Cited By
View all- Korzun DGurtov A(2013)Hierarchical architectures in structured peer-to-peer overlay networksPeer-to-Peer Networking and Applications10.1007/s12083-013-0200-z7:4(359-395)Online publication date: 14-Mar-2013
User-search time analysis for hierarchical peer-to-peer overlay networks with time-dependent user-population process
Article No.: 5, Pages 1 - 4
Abstract
Traditional Internet telephony systems heavily rely upon central servers, especially during call initiations. The absence of these servers in Peer-to-Peer (P2P) implementations results in a significant increase in delay during the user search process. With this issue in mind, we focus on a hierarchical P2P overlay network with a tree structure where node groups form sub-network cells of a constant size bound. In our model, users are assumed to arrive into the system according to a non-stationary Poisson process. The sojourn time for a node is assumed to be exponentially distributed. Through this modeling, we analyze the time-dependent user population process with an Mt/G/∞ queue. The mean user search time is then calculated by examining the overall shape of the hierarchical overlay network structure at a given time. Numerical results indicate that fluctuations in the number of layers generated in the system produce a greater impact on the user search latency when compared with the effects of changes in the cell size bound.
References
[1]
S. A. Baset and H. Schulzrinne. An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. In INFOCOM Conference Proceedings, pages 1--11. IEEE, April 2006.
[2]
S. G. Eick, W. A. Massey, and W. Whitt. M t /G/∞ Queues with Sinusoidal Arrival Rates. Management Science, 39(2):241--252, February 1993.
[3]
S. G. Eick, W. A. Massey, and W. Whitt. The Physics of the M t /G/∞ Queue. Operations Research, 41(4):731--742, July--August 1993.
[4]
D. P. Heyman and W. Whitt. The Asymptotic Behavior of Queues with Time-Varying Arrival Rates. Journal of Applied Probability, 21(1):143--156, June 1984.
[5]
L. Le and G. Kuo. Hierarchical and Breathing Peer-to-Peer SIP System. In International Conference on Communications (ICC) Conference Proceedings, pages 1887--1892. IEEE, June 2007.
[6]
A. T. Mizrak, Y. Cheng, V. Kumar, and S. Savage. Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup. In WIAPP, pages 104--111. IEEE, June 2003.
[7]
P2P-SIP. http://www.p2psip.org.
[8]
J. Rosenberg, H. Schulzrinne, G. Camarillo, A. Johnston, J. Peterson, R. Sparks, M. Handley, and E. Schooler. Sip: Session initiation protocol, June 2002.
[9]
K. Singh and H. Schulzrinne. Peer-to-Peer Internet Telephony using SIP. In NOSSDAV Conference Proceedings, pages 63--68. ACM, June 2005.
[10]
Skype. http://www.skype.com.
[11]
I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In SIGCOMM Conference Proceedings, pages 149--160. ACM, August 2001.
Index Terms
- User-search time analysis for hierarchical peer-to-peer overlay networks with time-dependent user-population process
Recommendations
A Novel Hierarchical Overlay for Structured Peer-to-Peer Network
SCALCOM-EMBEDDEDCOM '09: Proceedings of the 2009 International Conference on Scalable Computing and Communications; Eighth International Conference on Embedded ComputingLarge-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in ...
Trustworthiness of acquaintances in Peer-to-Peer overlay networks
Various types of applications manipulate objects distributed in Peer-to-Peer overlay networks. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance ...
Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks
WAINA '10: Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications WorkshopsSystems using peer-to-peer (P2P) overlay networks are getting a central position in information systems. P2P systems are in nature fully distributed with no centralized coordinator and each peer is autonomous. Each peer has to obtain information on ...
Comments
Information & Contributors
Information
Published In
Copyright © 2009 ACM.
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]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 July 2009
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
QTNA '09
Sponsor:
QTNA '09: International Conference on Queueing Theory and Network Applications
July 29 - 31, 2009
Fusionopolis, Singapore
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 77Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
Cited By
View all- Korzun DGurtov A(2013)Hierarchical architectures in structured peer-to-peer overlay networksPeer-to-Peer Networking and Applications10.1007/s12083-013-0200-z7:4(359-395)Online publication date: 14-Mar-2013
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in