Abstract:
While link allocation policies in multi-rate circuit switched loss models have drawn much attention in recent years, it is still an open question how to share the link capacity between service classes in a fair manner. In particular, when an ATM link is oered calls from service classes with/without strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this paper we propose a model and associated computational technique for an ATM transmission link to which CBR/VBR and ABR classes oer calls. We also propose a simple link allocation rule which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and attempts to minimize the blocking probability of ABR calls. Numerical examples demonstrate the eectiveness of the policy and of the applied computational technique.
Citations
|
378
|
Introduction to the Numerical Solution of Markov Chains
– Stewart
- 1995
|
|
194
|
Multiservice Loss Models for Broadband Telecommunication Networks
– Ross
- 1995
|
|
127
|
Blocking in a shared resource environment
– Kaufman
- 1981
|
|
49
|
ATM Network Design and Optimization: a Multirate Loss Network Framework
– Mitra, Morrison, et al.
- 1996
|
|
25
|
Optimal circuit access policies in an ISDN environment: A Markov decision approach
– Ross, Tsang
- 1989
|
|
23
|
Understanding and Improving TCP Performance over Networks with Minimum Rate Guarantees
– Feng, Kandlur, et al.
- 1999
|
|
22
|
Fendick, "The rate-based flow control framework for the available bit rate ATM service
– Bonomi, W
- 1995
|
|
22
|
The available bit rate service for data in ATM networks
– Chen, Liu, et al.
- 1996
|
|
20
|
Realizing quality of service guarantees in multiservice networks
– Roberts
- 1998
|
|
19
|
Efficiently providing multiple grades of service with protection against overloads in shared resources
– Choudhury, Leung, et al.
- 1995
|
|
15
|
Virtual partitioning for robust resource sharing: Computational techniques for heterogeneous traffic
– Borst, Mitra
- 1998
|
|
15
|
Call Admission and Routing in MultiService Loss Networks
– Dziong, Mason
- 1994
|
|
13
|
Quality of service guarantees and charging in multiservice networks
– Roberts
- 1998
|
|
12
|
Computation of the distribution of the completion time when the work requirement is a PH random variable. Stochastic Models
– Bobbio, Trivedi
- 1990
|
|
8
|
Functionality at the edge: Designing scalable multiservice ATM networks
– Rosenberg, Aissaoui, et al.
- 1998
|
|
6
|
A Multi-server Queue with Narrow- and Wide-Band Customers and Wide-Band Restricted Access
– Serres, Mason
- 1988
|
|
6
|
Protonotarios, "Simulative Analysis of Optimal Resource Allocation and Routing in IBCN's
– Sykas, Vlakos, et al.
- 1991
|
|
6
|
Numerical Analysis of Large Markov Reward Models
– Telek, Racz
- 1999
|
|
4
|
Revenue Optimization and Fairness Control of Priced Guaranteed and Best Effort Services on an ATM Transmission Link
– Fodor, Nordstrom, et al.
- 1998
|
|
4
|
Roberts (ed), "Methods for the Performance Evaluation and Design of Broadband Multi-service Networks", Published by the
– W
- 1996
|
|
3
|
Near-Optimal Link Allocation of Blockable Narrow-Band and Queueable Wide-Band Call Trac in ATM Networks
– Nordström
- 1997
|
|
3
|
Available Bit Rate - A New Service for ATM
– Smith, Adams, et al.
- 1996
|
|
2
|
Trac Management Speci Version 4.0
– Forum
- 1996
|
|
2
|
A New Degree of Freedom in ATM Networks
– Farago, Blaabjerg, et al.
- 1995
|
|
2
|
Multirate Blocking Probabilities: Numerically Stable Computations
– Nilson, Perry
- 1997
|
|
1
|
Performance of TCP File Transfers over the Explicit Rate
– Cigno, Munafo
- 1997
|
|
1
|
Robust Dynamic Admission Control for Uni Cell and Call QoS in Statistical Multiplexers
– Mitra, Reiman, et al.
- 1998
|
|
1
|
Y.Watanabe, "Optimal Trunk reservation for a group with multislot trac streams
– Oda
- 1990
|
|
