Name
Abstract | ||
|---|---|---|
The Internet is gradually and constantly becoming a multimedia network that needs mechanisms to provide effective quality of service (QoS) requirements to users. The service curve (SC) is an efficient description of QoS and the service curve based earliest deadline first policy (SCED) is a scheduling algorithm to guarantee SCs specified by users. In SCED, deadline calculation is the core. However, not every SC has a treatable deadline calculation; currently the only known treatable SC is the concave piecewise linear SC (CPLSC). In this paper, we propose an algorithm to translate all kinds of SCs into CPLSCs. In this way, the whole Internet can have improved performance. Moreover, a modification of the deadline calculation of the original SCED is developed to obtain neat and precise results. The results combining with our proposed algorithm can make the deadline calculation smooth and the multimedia Internet possible. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ins.2008.02.004 | Inf. Sci. |
Keywords | Field | DocType |
concave piecewise linear service,original sced,scheduling algorithm,whole internet,concave piecewise linear sc,treatable sc,earliest deadline,service curve,deadline calculation,proposed algorithm,treatable deadline calculation,quality of service,differentiated service,differentiated services,piecewise linear,earliest deadline first,information sciences | Differentiated services,Mathematical optimization,Computer science,Scheduling (computing),Quality of service,Differentiated service,Time-utility function,Earliest deadline first scheduling,Piecewise linear function,The Internet,Distributed computing | Journal |
Volume | Issue | ISSN |
178 | 12 | 0020-0255 |
Citations | PageRank | References |
3 | 0.39 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lain-chyr Hwang | 1 | 16 | 6.10 |
| Chia-Hsu Kuo | 2 | 17 | 4.06 |
| San-Yuan Wang | 3 | 100 | 7.99 |