Distributed true string B-tree peer-to-peer overlay networks
A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overl...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Ottawa (Canada)
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/27197 http://dx.doi.org/10.20381/ruor-18585 |
| Summary: | A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks which use DHT as their core data structure, the DTSBT P2P overlay network employs a new data structure, DTSBT as its core data structure. A DTSBT is a hybrid distributed data structure, in which all peers' routing tables make up a virtual B-tree and a Patricia Trie is plugged into each peer's routing table. The performance evaluation showed that the DTSBT P2P overlay network is more scalable, decentralized, resilient to failures, and self-organized compared to its competitors. |
|---|