Name
Abstract | ||
|---|---|---|
Multiservice networks will host heterogeneous applications, requiring different qualities of service (QoS), the coexistence of which can be efficiently accounted by employing scheduling algorithms which are capable of providing different QoS simultaneously. In a previous work, we defined a reference Dual-Class (DC) paradigm, according to which rate-guaranteed flows are restrained from using more than their minimum guaranteed rate in the presence of backlogged best-effort flows and the latter share all the remaining capacity according to predetermined weights. The Timed Token Service Discipline (TTSD), which applies at the output link of a switch the same rules used to control medium access by the Timed Token Protocol, was also introduced and analyzed therein. It was proven that TTSD shares most of the capacity which is not strictly needed by the rate-guaranteed flows among the best-effort ones, thus achieving one of the goals of the DC paradigm. However, in TTSD, best-effort flows can only share the available capacity equally. In this paper, we take into account the issue of differentiating the capacity sharing among the best-effort flows: We define a Generalized TTSD (GTTSD) in which the latter actually share capacity according to predefined weights in a weighted fair queuing service discipline. Formal analysis and simulation results show that GTTSD closely approximates the DC paradigm. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TC.2004.28 | IEEE Trans. Computers |
Keywords | Field | DocType |
capacity sharing,best-effort flow,backlogged best-effort flow,remaining capacity,generalized timed token service,dc paradigm,share capacity,generalized ttsd,available capacity,performance analysis,latter share,ttsd share,queueing theory,scheduling,packet switching,internet,switches,weighted fair queuing,scheduling algorithm,generation time,protocols,qos,quality of service,best effort | Packet scheduling,Capacity sharing,Scheduling (computing),Computer science,Quality of service,Computer network,Real-time computing,Queueing theory,Packet switching,Weighted fair queueing,Security token,Distributed computing | Journal |
Volume | Issue | ISSN |
53 | 7 | 0018-9340 |
Citations | PageRank | References |
6 | 0.51 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Lenzini | 1 | 596 | 66.46 |
| Enzo Mingozzi | 2 | 1055 | 100.39 |
| Giovanni Stea | 3 | 580 | 60.06 |