We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.

As the 3G cdma2000 R © networks with High Data Rates get deployed, it is interesting to study the impact of the scheduling algorithm used in these networks, and to improve its performance. We consider here the setting where this scheduling algorithm is used in heterogenous channels, meaning channels for which the fading properties are not the same from one user to the next. Some users might enc...

In this paper, we focus on understanding the binomial congestion control algorithms, which is proposed in [11] and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We discuss their global f...

Recently, cache-enabled heterogeneous cellular networks (C-HetNets) have been emerged as a promising solution for next-generation wireless networks to cope with exponentially increasing demands for high data rate and low latency multimedia services. In this paper, we design both the caching and the delivery policies in the downlink of an orthogonal frequency division multiple access (OFDMA)base...

| In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with FCFS routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Ou...

In third generation mobile networks, transmission rates can be assigned to both real time and non real time applications. We address in this paper the question of how to allocate transmission rates in a manner that is both optimal and fair. As optimality criterion we use the Pareto optimality notion, and as fairness criterion we use a general concept of which the max-min fairness (which is the ...

Opportunistic relaying scheme is a single cooperative relay selection method based on Channel State Information. However, the failure probability of the best relay selection may become unacceptable when the number of relays increases. Although most of the existing solutions can reduce the failure probability of relay selection, they ignore the fairness of the relay selection. In order to improv...

This is Part II of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part II are twofold. (i) First, we extend the problem formulation, theoretical results, and algorithms to the case of time-varying channels, where opportunistic c...

Without appropriately fair buffer management in the network, TCP encounters inherent unfairness towards connections with long round-trip times. This paper proposes a proportional fairness algorithm to correct the bias against these long connections. The algorithm is proven to converge to the fair point using Lyapunov Function. The basic algorithm is further modified to smooth the bursts of traf...