Optimal Call Admission Control in Generalized Processor Sharing (GPS) Schedulers

Generalized Processor Sharing(GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version PGPS is considered to be a good choice as a packet scheduling discipline to guarantee Quality-of-Service in IP and ATM networks. The existing Connection Admission Control(CAC) frameworks for GPS result in a conservative resource allocation. We propose an Optimal CAC algorithm for a GPS scheduler, for leaky-bucket constrained connections with deterministic delay guarantees. Our numerical results show that the Optimal CAC results in a higher network utilization than the existing CACs