A Framework for Peer-To-Peer Lookup Services based on k-ary search
Number of Authors: 4
2002 (English)Report (Refereed)
Locating entities in peer-to-peer environments is a fundamentaloperation. Recent studies show that the concept of distributed hash table can be used to design scalable lookup schemes with good performance (i.e. small routing table and lookup length). In this paper, we propose a simple framework for deriving decentralized lookup algorithms. The proposed framework is simple in that it is based on the well-known concept of k-ary search. To demonstrate the applicability of our framework, we show how it can be used to instantiate Chord. When deriving a generalized Chord from our framework, we obtain better performance in terms of the routing table size (38% smaller than the generalization suggested by the Chord authors).
Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2002, 1. , 13 p.
SICS Technical Report, ISSN 1100-3154 ; 2002:06
Lookup, peer-to-peer, distributed hash table, k-ary search
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21987OAI: oai:DiVA.org:ri-21987DiVA: diva2:1041529