Name
Abstract | ||
|---|---|---|
Peer-to-Peer overlays have become a popular paradigm for building distributed systems, aiming to provide resource localization and sharing in large-scale networks. To design an overlay network, the first step is to choose an overlay topology connecting all the overlay nodes. Many proposed distributed hash table schemes for peer-to-peer network are based on some traditional calculated interconnection topologies. In this paper, we propose to extend the DHT topology to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable resource localization support. We consider bidirectional routing algorithms and show how the resulting unfair routing structure extends the search region and provides an efficient resource lookup service at a very little additional cost. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ISCC.2009.5202386 | ISCC |
Keywords | Field | DocType |
peer-to-peer computing,table lookup,telecommunication network routing,telecommunication network topology,DHT overlays,bidirectional graph,bidirectional routing algorithms,distributed hash table,distributed system,peer-to-peer network,peer-to-peer overlays,routing unfairness,scalable resource localization support,super-peer based lookup algorithm,unfair routing structure,DHT,flooding,key based routing,power law degree,super peer | Computer science,Key-based routing,Computer network,Network topology,Bidirectional search,Overlay,Intrusion detection system,Overlay network,Distributed hash table,Distributed computing,Scalability | Conference |
ISSN | Citations | PageRank |
1530-1346 | 0 | 0.34 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Salma Ktari | 1 | 42 | 4.49 |
| Artur Hecker | 2 | 66 | 8.58 |
| Houda Labiod | 3 | 329 | 42.87 |