2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'05) An Efficient Distributed Protocol for Online Gossiping Problem Compi?gne University of Technology, France September 19-September 22 ISBN: 0-7695-2416-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IAT.2005.41
In this paper, we propose an efficient distributed protocol for online gossiping problem in any types of networks, especially for mobile networks and fault-tolerant networks. The nodes in the networks have limited information of the entire network. Each node knows its neighboring nodes. The proposed gossiping protocol is fully distributed and tolerates node or link failures as well as topology changes (mobility). We show that the protocol completes in O(n2) time in any types of networks, even when the networks contain multiple failures.
Index Terms:
Online gossiping protocol, distributed computing, mobile ad hoc networks, fault tolerance
Citation:
Zhengnan Shi, Pradip K Srimani, "An Efficient Distributed Protocol for Online Gossiping Problem," iat, pp.599-602, 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb