Reduced complexity in queues

Many real-life systems can be modeled using the classical M / G / c / N queue. A frequently-used approach is to replace the general service time distribution by a phase-type distribution since the M / P h / c / N queue can be described by familiar balance equations. The downside of this approach is that the size of the resulting state space suffers from the “dimensionality curse”, i.e., exhibits combinatorial growth as the number of servers and/or phases increases. cumvent this complexity issue, we propose to use a reduced state description in which the state of only one server is represented explicitly, while the other servers are accounted for through their rate of completions. The accuracy of the resulting approximation is generally good and, moreover, tends to improve as the number of servers in the system increases. Its computational complexity in terms of the number of states grows only linearly in the number of servers and phases.