Abstract | ||
---|---|---|
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in packet networks by the use of proper packet scheduling algorithms. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of such applications while continuing to provide best effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. The simulation results show that the Hierarchical Diff-EDF achieved the minimum packet miss ratio when compared with both EDF and Diff-EDF schedulers. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1109/AICCSA.2008.4493620 | AICCSA |
Keywords | Field | DocType |
hierarchical diff-edf,packet priority,efficient hierarchical diff-edf schedulability,minimum packet,time traffic,diff-edf schedulers,best-effort traffic,hierarchal diff-edf,packet network,proper packet scheduling algorithm,video traffic,qos packet network,scheduling,feedback,real time,earliest deadline first,best effort,packet switching,scheduling algorithm,feedback control,quality of service | Best-effort delivery,Packet analyzer,Scheduling (computing),Computer science,Network packet,Computer network,Quality of service,Packet scheduling algorithm,Real-time computing,Packet switching,Earliest deadline first scheduling,Distributed computing | Conference |
ISSN | Citations | PageRank |
2161-5322 | 0 | 0.34 |
References | Authors | |
5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Moutaz Saleh | 1 | 0 | 2.70 |
Zulaiha Ali Othman | 2 | 91 | 16.18 |
Mohammad Saleh | 3 | 0 | 0.68 |