Hybrid peer-to-peer lookup service algorithm on distributed hash table

Ruan Jian Xue Bao/Journal of Software

Volumn 18, Issue 3, 2007, Pages 714-721

  Yang, Feng ^a   Li, Feng Xia ^b   Yu, Hong Liang ^a   Zhan, Shou Yi ^b   Zheng, Wei Min ^a  

^a TSINGHUA UNIVERSITY   (China)

^b BEIJING INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Churn rate; Distributed hash table; Hybrid route; Lookup delay; Multicast

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; MULTICASTING; ROUTING ALGORITHMS; TABLE LOOKUP;

CHURN RATE; DISTRIBUTED HASH TABLE; HYBRID ROUTE; LOOKUP DELAY; MULTICAST;

NETWORK PROTOCOLS;

EID: 34247395863     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos180714     Document Type: Article

References (11)

1. Yan F, Zhan SY. A peer-to-peer approach with semantic locality to service discovery. In: Proc. of the 3rd Int'l Workshop on Grid and Cooperative Computing. LNCS 3251, Berlin: Springer-Verlag, 2004. 831-834.
2. Lu XC, Li DS, Wang YH, Lu K. Research on peer-to-peer distributed storage systems. Journal of Computer Research and Development, 2003, 40(Suppl.): 1-6 (in Chinese with English abstract).
3. Saroiu S, Gummadi PK, Gribble SD. A measurement study of peer-to-peer files sharing systems. In: Proc. of the Multimedia Computing and Networking. 2002. http://www.cs.washington.edu/homes/gribble/
4. Ying C, Shi ML. QoS routing in ad-hoc network. Chinese Journal of Computers, 2001, 24(10): 1026-1033 (in Chinese with English abstract).
5. Stoica I, Morris R, Liben-Nowell D, Karger DR, kaashoek MF, Dabek F, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for internet applications. IEEE Trans. on Networking, 2003. http://pdos.csail.mit.edu/chord/
6. Gupta I, Birman K, Linga P, Demers A, van Renesse R. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Proc. of the 2nd Int'l Workshop on P2P Systems. 2003. http://iptps03.cs.berkeley.edu/
7. Mizrak AT, Cheng YC, Kumar V, Savage S. Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems. 2003. http://iptps03.cs.berkeley.edu/
8. Gupta A, Liskov B, Rodrigues R. Efficient routing for peer-to-peer overlays. In: Proc. of the 1st Symp. on Networked Systems Design and Implementation (NSDI 2004). 2004. http://www.usenix.org/events/nsdi04/
9. Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
10. Garces-Erice L, Biersack EW, Felber PA, Ross KW, Urvoy-keller GU. Hierarchical peer-to-peer systems. In: Proc. of the INFOCOM 2003. 2003. http://www.eurecom.fr/-btroup/BPublished/
11. El-Ansary S, Alima LO, Brand P, Haridi S. Efficient broadcast in structured P2P networks. In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems. 2003. http://iptps03.cs.berkeley.edu/