Load distribution performance of super-node based peer-to-peer communication networks: A nonstationary markov chain approach

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Voice over Internet protocol (VoIP) services using peer-to-peer (P2P) technology have become popular in recent years. In P2P-based VoIP networks such as Skype and P2P session initiation protocol (P2PSIP), super nodes are chosen from among all ordinary end-user nodes and handle particular tasks such as the management of user information, call establishment, and traffic relay. Future communication networks based on P2P technology must support a huge number of user nodes. A fundamental analysis of the load distribution in decentralized user-information management is needed to develop efficient and robust communication networks. In this paper, we analyze the performance of the P2P-based dynamic load distribution. In our analytical model, new nodes join the network according to a nonstationary Poisson process, and the stochastic behavior of the number of online nodes is analyzed approximately with an M(t)/M/∞ queue. We focus on two performance measures that significantly affect the quality of service (QoS) provided to the users: the churn rate and the load of super nodes. Numerical examples show that the performance of the P2P-based VoIP networks is sensitive to the sojourn time of super nodes and the maximum number of nodes managed by a super node.

Cite

CITATION STYLE

APA

Kuraya, K., Masuyama, H., & Kasahara, S. (2011). Load distribution performance of super-node based peer-to-peer communication networks: A nonstationary markov chain approach. Numerical Algebra, Control and Optimization, 1(4), 593–610. https://doi.org/10.3934/naco.2011.1.593

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free