Effects of Network Dynamics on Routing Efficiency in P2P Networks

P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on query routing efficiency. First we describe some background and an abstract system model. The chosen routing technique makes use of cached metadata from previous answer messages and also employs a mechanism for broken path detection and metadata maintenance. Several metrics are used to show that the protocol behaves quite well even with high rate of node departures, but above a certain threshold it literally breaks down and exhibits considerable efficiency degradation.




References:
[1] M. Ripeanu, I. Foster, A. Iamnitchi, "Mapping the Gnutella Network:
Properties of Large-Scale Peer-to-Peer Systems and Implications for
System Design". IEEE Internet Computing, vol. 6(1), 2002.
[2] M.Ciglaric, "Content networks : distributed routing decisions in
presence of repeated queries". Int. j. found. comput. sci., 2004, vol. 15,
no. 3, pp. 555-566.
[3] M.Ciglaric, Towards More Effective Message Routing in Unstructured
Peer-to-Peer Overlays, to be published in IEE Proc. Communications,
2005.
[4] M. A. Jovanovic, F. S. Anexstein, K. A. Berman, Modeling Peer-to-Peer
Network Topologies through "Small-World" Models and Power Laws,
Proc. IX. Telecommunications Forum TELFOR, 2001.
[5] T. Bu, D. Towsley, On Distinguishing between Internet Power Law
Topology Generators, Proc. INFOCOM 2002.
[6] Q. Lv et al.: Search and Replication in Unstructured Peer-to-peer
Networks, Proc. 16th ACM Intl. Conf. Supercomputing ICS'02.
[7] B. Yang, H. Garcia-Molina, Comparing Hybrid Peer-to-Peer Systems,
Proc. Very Large Databases VLDB, 2001.
[8] B. Yang and H. Garcia-Molina, Efficient Search in Peer-to-Peer
Networks, ICDCS 2002. http://dbpubs.stanford.edu/ pub/2001-47.
[9] M. Ciglaric, Problems in Unstructured P2P Systems, to be published in
Electrotechnical Review, 2005.