Distributed admission control

IEEE Journal on Selected Areas in Communications

Volumn 18, Issue 12, 2000, Pages 2617-2628

  Kelly, Frank P ^a   Key, Peter B ^b   Zachary, Stan ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

^c HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ASYNCHRONOUS TRANSFER MODE; INTERNET; MARKOV PROCESSES; MATHEMATICAL MODELS; PACKET NETWORKS; PACKET SWITCHING; PROBABILITY DISTRIBUTIONS; QUALITY OF SERVICE;

COMMUNICATION SYSTEM CONTROL; CONGESTION NOTIFICATION; DISTRIBUTED ADMISSION CONTROL; LOSS NETWORK; PRODUCT FORM; SHADOW PRICES;

CONGESTION CONTROL (COMMUNICATION);

EID: 0034461276     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.898741     Document Type: Article

References (42)

1. T. R. Griffiths and P. B. Key, "Adaptive call admission control in ATM networks," in The Fundamental Role of Teletraffic Engineering in the Evolution of Telecommunication Networks: Proc. 14th International Teletraffic Congress, J. Labetoulle and J. Roberts, Eds: International Teletraffic Congress, Elsevier, 1994, vol. 1b, pp. 1089-1098.
2. P. B. Key, "Connection admission control in ATM networks," BT Technology J., vol. 13, pp. 52-66, July 1995.
3. R. J. Gibbens, F. P. Kelly, and P. B. Key, "A decision-theoretic approach to call admission control in ATM networks," IEEE J. Select. Areas Commun., Special Issue on Advances in the Fundamentals of Networking, vol. 13, pp. 1101-1114, 1995.
4. R. J. Gibbens and F. P. Kelly, "Measurement-based connection admission control," in Teletraffic Contributions for the Information Age, Proc. ITC16, V. Ramaswami and P. Wirth, Eds: Elsevier, June 1997, vol. 2a, pp. 879-888.
5. J. Y. Hui, "Resource allocation for broadband networks," IEEE J. Select. Areas Commun., vol. 6, pp. 1598-1608, 1988.
6. S. Floyd. (1996, July) Comments on measurement-based admissions control for controlled-load services. [Online]. Available: http://www.aciri.org/floyd/admit.html
7. S. Jamin and S. Shenker. (1997, Apr.) Measurement-based admission control algorithms for controlled-load service: A structural examination. Univ. Michigan. [Online]Tech. Rep. CSE-TR-333-97, . Available: http://irl.eecs.umich.edu/jamin/papers/
8. M. Grossglauser and D. N. C. Tse, "A framework for robust measurement-based admission control," IEEE/ACM Trans. Networking, vol. 7, pp. 293-309, 1999.
9. K. Ramakrishnan and S. Floyd. (1999, Jan.) A proposal to add explicit congestion notification ECN to IP. RFC 2481, IETF. [Online]. Available: ftp://ftp.isi.edu/in-notes/rfc2481.txt.
10. R. J. Gibbens and F. P. Kelly, "Resource pricing and the evolution of congestion control," Automatica, vol. 35, pp. 1969-1985, 1999.
11. P. B. Key, D. R. McAuley, P. Barham, and K. Laevens. (1999) Congestion pricing for congestion avoidance. MSR, Microsoft Research Tech. Rep. MSR-TR-99-15. [Online]. Available: http://research.microsoft.com/pubs/
12. R. J. Gibbens and F. P. Kelly, "Distributed connection acceptance control for a connectionless network," in Teletraffic Engineering in a Competitive World, Proc. ITC16, P. Key and D. Smith, Eds: Elsevier, June 1999, pp. 941-952.
13. Z. R. Turányi and L. Westberg. (1999) Load control: Lightweight provisioning of internet resources. [Online]. Available: www.eric-sson.co.hu/ethzrt/
14. V. Elek, G. Karlsson, and R. Rönngren. Admission control based on end-to-end measurements. INFOCOM 2000. [Online]. Available: www.comnet.technion.ac.il/infocom2000
15. G. Bianchi, A. Capone, and C. Petrioli. Throughput analysis of end-to-end measurement based admission control in IP. INFOCOM 2000. [Online]. Available: www.comnet.technion.ac.il/infocom2000
16. E. Brockmeyer, H. L. Halstrom, and A. Jensen, The Life and Works of A. K. Erlang. Copenhagen: Academy of Technical Sciences, 1948.
17. R. I. Wilkinson, "Theory for toll traffic engineering in the USA," Bell Syst. Tech. J., vol. 35, pp. 421-513, 1956.
18. A. G. Greenberg and R. Srikant, "Computational techniques for accurate performance evaluation in multirate, multihop communication networks," IEEE/ACM Trans. Networking, vol. 5, pp. 253-277, 1997.
19. P. B. Key, "Implied cost methodology and software tools for a fully connected network with DAR and trunk reservation," British Telecom Technol J., vol. 6, pp. 52-65, 1988.
20. A. Farago, S. Blaabjerg, L. Ast, G. Gordos, and T. Henk, "A new degree of freedom in ATM network dimensioning: Optimizing the logical configuration," IEEE J. Select. Areas Commun., vol. 13, pp. 1199-1206, 1995.
21. D. Mitra, J. A. Morrison, and K. G. Ramakrishnan, "ATM network design and optimization: A multirate loss network framework," IEEE/ACM Trans. Networking, vol. 4, pp. 531-543, 1996.
22. _, "Virtual private networks: Joint resource allocation and routing design," in Proc. INFOCOM, IEEE, 1999.
23. F. P. Kelly, "Loss networks," Ann. Appl. Prob., vol. 1, pp. 319-378, 1991.
24. K. W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks. Berlin: Springer, 1995.
25. P. J. Hunt and T. G. Kurtz, "Large loss networks," Stochastic Processes Appl., vol. 53, pp. 363-378, 1994.
26. S. Zachary, "Dynamics of large uncontrolled loss networks," J. Appl. Prob., vol. 37, pp. 685-695, 2000.
27. D. D. Botvich and N. Duffield, "Large deviations, the shape of the loss curve, and economies of scale in large multiplexers," Queueing Syst., vol. 20, pp. 293-320, 1995.
28. C. Courcoubetis and R. Weber, "Buffer overflow asymptotics for a switch handling many traffic sources," J. Appl. Prob., vol. 33, pp. 886-903, 1996.
29. C. Courcoubetis, V. A. Siris, and G. D. Stamoulis, "Application of the many sources asymptotic and effective bandwidths to traffic engineering," Telecommun. Syst., vol. 12, pp. 167-191, 1999.
30. F. P. Kelly, Reversibility and Stochastic Networks. Chichester: Wiley, 1979.
31. Z. Dziong and J. W. Roberts, "Congestion probabilities in a circuit-switched integrated services network," Performance Evaluation, vol. 7, pp. 267-284, 1987.
32. F. P. Kelly, "Blocking probabilities in large circuit-switched networks," Advances Appl. Prob., vol. 18, pp. 473-505, 1986.
33. S. Zachary, "On blocking in loss networks," Advances Appl. Prob., vol. 23, pp. 355-372, 1991.
34. F. P. Kelly, "Routing and capacity allocation in networks with trunk reservation," Math. Operations Res., vol. 15, pp. 771-793, 1990.
35. P. B. Key and D. R. McAuley, "Differential QoS and pricing in networks: Where flow control meets game theory," IEE Proc. Software, vol. 146, pp. 39-43, 1999.
36. F. P. Kelly, "Models for a self-managed Internet," Phil. Trans. R. Soc. Lond. A, vol. 358, pp. 2335-2348, 2000.
37. J. W. Roberts, Ed., "COST224 Performance evaluation and design of multiservice networks," Commission European Communities, Final Rep., Oct. 1992.
38. S. Bajaj, L. Breslau, and S. Shenker. (1998) Is service priority useful in networks?. [Online]. Available: http://www.cs.wpi.edu/∼sigmet98/bajaj.ps
39. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Networking, vol. 1, no. 4, pp. 397-413, 1993.
40. D. Wischik, "Sample path large deviations for queues with many inputs," Ann. Appl. Prob., vol. 10, 2000.
41. B. K. Ryu and A. Elwalid, "The importance of the long-range dependence of VBR video traffic in ATM traffic engineering: Myths and realities," in Proc. ACM SIGCOMM, Stanford, 1996.
42. P. B. Key and L. Massoulié, "User policies in a network implementing congestion pricing," in Proc. Workshop Internet Service Quality Economics: MIT, Dec. 1999.