Abstract
Structured peer-to-peer overlay networks such as Chord, CAN, Tapestry, and Pastry, operate as distributed hash tables (DHTs). However, since every node is assigned a unique identifier in the basic design of DHT (randomly hashed), ”locality-awareness” is not inherent due to the topology mismatching between the P2P overlay network and the physical underlying network. In this paper, we propose to incorporate physical locality into a Chord system. To potentially benefit from some level of knowledge about the relative proximity between peers, a network positioning model is necessary for capturing physical location information of network nodes. Thus, we incorporate GNP (Global Network Positioning) into Chord (Chord-GNP) since peers can easily maintain geometric coordinates that characterize their locations in the Internet. Next, we identify and explore three factors affecting Chord-GNP performance: distance between peers, message timeout calculation and lookup latency. The measured results show that Chord-GNP efficiently locates the nearest available node providing a locality property. In addition, both the number of the messages necessary to maintain routing information and the time taken to retrieve data in Chord-GNP is less than that in Chord.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stoica, I., Morris, R., Karger, D., Kaashock, M., Balakrishman, H.: Chord: A scalable P2P lookup protocol for Internet applications. In: Proc. of ACM SIGCOMM (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. of ACM SIGCOMM (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale p2p systems. In: Proc. of IFIP/ACM Middleware (2001)
Zhao, B., Huang, L., Stribling, J., Rhea, S.C., Joseph, A., Kubiatowicz, J.: Tapestry: A global-scale overlay for rapid service deployment. IEEE J-SAC 22(1) (2004)
Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting Network Proximity in Peer-to-Peer Overlay Networks. In: International Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy (June 2002)
Hong, F., Li, M., Yu, J., Wang, Y.: PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity. In: ICDCS Workshops 2005, pp. 806–811 (2005)
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, May 1997, pp. 654–663 (1997)
Secure hash standard, NIST, U.S. Dept. of Commerce, National Technical Information Service FIPS 180-1 (April 1995)
Ng, T.S.E., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proceedings of IEEE Infocom (May 2002)
Ng, T.S.E., Zhang, H.: Towards Global Network Positioning. In: ACM SIGCOMM Internet Measurement Workshop, San Francisco, CA (November 2001)
Overlay Weaver: an overlay construction toolkit, http://overlayweaver.sf.net/
Shudo, K., Tanaka, Y., Sekiguchi, S.: Overlay Weaver: An overlay construction toolkit Computer Communications (Special Issue on Foundations of Peer-to-Peer Computing) 31(2), 402–412 (2008) (available online on August 14, 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fantar, S.G., Youssef, H. (2009). Improving Chord Network Performance Using Geographic Coordinates. In: Trigoni, N., Markham, A., Nawaz, S. (eds) GeoSensor Networks. GSN 2009. Lecture Notes in Computer Science, vol 5659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02903-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-02903-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02902-8
Online ISBN: 978-3-642-02903-5
eBook Packages: Computer ScienceComputer Science (R0)