The General Packet Radio Service (GPRS) augments GSM to provide packet switched data services to the mobile users. Packet scheduling in GPRS is dynamic and several scheduling techniques have been implemented, for example round robin; however, these generally assure only best effort quality of service. In this paper we compare prominent scheduling algorithms by simulation of web and email traffi...

In this paper, we propose fairness-oriented packet scheduling (PS) schemes with power-efficient control mechanism for future packet radio systems. In general, the radio resource management functionality plays an important role in new OFDMA based networks. The control of the network resource division among the users is performed by packet scheduling functionality based on maximizing cell coverag...

This paper introduces a new packet scheduling algorithm for multi-media traffic. The proposed modified priority queuing (MPQ) packet scheduling algorithm, realizing the high priority traffic service employs exponential distributions with the higher averages respectively, secures the reduction in the mean waiting time regarding the high priority traffic sensitive to delay. Thus, we could meet th...

Packet scheduling constitutes the core problem in efficient fair allocation of bandwidth to competing flows. To date, numerous algorithms for packet scheduling have been suggested and tested. However, only a few of them are currently deployed. One of the key reasons for rarity of applied packet scheduling methods lies in the complexity of their implementation. This paper describes a family of r...

In this paper analyzes various scheduling algorithms applied to multi-media streaming system for providing real-time service in Internet and proposed a scheduling algorithm that can meet the QoS requirements of delay-sensitive traffic and loss-sensitive traffic for specific services. First, the concept of QoS drafted from the recommendation of ITU-T is defined and the requirements for packet mu...

In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences scheduling schemes in a way that each scheduled packet should be ensured to be completely transmitted within the scheduled frames. We formulate the PFS problem as an optimization problem. Based on the observations on the struc...

The main objective of this project is to create a new packet scheduling technique. Packet scheduling is one of the decision process. It is used to choose which packets should be serviced or dropped. The packet scheduling is needed in network for providing maximum bandwidth, a minimum delay, a minimum packet loss rate at all times. The issues in packet scheduling techniques are space, time compl...

Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in the bandwidth-constrained, shared-channel, multihop wireless networks. Packet scheduling has been a very popular paradigm to ensure minimum throughput and bounded delay access for packet flows. This work describes a packet scheduling approach to QoS provisioning in mult...

Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibili...

SRIDHARAN, SAVITHA. Fair Queueing Algorithms for QoS Support in Packet Switched Networks. (Under the direction of Dr. Yannis Viniotis, in association with Agere Systems.) The rapid growth of telecommunications has led to a demand for convergence of voice, video and data integration over traditional data networks. This has strained the current packet-switched networks which are not very well-sui...