T-Man: Gossip-Based Overlay Topology Management
Overlay topology plays an important role in P2P systems. Topology serves as a basis for achieving functions such as routing, searching and information dissemination, and it has a major impact on their efficiency, cost and robustness. Furthermore, the solution to problems such as sorting and clustering of nodes can also be interpreted as a topology. In this paper we propose a generic protocol, T-MAN, for constructing and maintaining a large class of topologies. In the proposed framework, a topology is defined with the help of a ranking function. The nodes participating in the protocol can use this ranking function to order any set of other nodes according to preference for choosing them as a neighbor. This simple abstraction makes it possible to control the self-organization process of topologies in a straightforward, intuitive and flexible manner. At the same time, the T-MAN protocol involves only local communication to increase the quality of the current set of neighbors of each node. We show that this bottom-up approach results in fast convergence and high robustness in dynamic environments. The protocol can be applied as a standalone solution as well as a component for recovery or bootstrapping of other protocols.
KeywordsNetwork Size Binary Tree Ranking Function Overlay Network Distribute Hash Table
Unable to display preview. Download preview PDF.
- 1.Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC 1987), pp. 1–12. ACM Press, New York (1987)CrossRefGoogle Scholar
- 5.Koren, Y.: Embedder, http://www.research.att.com/~yehuda/index_programs.html
- 6.Massoulie, L., Kermarrec, A.-M., Ganesh, A.J.: Network awareness and failure resilience in self-organising overlays networks. In: Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), Florence, Italy, pp. 47–55 (2003) Google Scholar
- 8.Montresor, A., Jelasity, M., Babaoglu, O.: Chord on demand. In: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005), Konstanz, Germany, August 2005. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 10.PeerSim, http://peersim.sourceforge.net/
- 13.Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 149–160. ACM Press, New York (2001) Google Scholar
- 16.Yang, B., Garcia Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International Conference on Data Engineering (ICDE 2003), March 2003. IEEE Computer Society Press, Los Alamitos (2003)Google Scholar