Performance analysis for (X,S)-bottleneck cell in large-scale wireless networks
Pages 269 - 277
Abstract
We present a performance analytical model for (X,S)-bottleneck cell and perform some probabilistic analysis on the performances of (X,S)-bottleneck cell, such as the probability of balance state, the transmission probability of a flow, and throughput. To capture the essential aspects of (X,S)-bottleneck cell, we use two-hierarchy Quasi-Birth-Death models (QBDs). The general characters of (X,S)-bottleneck cell are govern by the first hierarchy QBD, while the characters of each flow are captured by the second hierarchy QBD. Based on the model, we present a methodology to derive some theoretic ranges for these probabilities. Our results show that the proposed model can analyze effectively the performance of (X,S)-bottleneck cell. The results in the work are helpful for designing and managing wireless networks.
References
[1]
G.R. Gupta, N. Shroff, Delay analysis for multi-hop wireless networks, in: Proc. of IEEE INFOCOM, April 2009.
[2]
Y. Li, L. Qiu, Y. Zhang, R. Mahajan, E. Rozner, Predictable performance optimization for wireless networks, in: Proc. of ACM SIGCOMM, August 2008.
[3]
Neuts, M.F., Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach. 1981. John Hopkins University Press.
[4]
P. Chaporkar, K. Kar, S. Sarkar, Throughput guarantees through maximal scheduling in wireless networks, in: 43rd Annual Allerton Conference on Communication, Control, and, Computing, 2005.
[5]
Lin, X., Shroff, N.B. and Srikant, R., A tutorial on cross-layer optimization in wireless networks. IEEE Journal on Selected Areas in Communications. v24 i8. 1452-1463.
[6]
M.J. Neely, Delay analysis for maximal scheduling in wireless networks with bursty traffic, in: IEEE INFOCOM, 2008.
[7]
S. Shioda, T. Yag, A new approach to the bottleneck bandwidth measurement for an end-to-end network path, in: IEEE International Conference on Communications (ICC), 2005.
[8]
Paxson, V., End-to-end Internet packet dynamics. IEEE/ACM Transactions on Networking. v7 i3. 277-292.
[9]
F. Lehrieder, M. Menth, PCN-based flow termination with multiple bottleneck links, in: IEEE International Conference on Communications (ICC), Dresden, Germany, June 2009.
[10]
Yan, G.F., Wang, J.X. and Wang, W.P., An analytical model for end-to-end communication channel over PLCN based on QBDs. Information Processing Letters. v109 i23-24. 1252-1259.
[11]
S. Tao, R. Guerin, On-line estimation of Internet path performance: an application perspective, in: Proc. of IEEE INFOCOM, vol. 3, 2004, pp. 1774-1785.
[12]
Salamatian, K. and Vaton, S., Hidden Markov modeling for network communication channels. ACM SIGMETRICS Performance Evaluation Review. v29 i1. 92-101.
[13]
Silveira, F. and de Souza e Silva, E., Modeling the short-term dynamics of packet losses. ACM SIGMETRICS Performance Evaluation Review. v34 i3. 27-29.
[14]
Remke, A., Haverkort, B.R. and Cloth, L., Model checking infinite-state Markov chains. In: LNCS, vol. 3440. Springer. pp. 237-252.
[15]
Remke, A., Haverkort, B.R. and Cloth, L., CSL model checking algorithms for QBDs. Theoretical Computer Science. v382 i1. 24-41.
[16]
Sule Alfa, A., Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach. Annals of Operations Research. v141. 51-66.
[17]
Gupta, P. and Kumar, P.R., The capacity of wireless networks. IEEE Transactions on Information Theory. v46 i2. 388-404.
[18]
Gamal, A.E., Mammen, J., Prabhakar, B. and Shah, D., Optimal throughput-delay scaling in wireless networks-part I: The fluid model. IEEE Transactions on Information Theory. v52 i11. 5111-5116.
[19]
Ramaswami, V. and Taylor, P.G., Some properties of the rate operators in level dependent quasi-birth-and-death processes with a countable number of phases. Communications in Statististies Stochastic Models. v12. 143-164.
[20]
Chihara, T.S., An Introduction to Orthogonal Polynomials. 1978. Gordon and Breach, New York.
- Performance analysis for (X,S)-bottleneck cell in large-scale wireless networks
Recommendations
Performance assessment of service differentiation in IEEE 802.11e Wireless LANs
This paper proposes a performance assessment scheme for service differentiation provisioning for IEEE 802.11e EDCF. The analytical model is developed based on queueing theory to derive the state probabilities and transition probabilities, and the mean ...
Performance evaluation of a discrete-time Geo[X]/G/1 retrial queue with general retrial times
We consider a discrete-time Geo^[^X^]/G/1 retrial queue with general retrial times. The system state distribution as well as the orbit size and the system size distributions are obtained in terms of their generating functions. These generating functions ...
The MMΣk=1KCPPk/GE/c/L G-queue with heterogeneous servers: Steady state solution and an application to performance evaluation
A new queue, referred to here as the HetSigma queue, in the Markovian framework, is proposed in order to model nodes in modern telecommunication networks. The queue has many of the necessary ingredients, such as joint (or individual) Markov modulation ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V. © 2010.
Publisher
Elsevier North-Holland, Inc.
United States
Publication History
Published: 01 February 2011
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Nov 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in