Hierarchical scheduling for heterogeneous flows

Barhoun, Rabie; Namir, Abdelwahed

doi:10.1109/icmcs.2012.6320293

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Hierarchical Hybrid EDF/FIFO [17] can serve heterogeneous traffic, by using a priority queue Hybrid EDF/FIFO for class-1, while continuing to provide best effort service class-2 by lower priority queue FIFO. The queue process control is proposed to eliminate the queue overload.…”

Section: Hierarchical Hybrid Schedulingmentioning

confidence: 99%

Analysis of Hierarchical Scheduling for Heterogeneous Traffic Over Network

Barhoun¹,

Namir²,

Barhoun³

2013

IJCNC

Self Cite

View full text Add to dashboard Cite

Scheduling real time and non real time packets at network nodes has an important impact by reducing theprocessing overhead, queuing delay and response time. Most of the existing packet scheduling algorithmsused in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priorityscheduling. However, these algorithms incur a large processing overhead, queuing delay and responsetime and are not dynamic to the data traffic changes. In this paper, we present a new hierarchicalscheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the realtime traffic but also provide best effort service to non real time traffic. To examine our approach forscheduling, we realized our analytical study to express the worst case queuing delay and the worst caseresponse time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFOachieved the minimum packet delay and adequate loss packet for non real time traffic when compared withHierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF whichconfirms the effectiveness of this approac

show abstract

Section: Hierarchical Hybrid Schedulingmentioning

confidence: 99%