Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-13T16:01:22.071Z Has data issue: false hasContentIssue false
  • English
  • Français

Dynamic bandwidth allocation for ATM switches

Part of:Limit theoremsMarkov processesStochastic systems and controlOperations research and management science

Published online by Cambridge University Press:  14 July 2016

Ivy Hsu and
Jean Walrand
Ivy Hsu*
Affiliation:
University of California, Berkeley
Jean Walrand*
Affiliation:
University of California, Berkeley
*
∗ Postal address for both authors: Department of EECS, University of California, Berkeley, CA 94720, USA.
∗ Postal address for both authors: Department of EECS, University of California, Berkeley, CA 94720, USA.
Get accessRights & Permissions [Opens in a new window]

Abstract

We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence on accurate traffic models and thus simplify the tasks of supplying traffic statistics required of network users. In this paper we present two dynamic algorithms. The objective of these algorithms is to find the minimum bandwidth necessary to satisfy a cell loss probability constraint at an asynchronous transfer mode (ATM) switch. We show that in both schemes the bandwidth chosen by the algorithm approaches the optimal value almost surely. Furthermore, in the second scheme, which determines the point closest to the optimal bandwidth from a finite number of choices, the expected learning time is finite.

Keywords

ADAPTIVE ALGORITHMMARKOV MODULATED FLUID MODELCOUPLINGLAST EXIT TIMELARGE DEVIATIONS

MSC classification

Primary:93E35: Stochastic learning and adaptive control
Secondary:60J27: Continuous-time Markov processes on discrete state spaces90B22: Queues and service60F05: Central limit and other weak theorems

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 33 , Issue 3 , September 1996, pp. 758 - 771
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

This research is supported in part by a grant of the Networking and Communications Research Program of the National Science Foundation.

References

[1] Benveniste, A., Metivier, M. and Priouret, P. (1987) Adaptive Algorithms and Stochastic Approximations. Springer, Berlin.Google Scholar
[2] Bonatti, M. and Gaivoronski, A. A. (1994) Worst case analysis of ATM sources with application to access engineering of broadband multiservice networks. Preprint. Google Scholar
[3] Bucklew, J. (1990) Large Deviations Techniques in Decision, Simulation, and Estimation. Wiley, New York.Google Scholar
[4] Dembo, A. and Zeitouni, O. (1993) Large Deviations Techniques and Applications. Jones and Bartlett, New York.Google Scholar
[5] Doshi, B. T. (1993) Deterministic rule based traffic descriptors for broadband ISDN: worst case behavior and connection acceptance control. IEEE Globecom '93. pp. 1759–1764.Google Scholar
[6] Hsu, I. and Walrand, J. (1994) Admission control for multi-class ATM traffic. Comput. Net. ISDN Syst. J. Submitted.Google Scholar
[7] Metivier, M. and Priouret, P. (1984) Applications of a Kushner and Clark lemma to general classes of stochastic algorithms. IEEE Trans. Inf. Theory. IT-30, 140–151.Google Scholar
[8] Meyn, S. P. and Tweedie, R. L. (1993) Markov Chains and Stochastic Stability. Springer, Berlin.Google Scholar
[9] Takagi, Y. Takahashi, T. (1991) Priority assignment control of ATM line buffers with multiple QoS classes. IEEE J. Selected Areas in Commun. 9, 1078–1092.Google Scholar
[10] Varvarigos, E. A. (1994) Universal upper bounds on the packet loss probability of statistical multiplexing in high-speed networks. 32nd Allerton Conf. Communication, Control, and Computing. Google Scholar
[11] Vidyasagar, M. (1978) Nonlinear Systems Analysis. Prentice Hall, Englewood Cliffs, NJ.Google Scholar
[12] Yazid, S. and Mouftah, H. T. (1992) Congestion control methods for BISDN. IEEE Commun. Mag 30, (7), 42–47.Google Scholar