Name
Abstract | ||
|---|---|---|
In this paper we propose a new peer-to-peer network based on Knodel graphs W-d,W-n of even order n and degree d, where 1 <= d <= [log(2)n]. We then present routing algorithms in the P2P network based on the Knodel graph. The algorithm takes advantage of the routing heuristics in the Knodel graph and reduces the routing length of the P2P network by half. This P2P network can be configured flexibly to be based on the partial Knodel graph, where each peer is connected to the selected dimensions, thus decrease the size of the routing table with trading off the routing length. The applications may choose the configuration according to the computing ability of the peers and other requirements. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/PERCOMW.2007.9 | PerCom Workshops |
Keywords | Field | DocType |
broadcasting,routing table,software engineering,protocols,computer science,graph theory,helium,routing | Multipath routing,Link-state routing protocol,Policy-based routing,Computer science,Enhanced Interior Gateway Routing Protocol,Hierarchical routing,Static routing,Routing domain,Computer network,Theoretical computer science,Routing table,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2788-4 | 1 | 0.36 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hovhannes A. Harutyunyan | 1 | 206 | 28.18 |
| Junlei He | 2 | 1 | 0.36 |