Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Efficient Search in Structured Peer-to-Peer Systems: Binary v.s. k-ary Unbalanced Tree
 

Summary: Efficient Search in Structured Peer-to-Peer
Systems: Binary v.s. k-ary Unbalanced Tree
Structures
Magdalena Punceva and Karl Aberer
Department of Communication Systems,
Swiss Federal Institute of Technology (EPFL),
1015 Lausanne, Switzerland
{magdalena.punceva, karl.aberer}@epfl.ch
Abstract. We investigate the search cost in terms of number of mes-
sages generated for routing queries in tree-based P2P structured systems
including binary and k-ary tree structures with different arities and dif-
ferent degrees of imbalance in the tree shape. This work is motivated
by the fact that k-ary balanced tree access structures can greatly re-
duce the number of hops for searching compared to the binary trees. We
study to what extent the same fact is true when the tree-like structures
for access in P2P environments are unbalanced. Another important is-
sue related to P2P environments is how to build these structures in a
self-organizing way. We propose a mechanism for constructing k-ary tree
based decentralized access structure in a self-organizing way and based
on local interactions only. The ability to search efficiently also on unbal-

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences