Distributed Computing in Fault-Prone Dynamic Networks
Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and efficiency of distributed algorithms. The researchers have introduced a very general, worst case type model of dynamics: the edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change.
Provided by: Association for Computing Machinery Topic: Networking Date Added: Dec 2012 Format: PDF