Name
Abstract | ||
|---|---|---|
In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology-mismatch problem in the literature are far from the optimum. In this paper, we propose a novel topology-matching algorithm based on the Metropolis-Hastings method. Through extensive simulations, we show that our proposal constructs an unstructured P2P network where a broadcast message, originated by any node v, reaches any other node u by taking approximately the only physical end-to-end delay between v and u. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICPADS.2009.26 | ICPADS |
Keywords | Field | DocType |
metropolis-hastings method,underlying network,broadcast message,topology awareness,topology-mismatch problem,optimizing unstructured peer-to-peer overlays,underlying physical network,telecommunication network topology,end-to-end delay,p2p network,physical end-to-end delay,unstructured peer-to-peer overlays,node v,topology-matching algorithm,network traffics,peer-to-peer computing,redundant network,unstructured peer-to-peer,unstructured p2p network,node u,routing,metropolis hastings,data mining,end to end delay,network topology,topology | Broadcasting,Logical topology,Physical network,Computer science,Peer to peer overlay,Peer to peer computing,Computer network,Network topology,Topology awareness,Distributed computing | Conference |
ISSN | ISBN | Citations |
1521-9097 | 978-1-4244-5788-5 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hao Liao | 1 | 51 | 5.37 |
| Po-Shen Yeh | 2 | 5 | 0.72 |
| Hung-Chang Hsiao | 3 | 256 | 32.34 |