Title :
Synchronizing asynchronous bounded delay networks
Author :
Chou, Ching-Tsun ; Cidon, Israel ; Gopal, Inder S. ; Zaks, Shmuel
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fDate :
2/1/1990 12:00:00 AM
Abstract :
An efficient way to synchronize an asynchronous network with a bounded delay message delivery is presented. Two types of synchronization algorithm 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. How to overcome differences in nodal timer rates is explained
Keywords :
delays; message switching; synchronisation; telecommunication networks; additional bit; asynchronous bounded delay networks; bounded delay message delivery; initializing phase; nodal timer rates; synchronization algorithm; time complexity; Algorithm design and analysis; Clocks; Communication networks; Computer science; Costs; Delay; Distributed algorithms; IEL; Partitioning algorithms; Synchronization;
Journal_Title :
Communications, IEEE Transactions on
