Generalized processor sharing queues with heterogeneous traffic classes

Share/Save/Bookmark

Borst, Sem and Mandjes, Michel and Uitert, Miranda van (2003) Generalized processor sharing queues with heterogeneous traffic classes. Advances in Applied Probability, 35 (3). pp. 806-845. ISSN 0001-8678

[img] PDF
Restricted to UT campus only
: Request a copy
290kB
Abstract:We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behaviour of the light-tailed traffic flow under the assumption that its GPS weight is larger than its traffic intensity. The GPS mechanism ensures that the workload is bounded above by that in an isolated system with the light-tailed flow served in isolation at a constant rate equal to its GPS weight. We show that the workload distribution is, in fact, asymptotically equivalent to that in the isolated system, multiplied by a certain prefactor, which accounts for the interaction with the heavy-tailed flow. Specifically, the prefactor represents the probability that the heavy-tailed flow is backlogged long enough for the light-tailed flow to reach overflow. The results provide crucial qualitative insight in the typical overflow scenario.
Item Type:Article
Additional information:Open Access
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/70360
Official URL:http://dx.doi.org/10.1239/aap/1059486830
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 212729