Title:
On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks
On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks
| dc.contributor.author | Xu, Jun | en_US |
| dc.date.accessioned | 2005-06-17T17:41:15Z | |
| dc.date.available | 2005-06-17T17:41:15Z | |
| dc.date.issued | 2002 | en_US |
| dc.description.abstract | In this work, we study a fundamental tradeoff issue in designing dynamic hash table (DHT) in peer-to-peer networks: the size of the routing table v.s. the network diameter. It was observed in Ratnasamy et al. that existing DHT schemes either (a) have a routing table of size of O(log₂n) and network diameter of O(log₂n), or (b) have a routing table of size d and network diameter of O(n [superscript 1/d]). They asked whether this represents the best asymptotic "state-efficiency" tradeoffs. Our first major result is to show that there are routing algorithms which achieve better asymptotic tradeoffs. However, such algorithms all cause severe congestion on certain network nodes, which is undesirable in a P2P network. We then define the notion of "congestion-free" and conjecture that the above tradeoffs are asymptotically optimal for a congestion-free network. Though we are not able to prove (or disprove) this conjecture in full generality, our rigorous formulation of the problem and techniques introduced in proving slightly weaker results serve as the basis for further exploration of this problem. Our second major result is to prove that, if the routing algorithms are symmetric, the aforementioned tradeoffs are asymptotically optimal. Furthermore, for symmetric algorithms, we find that O(log₂n) is a magic threshold point for routing table size as follows. The "congestion" factor dominates the "reachability" factor in determining the minimum network diameter when the routing table size is asymptotically smaller than or equal to O(log₂ n), and it is the other way around when the routing table size is asymptotically larger than O(log₂n). Our third and final major result is to study the exact (instead of asymptotic) optimal tradeoffs. We propose a new routing algorithm that reduces the routing table size and the network diameter of Chord both by 21.4% without introducing any other overhead, based on a novel number-theoretical technique. | en_US |
| dc.format.extent | 268457 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/6547 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.relation.ispartofseries | CC Technical Report; GIT-CC-02-40 | en_US |
| dc.subject | Peer-to-peer networks | |
| dc.subject | Routing | |
| dc.subject | Hashing | |
| dc.subject | Algorithms | |
| dc.subject | Optimization | |
| dc.title | On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks | en_US |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | College of Computing | |
| local.relation.ispartofseries | College of Computing Technical Report Series | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isSeriesOfPublication | 35c9e8fc-dd67-4201-b1d5-016381ef65b8 |
Files
Original bundle
1 - 1 of 1