Packet scheduling attracted extensive research in the past years since it can significantly improve the performance of many Quality of Service (QoS) control mechanisms, either open-loop control or closed-loop control. In this report, I give the background information behind packet scheduling and a survey of several typical packet scheduling algorithms. After that, a general server model, named ...

The bounded-delay packet scheduling (or buffer management) problem is to schedule transmissions of packets arriving in a buffer of a network link. Each packet has a deadline and a weight associated with it. The objective is to maximize the weight of packets that are transmitted before their deadlines, assuming that only one packet can be transmitted in one time step. Online packet scheduling al...

A resource scheduling scheme is presented to improve throughput and fairness for NRT packet data traffic on the downlink shared channel of a UMTS WCDMA network supporting multiple services. The proposed Fair Resource Scheduling (FRS) scheme takes into account link conditions to enhance throughput and provides fair resource sharing among traffic flows. FRS includes service priority handling duri...

This paper presents a new scheduling scheme to support premium service in the Differentiated Service (DiffServ) architecture. It is based on weighted packet scheduling policies such as weighted round robin or fair queueing. The key feature of the new scheduling scheme is to change the scheduling weights of Behavior Aggregates adaptively. By adaptively adjusting the weights according to the dyna...

Packet delay and bandwidth are two important metrics for measuring quality of service (QoS) of Internet services. Traditionally, packet delay differentiation and fair bandwidth sharing are studied separately. In this paper, we first propose a generalized model for providing fair bandwidth sharing with delay differentiation, namely FBS-DD, at the same time. It essentially aims to provide multi-d...

Most of the existing packet scheduling mechanisms of the wireless sensor network use First Come First Served (FCFS) non pre emptive priority and pre emptive priority scheduling algorithms. The above algorithms have high processing overhead and also long end-to-end data transmission delay. In FCFS concept the data packet which is entering the node first will go out first from the node, and the p...

Now a day wireless networks are mostly preferred over wired networks because wireless networks are flexible and required no wire. If we talk about successful communication then end to end delivery of message is very important. In a heavy loaded networks scheduling of packets are key, by the proper scheduling of packets we can improve the guarantee ratio hence overall performance of the network ...

This paper investigates packet-scheduling aspects for satellite UMTS downlink transmissions in two special cases: High Speed Downlink Packet Access (HSDPA) and Multimedia Broadcast Multicast Services (MBMS). In particular, this paper surveys resource allocation constraints to be considered for HSDPA via satellite and investigates the applicability of Adaptive Modulation and Coding (AMC) in conj...

Quality of service capability of input queued packet switches is investigated. A packet transfer scheduling problem is formulated whereby each input-output pair is scheduled for packet transfers by regularly spaced deadlines, in compliance with a speciied data rate. Suitable applications include ATM networks and satellite switched TDMA systems that support periodic traac with delay guarantees. ...

In the framework of 3G systems, the adoption of efficient packet scheduling algorithms is needed to guarantee QoS as well as to provide high capacity. This letter reveals that for a proper system optimisation, different packet scheduling strategies should be used depending on the deployment scenario (macrocell, microcell, picocell), the link direction (uplink or downlink) as well as the service...