This paper compares the behaviour of Earliest Deadline First (EDF) and Opportunistic-EDF (O-EDF) with that of Round Robin, Proportional Fair Throughput (PFT), and Maximum Carrier to Interference ratio (MaxC/I) . Video, voice and web traffic are transmitted through an HSDPA air interface. The resultant queueing delay and fairness are measured and compared for each scheduler.

A joint resource allocation (RA), user association (UA), and power control (PC) problem is addressed for proportional fairness maximization in a cooperative multiuser downlink small cell network with limited backhaul capacity, based on orthogonal frequency division multiplexing. Previous studies have relaxed the per-resourceblock (RB) RA and UA problem to a continuous optimisation problem based...

Several important modifications to the distributed queue dual bus (DQDB) (IEEE 802.6) protocol for metropolitan area networks (MANs) are proposed. These modifications are aimed at improving not only the throughput and delay performance of the network but also its fairness performance. The first proposal exploits the continuation-of-message (COM) information in a DQDB segment in order to minimiz...

This paper studies the fairness, power allocation, and channel state information (CSI) quantization in multiuser systems utilizing multiple feedback bits per user. For a given set of schedulers, we obtain the system throughput with different power allocation strategies and any combination of different fading distributions. Moreover, the system performance under user different outage probability...

Resources in large-scale distributed systems are distributed among several autonomous domains. These domains collaborate to produce significantly higher processing capacity through load balancing. However, resources in the same domain tend to be cooperative, whereas those in different domains are self-interested. Fairness is the key to collaboration under a self-interested environment. Accordin...

Micro-buffered networks are high speed optical packet switched networks, and consist of either nodes with no buffering or nodes with limited buffering. We focus on the case of bufferless nodes, where there is no specific collision resolution mechanisms inside the core. Packet losses inside the core may be frequent, and are dealt with using end-to-end or edgeto-edge coding techniques. In this st...

Computing and storage utilities must control resource usage to meet contractual performance targets for hosted customers under dynamic conditions, including flash crowds and unexpected resource failures. This paper explores properties of proportional share resource schedulers that are necessary for stability and responsiveness under feedback control. It shows that the fairness properties common...

In best-effort networks, fairness has been used as a criterion to guide the design of traffic controls. The notion of fairness has evolved over time, from simple equality to a form of equality modulated by the user’s need (e.g. max-min and proportional fairness). However, fairness has always been defined on a per-user basis for a deterministic workload. In this paper, we argue that we must rede...

In this paper we consider the eeect of timedelay in the performance of the AIMD algorithm, speciically queue length and fairness for both rate and window based sources. The queue bounds can be used to allocate buuers at bottlenecks so that ows can go through without any loss.We modify the AIMD algorithm by making the additive rate increase parameter proportional to the round trip time and the d...

Orthogonal frequency division multiple access (OFDMA), which is widely used in the wireless sensor networks, allows different users to obtain different subcarriers according to their subchannel gains. Therefore, how to assign subcarriers and power to different users to achieve a high system sum rate is an important research area in OFDMA systems. In this paper, the focus of study is on the rate...