Abstract
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we present a study of topology-aware routing approaches in P2P overlays, and present an improved design in Chord. We evaluate TaChord and other algorithms by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. From experimental results TaChord shows the drastic improvement in routing performance. Finally, we show that the impact of cache management strategies in the TaChord overlay can’t be neglected.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. ACM Sigcomm. (2001)
Zhao, B.Y., Duan, Y., et al.: Brocade: landmark routing on overlay networks. In: Electronic Proceedings for IPTP 2002, Cambridge, MA, USA, March 7-8 (2002)
Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: 19th International Conference on Data Engineering, Bangalore, India, IEEE Computer Society, Los Alamitos (2003)
Brite, a network topology generator, http://www.cs.bu.edu/brite/
Wu, Z., Ma, L., Wang, K.: Efficient Topology-aware Routing. In: Peer-to-Peer Network. GCC2002, pp. 172–185 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, D., Yang, S. (2004). Improving Topology-Aware Routing Efficiency in Chord. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_71
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive