Name
Abstract | ||
|---|---|---|
We consider a system with two heterogeneous traffic classes, one having light-tailed characteristics, the other one exhibiting heavy-tailed properties. The two traffic classes 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-services networks.We determine the workload asymptotics of the light-tailed class for the situation where 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 class 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 with a certain pre-factor, which accounts for the interaction with the heavy-tailed class. Specifically, the pre-factor represents the probability that the heavy-tailed class is backlogged long enough for the light-tailed class to reach overflow. The results provide crucial qualitative insight in the typical overflow scenario. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1145/507553.507570 | SIGMETRICS Performance Evaluation Review |
Keywords | Field | DocType |
fluid queue,heavy tail,scheduling algorithm,weighted fair queueing,generalized processor sharing | Workload,Computer science,Scheduling (computing),Traffic intensity,Bounded set,Isolated system,Real-time computing,Generalized processor sharing,Global Positioning System,Weighted fair queueing,Distributed computing | Journal |
Volume | Issue | Citations |
29 | 3 | 9 |
PageRank | References | Authors |
0.70 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sem C. Borst | 1 | 1504 | 150.76 |
| Michel Mandjes | 2 | 534 | 73.65 |
| Miranda Van Uitert | 3 | 103 | 6.97 |