Mt/G/∞ queues with sinusoidal arrival rates
Management Science
The physics of the Mt/G/ ∞ symbol Queue
Operations Research
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Peer-to-peer internet telephony using SIP
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
| Hi-index | 0.00 |
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.