Call preemption in communication networks
Juan A. Garay, Inder S. Gopal
IEEE INFOCOM 1992
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
Juan A. Garay, Inder S. Gopal
IEEE INFOCOM 1992
Israel Cidon, Inder S. Gopal
International Journal of Digital & Analog Cabled Systems
Israel Cidon, Asad Khamisy, et al.
Performance Evaluation
Israel Cidon, Roch Guérin, et al.
Queueing Systems