Full Text:
<2856>
CLC number: TP393.02
On-line Access:
Received: 2005-03-09
Revision Accepted: 2005-05-27
Crosschecked: 0000-00-00
Cited: 2
Clicked: 4688
Using bidirectional links to improve peer-to-peer lookup performance
| |||||||||||||
JIANG Jun-jie, TANG Fei-long, PAN Feng, WANG Wei-nong. Using bidirectional links to improve peer-to-peer lookup performance[J]. Journal of Zhejiang University Science A, 2006, 7(6): 945-951.
@article{title="Using bidirectional links to improve peer-to-peer lookup performance",
author="JIANG Jun-jie, TANG Fei-long, PAN Feng, WANG Wei-nong",
journal="Journal of Zhejiang University Science A",
volume="7",
number="6",
pages="945-951",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.A0945"
}
%0 Journal Article
%T Using bidirectional links to improve peer-to-peer lookup performance
%A JIANG Jun-jie
%A TANG Fei-long
%A PAN Feng
%A WANG Wei-nong
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 6
%P 945-951
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.A0945
TY - JOUR
T1 - Using bidirectional links to improve peer-to-peer lookup performance
A1 - JIANG Jun-jie
A1 - TANG Fei-long
A1 - PAN Feng
A1 - WANG Wei-nong
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 6
SP - 945
EP - 951
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.A0945
Abstract: Efficient lookup is essential for peer-to-peer networks and Chord is a representative peer-to-peer lookup scheme based on distributed hash table (DHT). In peer-to-peer networks, each node maintains several unidirectional application layer links to other nodes and forwards lookup messages through such links. This paper proposes use of bidirectional links to improve the lookup performance in Chord. Every original unidirectional link is replaced by a bidirectional link, and accordingly every node becomes an anti-finger of all its finger nodes. Both theoretical analyses and experimental results indicate that these anti-fingers can help improve the lookup performance greatly with very low overhead.
[1] Bai, H.H., Jiang, J.J., Wang, W.N., 2005. ChordPlus: a scalable, decentralized object location and routing algorithm. Journal of System Engineering and Electronics, 15(4):772-779.
[2] Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I., 2001. Wide-area Cooperative Storage with CFS. Proceedings of the 18th ACM Symposium on Operating Systems Principles. Chateau Lake Louise, Banff, Canada, p.202-215.
[3] Jiang, J.J., Wang, W.N., 2004. Text-Based P2P Content Search Using a Hierarchical Architecture. Proceedings of the 7th International Conference of Asian Digital Libraries. Shanghai, China, p.429-439.
[4] Mesaros, V., Carton, B., van Roy, P., 2003. S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’03). Las Vegas, Nevada, USA, p.1752-1760.
[5] Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S., 2001. A Scalable Content-addressable Network. Proceedings of ACM SIGCOMM 2001. San Diego, CA, p.161-172.
[6] Ratnasamy, S., Shenker, S., Stoica, I., 2002. Routing Algorithms for DHTs: Some Open Questions. Proceedings of the 1st International Workshop on Peer-to-Peer Systems. Cambridge, MA, USA, p.45-52.
[7] Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Balakrishnan, H., 2003. Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking, 11(1):11-32.
[8] Zhuang, L., Zhou, F., 2003. Understanding Chord Performance and Topology-aware Overlay Construction for Chord. Project Report, available at http://www.cs.berkeley.edu/~zl/doc/chord_perf.pdf.
Open peer comments: Debate/Discuss/Question/Opinion
<1>