The performance of various GFR (Guaranteed Frame Rate) implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. In this paper we describe and evaluate a scheduling algorithm to provide the GFR service guarantees. The evaluation is performed by simulation using TCP connections. The proposed scheduling is...

Available bandwidth knowledge is very useful to network protocols. Unfortunately, available bandwidth is also very difficult to measure in packet networks, where methods to guarantee and keep track of the bandwidth (eg, weighted fair queuing scheduling) do not work well, for example the Internet. In this paper we are dealing with an available bandwidth sampling technique based on the observatio...

Multiuser selection scheduling concept has been recently proposed in the literature in order to increase the multiuser diversity gain and overcome the significant feedback requirements for the opportunistic scheduling schemes. The main idea is that reducing the feedback overhead saves per-user power that could potentially be added for the data transmission. In this work, we propose to integrate...

{ This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traac. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE system. The results show that, due to the burstiness of data traac, traditional work-conserving packet scheduling alg...

This paper presents a discrete-event simulator for the General Packet Radio Service (GPRS) on the IP level. GPRS is a standard on packet data in GSM systems that will become commercially available by the end of this year. The simulator focuses on the communication over the radio interface, because it is one of the central aspects of GPRS. We study the correlation of GSM and GPRS users by a stat...

The class based weighted fair queueing (WFQ) is applied in a lot of computer and communication systems. It is a popular way to share a common resource. Its efficient analytical solution is an open question for a long time. Different solutions were proposed, using complex analysis or numerical techniques. But all of these methods have their limits in usability. In this paper we present a very si...

The provisioning of quality of service by means of statistical multiplexing has been an alluring research idea for the last decade of teletraffic research. In this paper we question the efficiency of statistical bitrate service which is the standardized representation of this operational mode for ATM networks. Our argument is that the amount of information needed about a traffic source in order...

In this paper we introduce a new scheduling system with decoupled delay bound and bandwidth allocation guarantees. It is based on an existing efficient fair scheduler, Frame-based Fair Queueing (FFQ)[1], and therefore inherits the fairness, simplicity and efficiency of that policy. We combine a slightly modified version of an FFQ scheduler with the link sharing concept using rate estimator modu...