Title :
Scalable ultrapeer-based DHT protocol for file sharing
Author :
Kim, Chayoung ; Ahn, Jinho
Author_Institution :
Dept. of Comput. Sci., Kyonggi Univ., Suwon
Abstract :
In this paper, we present a novel file searching protocol to structure a DHT ring consisting of only ultrapeers, not all the nodes. The DHT ring in this protocol is much less sensitive to the churn rate because ultrapeers have much longer uptime compared with leaf nodes. Thus, this feature makes the protocol more scalable and efficient than the previous DHT ones in terms of costs of file search, node join and leave operations and the number of routing table entries each node should maintain. Moreover, it is more effective for locating rare files than Gnutella-like searching protocols.
Keywords :
computational complexity; file organisation; peer-to-peer computing; protocols; search problems; table lookup; DHT ring; distributed hash table; file searching protocol; file sharing; table lookup; ultrapeer-based DHT protocol; Bandwidth; Broadcasting; Costs; File servers; Floods; Keyword search; Network servers; Peer to peer computing; Routing protocols; Scalability; P2P system; dynamic hash table; file sharing; scalability; ultrapeer;
Conference_Titel :
Collaborative Technologies and Systems, 2009. CTS '09. International Symposium on
Conference_Location :
Baltimore, MD
Print_ISBN :
978-1-4244-4584-4
Electronic_ISBN :
978-1-4244-4586-8
DOI :
10.1109/CTS.2009.5067506