Link capacity sharing between guaranteed- and best effort services on are ATM transmission link under GoS constraints

While link allocation policies in multi-rate circuit switched loss models h ave 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 par ticular, when an ATM link is offered calls from service classes with/withou t strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities und er some GoS constraints. In this paper we propose a model and associated co mputational technique for an ATM transmission link to which CBR/VBR and ABR classes offer calls. We also propose a simple link allocation rule which t akes into account blocking probability constraints for the CBR/VBR calls an d a throughput constraint for the ABR calls and attempts to minimize the bl ocking probability of ABR calls. Numerical examples demonstrate the effecti veness of the policy and of the applied computational technique.