12 search results - page 1 / 3 » Performance analysis of LAS-based scheduling disciplines in ... |
SIGMETRICS
2004
ACM
13 years 10 months ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
PE
2002
Springer
13 years 4 months ago
2002
Springer
Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-tim...
PE
2006
Springer
13 years 4 months ago
2006
Springer
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing syste...
ETT
2002
13 years 4 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
SIGCOMM
1996
ACM
13 years 8 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...