Change search
ReferencesLink to record
Permanent link

Direct link
A Framework for Peer-To-Peer Lookup Services based on k-ary search
Number of Authors: 4
2002 (English)Report (Refereed)
Abstract [en]

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
Keyword [en]
Lookup, peer-to-peer, distributed hash table, k-ary search
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14175OAI: diva2:1035462
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(143 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 143 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link