Abstract
A dynamic network is the abstraction of distributed systems with frequent network topology changes. With such dynamic network models, fundamental distributed computing problems can be formally studied with rigorous correctness. Although quite a number of models have been proposed and studied for dynamic networks, the existing models are usually defined from the point of view of connectivity properties. In this paper, instead, we examine the dynamicity of network topology according to the procedure of changes, i.e., how the topology or links change. Following such an approach, we propose the notion of the “instant path” and define two dynamic network models based on the instant path. Based on these two models, we design distributed algorithms for the problem of information dissemination respectively, one of the fundamental distributing computing problems. The correctness of our algorithms is formally proved and their performance in time cost and communication cost is analyzed. Compared with existing connectivity based dynamic network models and algorithms, our procedure based ones are definitely easier to be instantiated in the practical design and deployment of dynamic networks.
Highlights
Due to the rapid development of wireless technologies, the dynamic network is attracting more and more attention from researchers on study of distributed computing theory
We first propose the notion of the “instant path”, which is the abstraction of the communication path between network nodes
The (T, l)-path model focuses on the number of nodes which join in or leave the instant path in every T consecutive rounds, while the (T, l)*-path model concerns the number more general than the (T, l)-path because it considers node order changes
Summary
Due to the rapid development of wireless technologies, the dynamic network is attracting more and more attention from researchers on study of distributed computing theory. Information 2018, 9, 212 properties of networks Based on these connectivity models, quite a number of fundamental distributed computing problems have been solved, including information dissemination. As aforementioned, these models define network dynamicity in the point of view of connectivity properties of the network against dynamic topology changes. We define two dynamicity models, named (T, l)-path and (T, l)*-path These new models describe the topology dynamicity in terms of the procedure of communication paths, including node join and leave. Information dissemination is one of the fundamental problems in distributed computing, which is concerned with how to disseminate information to all the nodes in the network, with as little time cost and communication cost as possible [8,9].
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call