Abstract
We propose a novel on-line algorithm for shared Bandwidth and Buffer Allocation (BABA) in ATM networks. The objective of the BABA algorithm is to guarantee users’ Quality of Service (QoS), while saving as much bandwidth and buffer space as possible to meet the needs of other potential network users. This algorithm proceeds incrementally on each link of a path, when a new user arrives to the network — or when a user terminates a connection. The algorithm uses gradient descent of a cost function which describes the “closest” available allocation for a given loss probability bound. BABA only requires simple algebraic operations, making it practical for fast on-line control. Numerical and simulation results show that BABA compares very favorably with currently proposed resource allocation policies.
Chapter PDF
Similar content being viewed by others
References
M. Aicardi, R. Bolla, F. Davoli, and R. Minciardi (1990). Optimization of capacity allocation among users and services in integrated network. In Proc. ICC’90, pages 0302–0808.
A. Baiocchi, N. Blefari-Melazzi, F. Cuomo, and M. Listanti (1994). Achieving statistical gain in ATM networks with the same complexity as peak allocation strategy. In Proc. INFOCOM’9N, pages 374–382.
A. Baiocchi, A. Roveri N. Bléfari-Melazzi, and F. Salvatore (1993). Stochastic fluid analysis of an ATM multiplexer loaded with heterogeneous ON-OFF sources: an effective computational approach. In Proc. INFOCOM’92, pages 0405–0414.
R. Bolla and F. Davoli (1993). Dynamic hierarchical control of resource allocation in an integrated services broadband network. Computer Networks and ISDN Systems, 25: 1079–1087.
J. H. S. Chan and D. H. K. Tsang (1994). Bandwidth allocation of multiple QOS classes in ATM environment. In Proc. INFOCOM’94, pages 360–367.
T. Cheng (1994). Bandwidth allocation in B-ISDN. Computer Networks and ISDN Systems, 26: 1129–1142.
S. Chowdhury and K. Sohraby (1994). Bandwidth allocation algorithms for packet video in ATM networks. Computer Networks and ISDN Systems, 26: 1215–1223.
Z. Dziong, K. Liao, and L. Mason (1993). Effective bandwidth allocation and buffer dimensioning in ATM based networks with priorities. Computer Networks and ISDN Systems, 25: 1065–1078.
A. I. Elwalid and D. Mitra (1991). Analysis and design of rate-based control of high speed networks, I: Stochastic fluid models. Queueing Systems, 9: 29–64.
A. I. Elwalid and D. Mitra (June 1993). Effective bandwidth of general markovian traffic sources and admission control of high speed networks. IEEE/ACM Transactions on Networking, 1: 329–343.
V. J. Friesen and J. W. Wong (1993). The effect of multiplexing, switching and other factors on the performance of broadband networks. In Proc. INFOCOM’93, pages 1194–1203.
E. Gelenbe (1975). On approximate computer system models. J. ACM, 22: 261–263.
E. Gelenbe and I. Mitrani (1980). Analysis and Synthesis of Computer Systems. Academic Press, New York.
E. Gelenbe and G. Pujolle (1976). An approximation to the behaviour of a single queue in a network. Acta Informatica, 7: 123–136.
R. Guerin and L. Gun (1992). A unified approach to bandwidth allocation and access control in fast packet-switched networks. In Proc. INFOCOM’92, pages 0001 - -0012.
F. P. Kelly (1991). Effective bandwidths at multi-class queues. Queueing Systems, 9: 5–16, 1991.
H. Kobayashi and Q. Ren (December 1992). A mathematical theory for transient analysis of communication networks. IEICE Transaction on Communications, E75-B: 1266–1276.
H. Kobayashi and Q. Ren (1993). A diffusion approximation analysis of an ATM statistical multiplexer with multiple state solutions: Part I: Equilibrium state solutions. In Proc. ICC’93, pages 1047–1053.
J. Medhi (1991). Stochastic Models in Queueing Theory. Academic Press, New York.
G. Meempat, G. Ramamurthy, and B. Sengupta (1991). A new performance measure for statistical multiplexing: Perspective of the individual source. In Proc. INFOCOM’93, pages 531–538.
J. W. Roberts and A. Gravey (1991). Recent results on B-ISDN/ATM traffic modeling and performance analysis–a review of ITC 13 papers. In Proc. GLOBECOM’91, pages 1325–1330.
J. Sole-Pareta and J. Domingo-Pascual (1994). Burstiness characterization of ATM Cell streams. Computer Network and ISDN Systems, 26: 1351–1363.
K. Sriram (1993). Methodologies for bandwidth allocation, transmission scheduling, and congestion avoidance in broadband ATM networks. Computer Networks and ISDN Systems, 26: 43–59.
T. E. Tedijanto and L. Gun (1993). Effectiveness of dynamic bandwidth management mechanisms in ATM networks. In Proc. INFOCOM’93, pages 358–367.
M. Wong and P. Varaiya (1994). A deterministic fluid model for cell loss in ATM networks. In Proc. INFOCOM’93, pages 395–440, 1993.
N. Xiao, F. F. Wu, and S. Lun. Dynamic bandwidth allocation using infinitesimal perturbation analysis. In Proc. INFOCOM’9j,pages 383–389.
F. Yegenoglu and B. Jabbari (1994). Characterization and modeling of aggregate traffic for finite buffer statistical multiplexers. Computer Networks and ISDN Systems, 26: 1169 1185.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Gelenbe, E., Mang, X. (1996). On-line Bandwidth and Buffer Allocation for ATM. In: Fdida, S., Onvural, R.O. (eds) Data Communications and their Performance. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34942-8_20
Download citation
DOI: https://doi.org/10.1007/978-0-387-34942-8_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4908-3
Online ISBN: 978-0-387-34942-8
eBook Packages: Springer Book Archive