Hierarchical AED: An approach for scheduling real-time network traffic

Moutaz Saleh, Zulaiha Ali Othman, S. Shamala

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Earlier studies have observed that in moderately-loaded real-time systems, using an earliest deadline policy to schedule tasks results in the fewest missed deadlines. However, when the real-time system is overloaded an earliest deadline schedule performs worse than most other policies. This is due to the earliest deadline giving the highest priority to the tasks that are close to missing their deadlines, thus delaying other transactions that might still be able to meet their deadline. In this research, an enhanced priority assignment algorithm is presented, called the Adaptive Earliest Deadline (AED), which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, the performance of AED is compared and analyzed with Earliest Deadline First (EDF). Furthermore, an enhanced AED algorithm called the Hierarchical AED is proposed in a manner in which it obtains a better packet-serving performance by using the concept of priority based on QoS of network traffic rather than using a random priority assignment when doing the packet group assignment. Finally, the performance of Hierarchical AED scheduling algorithm will be compared with both EDF and the AED scheduling algorithms under the same operating environment.

Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Modelling and Simulation
Volume2006
Publication statusPublished - 2006
Event17th IASTED International Conference on Modelling and Simulation - Montreal, QC
Duration: 24 May 200626 May 2006

Other

Other17th IASTED International Conference on Modelling and Simulation
CityMontreal, QC
Period24/5/0626/5/06

Fingerprint

Real time systems
Scheduling algorithms
Scheduling
Telecommunication traffic
Feedback control
Quality of service

Keywords

  • AED
  • Hierarchical
  • QoS
  • Real-time network
  • Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Saleh, M., Ali Othman, Z., & Shamala, S. (2006). Hierarchical AED: An approach for scheduling real-time network traffic. In Proceedings of the IASTED International Conference on Modelling and Simulation (Vol. 2006)

Hierarchical AED : An approach for scheduling real-time network traffic. / Saleh, Moutaz; Ali Othman, Zulaiha; Shamala, S.

Proceedings of the IASTED International Conference on Modelling and Simulation. Vol. 2006 2006.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Saleh, M, Ali Othman, Z & Shamala, S 2006, Hierarchical AED: An approach for scheduling real-time network traffic. in Proceedings of the IASTED International Conference on Modelling and Simulation. vol. 2006, 17th IASTED International Conference on Modelling and Simulation, Montreal, QC, 24/5/06.
Saleh M, Ali Othman Z, Shamala S. Hierarchical AED: An approach for scheduling real-time network traffic. In Proceedings of the IASTED International Conference on Modelling and Simulation. Vol. 2006. 2006
Saleh, Moutaz ; Ali Othman, Zulaiha ; Shamala, S. / Hierarchical AED : An approach for scheduling real-time network traffic. Proceedings of the IASTED International Conference on Modelling and Simulation. Vol. 2006 2006.
@inproceedings{6a17da07b1f549bb90c315dafdb0b354,
title = "Hierarchical AED: An approach for scheduling real-time network traffic",
abstract = "Earlier studies have observed that in moderately-loaded real-time systems, using an earliest deadline policy to schedule tasks results in the fewest missed deadlines. However, when the real-time system is overloaded an earliest deadline schedule performs worse than most other policies. This is due to the earliest deadline giving the highest priority to the tasks that are close to missing their deadlines, thus delaying other transactions that might still be able to meet their deadline. In this research, an enhanced priority assignment algorithm is presented, called the Adaptive Earliest Deadline (AED), which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, the performance of AED is compared and analyzed with Earliest Deadline First (EDF). Furthermore, an enhanced AED algorithm called the Hierarchical AED is proposed in a manner in which it obtains a better packet-serving performance by using the concept of priority based on QoS of network traffic rather than using a random priority assignment when doing the packet group assignment. Finally, the performance of Hierarchical AED scheduling algorithm will be compared with both EDF and the AED scheduling algorithms under the same operating environment.",
keywords = "AED, Hierarchical, QoS, Real-time network, Scheduling",
author = "Moutaz Saleh and {Ali Othman}, Zulaiha and S. Shamala",
year = "2006",
language = "English",
isbn = "0889865949",
volume = "2006",
booktitle = "Proceedings of the IASTED International Conference on Modelling and Simulation",

}

TY - GEN

T1 - Hierarchical AED

T2 - An approach for scheduling real-time network traffic

AU - Saleh, Moutaz

AU - Ali Othman, Zulaiha

AU - Shamala, S.

PY - 2006

Y1 - 2006

N2 - Earlier studies have observed that in moderately-loaded real-time systems, using an earliest deadline policy to schedule tasks results in the fewest missed deadlines. However, when the real-time system is overloaded an earliest deadline schedule performs worse than most other policies. This is due to the earliest deadline giving the highest priority to the tasks that are close to missing their deadlines, thus delaying other transactions that might still be able to meet their deadline. In this research, an enhanced priority assignment algorithm is presented, called the Adaptive Earliest Deadline (AED), which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, the performance of AED is compared and analyzed with Earliest Deadline First (EDF). Furthermore, an enhanced AED algorithm called the Hierarchical AED is proposed in a manner in which it obtains a better packet-serving performance by using the concept of priority based on QoS of network traffic rather than using a random priority assignment when doing the packet group assignment. Finally, the performance of Hierarchical AED scheduling algorithm will be compared with both EDF and the AED scheduling algorithms under the same operating environment.

AB - Earlier studies have observed that in moderately-loaded real-time systems, using an earliest deadline policy to schedule tasks results in the fewest missed deadlines. However, when the real-time system is overloaded an earliest deadline schedule performs worse than most other policies. This is due to the earliest deadline giving the highest priority to the tasks that are close to missing their deadlines, thus delaying other transactions that might still be able to meet their deadline. In this research, an enhanced priority assignment algorithm is presented, called the Adaptive Earliest Deadline (AED), which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, the performance of AED is compared and analyzed with Earliest Deadline First (EDF). Furthermore, an enhanced AED algorithm called the Hierarchical AED is proposed in a manner in which it obtains a better packet-serving performance by using the concept of priority based on QoS of network traffic rather than using a random priority assignment when doing the packet group assignment. Finally, the performance of Hierarchical AED scheduling algorithm will be compared with both EDF and the AED scheduling algorithms under the same operating environment.

KW - AED

KW - Hierarchical

KW - QoS

KW - Real-time network

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=33751202942&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751202942&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33751202942

SN - 0889865949

SN - 9780889865945

VL - 2006

BT - Proceedings of the IASTED International Conference on Modelling and Simulation

ER -