Abstract
We consider a multi-service broadband system in which the services form different traffic classes. The superimposed traffic is carried by a link of fixed bit-rate. The services are of constant bit-rate (CBR) as well as of variable bit-rate (VBR). The VBR services are characterized as ON/OFF sources. We derive approximate algorithms for the computation of blocking probabilities at call and at burst level. The algorithms consist of two phases using a product-form solution. The computational complexity of the approximations is low and allows the investigation of large numbers of traffic classes. Comparison of numerical results with simulation results and results from an exact iterative algorithm indicate that the approximation is of excellent accuracy. It can be concluded from numerical results that the burst blocking probability is strongly dependent on the estimation of the required bit-rate of the VBR calls.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
COST4 224 Final Report, “Performance Evaluation and Design of Multiservice Networks ”J. W. Roberts (ed.), Paris, October 1991.
M. Decina, L. Faglia, T. Toniatti, “Bandwidth Allocation and Selective Discarding for Variable Bit Rate Video and Bursty Data Calls in ATM Networks ”, IEEE INFOCOM, 1991, pp. 1386–1393.
O. Enomoto, H. Miyamoto, “An Analysis of Mixtures of Multiple Bandwidth Traffic on Time Division Switching Networks ”, Proceedings of the 7th International Teletraffic Congress, Stockholm 1973, pp. 635. 1–635. 8.
R. Guérin, H. Ahmadi, M. Naghshineh, ” Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks”, IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, September 1991, pp. 968–981.
V. B. Iversen, ” A Simple Convolution Algorithm for the Exact Evaluation of Multi-Service Loss Systems with Heterogeneous Traffic Flows and Access Control”, COST4 214 Technical Document (084), 1987.
J. S. Kaufman, ” Blocking in a Shared Resource Environment”, IEEE Transactions on Communications, Vol. 29, No. 10, 1981, pp. 1474–1481.
J. S. Kaufman, “ Blocking with Retrials in a Completely Shared Resource Environment ”, Performance Evaluation 15, June 1992, pp. 99–113.
J. W. Roberts, “ A Service System with Heterogeneous User Requirements - Application to Multi-Service Telecommunications Systems ”, Proc. Performance of Data Communication Systems and their Applications, G. Pujolle (ed.), North Holland, 1981, pp. 423–431.
J. W. Roberts, “ Teletraffic Models for the Telecom 1 Integrated Services Network ”, Proceedings of the 10th International Teletraffic Congress, Montreal 1983, paper 1. 1. 2.
P. Tran-Gia, “Modelling Overload Control in SPC Switching Systems ”, 36th Report on Studies in Congestion Theory, University of Stuttgart, 1982.
P. Tran-Gia, F. Hiibner, “ An Analysis of Trunk Reservation and Grade of Service Balancing Mechanisms in Multiservice Broadband Networks ”, IFIP Workshop TC6, Modelling and Performance Evaluation of ATM Technology, La Martinique, January 1993.
E. Wallmeier, “ A Connection Acceptance Algorithm for ATM Networks Based on Mean and Peak Bit Rated ”, Int. Journal on Digital and Analog Communication Systems, Vol. 3, 1990, pp. 144–153.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hübner, F., Ritter, M. (1993). Call and Burst Blocking in Multi-Service Broadband Systems with CBR and VBR Input Traffic. In: Walke, B., Spaniol, O. (eds) Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78495-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-78495-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57201-5
Online ISBN: 978-3-642-78495-8
eBook Packages: Springer Book Archive