Skip to main content
Log in

Optimal Policies for ATM Cell Scheduling and Rejection

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper addresses the following questions related to buffer management schemes for high speed integrated services networks: (i) given the pattern of cell arrivals from different classes of traffic, can buffer control significantly influence the effect of cell loss, and (ii) what are the “best” policies for selecting cells for transmission from buffers in the network nodes as well as for rejecting cells when the buffers are full. The basic approach to answering these questions is to impute a cost of losing cells which could depend on the class of application, and to minimize this cost over the finite or infinite time horizons. The policies we derive using this cost minimization approach are best in the sense that they minimize linear cost functions of cell losses, at each instant of time during the system's operation. We also show how to construct policies that minimize general cost functions of cell loss rates.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. M. Arpaci and J.A. Copeland, Buffer management for shared-memory ATM switches, http://www.comsoc.org/pubs/surveys/1q00issue/copeland.html (2000).

  2. S. Asmussen and R.Y. Rubinstein, Steady state rare events simulation in queueing models and its complexity properties, in: Advances in Queueing: Theory, Methods, and Open Problems, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1995).

    Google Scholar 

  3. G.A. Awater and F.C. Schoute, Optimal queueing strategies for fast packet switching of mixed traffic, IEEE Journal on Selected Areas in Communication 9(3) (April 1991) 458-467.

    Google Scholar 

  4. A.W. Berger and W. Whitt, Effective bandwidths with priorities, IEEE/ACM Transactions on Networking 6(4) (August 1998).

  5. A.W. Berger and W. Whitt, Extending the effective bandwidth concept to network with priority classes, IEEE Communications Magazine (August 1998).

  6. J.A. Buzacott and J.G. Shanthikumar, Stochastic Models of Manufacturing Systems (Prentice-Hall, Englewood Cliffs, NJ, 1993).

    Google Scholar 

  7. C. Catalano, Asynchronous transfer mode, Computerworld (3 January 2000).

  8. S. Catanzariti, New ATM service targets IP networks, Network World (1 June 1998).

  9. C. Chan, S. Hu, P. Wang and Y. Chen, A FIFO-based buffer management approach for the ATM GFR services, IEEE Communications Letters 4(6) (2000).

  10. H.J. Chao, A novel architecture for queue management in ATM networks, in: Proc. of GLOBECOM, Phoenix, AZ, 1991, pp. 1611-1615.

  11. K.L. Chung, A Course in Probability Theory (Academic Press, New York, 1974).

    Google Scholar 

  12. I. Cidon, R. Guerin and A. Khamisy, On protective buffer policies, IEEE/ACM Transactions on Networking 2(3) (June 1994) 240-246.

    Google Scholar 

  13. L.P. Clare and I. Rubin, Performance boundaries for prioritized multiplexing systems, IEEE Transactions on Information Theory 33(3) (May 1987) 329-340.

    Google Scholar 

  14. COMNET III-Simulating application and network performance, http://www.compuware.com/products/ecosystems/comnet/.

  15. G. de Veciana, C. Courcoubetis and J. Walrand, Decoupling bandwidths for networks: A decomposition approach to resource management, in: INFOCOM'94, pp. 466-473.

  16. G. de Veciana, G. Kesidis and J. Walrand, Resource management in wide-area ATM networks using effective bandwidths, IEEE Journal on Selected Areas in Communications 13(6) (1995) 1081-1090.

    Google Scholar 

  17. N.G. Duffield and W. Whitt, Network design and control using on-off and multi-level source traffic models with heavy-tailed distributions, in: Self-Similar Network Traffic and Performance Evaluation, eds. K. Park and W. Willinger (2000).

  18. A.I. Elwalid, D. Heyman, T.V. Lakshman, D. Mitra and A. Weiss, Fundamental bounds and approximations for ATM multiplexers with applications to video teleconferencing, IEEE Journal on Selected Areas in Communications 13(6) (1995) 1004-1016.

    Google Scholar 

  19. A.I. Elwalid and D. Mitra, Analysis, approximations and admission control of a multi-service multiplexing system with priorities, in: INFOCOM'95, 1995, pp. 463-472.

  20. S. Fahmy, A survey of ATM switching techniques, http://www.cs.purdue.edu/homes/fahmy/ (2000).

  21. R. Fan, A. Ishii, B. Mark, G. Ramamurthy and Q. Ren, An optimal buffer management scheme with dynamic thresholds, in: GLOBECOM, Vol. 1b, 1999, pp. 631-637.

    Google Scholar 

  22. A. Federgruen and H. Groenvelt, Characterization and optimization of achievable performance in queueing systems, Operations Research 36(3) (1988) 733-741.

    Google Scholar 

  23. N. Gautam and V. G. Kulkarni, Applications of SMP bounds to multi-class traffic in high-speed networks, to appear in Queueing Systems (December 2000).

  24. N. Gautam, V.G. Kulkarni, Z. Palmowski and T. Rolski, Bounds for fluid models driven by semi-Markov inputs, Probability in the Engineering and Informational Sciences 13 (1999) 429-475.

    Google Scholar 

  25. N. Gautam and S. Seshadri, Approximations for system performance under self-similar traffic, in: Proc. of the 3rd Internat. Conf. on Telecommunications and E-commerce (November 2000) pp. 239-250.

  26. E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems (Academic Press, London, 1980).

    Google Scholar 

  27. L. Georgiadis, R. Guérin and A. Parekh, Optimal multiplexing on single link: Delay and buffer requirements, in: Proc. of IEEE INFOCOM, Toronto, Canada, June 1994.

  28. G. Hebuterne and A. Gravey, A space priority queueing mechanism for multiplexing channels, Computer Networks and ISDN Systems 20(1–5) (December 1990) 37-43.

    Google Scholar 

  29. Y.-H. Jeon, Conservation laws and multiplexing schemes for delay and loss requirements in broadband networks, Ph.D. thesis, Department of Electronic and Computer Engineering, North Carolina State University, Raleigh, NC (1992).

    Google Scholar 

  30. G. Kesidis, ATM Network Performance, 2nd ed. (Kluwer Academic, Dordrecht, 2000).

    Google Scholar 

  31. K.Y. Kou, Realization of large-capacity ATMswitches, IEEE Communications Magazine 37(12) (December 1999).

  32. B. Kraimeche, A buffer management and channel allocation strategy for QoS support in an ATM switch, in: 9th Internat. Conf. on Computer Communications and Networks (2000) pp. 463-466.

  33. V. Kriman and R.Y. Rubinstein, Polynomial time algorithms for estimation of rare events in queueing models, in: Frontiers in Queueing: Models and Applications in Science and Engineering, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1997).

    Google Scholar 

  34. H. Kroner, G. Hebuterne, P. Boyer and A. Gravey, Priority management in ATM switching nodes, IEEE Journal on Selected Areas in Communications 9(3) (April 1991) 418-427.

    Google Scholar 

  35. V.G. Kulkarni, and N. Gautam, Admission control of multi-class traffic with service priorities in high-speed networks, Queueing Systems 27 (1997) 79-97.

    Google Scholar 

  36. A.Y.-M. Lin and J.A. Silvester, Priority queueing strategies and buffer allocation protocols for traffic control at an ATM integrated broadband switching system, IEEE Journal on Selected Areas in Communications 9(9) (December 1991) 1524-1536.

    Google Scholar 

  37. A. Mokhtar and M. Azizoglu, A random early discard framework for congestion control in atm networks, in: Proc. of IEEE ATM Workshop (1999) pp. 45-50.

  38. Marconi, http://www.marconi.com (2000).

  39. S. Parekh and J. Walrand, A quick simulation method for excessive backlogs in networks of queues, IEEE Transactions on Automatic Control 34(1) (1989) 54-66.

    Google Scholar 

  40. J.M. Peha and F.A. Tobagi, A cost-based scheduling algorithm to support integrated services, in: Proc. of IEEE INFOCOM, Bal Harbour, FL, April 1991, pp. 741-753.

    Google Scholar 

  41. J.M. Peha and F.A. Tobagi, Implementation strategies for scheduling algorithms in integrated-services packet-switched networks, in: Proc. of GLOBECOM, Phoenix, AZ, December 1991, pp. 1733-1740.

  42. D.W. Petr and V.S. Frost, Optimal packet discarding: An ATM-oriented analysis model and initial results. in: Proc. of IEEE INFOCOM, San Francisco, CA, June 1990, pp. 537-542.

  43. D.W. Petr and V.S. Frost, Nested threshold cell discarding for ATM overload control: Optimization under cell loss constraints, in: Proc. of IEEE INFOCOM, Bal Harbour, FL, April 1991, pp. 1403-1412 (12A.4).

  44. K.W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks (Springer, London, 1995).

    Google Scholar 

  45. J.G. Shanthikumar and D.D. Yao, Multiclass queueing systems: Polymatroidal structure and optimal scheduling control, Operations Research 40 (May/June 1992).

  46. S. Sharma and Y. Viniotis, Optimal buffer management policies for shared-buffer ATM switches, IEEE/ACM Transactions on Networking 7(4) (August 1999).

  47. Y. Takagi, S. Hino and T. Takahashi, Priority assignment control of ATM line buffers with multiple QOS classes, IEEE Journal on Selected Areas in Communications 9(7) (September 1991) 1078-1092.

    Google Scholar 

  48. L. Tassiulas, Y. Hung and S.S. Panwar, Optimal buffer control during congestion in an ATM network node, IEEE/ACM Transactions on Networking 2(4) (August 1994).

  49. D. Walker, F.P. Kelly and J. Solomon, Tariffing in the new IP/ATMenvironment, Telecommunications Policy 21 (1997) 283-295.

    Google Scholar 

  50. L. Wein, Optimal control of a two-station Brownian network, Mathematics of Operations Research 15(2) (1990) 215-242.

    Google Scholar 

  51. W. Whitt, Tail probabilities with statistical multiplexing and effective bandwidths for multiclass queues, Telecommunications Systems 2 (1993) 71-107.

    Google Scholar 

  52. W. Whitt, Performance models consistent with traffic measurements, http://www.research.att.com/wow/performance.html (2000).

  53. W. Willinger and V. Paxson, Where mathematics meets the Internet, Notices of the American Mathematical Society 45(8) (September 1998) 961-970.

    Google Scholar 

  54. R. Wolff, Stochastic Modeling and the Theory of Queues (Prentice-Hall, Englewood Cliffs, NJ, 1989).

    Google Scholar 

  55. P. Yang, Least controls for a class of constrained linear stochastic systems, Mathematics of Operations Research 18(2) (May 1993) 275-291.

    Google Scholar 

  56. X. Yijun and J. Kanginakudru, CLR in multicast ATM switches with shared memory and buffer management, in: GLOBECOM, Vol.2, 1999, pp. 1391-1395.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gelenbe, E., Srinivasan, V., Seshadri, S. et al. Optimal Policies for ATM Cell Scheduling and Rejection. Telecommunication Systems 18, 331–358 (2001). https://doi.org/10.1023/A:1016782028027

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016782028027

Navigation