Istituto di Scienza e Tecnologie dell'Informazione     
Spognardi A., Di Pietro R., Mancini L. V. BaRT, Balanced Randomized Tree: A scalable and distributed protocol for lookup in peer-to-peer networks. In: International Workshop on Hot Topics in Peer-to-Peer Systems (HOT-P2P'04) (Volendam, The Netherlands, October 08 - 08, 2004). Proceedings, pp. 22 - 29. IEEE Press (ed.). 2004.
This paper proposes a new scheme for p2p networks. The main contributions are an extensive use of randomization techniques and a novel usage of tree-data structure. The combination of these two ingredients allows a great flexibility of network parameters, such as: load balance among the peers, fast lookups and reduced memory usage. For instance, with routing tables of size $(d-1) log_d n$, the average number of hops for a lookup is of the order of $1/d((d-1) log_d n +1)$, where n is the number of peers in the network and d is the ariety of the tree data structure. Further, we propose a few new optimization mechanisms that can be adopted in DHT. Extensive simulations support these results.
Subject Peer-to-Peer
C.2.3 Network Operations

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional