ICOIN 2007: Information Networking. Towards Ubiquitous Networking and Services pp 234-243 | Cite as
Proximity Based Peer-to-Peer Overlay Networks (P3ON) with Load Distribution
Abstract
Construction of overlay networks without any consideration of real network topologies causes inefficient routing in peer-to-peer networks. This paper presents the design and evaluation of a proximity based peer-to-peer overlay network (P3ON). P3ON is composed of two-tier overlay rings. The high tier ring is a global overlay in which every node participates. Whereas, the low tier ring is a local overlay that consists of nodes in the same autonomous system (AS). Since the low tier ring consists of nearby nodes (in the same AS), the lookup latency can be significantly reduced if the first search within the low tier ring is successful. Also, to cope with skewness of load (of key lookup) distribution, P3ON effectively replicates the popular keys (and results) to neighbor nodes and neighbor ASs. Simulation results reveal that P3ON outperforms the existing ring-based P2P network in terms of lookup time and achieves relatively balanced load distribution.
Keywords
proximity peer-to-peer overlay network load distributionPreview
Unable to display preview. Download preview PDF.
References
- 1.Gnutella, http://www.gnutella.com
- 2.Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)CrossRefGoogle Scholar
- 3.Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM 2001, pp. 161–172 (August 2001)Google Scholar
- 4.Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 5.Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: landmark routing on overlay networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 34–44. Springer, Heidelberg (2002)CrossRefGoogle Scholar
- 6.Ferreira, R.A., Grama, A., Jagannathan, S.: Enhancing Locality in Structured Peer-to-Peer Networks. In: Proceedings of Tenth IEEE International Conference on Parallel and Distributed Systems, Newport Beach, CA, July 2004, pp. 25–34 (2004)Google Scholar
- 7.Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In: Proc. of the 19th ACM Symposium on Operating Systems Principles, Bolton Landing, NY (October 2003)Google Scholar
- 8.Mao, Z.M., Rexford, J., Wang, J., Katz, R.H.: Towards an Accurate AS-Level Traceroute Tool. In: Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Karlsruhe, Germany (August 2003)Google Scholar
- 9.Exploiting Autonomous System Information in Structured Peer-to-Peer Networks. In: The 13th IEEE International Conference on Computer Communications and Networks (ICCCN 2004), Chicago, IL, October 11-13 (2004)Google Scholar
- 10.Ge, Z., Figueiredo, D.R., Jaiswal, S., Kurose, J., Towsley, D.: Modeling peer-peer file sharing systems. In: Proceedings of INFOCOM 2003, Santa Fe, NM (October 2003)Google Scholar
- 11.Internet End-to-end Performance Monitoring (IEPM), http://www-iepm.slac.stanford.edu/
- 12.Xu, Z., Mahalingam, M., Karlsson, M.: Turning Heterogeneity into an Advantage in Overlay Routing. In: Proceedings of the IEEE INFOCOM 2003, San Francisco, CA (April 2003)Google Scholar