دانلود رایگان مقاله انگلیسی گراف P پویا برای گرفتن پویایی سیستم توزیع شده - نشریه الزویر

Abstract

The dynamics of a mobile dynamic distributed system depends on both the node mobility and the capacity of the underlying communication protocol. To qualify the dynamics of a distributed system, the family of dynamic p-graphs is introduced in this paper, constituting a finite set of dynamic graphs, each of them being a sequence of observed graphs, with the particularity that their edges allow transferring p messages. The family of dynamic p-graphs allows the characterization and the comparison of dynamic distributed systems of very different nature. It is also used to evaluate the ability of algorithms themselves to support a given dynamic distributed system.

7. Conclusion

In this paper, we introduced a new model of dynamic distributed systems: the dynamic p-graphs. This modeling takes into account the ability of the dynamic network to send consecutive messages on a link, encompassing both the nodes move and the capacity of the underlying communication technology. We claim that the dynamics of dynamic distributed systems can be fully described with the finite family of dynamic p-graphs for different values of p ∈ N ∗ . The importance of such modeling for algorithmic issues is shown in this paper. First, we have shown that dynamic distributed systems of very different nature can be compared according to their ability to support a given algorithm. Then we proved the intrinsic limitation of topology-based routing protocols for a given dynamic distributed system. Finally we illustrated the interest of our modeling by exhibiting conditions on the dynamics that ensure the desired behavior of three distributed algorithms commonly used in dynamic distributed systems. Our future work will focus on the comparison of real dynamic distributed systems and on the proof of complex algorithms and protocols in the context of vehicular networks and swarm of UAVs.