skip to main content
10.1145/1506270.1506298acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmobilityConference Proceedingsconference-collections
research-article

GTPP: general truncated pyramid architecture over P2PSIP networks

Published: 10 September 2008 Publication History

Abstract

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.

References

[1]
Rosenberg J. et al. 2002. SIP: Session Initiation Protocol. RFC3261, Internet Engineering Task Force, June 2002.
[2]
David A. Bryan, Bruce B. Lowekamp and C. Jennings. 2005. SOSIMPLE:A Serverless, Standards-based, P2P SIP Communication System. Proc. of International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications, June 2005.
[3]
Le, L.; Kuo, G.-S. 2007. Hierarchical and Breathing Peer-to-Peer SIP System. IEEE International Conference on Communications, 2007. ICC '07. 24--28 June 2007. Page(s):1887--1892
[4]
Singh K., Schulzrinne H. 2004. Peer-to-peer Internet Telephony Using SIP. Columbia University Technical Report CUCS-044-04, New York, NY, October 2004.
[5]
P2P SIP, http://www.p2psip.org/.
[6]
Ratnasamy S., Francis P., Handley M., Karp R., Shenker S. A scalable content addressable network. SIGCOMM Symposium on Communications Architectures and Protocols, San Diego, CA, USA, Aug. 2001, ACM.
[7]
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., Balakrishnan, H. Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking, Volume 11, Issue 1, Feb. 2003 Page(s):17--32.
[8]
Rowstron A., Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nov. 2001, Page(s):329--350.
[9]
Maymounkov P. and Mazires D. Kademlia: A peer-to-peer information system based on the xor metric. In Peer-to-Peer Systems: First International Workshop, IPTPS 2002 Cambridge, MA, USA, March 7--8, 2002. Page(s): 53--65.
[10]
Bryan D., Matthews P., Shim E., Willis D. (2007) Concepts and Terminology for Peer to Peer SIP. Internet Draft, draft-ietf-p2psip-concepts-01 (work in progress).
[11]
Peng, Z., Duan, Z.-H., Qi, J.-J, Cao Y.; Lv E.-T. HP2P: A Hybrid Hierarchical P2P Network. First International Conference on the Digital Society, 2007. ICDS '07. Jan. 2007 Page(s):18--22.
[12]
Xu Z., Min R., and Hu Y. HIERAS: A DHT-Based Hierarchical Peer-to-Peer Routing Algorithm. Proceedings of 2003 international conference on parallel processing (ICPP 2003), 2003. Page(s):187--194.
[13]
E. T. Jaynes. Information Theory and Statistical Mechanics. Physical Review, vol. 106, no. 4, pp. 620--630, May 15, 1957.
[14]
V. Lo, Zhou D.-Y, Liu Y.-H, Dickey C.-G and Li J. Scalable Supernode Selection in Peer-to-peer Overlay Networks. Hot topic in Peer-to-Peer System, 2005.

Cited By

View all

Index Terms

  1. GTPP: general truncated pyramid architecture over P2PSIP networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    Mobility '08: Proceedings of the International Conference on Mobile Technology, Applications, and Systems
    September 2008
    689 pages
    ISBN:9781605580890
    DOI:10.1145/1506270
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 10 September 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. general truncated pyramid architecture
    2. geometry distribution
    3. maximum information entropy
    4. negative exponential distribution
    5. p2psip

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 08 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media