Exponential bounds with applications to call admission

Journal of the ACM

Volumn 44, Issue 3, 1997, Pages 366-394

  Liu, Zhen ^a   Nain, Philippe ^a   Towsley, Don ^b,c  

^a INRIA   (France)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

^c Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Call admission control; Effective bandwidth; Ergodicity; Exponential bound; Large deviation principle; Markov additive process; Markov chain; Matrix analysis; Performance; Queues; Tail distribution; Theory

Indexed keywords

COMMUNICATION; MARKOV PROCESSES; QUEUEING THEORY;

CALL ADMISSION CONTROL; ERGODICITY; EXPONENTIAL BOUND; MARKOV ADDITIVE PROCESS;

COMPUTER NETWORKS;

EID: 0031140668     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/258128.258129     Document Type: Article

References (62)

1. ABATE, J., CHOUDHURY, G. L., AND WHITT, W. 1994. Asymptotics for steady-state tail probabilities in structured Markov queueing models. Commun. Statist. Stochastic Models 10, 1, 99-143.
2. ABATE, J., AND WHITT, W. 1992. The Fourier-series method for inverting transforms of probability distributions. Que. Syst. 10, 5-88.
3. ANICK, D., MITRA, D., AND SONDHI, M. M. 1982. Stochastic theory of a data-handling system with multiple sources. Bell Syst. Tech. J. 61, 1871-1894.
4. ARTIGES, D., AND NAIN, P. 1996. Upper and lower bounds for the multiplexing of multiclass Markovian on/off sources. Perf. Eval. 27&28, 673-698.
5. ASMUSSEN, S. 1987. Applied Probability and Queues. Wiley, New York.
6. ASMUSSEN, S. 1995. Stationary distributions via first passage times. Preprint. (Jan.).
7. ASMUSSEN, S., AND ROLSKI, T. 1994. Risk theory in a periodic environment: The CramerLundberg approximation and Lundberg's inequality. Math. Op. Res. 2, 2 (May), 410-433.
8. BOLOT, J., AND VEGA GARCIA, A. 1996. Control mechanisms for packet audio in the internet. In Proceedings of INFOCOM '96 (San Francisco, Calif., Mar.) IEEE Computer Society Press, Los Alamitos, Calif., pp. 232-239.
9. BOROVKOV, A. A. 1976. Stochastic Processes in Queueing Theory. Springer-Verlag, New York.
10. BOROVKOV, A. A., AND Foss, S. G. 1992. Stochastically recursive sequences and their generalizations. Sib. Adv. Math. 2, 16-81.
11. BOTVICH, D. D., AND DUFFIELD, N. G. 1995. Large deviations, the shape of the loss curve and economies of scale in large multiplexers. Que. Syst. 20, 293-320.
12. BREWER, J. W. 1978. Kronecker products and matrix calculus in system theory. IEEE Trans. Circuit Syst. 25, 9, 772-781.
13. CHANG, C.-S. 1994. Stability, queue length and delay of deterministic and stochastic queueing networks. IEEE Trans. Aut. Contr. 39, 5 (May), 913-931.
14. CHANG, C.-S., AND CHENG, J. 1995. Computable exponential bounds for intree networks with routing. In Proceedings of INFOCOM'95. IEEE Society Press, Los Alamitos, Calif., pp. 197-204.
15. CHANG, C.-S., HEIDELBERGER, P., JUNEJA, S., AND SHAHABUDDIN, P. 1994. The application of effective bandwidth to fast simulation of communication networks. Perf. Eval. 20, 45-66.
16. CHOUDHURY, G. L., LUCANTONI, D. M., AND WHITT, W. 1996. Squeezing the most out of ATM. IEEE Trans. Commun. 44, 2 (Feb.), 203-217.
17. COURCOUBETIS, C., FOUSKAS, G., AND WEBER, R. 1994. On the performance of an effective bandwidth formula. In Proceedings of ITC'14 (Antibes, June). J. Labetoulle, J. Roberts, eds. Elsevier, Amsterdam, The Netherlands, pp. 201-212.
18. COURCOUBETIS, C., AND WEBER, R. 1996. Buffer overflow asymptotics for a switch handling many traffic sources. J. Appl. Prob. 33, (Sept.), 886-903.
19. CRUZ, R. L. 1991a. A calculus for network delay. Part I: Network elements in isolation. IEEE Trans. Inf. Theory 37, 1 (Jan.), 114-131.
20. CRUZ, R. L. 1991b. A calculus for network delay. Part II: Network analysis. IEEE Trans. Inf. Theory 37, 1 (Jan.), 132-141.
21. DAN, A., SITARAM, D., AND SHAHABUDDIN, P. 1994. Scheduling policies for an on-demand video server with batching. IBM Res. Rep. RC 19381. IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y.
22. DE VECIANA, G., COURCOUBETIS, C., AND WALRAND, J. 1993. Decoupling bandwidth for networks. UCB/ERL Tech. Rep. M93/50. Univ. California at Berkeley, Berkeley, Calif.
23. DUFFIELD, N. G. 1994. Exponential bounds for queues with Markovian arrivals. Que. Syst. 17, 413-430.
24. DUFFIELD, N. G., AND O'CONNELL, N. 1995. Large deviations and overflow probabilities for the general single-server queue. Math. Proc. Phil. Soc. 118, 363-374.
25. ELLIS, R. S. 1984. Large deviations for a general class of random vectors. Ann. Prob. 12, 1, 1-12.
26. ELLIS, R. S. 1985. Entropy, Large Deviations, and Statistical Mechanics. Springer-Verlag, New York.
27. ELWALID, A. I., HEYMAN, D., LAKSJMAN, T. V., MITRA, D., AND WEISS, A. 1995. Fundamental bounds and approximations for ATM multiplexers with applications to video teleconferencing. IEEE J. Select. Areas Commun. 13, 6, 1004-1016.
28. ELWALID, A. I., AND MITRA, D. 1993. Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. IEEE/ACM Trans. Netw. 1, 3 (Jun.), 329-343.
29. FERRARI, D., AND VERMA, D. 1990. A scheme for real-time channel establishment in wide-area networks. IEEE J. Select. Areas Commun. 8, 1 (Apr.), 368-379.
30. FISCHER, W., AND MEIER-HELLSTERN, K. 1992. The Markov-modulated Poisson process (MMPP) cookbook. Perf. Eval. 18, 149-172.
31. FREDERICK, R. 1993. nv. Manual Pages. Xerox Palo Alto Research Center, Palo Alto, Calif.
32. GELENBE, E., MANG, X., ÖNVURAL, R. 1996. Diffusion based statistical call admission in ATM networks. Perf. Eval. 27&28, (Oct.), 411-436.
33. GIBBENS, R. J., AND HUNT, P. J. 1991. Effective bandwidths for the multi-type UAS channel. Que. Syst. 9, 17-28.
34. GLYNN, P. W., AND WHITT, W. 1994. Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. In Studies in Applied Probability, J. Galambos and J. Gani, eds. J. Appl. Prob., Special vol. 31A, 131-159.
35. GRAHAM, A. 1981. Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Chischester, England.
36. GUÉRIN, R., AHMADI, H., AND NAGHSHINEH, M. 1991. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE J. Select. Areas Commun. 9, 968-981.
37. HEFFES, H., AND LUCANTONI, D. M. 1986. A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE J. Select. Areas Commun. 6, 856-868.
38. HORN, R. A., AND JOHNSON, C. R. 1985. Matrix Analysis. Cambridge University Press, Cambridge, Mass.
39. ISCOE, I., NEY, P., AND NUMMELIN, E. 1985. Large deviations of uniformly recurrent Markov additive processes. Adv. Appl. Math. 6, 373-412.
40. JACOBSON, V., AND MCCANNE, S. 1994. vat. Manual pages. Lawrence Berkeley Laboratory, Berkeley, Calif.
41. JACOBSON, V., AND MCCANNE, S. 1995. Using the LBL Network Whiteboard. Lawrence Berkeley Laboratory, Berkeley, Calif.
42. KELLY, F. P. 1991. Effective bandwidths at multi-class queues. Que. Syst. 9, 5-16.
43. KESIDIS, G., WALRAND, J., AND CHANG, C.-S. 1993. Effective bandwidths for multiclass Markov fluids and other ATM sources. IEEE/ACM Trans. Netw. 1, 4 (Aug.), 424-428.
44. KINGMAN, J. F. C. 1964. A Martingale inequality in the theory of queues. Camb. Phil. Soc. 59, 359-361.
45. KINGMAN, J. F. C. 1970. Inequalities in the theory of queues. J. Roy. Stat. Soc., Ser. B 32, 102-110.
46. KUROSE, J. 1992. On computing per-session performance bounds in high-speed multi-hop computer networks. In Proceedings of the 1992 ACM SIGMETRICS and PERFORMANCE'92 International Conference on Measurement and Modeling of Computer Systems (Newport, R.I. June 1-5). ACM, New York, pp. 128-139.
47. LIU, Z., NAIN, P., AND TOWSLEY, D. 1997. On a generalization of Kingman's bounds. Preprint INRIA, BP93 06 902 Sophia Antipolis, France (available via http://www.inria.fr/mistral/personnel/ Philippe.Nain/research.html).
48. LIU, Z., NAIN, P., AND TOWSLEY, D. 1996. Bounds on finite horizon QoS metrics with application to call admission. In Proceedings of INFOCOM'96 (San Francisco, Calif., Mar.) IEEE Computer Society Press, Los Alamitos, Calif., pp. 1338-1345.
49. LIU, Z., NAIN, P., AND TOWSLEY, D. 1995. Bounds on the tail distribution of Markov-modulated stochastic Max-Plus systems. In Proceedings of the 34th IEEE Conference on Decision and Control (New Orleans, La., Dec.). IEEE Control Systems Society, Piscataway, N.J., pp. 1395-1399.
50. LOYNES, R. M. 1962. The stability of a queue with non-independent inter-arrival and service times. Proc. Cambridge Philos. Soc. 58, 497-520.
51. LUCANTONI, D. M., CHOUDHURY, G. L., AND WHITT, W. 1994. The transient BMAP/G/1 queue. Stock. Models 10, 145-182.
52. NAGARAJAN, R., KUROSE, J., AND TOWSLEY, D. 1993. Local allocation of end-to-end quality-of-service in high-speed networks. IFIP Transactions C-15: Modelling and Performance Evaluation of ATM Technology, H. Perros, G. Pujolle, and Y. Takahashi, eds., pp. 99-118.
53. NEUTS, M. F. 1981. Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore, Md.
54. PARULEKAR, M., AND MAKOWSKI, A. M. 1996. Buffer overflow probabilities for a multiplexer with self-similar traffic. In Proceedings of INFOCOM'96 (San Francisco, Calif., Mar.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 1452-1459.
55. PRESS, L. 1993. The internet and interactive television. Commun. ACM 36, 12 (Dec.), pp. 19-23, 140.
56. REGTERSCHOT, G. J. K., AND DE SMIT, J. H. A. 1986. The queue with Markov modulated arrival and services. Math. Op. Res. 11, 3, 465-483.
57. Ross, S. M. 1974. Bounds on the delay distribution in GI/G/1 queues. J. Appl. Prob. 11, 417-421.
58. SCHULZRINNE, H. 1992. Voice communication across the internet: A network voice terminal. Tech. Rep. Dept. of Computer Science, Univ. Massachusetts, Amherst Mass., July. (Available via anonymous ftp to gaia.cs.umass.edu in pub/nevot/nevot.ps.Z).
59. SIMONIAN, A., AND GUIBERT, J. 1995. Large deviations approximation for fluid queues fed by a large number of on/off sources. IEEE J. Sel. Areas Commun. 13, 6, 1017-1027.
60. STOYAN, D. 1983. Comparison Methods for Queues and Other Stochastic Models. Wiley, Berlin, Germany.
61. WHITT, W. 1993. Tail probabilities with statistical multiplexing and effective bandwidths in multiclass queues. Telecommun. Syst. 2, 71-107.
62. YARON, O., AND SIDI, M. 1993. Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans. Netw. 1, 3 (Jun.), 372-385.