Asymptotic ehavior of queues is studies for large closed multi-class queueing networks consisting of one infinite server statio with K classes and M processor sharing(PS) stations. A simple numerical procedure is derived that allows us to identify all bottleneck PS stations. The bottleneck station is defined asymptotically as the station, where the number of customers grows proportionally to the total number of customers in the network as the latter increases simultaneously with service rates at PS stations. The case oftwo bottlenecks is illustrated by its application to the problem of idmensioning bandwidth for different data sources in packet-switched communication networks. An engineering rule is provided for determinning the link rates such that a service objective on a per-class throughput is satisfied.
展开▼
