A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Scalable Supernode Selection in Peer-to-Peer Overlay Networks
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System
AAA-IDEA '05 Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications
HP2P: A Hybrid Hierarchical P2P Network
ICDS '07 Proceedings of the First International Conference on the Digital Society
GTPP: General Truncated Pyramid Peer-to-Peer Architecture over Structured DHT Networks
Mobile Networks and Applications
| Hi-index | 0.00 |
There is recently some research work focusing on the multiple-level hierarchical overlay architecture in peer-to-peer (P2P) SIP networks with some assumptions. But questions such as what performance improvements can be achieved and how many levels should be existed in the architecture have not been proved from the mathematical aspect. In this paper, a general truncated pyramid architecture over P2PSIP networks (GTPP) has been put forward in which the number of peers of each level of sub-overlay is subject to the negative exponential distribution (NED) according to the maximum information entropy theorem. Utilizing the similarity between geometric distribution (GD) and NED, we harness GD to distribute peers into multiple sub-overlays to convert the distribution function into discrete domain. Through mathematical evaluation, we get the conclusion that 2~4 levels of sub-overlays are appropriate for most of the systems which also takes the maintenance cost into consideration. As for the number of peers in each sub-sub-overlay (SSO), the kth root of the total number of peers N, that is to say, n = N1/k, is a proper number taking the load balancing into account, wherein k stands for the total number of levels of GTPP.