Large deviations for gaussian queues modelling communication networks

Large Deviations for Gaussian Queues: Modelling Communication Networks

Volumn , Issue , 2007, Pages 1-326

  Mandjes, Michel ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84889324879     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470515099     Document Type: Book

References (296)

1. Abate, J., and Whitt, W. Transient behavior of regulated Brownian motion, I: Starting at the origin. Adv. Appl. Probab. 19 (1987), 560-598.
2. Abate, J., and Whitt, W. Transient behavior of regulated Brownian motion, II: Non-zero initial conditions. Adv. Appl. Probab. 19 (1987), 599-631.
3. Abate, J., and Whitt, W. Asymptotics for M/G/1 low-priority waiting-time tail probabilities. Queueing Syst. 25 (1997), 173-233.
4. Abry, P., Baraniuk, R., Flandrin, P., Riedi, R., and Veitch, D. Multiscale nature of network traffic. IEEE Signal Proc. Mag. 19 (2002), 28-46.
5. Addie, R., Mannersalo, P., and Norros, I. Most probable paths and performance formulae for buffers with Gaussian input traffic. Eur. Trans. Telecomm. 13 (2002), 183-196.
6. Adler, R. An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes. Lecture Notes-Monograph Series, Vol. 12. Institute of Mathematical Statistics, Hayward, CA, USA, 1990.
7. Agrawal, R., Makowski, A., and Nain, P. On a reduced load equivalence for fluid queues under subexponentiality. Queueing Syst. 33 (1999), 5-41.
8. Alvarez, J., and Hajek, B. On the use of packet classes in communication networks to enhance congestion pricing based on marks. IEEE Trans. Autom. Contr. 47 (2002), 1020-1026.
9. Anick, D., Mitra, D., and Sondhi, M. Stochastic theory of a data handling system with multiple resources. Bell Syst. Techn. J. 61 (1982), 1871-1894.
10. Applebaum, D. Levy Processes and Stochastic Calculus. Cambridge University Press, Cambridge, UK, 2004
11. Arvidsson, A., Chiera, B., Krzesinski, A., and Taylor, P. A distributed scheme for value-based bandwidth reconfiguration. Submitted (2006).
12. Arvidsson, A., de Kock, J., Krzesinski, A., and Taylor, P. Cost-effective deployment of bandwidth partitioning in broadband networks. Telecomm. Syst. 25 (2004), 33-49.
13. Asmussen, S. Applied Probability and Queues, 2nd edition. Springer, New York, NY, USA, 2003.
14. Asmussen, S., and Rubinstein, R. Steady state rare events simulation in queueing models and its complexity properties. In Advances in Queueing, J. Dshalalow, Ed. CRC Press, 1995, pp. 429-461
15. Avi-Itzhak, B. A sequence of service stations with arbitrary input and regular service times. Manage. Sci. 11 (1965), 565-571.
16. Azencott, R. Ecole d’Ete de Probabilites de Saint-Flour VIII-1978, vol. 774 of Lecture Notes in Mathematics. Springer, Berlin, 1980, ch. Grandes deviations et applications, pp. 1-176.
17. Baccelli, F., and Bremaud, P. Elements of Queuing Theory, 2nd edition. Springer, New York, NY, USA, 2002.
18. Bahadur, R., and Rao, R. On deviations of the sample mean. Ann. Math. Stat. 31 (1960), 1015-1027.
19. Bahadur, R., and Zabell, S. Large deviations of the sample mean in general vector spaces. Ann. Probab. 7 (1979), 587-621.
20. Baldi, P., and Pacchiarotti, B. Importance sampling for the ruin problem for general Gaussian processes. Submitted (2004).
21. Barakat, C., Thiran, P., Iannaccone, G., Diot, C., and Owezarski, P. Modeling Internet backbone traffic at the flow level. IEEE Trans. Signal Proc. 51 (2003), 2111-2114.
22. Baxter, G., and Donsker, M. On the distribution of the supremum functional for the processes with stationary independent increments. Trans. Am. Math. Soc. 85 (1957), 73-87.
23. Bean, N. Robust connection acceptance control for ATM networks with incomplete source information. Ann. Oper. Res. 48 (1994), 357-379.
24. Ben Azzouna, N., Clerot, F., Fricker, C., and Guillemin, F. Modeling ADSL traffic on an IP backbone link. Ann. Telecomm. 59 (2004), 1260-1314.
25. Beran, J. Statistics for Long-Memory Processes. Chapman & Hall, New York, NY, USA, 1994.
26. van den Berg, H., and Mandjes, M. Admission control in integrated networks: Overview and evaluation. In Proceedings of the 8th International Conference on Telecommunication Systems. Nashville, (2000), pp. 132-151.
27. van den Berg, H., Mandjes, M., van de Meent, R., Pras, A., Roijers, F., and Venemans, P. QoS-aware bandwidth provisioning of IP links. Comp. Netw. 50 (2006), 631-647
28. Berger, J. Statistical Decision Theory and Bayesian Statistics, 2nd edition. Springer, New York, NY, USA, 1999.
29. Berger, A., and Whitt, W. Extending the effective bandwidth concept to networks with priority classes. IEEE Comm. Mag. August (1998), 78-83
30. Bertoin, J. Levy Processes. Cambridge University Press, Cambridge, UK, 1996
31. Bertsekas, D. Nonlinear Programming, 2nd edition. Athena Scientific, Belmont, MA, USA, 1999.
32. Bertsekas, D., and Gallager, R. Data Networks. Prentice-Hall, Englewood Cliffs, NJ, USA, 1987
33. Bertsimas, D., Paschalidis, I., and Tsitsiklis, J. Large deviations analysis of generalized processor sharing policy. Queueing Syst. 32 (1999), 319-349
34. Bingham, N., Goldie, C., and Teugels, J. Regular Variation. Cambridge University Press, Cambridge, UK, 1987
35. de Boer, P.-T., Kroese, D., Mannor, S., and Rubinstein, R. A tutorial on the cross-entropy method. Ann. Oper. Res. 134 (2005), 19-67
36. Bonald, T., Olivier, P., and Roberts, J. Dimensioning high speed IP access networks. Proc. ITC 18 (2003), pp. 241-251
37. Boots, N.-K., and Mandjes, M. Fast simulation of a queue fed by a superposition of many(heavy-tailed) sources. Probab. Eng. Inform. Sci. 16 (2002), 205-232.
38. Borst, S., Mandjes, M., and van Uitert, M. GPS queues with heterogeneous traffic classes. Proc. IEEE Infocom (2002), pp. 74-83.
39. Borst, S., Mandjes, M., and van Uitert, M. Generalized processor sharing queues with light-tailed and heavy-tailed input. IEEE/ACM Trans. Netw. 11 (2003), 821-834
40. Botvich, D., and Duffield, N. Large deviations, the shape of the loss curve, and economies of large scale multiplexers. Queueing Syst. 20 (1995), 293-320.
41. Bratley, P., Fox, B., and Schrage, L. A Guide to Simulation, 2nd edition. Springer, New York, NY, USA, 1987.
42. Bucklew, J. Large Deviation Techniques in Decision, Simulation and Estimation. Wiley, New York, NY, USA, 1990.
43. Bucklew, J. Introduction to Rare Event Simulation. Springer, New York, NY, USA, 2004.
44. Casetti, C., Kurose, J., and Towsley, D. A new algorithm for measurement-based admission control in integrated services packet networks. In Proceedings of the Fifth International Workshop on Protocols for High-Speed Networks. Antipolis, France, (1996), pp. 13-28.
45. Chang, C.-S. Sample path large deviations and intree networks. Queueing Syst. 20 (1995), 7-36
46. Chang, C.-S. Performance Guarantees in Communication Networks. Springer, London, UK, 2000.
47. Chang, C.-S., Heidelberger, P., Juneja, S., and Shahabuddin, P. Effective bandwidth and fast simulation of ATM intree networks. Perf. Eval. 20 (1994), 45-65.
48. Chernoff, H. A measure of asymptotic efficiency for test of hypothesis based on the sum of observations. Ann. Math. Stat. 23 (1952), 493-507.
49. Choe, J., and Shroff, N. A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks. IEEE/ACM Trans. Netw. 6 (1998), 659-671.
50. Choe, J., and Shroff, N. On the supremum distribution of integrated stationary Gaussian processes with negative linear drift. Adv. Appl. Probab. 31 (1999), 135-157.
51. Choe, J., and Shroff, N. Use of the supremum distribution of Gaussian processes in queueing analysis with long-range dependence and selfsimilarity. Stoch. Models 16 (2000), 209-231.
52. Cohen, J. The Single Server Queue, 2nd edition. North Holland, Amsterdam, Netherlands, 1982.
53. Cohen, J. On the effective bandwidth in buffer design for the multi-server channels. CWI Report BS-R9406, http://ftp.cwi.nl/CWIreports/BS/BS-R9406.pdf, (1994)
54. Cottrell, M., Fort, J.-C., and Malgouyres, G. Large deviations and rare events in the study of stochastic algorithms. IEEE Trans. Automat. Contr. 28 (1983), 907-920.
55. Courcoubetis, C., and Weber, R. Buffer overflow asymptotics for a buffer handling many traffic sources. J. Appl. Probab. 33 (1996), 886-903.
56. Courcoubetis, C., and Weber, R. Pricing Communication Networks: Economics, Technology and Modelling. Wiley, Chichester, 2003
57. Cramer, H. Sur un nouveau theoreme limite de la theorie des probabilites. Actual. Sci. Ind. 736 (1938), 5-23.
58. Crovella, M., and Bestavros, A. Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Trans. Netw. 5 (1997), 835-847
59. Davies, R., and Harte, D. Tests for Hurst effect. Biometrika 74 (1987), 95-101
60. Debicki, K. A note on LDP for supremum of Gaussian processes over infinite horizon. Stat. Probab. Lett. 44 (1999), 211-220.
61. Debicki, K. Some properties of generalized Pickands constants. Prob. Th. Appl. 50 (2006), 290-298
62. Debicki, K., and Mandjes, M. Exact overflow asymptotics for queues with many Gaussian inputs. J. Appl. Probab. 40 (2003), 702-720.
63. Debicki, K., and Mandjes, M. Traffic with an FBM limit: Convergence of the stationary workload process. Queueing Syst. 46 (2003), 113-127
64. Debicki, K., and Mandjes, M. A note on large-buffer asymptotics for generalized processor sharing with Gaussian inputs. Queueing Syst. (2007), in press.
65. Debicki, K., Mandjes, M., and van Uitert, M. A tandem queue with Levy input: A new representation of the downstream queue length. Probab. Eng. Inform. Sci. 21 (2007), 83-107.
66. Debicki, K., and Palmowski, Z. Heavy traffic Gaussian asymptotics of on-off fluid model. Queueing Syst. 33 (1999), 327-338
67. Debicki, K., and Rolski, T. Gaussian fluid models; A survey. Symposium on Performance Models for Information Communication Networks, Sendai, Japan. Available from: Http://www.math.uni.wroc.pl/~rolski/publications.html, 2000.
68. Debicki, K., and Rolski, T. A note on transient Gaussian fluid models. Queueing Syst. 41 (2002), 321-342
69. Debicki, K., and van Uitert, M. Large buffer asymptotics for generalized processor sharing queues with Gaussian inputs. Queueing Syst. 54 (2006), 111-120
70. Delas, S., Mazumdar, R., and Rosenberg, C. Tail asymptotics for HOL priority queues handling a large number of independent stationary sources. Queueing Syst. 40 (2002), 183-204
71. Dembo, A., and Zeitouni, O. Large Deviations Techniques and Applications, 2nd edition. Springer, New York, NY, USA, 1998
72. Demers, A., Keshav, S., and Shenker, S. Analysis and simulation of a fair queueing algorithm. Proc. ACM Sigcomm (1989), pp. 1-12
73. Dempster, A. Generalized D+ statistics. Ann. Math. Stat. 30 (1959), 593-597
74. Deuschel, J.-D., and Stroock, D. Large Deviations. Academic Press, Boston, MA, USA, 1989.
75. Dieker, T. Tools for simulating fractional Brownian motion traces; Note: These tools are available from: Http://www.proba.ucc.ie/~td3/fbm/index.html, 2003
76. Dieker, T. Simulation of Fractional Brownian Motion. Master’s Thesis, Vrije Universiteit, Amsterdam, Netherlands, 2002.
77. Dieker, T. Extremes of Gaussian processes over an infinite horizon. Stoch. Proc. Appl. 115 (2005), 207-248.
78. Dieker, T. Reduced-load equivalence for queues with Gaussian input. Queueing Syst. 49 (2005), 405-414.
79. Dieker, T., and Mandjes, M. On spectral simulation of fractional Brownian motion. Probab. Eng. Inform. Sci. 17 (2003), 417-434.
80. Dieker, T., and Mandjes, M. Fast simulation of overflow probabilities in a queue with Gaussian input. ACM Trans. Model. Comp. Simul. 16 (2006), 119-151
81. Duffield, N. Asymptotic sampling properties of effective bandwidth estimation for admission control. Proc. IEEE Infocom (1999), pp. 1532-1538
82. Duffield, N. A large deviation analysis of errors in measurement based admission control to buffered and bufferless resources. Queueing Syst. 34 (2000), 131-168.
83. Duffield, N., and O’Connell, N. Large deviations and overflow probabilities for general single-server queue, with applications. Math. Proc. Camb. Phil. Soc. 118 (1995), 363-374.
84. Dukkipati, N., Kuri, J., and Jamadagni, H. Optimal call admission control for generalized processor sharing (GPS) schedulers. Proc. IEEE Infocom (2001), pp. 468-477
85. Duncan, T., Yan, Y., and Yan, P. Exact asymptotics for a queue with fractional Brownian input and applications in ATM networks. J. Appl. Probab. 38 (2001), 932-945
86. Dupuis, P., and Ellis, R. A Weak Convergence Approach to the Theory of Large Deviations. Wiley, New York, NY, USA, 1997
87. Dupuis, A., and Guillemin, F. Simulation-based analysis of weighted fair queueing algorithms for ATM networks. Telecomm. Syst. 12 (1999), 149-166
88. Dupuis, P., and Wang, H. Importance sampling, large deviations, and differential games. Stoch. Stoch. Rep. 76 (2004), 481-508.
89. Dupuis, P., and Wang, H. Dynamic importance sampling for uniformly recurrent Markov chains. Ann. Appl. Probab. 15 (2005), 1-38
90. Ellis, R. Entropy, Large Deviations, and Statistical Mechanics. Springer, New York, NY, USA, 1985
91. Elwalid, A., and Mitra, D. Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. IEEE/ACM Trans. Netw. 1 (1993), 329-343.
92. Elwalid, A., and Mitra, D. Analysis, approximations and admission control of a multi-service multiplexing system with priorities. Proc. IEEE Infocom (1995), pp. 463-472
93. Elwalid, A., and Mitra, D. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. Proc. IEEE Infocom (1999), pp. 1220-1230.
94. Elwalid, A., Mitra, D., and Wentworth, R. A new approach for allocating buffers and bandwidth to heterogeneous regulated traffic in an ATM node. IEEE J. Sel. Areas Comm. 13 (1995), 1115-1127
95. Erlang, A. The theory of probabilities and telephone conversations. Nyt. Tidsskr. Mat. B 20 (1909), 33-39
96. Erramilli, A., Narayan, O., and Willinger, W. Experimental queueing analysis with long-range dependent packet traffic. IEEE/ACM Trans. Netw. 4 (1996), 209-223.
97. Erramilli, A., Roughan, M., Veitch, D., and Willinger, W. Self-similar traffic and network dynamics. Proc. IEEE 90 (2002), 800-819
98. Fayolle, G., Mitrani, I., and Iasnogoroski, R. Sharing a processor among many job classes. J. ACM 27 (1980), 519-532.
99. Fiedler, M., and Arvidsson, A. A resource allocation law to satisfy QoS demands on ATM burst and connection level. COST 257 TD(99) 6 (1998)
100. Fraleigh, C. Provisioning Internet Backbone Networks to Support Latency Sensitive Applications. PhD Thesis, Stanford University, USA, 2002
101. Fraleigh, C., Tobagi, F., and Diot, C. Provisioning IP backbone networks to support latency sensitive traffic. Proc. IEEE Infocom (2003).
102. Fricker, C., and Jaibi, R. On the fluid limit of the M/G/to server queue. Submitted (2006).
103. Friedman, H. Reduction methods for tandem queueing systems. Oper. Res. 13 (1965), 121-131
104. Fulp, E., and Reeves, D. Optimal provisioning and pricing of internet differentiated services in hierarchical markets. In International Conference of Networking, ICN 2001, Colmar, France. Lecture Notes in Computer Science (LNCS) Series, 2093, P. Lorenz, Ed. Springer, 2001, pp. 409-418
105. Ganesh, A., Green, P., O’Connell, N., and Pitts, S. Bayesian network management. Queueing Syst. 28 (1998), 267-282.
106. Ganesh, A., and O’Connell, N. An inverse of Sanov’s theorem. Stat. Probab. Lett. 42 (1999), 201-206.
107. Ganesh, A., and O’Connell, N. A large deviation principle for Dirichlet posteriors. Bernoulli 6 (2000), 1021-1034.
108. Ganesh, A., O’Connell, N., and Wischik, D. Big Queues, Lecture Notes in Mathematics, Vol. 1838. Springer, Berlin, Germany, 2004
109. Gibbens, R., and Hunt, P. Effective bandwidths for the multi-type UAS channel. Queueing Syst. 9 (1991), 17-28
110. Gibbens, R., and Kelly, F. Resource pricing and the evolution of congestion control. Automatica 35 (1999), 1969-1985.
111. Gibbens, R., and Kelly, F. On packet marking at priority queues. IEEE Trans. Automat. Contr. 47 (2002), 1016-1020
112. Gibbens, R., Kelly, F., and Key, P. A decision-theoretic approach to call admission control in ATM networks. IEEE J. Sel. Areas Comm. 13 (1995), 1102-1114
113. Gibbens, R., Mason, R., and Steinberg, R. Internet service classes under competition. IEEE J. Sel. Areas Comm. 18 (2000), 2490-2498
114. Giordano, S., Gubinelli, M., and Pagano, M. Bridge Monte-Carlo: A novel approach to rare events of Gaussian processes. In Proceedings of the 5th Workshop on Simulation. St. Petersburg, (2005), pp. 281-286
115. Glasserman, P., Heidelberger, P., Shahabuddin, P., and Zajic, T. Multilevel splitting for estimating rare event probabilities. Oper. Res. 47 (1999), 585-600
116. Glasserman, P., and Wang, Y. Counterexamples in importance sampling for large deviations probabilities. Ann. Appl. Probab. 7 (1997), 731-746
117. Glynn, P. Efficiency improvement techniques. Ann. Oper. Res. 53 (1994), 175-197.
118. Glynn, P., and Whitt, W. Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. In Studies in Applied Probability, Papers in Honour ofLajos Takacs, J. Galambos and J. Gani, Eds. Applied Probability Trust, 1994, pp. 131-156.
119. Grossglauser, M., Keshav, S., and Tse, D. RCBR: A simple and efficient service for multiple time-scale traffic. IEEE/ACM Trans. Netw. 5 (1997), 741-755
120. Grossglauser, M., and Tse, D. A framework for robust measurement-based admission control. IEEE/ACM Trans. Netw. 7 (1999), 293-309
121. Guerin, R., Ahmadi, H., and Naghshineh, M. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE J. Sel. Areas Comm. 9 (1991), 968-981
122. Guillemin, F., Mazumdar, R., Dupuis, A., and Boyer, J. Analysis of the fluid weighted fair queueing system. J. Appl. Probab. 40 (2003), 180-199.
123. Guillemin, F., and Pinchon, D. Analysis of generalized processor-sharing systems with two classes of customers and exponential services. J. Appl. Probab. 41 (2004), 832-858
124. Guo, L., and Matta, I. The war between mice and elephants. In Proceedings of the International Conference on Network Protocols (2001), pp. 180-191
125. Hammersley, J., and Handscomb, D. Monte Carlo Methods. Methuen, London, 1964
126. Hansen, M., and Pitts, S. Nonparametric inference from the M/G/1 workload. Bernoulli 12 (2006), 737-759
127. Harrison, J. Brownian Motion and Stochastic Flow Systems. Wiley, New York, NY, USA, 1985
128. Hassin, R., and Haviv, M. To Queue or Not to Queue. Kluwer, Dordrecht, Netherlands, 2003.
129. Heath, D., Resnick, S., and Samorodnitsky, G. Heavy tails and long range dependence in on/off processes and associated fluid models. Math. Oper. Res. 23 (1998), 145-165
130. Heidelberger, P. Fast simulation of rare events in queueing and reliability models. ACM Trans. Model. Comp. Simul. 5 (1995), 43-85
131. den Hollander, F. Large Deviations. Fields Institute Monographs 14. American Mathematical Society, Providence, RI, USA, 2000.
132. Hopmans, A., and Kleijnen, J. Importance sampling in systems simulation: A practical failure? Math. Comp. Simul. 21 (1979), 209-220.
133. Huang, C., Devetsikiotis, M., Lambadaris, I., and Kaye, A. Fast simulation of queues with long-range dependent traffic. Stoch. Models 15 (1999), 429-460
134. Huang, X., Ozdaglar, A., and Acemoglu, D. Efficiency and Braess’ paradox under pricing in general networks. IEEE J. Sel. Areas Comm. 24 (2006), 977-991
135. Hui, J. Resource allocation for broadband networks. IEEE J. Sel. Areas Comm. 6 (1988), 1598-1608.
136. Humblet, P., Bhargava, A., and Hluchyj, M. Ballot theorems applied to the transient analysis of nD/D/1 queues. IEEE/ACM Trans. Netw. 1 (1993), 81-95.
137. Husler, J., and Piterbarg, V. Extremes of a certain class of Gaussian processes. Stoch. Proc. Appl. 83 (1999), 257-271.
138. Jacod, J., and Shiryaev, A. Limit Theorems for Stochastic Processes, 2nd edition. Springer, Berlin, 2003
139. Jamin, S., Danzig, P., Shenker, S., and Zhang, L. A measurement- based admission control algorithm for integrated service packet networks. IEEE/ACM Trans. Netw. 5 (1997), 56-70.
140. Jamin, S., Shenker, S., and Danzig, P. Comparison of measurement-based call admission control algorithms for controlled-load service. Proc. IEEE Infocom (1997), pp. 973-980
141. Johari, R., and Tan, D. End-to-end congestion control for the Internet: Delays and stability. IEEE/ACM Trans. Netw. 9 (2001), 818-832.
142. Juva, I., Susitaival, R., Peuhkuri, M., and Aalto, S. Traffic characterization for traffic engineering purposes: Analysis of Funet data. In Proceedings of the 1st EuroNGI Conference on Next Generation Internet Networks-Traffic Engineering (2005).
143. Kaj, I., and Taqqu, M. Convergence to fractional Brownian motion and to the Telecom process: The integral representation approach. Department of Mathematics, Uppsala University, U.U.D.M. 2004:16. Submitted (2004).
144. Kaufman, J. Blocking in a shared resource environment. IEEE Trans. Comm. 29 (1981), 1474-1481.
145. Kella, O. Parallel and tandem fluid networks with dependent Levy inputs. Ann. Appl. Probab. 3 (1993), 682-695.
146. Kella, O., and Whitt, W. A tandem fluid network with Levy input. In Queueing and Related Models, U. Bhat and I. Basawa, Eds. Oxford University Press, 1992, pp. 112-128.
147. Kelly, F. Loss networks. Ann. Appl. Probab. 1 (1991), 319-378
148. Kelly, F. Notes on effective bandwidths. In Stochastic Networks: Theory and Applications, F. P. Kelly, S. Zachary, and I. Ziedins, Eds. Oxford University Press, 1996, pp. 141-168.
149. Kelly, F. Charging and rate control for elastic traffic. Eur. Trans. Telecomm. 8 (1997), 33-37.
150. Kelly, F. Models for a self-managed Internet. Phil. Trans. R. Soc. A358 (2000), 2335-2348.
151. Kelly, F. Mathematical modelling of the Internet. In Mathematics Unlimited-2001 and Beyond, B. Engquist and W. Schmid, Eds. Springer, 2001, pp. 685-702.
152. Kelly, F., Maulloo, A., and Tan, D. Rate control in communication networks: Shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49 (1998), 237-252.
153. Kesidis, G., Walrand, J., and Chang, C.-S. Effective bandwidths for multiclass Markov fluids and other ATM sources. IEEE/ACM Trans. Netw. 1 (1993), 424-428.
154. Kilkki, K. Differentiated Services for the Internet. Macmillan Technical Publishing, Indianapolis, IN, USA, 1999.
155. Kilpi, J., and Norros, I. Testing the Gaussian approximation of aggregate traffic. In Proceedings of the 2nd Internet Measurement Workshop (2002), pp. 49-61.
156. Kobelkov, S. The ruin problem for the stationary Gaussian process. Theory Probab. Appl. 49 (2005), 155-163.
157. Konstant, D., and Piterbarg, V. Extreme values of the cyclostationary Gaussian random processes. J. Appl. Probab. 30 (1993), 82-97.
158. Kosten, L. Stochastic theory of data-handling systems with groups of multiple sources. In Performance of Computer-Communication Systems, H. Rudin and W. Bux, Eds. Elsevier, 1984, pp. 321-331.
159. Kulkarni, V. Frontiers in Queueing. CRC Press, Boca Raton, FL, USA, 1997 pp. 321-338.
160. Kulkarni, V., and Rolski, T. Fluid model driven by an Ornstein-Uhlenbeck process. Probab. Eng. Inform. Sci. 8 (1994), 403-417
161. Kumaran, K., and Mandjes, M. The buffer-bandwidth trade-off curve is convex. Queueing Syst. 38 (2001), 471-483.
162. Kumaran, K., and Mandjes, M. Multiplexing regulated traffic streams: Design and performance. Proc. IEEE Infocom (2001), pp. 527-536.
163. Kumaran, K., Mandjes, M., and Stolyar, A. Convexity properties of loss and overflow functions. Oper. Res. Lett. 31 (2003), 95-100.
164. Kumaran, K., Margrave, G., Mitra, D., and Stanley, K. Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes. Proc. IEEE Infocom (2000), pp. 932-941.
165. Kumaran, K., and Mitra, D. Performance and fluid simulations of a novel shared buffer management system. Proc. IEEE Infocom (1998), pp. 1449-1461.
166. Kurose, J., and Ross, K. Computer Networking: A Top-Down Approach Featuring the Internet. Addison-Wesley Longman, Boston, MA, USA, 2002.
167. Kvols, K., and Blaabjerg, S. Bounds and approximations for the periodic on-off queue with application to ATM traffic control. Proc. IEEE Infocom (1992), pp. 487-494.
168. Lanning, S., Massey, W., Rider, B., and Wang, Q. Optimal pricing in queueing systems with quality of service constraints. Proc. ITC 16 (1999), pp. 747-756.
169. Law, A., and Kelton, W. Simulation Modeling and Analysis. 3rd edition. McGraw-Hill, New York, NY, USA, 2000.
170. L’Ecuyer, P. Efficiency improvement via variance reduction. In Proceedings of the Winter Simulation Conference (1994), pp. 122-132.
171. Leland, W., Taqqu, M., Willinger, W., and Wilson, D. On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Trans. Netw. 2 (1994), 1-15.
172. Lieshout, P., Mandjes, M., and Borst, S. GPS scheduling: Selection of optimal weights and comparison with strict priorities. Proc. ACM Sigmetrics Perform. 34 (2006), pp. 75-86.
173. Likhanov, N., and Mazumdar, R. Cell loss asymptotics in buffers fed with a large number of independent stationary sources. J. Appl. Probab. 36 (1999), 86-96.
174. LoPresti, F., Zhang, Z., Towsley, D., and Kurose, J. Source time scale optimal buffer/bandwidth trade-off for regulated traffic in an ATM node. Proc. IEEE Infocom (1997), pp. 675-682.
175. Low, S., and Lapsley, D. Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Trans. Netw. 7 (1999), 861-875.
176. Luenberger, D. Linear and Nonlinear Programming, 2nd edition. Addison Wesley, Reading, MA, USA, 1984.
177. MacKie-Mason, J., and Varian, H. Pricing congestible network resources. IEEE J. Sel. Areas Comm. 13 (1995), 1141-1149.
178. MacKie-Mason, J., and Varian, H. Pricing the Internet. In Public Access to the Internet, B. Kahin and J. Keller, Eds. MIT Press, 1995, pp. 269-314.
179. Mandjes, M. Asymptotically optimal importance sampling for tandem queues with Markov fluid input. AEU Int. J. Elect. Comm. 52 (1998), 152-161
180. Mandjes, M. Pricing strategies under heterogeneous service requirements. Comp. Netw. 42 (2003), 231-249.
181. Mandjes, M. A note on the benefits of buffering. Stoch. Models 20 (2004), 43-54.
182. Mandjes, M. Packet models revisited: Tandem and priority systems. Queueing Syst. 47 (2004), 363-377
183. Mandjes, M. Large deviations for complex buffer architectures: The short-range dependent case. Stoch. Models 22 (2006), 99-128.
184. Mandjes, M., and Borst, S. Overflow behavior in queues with many longtailed inputs. Adv. Appl. Probab. 32 (2000), 1150-1167
185. Mandjes, M., and Kim, J.-H. An analysis of the phase transition phenomenon in packet networks. Adv. Appl. Probab. 33 (2001), 260-280
186. Mandjes, M., and Kim, J.-H. Large deviations for small buffers: An insensitivity result. Queueing Syst. 37 (2001), 349-362.
187. Mandjes, M., Mannersalo, P., and Norros, I. Priority queues with Gaussian input: A path-space approach to loss and delay asymptotics. Proc. ITC 19 (2005), pp. 1135-1144.
188. Mandjes, M., Mannersalo, P., and Norros, I. Gaussian tandem queues with an application to dimensioning of switch fabrics. Comp. Netw. 51 (2007), 781-797
189. Mandjes, M., Mannersalo, P., Norros, I., and van Uitert, M. Large deviations of infinite intersections of events in Gaussian processes. Stoch. Proc. Appl. 116 (2006), 1269-1293
190. Mandjes, M., and Ramakrishnan, M. Bandwidth trading under misaligned objectives: Decentralized measurement-based control. Submitted (2006)
191. Mandjes, M., and Ridder, A. Optimal trajectory to overflow in a queue fed by a large number of sources. Queueing Syst. 31 (1999), 137-170.
192. Mandjes, M., and van de Meent, R. Inferring traffic burstiness by sampling the buffer occupancy. In Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems. Fourth International IFIP-TC6 Networking Conference (Networking 2005), Waterloo, Canada. Lecture Notes in Computer Science (LNCS) Series, 3462, R. Boutaba, K. Almeroth, R. Puigjaner, S. Shen, and J. Black, Eds. Springer, 2005, pp. 303-315.
193. Mandjes, M., Saniee, I., and Stolyar, A. Load characterization, overload prediction, and load anomaly detection for voice over IP traffic. IEEE Trans. Neural Netw. 16 (2005), 1019-1028.
194. Mandjes, M., and van de Meent, R. Resource provisioning through buffer sampling. Submitted (2006).
195. Mandjes, M., and van Uitert, M. Sample-path large deviations for tandem queues with Gaussian inputs. Proc. ITC 18 (2003), pp. 521-530.
196. Mandjes, M., and van Uitert, M. Sample-path large deviations for Generalized processor sharing queues with Gaussian inputs. Perf. Eval. 61 (2005), 225-256
197. Mandjes, M., and van Uitert, M. Sample-path large deviations for tandem and priority queues with Gaussian inputs. Ann. Appl. Probab. 15 (2005), 1193-1226.
198. Mandjes, M., and Weiss, A. Sample-path large deviations of a multiple time-scale queueing model. Submitted (2004).
199. Mankiw, G. Macro-economics, 2nd edition. Worth Publishers, New York, NY, USA, 1994.
200. Mannersalo, P., and Norros, I. Approximate formulae for Gaussian priority queues. Proc. ITC 17 (2001), pp. 991-1002
201. Mannersalo, P., and Norros, I. GPS schedulers and Gaussian traffic. Proc. IEEE Infocom (2002), pp. 1660-1667.
202. Mannersalo, P., and Norros, I. A most probable path approach to queueing systems with general Gaussian input. Comp. Netw. 40 (2002), 399-412
203. Massoulie, L. Large deviations estimates for polling and weighted fair queueing service systems. Adv. Perf. Anal. 2 (1999), 103-127
204. Massoulie, L., and Simonian, A. Large buffer asymptotics for the queue with FBM input. J. Appl. Probab. 36 (1999), 894-906
205. McKnight, L., and Bailey, J. Internet Economics. MIT Press, Cambridge, MA, USA, 1998.
206. van de Meent, R., and Mandjes, M. Evaluation of ‘user-oriented’ and ‘black-box’ traffic models for link provisioning. In Proceedings of the 1st EuroNGI Conference on Next Generation Internet Networks - Traffic Engineering (2005)
207. van de Meent, R., Mandjes, M., and Pras, A. Gaussian traffic everywhere? In Proceedings of the IEEE International Conference on Communications (2006)
208. van de Meent, R., Mandjes, M., and Pras, A. Smart dimensioning of IP network links. Submitted (2007).
209. van de Meent, R., Pras, A., Mandjes, M., H. van den Berg, and Nieuwen- huis, L. Traffic measurements for link dimensioning - a case study. In Self-managing distributed systems. 14th IFIP/IEEE International Workshop on Distributed Systems Operations and Management, DSOM 2003. Heidelberg, Germany. Lecture Notes in Computer Science (LNCS) Series, 2867, M. Brunner and A. Keller, Eds. Springer, 2003, pp. 106-117
210. Mendelson, H., and Whang, S. Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. 38 (1990), 870-883
211. Michna, Z. On tail probabilities and first passage times for fractional Brownian motion. Math. Meth. Oper. Res. 49 (1999), 335-354
212. Mikosch, T., Resnick, S., Rootzen, H., and Stegeman, A. Is network traffic approximated by stable Levy motion or fractional Brownian motion? Ann. Appl. Probab. 12 (2002), 23-68.
213. Mitra, D. Stochastic theory of a fluid model of producers and consumers coupled by a buffer. Adv. Appl. Probab. 20 (1988), 646-676
214. Mitrinovic, D. Analytic Inequalities. Springer, Berlin, Germany, 1970.
215. Mo, J., and Walrand, J. Fair end-to-end window-based congestion control. IEEE/ACM Trans. Netw. 8 (2000), 556-567
216. Narayan, O. Exact asymptotic queue length distribution for fractional Brownian traffic. Adv. Perf. Anal. 1 (1998), 39-63
217. Norros, I. A storage model with self-similar input. Queueing Syst. 16 (1994), 387-396
218. Norros, I. On the use of fractional Brownian motion in the theory of connectionless networks. IEEE J. Sel. Areas Comm. 13 (1995), 953-962
219. Norros, I. Busy periods of fractional Brownian storage: A large deviations approach. Adv. Perf. Anal. 2 (1999), 1-20
220. Norros, I. Most probable paths in Gaussian priority queues. COST257 TD(99)16 (1999).
221. Norros, I. Large deviations of queues with long-range dependent input. In Theory and Applications of Long Range Dependence, P. Doukhan, G. Oppenheim, and M. Taqqu, Eds. Birkhauser, 2002, pp. 409-416
222. Norros, I. Most probable path techniques for Gaussian systems. In Proc. Networking 2002 (2002), pp. 86-104
223. Norros, I., Mannersalo, P., and Wang, J. Simulation of fractional Brownian motion with conditionalized random midpoint displacement. Adv. Perf. Anal. 2 (1999), 77-101.
224. Norros, I., Roberts, J., Simonian, A., and Virtamo, J. The superposition of variable bit rate sources in an ATM multiplexer. IEEE J. Sel. Areas Comm. 9 (1991), 378-387
225. Odlyzko, A. Paris metro pricing for the internet. In Proceedings of the ACM Conference on Electronic Commerce (1999), pp. 140-147
226. Oetiker, T. MRTG: Multi Router Traffic Grapher; Note: This tool is available from: Http://people.ee.ethz.ch/oetiker/webtools/mrtg/, 2007
227. Onvural, R. Asynchronous Transfer Mode Networks: Performance Issues, 2nd edition. Artech House, Norwood, MA, USA, 1995
228. Ozdaglar, A. Price competition with elastic traffic. Submitted (2006).
229. Panagakis, A., Dukkipati, N., Stavrakakis, I., and Kuri, J. Optimal call admission control on a single link with a GPS scheduler. IEEE/ACM Trans. Netw. 12 (2004), 865-878
230. Papagiannaki, K. Provisioning IP Backbone Networks Based on Measurements. PhD Thesis, University of London, UK, 2003
231. Parekh, A., and Gallager, R. A generalized processor sharing approach to flow control in integrated services network: The single node case. IEEE/ACM Trans. Netw. 1 (1993), 344-357
232. Parekh, A., and Gallager, R. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Trans. Netw. 2 (1994), 137-150.
233. Paschalidis, Y. Class-specific quality of service guarantees in multimedia communication networks. Automatica 12 (1999), 1951-1969
234. Paxson, V. Fast, approximate synthesis of fractional Gaussian noise for generating self-similar network traffic. Comp. Comm. Rev. 27 (1997), 5-18
235. Paxson, V., and Floyd, S. Wide area traffic: The failure of Poisson modeling. IEEE/ACM Trans. Netw. 3 (1995), 226-244
236. Pickands III., J. Asymptotic properties of the maximum in a stationary Gaussian process. Trans. Am. Math. Soc. 145 (1969), 75-86.
237. Pigou, A. The Economics of Welfare, 3rd edition. Macmillan, London, UK, 1929
238. Piterbarg, V. Asymptotic Methods in the Theory of Gaussian Processes. American Mathematical Society, Providence, RI, USA, 1995.
239. Piterbarg, V., and Fatalov, V. The Laplace method for probability measures in banach spaces. Russ. Math. Surv. 50 (1995), 1151-1239
240. Piterbarg, V. Large deviations of a storage process with fractional Brownian motion as input. Extremes 4 (2001), 147-164
241. Piterbarg, V., and Prisyazhnyuk, V. Asymptotic behavior of the probability of a large excursion for a nonstationary Gaussian processes. Theory Probab. Math. Stat. 18 (1978), 121-133.
242. Prabhu, N. Stochastic Storage Processes: Queues, Insurance Risk, Dams and Data Communication, 2nd edition. Springer, New York, NY, USA, 1998
243. Pyke, R. The supremum and infimum of the Poisson process. Ann. Math. Stat. 30 (1959), 568-576
244. Ramakrishnan, M. Distributed Approaches to Capacity Reallocation in Networks. PhD Thesis, University of Melbourne, Australia, 2006.
245. Reich, E. On the integrodifferential equation of Takacs I. Ann. Math. Stat. 29 (1958), 563-570
246. Robert, P. Stochastic Networks and Queues. Springer, New York, NY, USA, 2003
247. Roberts, J. A service system with heterogeneous service requirements - applications to multi-service telecommunications systems. In Proceedings of Performance of Datacommunications Systems and their Applications, G. Pujolle, Ed. North Holland, Amsterdam, The Netherlands, 1981, pp. 423-431
248. Roberts, J. Traffic theory and the Internet. IEEE Comm. Mag. 39 (2001), 94-99.
249. Roberts, J., Mocci, U., and Virtamo, J. Broadband Network Teletraffic, Final Report of European Action COST 242. Springer, Berlin, Germany, 1996
250. Roberts, J., and Virtamo, J. The superposition of periodic cell arrival streams in an ATM multiplexer. IEEE Trans. Comm. 39 (1991), 298-303
251. Rockafellar, R. Convex Analysis. Princeton University Press, Princeton, NJ, USA, 1970
252. Rogers, L. Fluid models in queueing theory and Wiener-Hopf factorization of Markov chains. Ann. Appl. Probab. 4 (1994), 390-413
253. Roughgarden, T. Selfish Routing and the Price of Anarchy. MIT Press, Cambridge, MA, USA, 2004
254. Rubinstein, R. Optimization of computer simulation models with rare events. Eur. J. Oper. Res. 99 (1997), 89-112
255. Rubinstein, R., and Kroese, D. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. Springer, New York, NY, USA, 2004
256. Sadowsky, J., and Bucklew, J. On large deviations theory and asymptotically efficient Monte Carlo estimation. IEEE Trans. Inf. Theory 36 (1990), 579-588
257. Sanov, I. Selected Translations in Mathematical Statistics and Proba bility, vol. 1. American Mathematical Society, Providence, RI, USA, 1961 pp. 213-244
258. Sato, K. Levy Processes and Infinitely Divisible Distributions. Cambridge University Press, Cambridge, UK, 1999
259. Shakkottai, S., and Srikant, R. Many-sources delay asymptotics with applications to priority queues. Queueing Syst. 39 (2001), 183-200
260. Sharma, V. Estimating traffic intensities at different nodes in networks via a probing stream. Proc. IEEE Globecom (1999), pp. 374-380
261. Sharma, V., and Mazumdar, R. Estimating the traffic parameters in queueing systems with local information. Perf. Eval. 32 (1998), 217-230
262. Shenker, S. Fundamental design issues for the future Internet. IEEE J. Sel. Areas Comm. 13 (1995), 1176-1188
263. Shwartz, A., and Weiss, A. Large Deviations for Performance Analysis. Queues, Communications, and Computing. Chapman & Hall, London, UK, 1995
264. Siegmund, D. Importance sampling in the Monte Carlo study of sequential tests. Ann. Stat. 4 (1976), 673-684
265. Songhurst, D. Charging Communication Networks -from Theory to Practice. Elsevier, Amsterdam, the Netherlands, 1999
266. Sriram, K., and Whitt, W. Characterizing superposition arrival processes in packet multiplexers for voice and data. IEEE J. Sel. Areas Comm. 4 (1986), 833-846
267. Szczotka, W. Central limit theorem in D(0; TO) for breakdown processes. Probab. Math. Stat. 1 (1980), 49-57
268. Takacs, L. Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York, NY, USA, 1967
269. Taqqu, M., Teverovsky, V., and Willinger, W. Estimators for long-range dependence: an empirical study. Fractals 3 (1995), 785-798
270. Taqqu, M., Willinger, W., and Sherman, R. Proof for a fundamental result in self-similar traffic modeling. Comp. Comm. Rev. 27 (1997), 5-23
271. Tijms, H. A First Course in Stochastic Models. Wiley, New York, NY, USA, 2003
272. van Uitert, M., and Borst, S. Generalised processor sharing networks fed by heavy-tailed traffic flows. Proc. IEEE Infocom (2001), pp. 269-278
273. van Uitert, M., and Borst, S. A reduced-load equivalence for generalised processor sharing networks with long-tailed traffic flows. Queueing Syst. 41 (2002), 123-163
274. Varian, H. Microeconomic Analysis, 3rd edition. Norton, New York, NY, USA, 1992
275. de Veciana, G., Kesidis, G., and Walrand, J. Resource management in wide- area ATM networks using effective bandwidths. IEEE J. Sel. Areas Comm. 13 (1995), 1081-1090
276. Villen-Altamirano, M., and Villen-Altamirano, J. Restart: A straightforward method for fast simulation of rare events. In Proceedings of the Winter Simulation Conference (1994), pp. 282-289
277. Vinnicombe, G. On the stability of networks operating TCP-like congestion control. In Proceedings of the 15th IFAC World Congress on Automatic Control (2002)
278. Weber, R. The interchangeability of-/M/1 queues in series. J. Appl. Probab. 16 (1979), 690-695
279. Weiss, A. A new technique for analyzing large traffic systems. Adv. Appl. Probab. 18 (1986), 506-532
280. Weiss, W. QoS with differentiated services. Bell Labs Techn. J. 3 (1998), 48-62.
281. Whitt, W. Tail probabilities with statistical multiplexing and effective bandwidth in multi class queues. Telecomm. Syst. 2 (1993), 71-107
282. Whitt, W. Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and their Application to Queues. Springer, New York, NY, USA, 2002
283. Whittle, P. Optimization under Constraints. Wiley, Chichester, UK, 1971
284. Willinger, W., Taqqu, M., Sherman, R., and Wilson, D. Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level. IEEE/ACM Trans. Netw. 5 (1997), 71-86
285. Winkler, R. Introduction to Bayesian Inference and Decision, 2nd edition. Probabilistic Publishing, Sugar Land, TX, USA, 2003
286. Wischik, D. Large deviations and Internet Congestion. PhD Thesis, University of Cambridge, UK, 1999
287. Wischik, D. The output of a switch, or, effective bandwidths for networks. Queueing Syst. 32 (1999), 383-396
288. Wischik, D. Sample path large deviations for queues with many inputs. Ann. Appl. Probab. 11 (2001), 389-404.
289. Wischik, D., and Ganesh, A. The calculus of Hurstiness. Queueing Syst. (2007)
290. Wroclawski, J. Specification of the controlled load network element service. Internet Engineering Task Force RFC 2211 (1997)
291. Zeevi, A., and Glynn, P. On the maximum workload in a queue fed by fractional Brownian motion. Ann. Appl. Probab. 10 (2000), 1084-1099
292. Zhang, Z.-L. Large deviations and the Generalized processor sharing scheduling for a two-queue system. Queueing Syst. 26 (1997), 229-254.
293. Zhang, Z.-L. Large deviations and the Generalized processor sharing scheduling for a multiple-queue system. Queueing Syst. 28 (1998), 349-376.
294. Zhang, Z.-L., Liu, Z., Kurose, J., and Towsley, D. Call admission control schemes under Generalized processor sharing scheduling. Telecomm. Syst. (1997), 125-152.
295. Zhang, Z.-L., Ribeiro, V., Moon, S., and Diot, C. Small-time scaling behaviors of Internet backbone traffic: An empirical study. Proc. IEEE Infocom (2003)
296. Zwart, B., Borst, S., and Debicki, K. Reduced-load equivalence for Gaussian processes. Oper. Res. Lett. 33 (2005), 502-510