Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues
- 20 December 2005
- journal article
- Published by Elsevier in AEU - International Journal of Electronics and Communications
- Vol. 60 (2) , 109-115
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Discriminatory processor sharing revisited2005
- DPS queues with stationary ergodic service times and the performance of TCP in overload2005
- Asymptotic regimes and approximations for discriminatory processor sharingACM SIGMETRICS Performance Evaluation Review, 2004
- The impact of the service discipline on delay asymptoticsPerformance Evaluation, 2003
- Bandwidth sharing: objectives and algorithms1999
- Queue-Length Distribution for the Discriminatory Processor-Sharing QueueOperations Research, 1996
- A decomposition theorem and related results for the discriminatory processor sharing queueQueueing Systems, 1994
- Sharing a Processor Among Many Job ClassesJournal of the ACM, 1980
- An Analysis of the M/G/1 Queue Under Round-Robin SchedulingOperations Research, 1971
- Time-shared SystemsJournal of the ACM, 1967