Abstract
High speed integrated services networks will multiplex distinct traffic streams that have different sensitivities to packet or cell loss. We consider traffic streams or “classes” that have a cost function representation related to cell loss. These traffic classes share a common finite capacity buffer. Using this model we characterize optimal scheduling and rejection rules for minimizing the cost of lost cells, both over the finite and infinite time horizon. Optimization is considered both at the single switch level and for a sequence of switches with cross traffic. For the single node case we describe optimal policies for cell scheduling and rejection when loss related cost functions are used. These cost functions can either be linear or convex. In the case of a two-node system, we describe numerical experiments using a dynamic programming formulation. Although this leads to large computational cost, it does provide insight into simple rules which could be used to approximate optimal policies.
Chapter PDF
Similar content being viewed by others
Keyword Codes
Keywords
References
E. Gelenbe, S. Seshadri and V. Srinivasan, “Pathwise Optimum Policies for ATM Cell Scheduling and Rejection,” Department of Computer Science, Technical Report, Duke University, CS-1994–24, 1994.
G. Hebuterne and A. Gravey, “A Space Priority Queueing Mechanism for Multiplexing Channels,” Computer Networks and ISDN Systems, 20, 1990, 37–43.
I. Cidon, R. Guérin and A. Khamisy, “On Protective Buffer Policies,” Proc. INFOCOM ‘83, 1051–1058, 1993.
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, Vol. 9, No. 9, Dec. 1991, 1524–1536.
D.W. Petr, and V.S. Frost, “Optimal Packet Discarding: An ATM-Oriented Analysis Model and Initial Results,” Proc. INFOCOM ‘80, 537–542, 1990.
L. Tassiulas, Y. Hung and S.S. Panwar, “Optimal buffer control during congestion in an ATM network node,” Proc. INFOCOM ‘83, 1059–1065, 1993.
Y-H. Jeon, “Conservation Laws and Multiplexing Schemes for Delay and Loss Requirements in Broadband Networks,” Ph.D thesis, Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, 1992.
L.P. Clare and I. Rubin, “Performance Boundaries for Prioritized Multiplexing Systems,” IEEE Transactions on Information Theory, Vol. IT-33, No. 3, May 1987, 329340.
L. Georgiadis, R. Guérin and A. Parekh, “Optimal Multiplexing on Single Link: Delay and Buffer Requirements,” to appear in Proc. INFOCOM ‘84,1994.
J.G. Shanthikumar and D.D. Yao, “Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control,” Operations Research, Vol. 40, Supp. No. 2, May-June 1992.
J.M. Harrison, “Brownian Models of Queueing Networks with Heterogeneous Customer Populations,” Stochastic Differential Systems, Stochastic Control Theory and Applications, ed. by W. Fleming and P. Lions, IMA Vol. 10, Springer-Verlag, Berlin 1988, 147–186.
C.N. Laws and G.M. Louth, “Dynamic Scheduling of a Four Station Queueing Network,” Probability in Engineering and Information Sciences, 4, 1990, 131–156.
L.M. Wein, “Optimal Control of a Two-Station Brownian Network,” Math. Oper. Res., 15, 2, 1990, 215–242.
P. Yang, “Pathwise Solutions for a Class of Linear Stochastic Systems,” Doctoral Dissertation, Stanford University, 1988.
E. Gelenbe and I. Mitrani, “Analysis and Synthesis of Computer Systems,” Academic Press, London, 1980.
K.L. Chung, “A Course in Probability Theory,” Academic Press, New York, 1974.
J.A. Buzacott, and J.G. Shanthikumar, “Stochastic Models of Manufacturing Systems,” Prentice Hall, Englewood Cliffs, N.J, 1993.
A. Federgruen and H. Groenvelt, “Characterization and Optimization of Achievable Performance in Queueing Systems,” Operations Research, 36, 733–741.
S. Ross, “Introduction to Stochastic Dynamic Programming,” Academic Press, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Gelenbe, E., Seshadri, S., Srinivasan, V. (1995). Single Node and End-to-End Buffer Control in Real Time. In: Kouvatsos, D.D. (eds) Performance Modelling and Evaluation of ATM Networks. ATM 1994. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34881-0_24
Download citation
DOI: https://doi.org/10.1007/978-0-387-34881-0_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6164-1
Online ISBN: 978-0-387-34881-0
eBook Packages: Springer Book Archive