Cake cutting, a subfield of fair division, refers to the allocation of a heterogeneous, divisible, and continuous good among n players who have heterogeneous preferences. The challenge is to allocate the cake in such a way that is fair by using a procedure that encourages the players to be truthful about their preferences. There are several different notions of fairness studied in the literatur...

. 4 b s h c t This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the socalled max-min fairness: F . Kelly [IO] has recently introduced the alternative proportional fairness criterion; we introduce a third criterion. which is naturally interpreted in terms of the delays experienced by ongoing t...

In a multi-rate environment fairness is not guaranteed, there is a tradeoff between fairness and throughput in such WLANs. To reduce the tradeoff problem we construct a novel intuitive simplified mathematical model called simplified coefficient of variation (SCV) model, we use SCV model to solve the optimization tradeoff problem through power control of APs, to improve balance between proportio...

Low throughput due to unfairness is a key problem in multi-rate wireless local area networks. To promote fairness and hence throughput, T -Fair groups flows according to their average data rate, provides each group fair time allocations and ensures throughput fairness for flows in each group. Since each group is allocated transmission times fairly, T -Fair isolates high and low rate groups and ...

We present a TCP flow level performance evaluation on error rate aware scheduling algorithms in Evolved UTRA and UTRAN networks. With the introduction of the error rate, which is the probability of transmission failure under a given wireless condition and the instantaneous transmission rate, the transmission efficiency can be improved without sacrificing the balance between system performance a...

Scheduling imposes a trade-off between sum capacity and fairness among users. In some situations, fairness needs to be given the first priority. Therefore, a scheduling algorithm which can flexibly control sum capacity and fairness is desirable. In this paper, assuming the single-carrier frequency division multiple access (SC-FDMA), we propose three scheduling algorithms: modified max-map, prop...

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...

The OFEX (Optimal and Fully EXplicit) rate controller is able to provide not only the optimal bandwidth allocation but also the fully explicit congestion signal to sources. It exercises link-wise proportional fairness and network-wise max-min fairness, which enables the controller to feed the congestion signal back from the most congested link, instead of using the networkwise proportional fair...

As the 3G cdma2000 R © networks with High Data Rates get deployed, it is interesting to study the impact of the scheduling algorithms used in these networks, and to improve over their performance. In this paper, we introduce a quantized scheduling that takes into account the fact that mobile nodes and access points can communicate only through a finite set of rate or power vectors. This approac...

In this paper, a radio resource sharing scheme for wireless cellular network is investigated to achieve efficiency and fairness among base stations. We propose a credit-token based spectrum sharing algorithm. Game theory is utilized to formulate and analyze the proposed spectrum sharing algorithm. We first discuss the simplest two-base-station game through a graphical method to gain insights fo...