Inder S. Gopal, C.K. Wong, et al.
IEEE Transactions on Communications
An efficient way to synchronize an asynchronous network with a bounded delay message delivery is presented. Two types of synchronization algorithms are presented. Both types require an initializing phase that costs |E| messages (where |E| is the number of links). The first requires an additional bit in every message and increases the time complexity by a factor of 2. The second does not require any additional bits but increases the time complexity by a factor of 3. We also explain how to overcome differences in nodal timer rates. © 1990 IEEE
Inder S. Gopal, C.K. Wong, et al.
IEEE Transactions on Communications
Israel Cidon, Jeffrey M. Jaffe, et al.
IEEE Transactions on Software Engineering
Adrian Segall, Inder S. Gopal
Computer Networks and ISDN Systems
Ornan Gerstel, Israel Cidon, et al.
IEEE/ACM Transactions on Networking