The focus of this paper is to compare two popular end-to-end congestion control algorithms in the literature, namely, AIMD (additive increase/multiplicative decrease) and AIPD (additive increase/loss proportional decrease). We clarify the definitions of AIMD and AIPD algorithms, and compare them in various aspects such as convergence, steady state throughput, fairness characteristics, and the c...

Wireless packet-scheduling is a crucial component for providing quality of service (QoS) in CDMA networks. In this paper, we propose channel-adaptive rate-scheduling based on Generalized Processor Sharing (CAGPS) to guarantee minimum service rate and to provide proportional fairness among heterogeneous multimedia traffic for QoS differentiation. The CA-GPS scheduler assigns different GPS weight...

This paper presents a new overlay-based congestion management mechanism that provides the proportional fairness among competing aggregates and the improvement in packet loss ratio for Differentiated Services (DiffServ) network. In the proposed scheme, a QoS control packet is sent from the ingress to the egress router every fixed time interval. The ingress router employs a simple additive increa...

We consider the problem of scheduling a group of heterogeneous, distributed processes to a group of heterogeneous resource pools (physical servers, clusters of processors/cores) each with different types of resources. The processes specify their preference-constraints [20] and linearly elastic resource needs for heterogeneous resource pools. Our setting is a neutral, public cloud datacenter [6]...

A new scheme for MIMO-OFDMA (Multiple Input Multiple Output Orthogonal Frequency Division Multiple Access) downlink resource allocation is presented in this paper. It has an objective of maximizing the total system capacity while having constraints on the total available power and proportional fairness. Dominant eigenchannels obtained from MIMO state matrix are used to formulate this scheme wit...

This thesis proposes a novel approach to address the issues of efficiency and fairness when multiple portfolios are rebalanced simultaneously. A fund manager who rebalances multiple portfolios needs to not only optimize the total efficiency, i.e., maximize net risk-adjusted return, but also guarantee that trading costs are fairly split among the clients. The existing approaches in the literatur...

In this note we provide a novel characterization of the proportionally fair bandwidth allocation of network capacities, in terms of the Legendre-Fenchel transform of the network capacity region. We use this characterization to prove stability of network dynamics under proportionally fair sharing, by exhibiting a suitable Lyapunov function. Our stability result extends previously known results t...

In this article we provide a novel characterization of the proportionally fair bandwidth allocation of network capacities, in terms of the Fenchel– Legendre transform of the network capacity region. We use this characterization to prove stability (i.e., ergodicity) of network dynamics under proportionally fair sharing, by exhibiting a suitable Lyapunov function. Our stability result extends pre...