Title :
Dynamic networks are as fast as static networks
Author :
Awerbuch, Baruch ; Sipser, Michael
Author_Institution :
Dept. of Math., MIT, Cambridge, MA, USA
Abstract :
An efficient simulation is given to show that dynamic networks are as fast as static ones up to a constant multiplicative factor. That is, any task can be performed in a dynamic asynchronous network essentially as fast as in a static synchronous network. The simulation protocol is based on an approach in which locality is perceived as the key to fast adaptation to changes in network topology. The heart of the simulation is a technique called a dynamic synchronizer, which achieves `local´ simulation of a global `clock´ in a dynamic asynchronous network. Using this result, improved solutions to a number of well-known problems on dynamic networks are obtained. It can also be used to improve the solution to certain static network problems
Keywords :
computer networks; protocols; asynchronous network; constant multiplicative factor; dynamic networks; dynamic synchronizer; network topology; protocol; simulation; static networks; Communication networks; Computational modeling; Computer science; Computer simulation; Contracts; Heart; Laboratories; Mathematics; Network topology; Protocols;
Conference_Titel :
Foundations of Computer Science, 1988., 29th Annual Symposium on
Conference_Location :
White Plains, NY
Print_ISBN :
0-8186-0877-3
DOI :
10.1109/SFCS.1988.21938