Compression on partial overlap ATM link

One of important tasks in link allocation policies in multirate circuit switched loss models is sharing of link capacity between service classes. For quality of service guarantees the most interesting are sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this work is suggested a model and associated computational technique for compression on partial overlap ATM transmission link to which CBR/VBR and ABR classes offer calls. A model with two parallel queues is under investigation where each queue is receiving traffic flows with standard distributions. The aim research is to investigate the compression of the cluster classes, which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and is minimizing blocking probability during compression. The examples for a network with 70 steady states prove the efficiency of the compression technique.