Access Convergence for Heavy Load Markov Ethernet Bursty Traffic Using Two-level Statistical Multiplexing
Article Sidebar
Main Article Content
Abstract
A method for modeling aggregated heavy Markov bursty Ethernet traffic from different sources is proposed in this paper, particularly that prevailing between gateway services and internet routing devices, with the aim of achieving rate accommodation. In other words, to accommodate different rates while filtering out delays in the queue, to achieve access network convergence. Although gateway functions can be used to achieve this by adapting service rates, as many gateways as services are required. Instead of considering the distributed gateway services method, statistical multiplexing is chosen for this study for cost efficiency in network resources. Unfortunately, statistical multiplexing exhibits greater packet variation (jitter) and transfer delay. These delays, basically resulting from positive correlations or time dependency in the queue system, are addressed through infinitesimal queue modeling, based on the diffusion process approximated by Ornstein-Uhlenbeck, which deals with infinitesimal changes in the Markov queue. The related analysis has resulted in an exponential queueing model for univariate and/or multivariate servers obtained through Markov Gaussian approximation. An experiment based on two different voice algorithms shows rate accommodation, and a fluid solution, which is dynamically outputted according to the transmission link availability during each transition time, without any significant delay. Hence, better transfer delay and rate control is obtained through the proposed two multiplexing levels within an Ethernet LAN
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.
- Creative Commons Copyright License
The journal allows readers to download and share all published articles as long as they properly cite such articles; however, they cannot change them or use them commercially. This is classified as CC BY-NC-ND for the creative commons license.
- Retention of Copyright and Publishing Rights
The journal allows the authors of the published articles to hold copyrights and publishing rights without restrictions.
References
E. T. Affonso, R. D. Nunes, R. L. Rosa, G. F. Pivaro, and D. Z. Rodriguez, “Speech quality assessment in wireless VoIP communication using deep belief network,” IEEE Access, vol. 6, pp. 77 022–77 032, 2018.
QoS for Video Conferencing: Critical Considerations for Empowered Communications. https://www.vonage.com/resources/articles/qosvideo-conferencing-critical-considerationsempowered-communications/
K. Sriram and W. Whitt, “Characterizing superposition arrival processes in packet multiplexers for voice and data,” IEEE Journal on Selected Areas in Communications, vol. 4, no. 6, pp. 833–846, Sep. 1986.
K. Chandra, “Statistical multiplexing,” in Wiley Encyclopedia of Telecommunications, J. G. Proakis, Ed. Hoboken, New Jersey, USA: John Wiley & Sons, 2003.
J. Medhi, Stochastic Models in Queuing Theory. San Diego, California, USA: Academic Press, 1991.
J. J. Hunter, Mathematical Techniques of Applied Probability: Discrete Time Models: Basic Theory. San Diego, California, USA: Academic Press, 1983.
V. Frost and B. Melamed, “Traffic modeling for telecommunications networks,” IEEE Communications Magazine, vol. 32, no. 3, pp. 70–81, Mar. 1994.
R. Gusella, “Characterizing the variability of arrival processes with indexes of dispersion,” IEEE Journal on Selected Areas in Communications, vol. 9, no. 2, pp. 203–211, Feb. 1991.
W. Leland, M. Taqqu, W. Willinger, and D. Wilson, “On the self-similar nature of Ethernet traffic (extended version),” IEEE/ACM Transactions on Networking, vol. 2, no. 1, pp. 1–15, Feb. 1994.
D. G. Kendall, “Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain,” The Annals of Mathematical Statistics, vol. 24, no. 3, pp. 338–354, Sep. 1953.
L. Takács, Introduction to the Theory of Queues. New York, USA: Oxford University Press, 1962.
W. Whitt, “Approximating a point process by a renewal process, I: Two basic methods,” Operations Research, vol. 30, no. 1, pp. 125–147, Feb. 1982.
J. C. Lui. G/G/1 queueing systems [Online]. Available: http://www.cse.cuhk.edu.hk/~cslui/CSC5420/GG1.pdf
D. Sloughter. (2004). Liouville’s theorem [Online]. Available: http://math.furman.edu/~dcs/courses/math39/lectures/lecture-32.pdf
J. F. C. Kingman, “On queues in heavy traffic,” Journal of the Royal Statistical Society. Series B (Methodological), vol. 24, no. 2, pp. 383–392, 1962.
H. Kobayashi, “Bounds for the waiting time in queueing systems,” in Computer Architectures and Networks: Modelling and Evaluation : Proceedings of an International Workshop, E. Gelenbe and R. Mahl, Eds. Amsterdam, The Netherlands: North-Holland, 1974, pp. 263–274.
S. L. Brumelle, “Some inequalities for parallel-server queues,” Operations Research, vol. 19, no. 2, pp. 402–413, Apr. 1971.
M. M. Marjanović and Z. Kadelburg, “A proof of Chebyshev’s inequality,” The Teaching of Mathematics, vol. 10, no. 2, pp. 107–108, 2007.
W. Feller, An Introduction to Probability Theory and Its Applications. Hoboken, New Jersey, USA: John Wiley & Sons, 1957, vol. 1.
H. Kobayashi and Q. Ren, “A diffusion approximation analysis of an ATM statistical multiplexer with multiple types of traffic. - I. equilibrium state solutions,” in Proceedings of ICC’93 - IEEE International Conference on Communications, 1993, pp. 1047–1053.
Q. Ren and H. Kobayashi, “Diffusion approximation modeling for Markov modulated bursty traffic and its applications to bandwidth allocation in ATM networks„” IEEE Journal on Selected Areas in Communications, vol. 16, no. 5, pp. 679–691, Jun. 1998.
M. Reiser and H. Kobayashi, “Accuracy of the diffusion approximation for some queuing systems,” IBM Journal of Research and Development, vol. 18, no. 2, pp. 110–124, Mar. 1974.
M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. Reading, Massachusetts, USA: Addison-Wesley, 1987.
M. Luhanga, “A fluid approximation model of an integrated packet voice and data multiplexer,” in IEEE INFOCOM’88, Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?, 1988, pp. 687–692.
J. M. Harrison and A. Zeevi, “Dynamic scheduling of a multiclass queue in the Halfin-Whitt heavy traffic regime,” Operations Research, vol. 52, no. 2, pp. 243–257, Apr. 2004.
Y. Aït-Sahalia, “Maximum likelihood estimation of discretely sampled diffusions: A closed-form approximation approach,” Econometrica, vol. 70, no. 1, pp. 223–262, Jan. 2002.
A. Friedman, Partial Differential Equations of Parabolic Type. Englewood Cliffs, New Jersey, USA: Prentice-Hall, 1964.
Y. Aït-Sahalia, “Closed-form likelihood expansions for multivariate diffusions,” Annals of Statistics, vol. 36, no. 2, pp. 906–937, Apr. 2008.
S. Nlend, “Optimization of resources allocation for H.323 endpoints and terminals over VoIP networks,” M.Phil. Thesis, Department of Electrical and Electronic Engineering Science, University of Johannesburg, South Africa, 2013.