Abstract
Efficient resource lookup is essential for peer to peer networks and DHT (Distributed Hash Table) provides an ideal solution for resource lookup in distributed networks. Chord is a representative peer to peer lookup service based on DHT. The topology of Chord is modeled as a directed graph. There is a unidirectional link from a node to its every routing table entry node.
In this paper, we propose to model the topology of Chord as a bidirectional graph. A reverse link is added for each original unidirectional link and such a pair of symmetrical links is maintained by a single heart-beat message. Then each node should maintain a finger table and a reverse finger table at very little additional cost. However, such reverse fingers may help to improve the lookup efficiency greatly. Theoretical analyses and experimental results both approve such improvements.
This is a preview of subscription content, log in via an institution to check access.
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
Napster, http://www.napster.com
The Gnutella protocol specification v4.0, http://dss.clip2.com/GnutellaProtocol04.pdf
KaZaA website: http://www.kazaa.com
Ratnasamy, S., Francis, P., Handley, M., et al.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM 2001, San Diego, CA, pp. 161–172 (2001)
Stoica, I., Morris, R., Liben-Nowell, D., et al.: Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking 11(1), 11–32 (2003)
Junjie, J., Wang, W.: Text-Based P2P Content Search Using a Hierarchical Architecture. In: Chen, Z., Chen, H., Miao, Q., Fu, Y., Fox, E., Lim, E.-p. (eds.) ICADL 2004. LNCS, vol. 3334, pp. 429–439. Springer, Heidelberg (2004)
Li, Z., Feng, Z.: Understanding Chord Performance and Topology-aware Overlay Construction for Chord, http://www.cs.berkley.edu/~zl/doc/chord_perf.pdf Project Report (2003)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 45–52. Springer, Heidelberg (2002)
Haihuan, B., Junjie, J., Wang, W.: ChordPlus: A Scalable, Decentralized Object Location and Routing Algorithm. Journal of System Engineering and Electronics (to appear)
Mesaros, V., Carton, B., Van Roy, P.: S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA 2003, Las Vegas, Nevada, USA (June 2003)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R.: Wide-area Cooperative Storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles, Chateau Lake Louise, Banff, Canada (October 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, J., Pan, R., Liang, C., Wang, W. (2005). BiChord: An Improved Approach for Lookup Routing in Chord. In: Eder, J., Haav, HM., Kalja, A., Penjam, J. (eds) Advances in Databases and Information Systems. ADBIS 2005. Lecture Notes in Computer Science, vol 3631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11547686_25
Download citation
DOI: https://doi.org/10.1007/11547686_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28585-4
Online ISBN: 978-3-540-31895-8
eBook Packages: Computer ScienceComputer Science (R0)