The M/G/c queue is separately treated. Two imposed prerequisites, that only minimal prior information about the queue will be required and that no numeric method be needed other than a root-finding ...

Finally, we demonstrate the potential of our methodology to solve other problems using the M/M/c queue with two priority classes, where the high-priority class is completely impatient. OR ...

In this paper, the authors presented an architecture of load balancing and algorithm which will further improve the load balancing problem by minimizing the response time while maintaining SLA.