Abstract
This paper is a review of an approach to queueing systems where the cumulative input is modelled by a general Gaussian process with stationary increments. The examples include priority and Generalized Processor Sharing systems, and a system where service capacity is allocated according to predicted future demand. The basic technical idea is to identify the most probable path in the threshold exceedance event, or a heuristic approximation of it, and then use probability estimates based on this path. The method is particularly useful for long-range dependent traffic and complicated traffic mixes, which are difficult to handle with traditional queueing theory.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R.G. Addie. On weak convergence of long range dependent traffic processes. Journal of Statistical Planning and Inference, 80(1–2):155–171, 1999.
R.G. Addie, P. Mannersalo, and I. Norros. Performance formulae for queues with Gaussian input. In P. Key and D. Smith, editors, Teletraffic Engineering in a Competitive World. Proceedings of the International Teletraffic Congress — ITC-16, pages 1169–1178, Edinburgh, UK, 1999. Elsevier.
R.G. Addie, P. Mannersalo, and I. Norros. Most probable paths and performance formulae for buffers with Gaussian input traffic. To appear in European Transactions on Telecommunications, 2002.
R.J. Adler. An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes, volume 12 of Lecture Notes-Monograph Series. Institute of Mathematical Statistics, 1990.
R. Azencott. Ecole d’Eté de Probabiltés de Saint-Flour VII-1978, chapter Grandes deviations et applications, pages 1–176. Number 774 in Lecture notes in Mathematics. Springer, Berlin, 1980.
R.R. Bahadur and S.L. Zabell. Large deviations of the sample mean in general vector spaces. Ann. Prob., 7(4):587–621, 1979.
A.W. Berger and W. Whitt. Effective bandwidths with priorities. IEEE/ACM Transactions on Networking, 6(4), 1998.
A.W. Berger and W. Whitt. Extending the effective bandwidth concept to networks with priority classes. IEEE Communications Magazine, August 1998.
J.-D. Deuschel and D.W. Stroock. Large Deviations. Academic Press, Boston, 1989.
J. Kilpi and I. Norros. Testing the Gaussian character of access network traffic. Technical Report COST279TD(01)03, COST, 2001. Available from http://www.vtt.fi/tte/projects/cost279/.
W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson. On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Transactions on Networking, 2(1):1–15, February 1994.
M.R.H. Mandjes and J.H. Kim. An analysis of the phase transition phenomenon in packet networks. To appear in Adv. or J. of Applied Probability.
P. Mannersalo and I. Norros. GPS schedulers and Gaussian traffic. Infocom 2002, New York.
P. Mannersalo and I. Norros. Gaussian priority queues. In Proceedings of ITC 17. Elsevier, 2001.
P. Mannersalo and I. Norros. A most probable path approach to queueing systems with general Gaussian input. Computer Networks, 2002. To appear.
L. Massoulie. Large deviations estimates for polling and weighted fair queueing service systems. Adv. Perf. Anal., 2(2):103–127, 1999.
L. Massoulie and A. Simonian. Large buffer asymptotics for the queue with FBM input. J. Appl. Prob., 36(3):894–906, 1999.
O. Narayan. Exact asymptotic queue length distribution for fractional Brownian traffic. Advances in Performance Analysis, 1:39–63, 1998.
I. Norros. A storage model with self-similar input. Queueing Systems, 16:387–396, 1994.
I. Norros. Busy periods of fractional Brownian storage: a large deviations approach. Adv. Perf. Anal., 2:1–19, 1999.
I. Norros, P. Mannersalo, and J.L. Wang. Simulation of fractional Brownian motion with conditionalized random midpoint displacement. Adv. Performance Anal., 2:77–101, 1999.
I. Norros, J.W. Roberts, A. Simonian, and J.T. Virtamo. The superposition of variable bit rate sources in an ATM multiplexer. IEEE JSAC, 9(3):378–387, April 1991.
A.K. Parekh and R.G. Gallager. A generalized processor sharing approach to flow control in integrated services network: the single node case. IEEE/ACM Transaction on Networking, 1(3):344–357, 1993.
R.S. Pazhyannur and P. Fleming. Asymptotic results for voice delay in packet networks. In Vehicular Technology Conference /Fall, 2001.
V.I. Piterbarg. Asymptotic Methods in the Theory of Gaussian Processes and Fields. American Mathematical Society, 1996.
P. Tran-Gia and N. Vicari, editors. Impacts of new services on the architecture and performance of broadband networks. COST 257 Final Report. compuTEAM Würzburg, 2000. http://nero.informatik.uni-wuerzburg.de/cost/Final/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Norros, I. (2002). Most Probable Path Techniques for Gaussian Queueing Systems. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds) NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. NETWORKING 2002. Lecture Notes in Computer Science, vol 2345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47906-6_7
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43709-3
Online ISBN: 978-3-540-47906-2
eBook Packages: Springer Book Archive