Time dependent priority scheduling for guaranteed QoS systems

Abstract

Wath the advances an server technology, and the advent of fast Gzgabat networks, at has become possable to support multa-medza applzcatzons To support the requzrements f o r the transmassaon of asochronous data, the network must provade servace guarantees to connectzons, zncludang mznzmum bandwadth, packet delay, delay jatter, and loss Three factors determine the utalazatzon of the network when provadzng these servaces These are the scheduling algorithm employed at each swztch, the accuracy (tzghtness) of the admission control schedulability condition) that detects vzolatzons t o t b e servace guarantees] accuracy of the input traffic characterization In thas paper we present a schedulang algorathm, a-ts schedulabalaty condatzon and amplementatzon The schedulabzlaty condztaon as free of anput trafic characterazataon and thus any anput trafic model can be used Further, the algorathm as capable of achzevang up to maxzmum eficaency possible at each swatch.

Packet Scheduling Algorithms in LTE/LTE-A

“…It serves non-real time data streams. With greater efficiency, it optimizes the throughput and ensures fairness between the data flows [16]. The subcarrier is allocated to the user having most favorable conditions of transmission.…”

Usage of Network-Level Dynamic Priority and Its Comparison with Static Priority

“…Jackson [2] proposed the dynamic assignment of priority in the form of the sum of the total sojourn time and a parameter assigned to each packet. Kleinrock [3] and Chaudhry and Choudhary [4] proposed time dependent priority, where the priority for each packet is determined by one of several linear functions of packet sojourn times. Lim and Kobza [5] proposed headof-line with priority jump, in which a packet in a given class is reassigned to a higher class after waiting for a particular time.…”

Introduction to Packet Scheduling Algorithms for Communication Networks

“…It essentially schedules the packets in a greedy manner which always picks the packets with the closest deadline. Compare with strict priority discipline, we can regard EDF as a scheduling algorithm which provides time-dependent priority [8] to each eligible packet. Actually, the priority of an eligible packet under EDF is an increasing function of time since the sending order in EDF is according to the closeness of packets' deadlines.…”