Approximation for overflow moments of a multiservice link with trunk reservation

Abstract In this paper we propose an approximation for individual overflow moments of a multiservice link with differing arrival rates, capacity requirements and mean holding times, where trunk reservation is used. The approximation is a generalization of Roberts’ well-known approximation for individual blocking probabilities of a multiservice link to higher moments. It can be computed very efficiently. The quality of the approximation for the second moment (variance) is comparable to Roberts’ approximation for the individual blocking probabilities. Thus the results provide an efficient algorithm for computing the two moment characterization of the individual overflow streams and hence can be used for the design and analysis of circuit switched alternate routing networks with trunk reservation links.

[1]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[2]  Jorma Virtamo,et al.  Broadband Network Traffic , 1996, Lecture Notes in Computer Science.

[3]  Valeri Naoumov.  Normal-type approximation for multi-service systems with trunk reservation , 1995 .

[4]  J. Stoer,et al.  Introduction to Numerical Analysis , 2002 .

[5]  R. Gibbens,et al.  Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks , 1995, Advances in Applied Probability.

[6]  M. Reiman.  Asymptotically optimal trunk reservation for large trunk groups , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[7]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[8]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[9]  L. Delbrouck.  On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements , 1983, IEEE Trans. Commun..

[10]  P. Deschamps,et al.  Analytic Approximation of Blocking Probabilities in Circuit Switched Communication Networks , 1979, IEEE Trans. Commun..

[11]  Phuoc Tran-Gia,et al.  An Analysis of Trunk Reservation and Grade of Service Balancing Mechanisms in Multiservice Broadband Networks , 1993, Modelling and Evaluation of ATM Networks.

[12]  Peter Key,et al.  Optimal Control and Trunk Reservation in Loss Networks , 1990 .

[13]  Ramesh Bhandari.  A Model for Stream Overflows in Circuit-Switched Communication Networks , 1997 .

[14]  Åke Arvidsson.  On the Performance of a Circuit Switched Link with Priorities , 1991, IEEE J. Sel. Areas Commun..

[15]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[16]  F. Kelly.  Fixed point models of loss networks , 1989, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[17]  Andre Girard.  Blocking Probability of Noninteger Groups with Trunk Reservation , 1985, IEEE Trans. Commun..

[18]  M. Azmodeh,et al.  Multi-rate call congestion: fixed point models and trunk reservation , 1994 .

[19]  Jacques Bernussou,et al.  Blocking Probabilities for Trunk Reservation Policy , 1987, IEEE Trans. Commun..

[20]  James Roberts,et al.  Broadband Network Teletraffic - Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action COST 242 , 1996, Lecture Notes in Computer Science.

[21]  J. A. Schmitt,et al.  Performance models of multirate traffic in various network implementations , 1994 .

[22]  J. F. E. Wallin,et al.  The Calculation of Overflow Moments in Loss Systems with Selective Trunk Reservation , 1992, Perform. Evaluation.