FCFS priority-based: An adaptive approach in 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 systems, using FCFS priority-based policy to schedule tasks results in the fewest packet loss. However, when the system is overloaded a FCFS priority-based policy schedule performs worse than most other policies. This is due to FCFS priority-based gives the highest priority to one queue while ignoring the overloaded conditions. In this research, a new priority assignment algorithm is presented which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, Object Oriented Dynamic Stochastic Discrete Event Simulation, we will compare the performance of the original FCFS-priority based algorithm with respect to the Adaptive FCFS priority-based algorithm.

Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Networks and Communication Systems 2006
Pages235-239
Number of pages5
Volume2006
Publication statusPublished - 2006
EventIASTED International Conference on Networks and Communication Systems 2006 - Chiang Mai
Duration: 29 Mar 200631 Mar 2006

Other

OtherIASTED International Conference on Networks and Communication Systems 2006
CityChiang Mai
Period29/3/0631/3/06

Fingerprint

Scheduling
Discrete event simulation
Packet loss
Feedback control

Keywords

  • Adaptive
  • Priority
  • Real-time network
  • Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Saleh, M., Ali Othman, Z., & Shamala, S. (2006). FCFS priority-based: An adaptive approach in scheduling real-time network traffic. In Proceedings of the IASTED International Conference on Networks and Communication Systems 2006 (Vol. 2006, pp. 235-239)

FCFS priority-based : An adaptive approach in scheduling real-time network traffic. / Saleh, Moutaz; Ali Othman, Zulaiha; Shamala, S.

Proceedings of the IASTED International Conference on Networks and Communication Systems 2006. Vol. 2006 2006. p. 235-239.

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

Saleh, M, Ali Othman, Z & Shamala, S 2006, FCFS priority-based: An adaptive approach in scheduling real-time network traffic. in Proceedings of the IASTED International Conference on Networks and Communication Systems 2006. vol. 2006, pp. 235-239, IASTED International Conference on Networks and Communication Systems 2006, Chiang Mai, 29/3/06.
Saleh M, Ali Othman Z, Shamala S. FCFS priority-based: An adaptive approach in scheduling real-time network traffic. In Proceedings of the IASTED International Conference on Networks and Communication Systems 2006. Vol. 2006. 2006. p. 235-239
Saleh, Moutaz ; Ali Othman, Zulaiha ; Shamala, S. / FCFS priority-based : An adaptive approach in scheduling real-time network traffic. Proceedings of the IASTED International Conference on Networks and Communication Systems 2006. Vol. 2006 2006. pp. 235-239
@inproceedings{5a19e4e7d76f40d5993284f8da207209,
title = "FCFS priority-based: An adaptive approach in scheduling real-time network traffic",
abstract = "Earlier studies have observed that in moderately-loaded systems, using FCFS priority-based policy to schedule tasks results in the fewest packet loss. However, when the system is overloaded a FCFS priority-based policy schedule performs worse than most other policies. This is due to FCFS priority-based gives the highest priority to one queue while ignoring the overloaded conditions. In this research, a new priority assignment algorithm is presented which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, Object Oriented Dynamic Stochastic Discrete Event Simulation, we will compare the performance of the original FCFS-priority based algorithm with respect to the Adaptive FCFS priority-based algorithm.",
keywords = "Adaptive, Priority, Real-time network, Scheduling",
author = "Moutaz Saleh and {Ali Othman}, Zulaiha and S. Shamala",
year = "2006",
language = "English",
isbn = "0889865906",
volume = "2006",
pages = "235--239",
booktitle = "Proceedings of the IASTED International Conference on Networks and Communication Systems 2006",

}

TY - GEN

T1 - FCFS priority-based

T2 - An adaptive approach in 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 systems, using FCFS priority-based policy to schedule tasks results in the fewest packet loss. However, when the system is overloaded a FCFS priority-based policy schedule performs worse than most other policies. This is due to FCFS priority-based gives the highest priority to one queue while ignoring the overloaded conditions. In this research, a new priority assignment algorithm is presented which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, Object Oriented Dynamic Stochastic Discrete Event Simulation, we will compare the performance of the original FCFS-priority based algorithm with respect to the Adaptive FCFS priority-based algorithm.

AB - Earlier studies have observed that in moderately-loaded systems, using FCFS priority-based policy to schedule tasks results in the fewest packet loss. However, when the system is overloaded a FCFS priority-based policy schedule performs worse than most other policies. This is due to FCFS priority-based gives the highest priority to one queue while ignoring the overloaded conditions. In this research, a new priority assignment algorithm is presented which features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Using a detailed simulation model, Object Oriented Dynamic Stochastic Discrete Event Simulation, we will compare the performance of the original FCFS-priority based algorithm with respect to the Adaptive FCFS priority-based algorithm.

KW - Adaptive

KW - Priority

KW - Real-time network

KW - Scheduling

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

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

M3 - Conference contribution

AN - SCOPUS:34047132742

SN - 0889865906

SN - 9780889865907

VL - 2006

SP - 235

EP - 239

BT - Proceedings of the IASTED International Conference on Networks and Communication Systems 2006

ER -