Hostname: page-component-89b8bd64d-7zcd7 Total loading time: 0 Render date: 2026-05-08T02:19:54.309Z Has data issue: false hasContentIssue false
  • English
  • Français

Conservation Relations for Fully Shared ATM Buffers

Published online by Cambridge University Press:  27 July 2009

G. Kesidis  and
J. Walrand
G. Kesidis
Affiliation:
Electrical and Computer Engineering Department, University of Waterloo, Waterloo, Ontario, CanadaN2L 3G1
J. Walrand
Affiliation:
EECS Department, University of CaliforniaBerkeley, California 94720
Get access Rights & Permissions [Opens in a new window]

Abstract

In asynchronous transfer mode (ATM), networks, buffering is required to reduce cell loss and increase bandwidth utilization by the bursty traffic. Several types of traffic with different performance requirements on delay and loss will share buffer resources. We focus on the fully shared buffer with push-out and a randomized service priority rule. Some conservation relations are obtained which can be used to tune the parameters of the buffering and service disciplines.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 8 , Issue 1 , January 1994 , pp. 147 - 151
Copyright
Copyright © Cambridge University Press 1994

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

References

1.Clare, L.P. & Rubin, I. (1987). Performance boundaries for prioritized multiplexing systems. IEEE Transactions on Information Theory IT-33(3): 329–340.CrossRefGoogle Scholar
2.Gravey, A. & Hebuterne, G. (1991). Mixing times and loss probabilities in a single server queue. Teletraffic and Datatraffic in a Period of Change ITC-13: 147–152.Google Scholar
3.Habib, I.W. & Saadawi, T.N. (1991). Controlling flow and avoiding congestion in broadband networks. Communications Magazine 29(10): 46–53.CrossRefGoogle Scholar
4.Hebuterne, G. & Gravey, A. (1990). A space priority mechanism for multiplexing ATM channels. Computer Networks and ISDN Systems 20 (1–5): 37–43.CrossRefGoogle Scholar
5.Kesidis, G. (1992). Cell loss estimation in high-speed digital networks. Ph.D. dissertation, EECS Department, University of California, Berkeley.Google Scholar
6.Kroner, H., Hebuterne, G., Boyer, P., & Gravey, A. (1991). Priority management in ATM switching nodes. IEEE Journal on Selected Areas of Communication 9(3): 418–427.CrossRefGoogle Scholar
7.Lazar, A.A., Pacifici, G., & White, J.S. (1990). Real-time traffic measurement on MAGNET II. IEEE Journal on Selected Areas of Communication 8(3): 467–493.CrossRefGoogle Scholar
8.Petr, D.W. & Frost, V.S. (1991). Nested threshold cell discarding for ATM overload control: Optimization under cell loss constraints. Proceedings of IEEE INFOCOM 3: 12A.4.1–12A.4.10.Google Scholar
9.Pitts, J.M. & Schormans, J.A. (1990). Analysis of ATM switch model with time priorities. Electronic Letters 26(15): 1192–1193.CrossRefGoogle Scholar
10.Sriram, K. (1990). Dynamic bandwidth allocation and congestion control schemes for voice and data integration in wideband packet technology. Proceedings of IEEE ICC'90, Atlanta, GA 3: 1003–1009.Google Scholar
11.Sriram, K., McKinney, R.S., & Sherif, M.H. (1991). Voice packetization and compression in broadband ATM networks. IEEE Journal on Selected Areas of Communication 9(3): 294–304.CrossRefGoogle Scholar