Enforcing End-to-End Proportional Fairness with Bounded Buffer Overflow Probabilities

Singh, Nikhil; Sreenivas, Ramavarapu S.; Shanbhag, Uday V.

Permalink

https://hdl.handle.net/2142/99608 Copy

Description

Title

Enforcing End-to-End Proportional Fairness with Bounded Buffer Overflow Probabilities

Author(s)

• Singh, Nikhil
• Sreenivas, Ramavarapu S.
• Shanbhag, Uday V.

Issue Date

2008-08

Keyword(s)

• Proportional fairness
• Buffer overflow probabilities
• Wireless LAN
• Access protocols
• Resource management

Abstract

In this paper we present a distributed flow-based access scheme for slotted-time protocols, that provides proportional fairness in ad hoc wireless networks under constraints on the buffer overflow probabilities at each node. The proposed scheme requires local information exchange at the link-layer and end-to-end information exchange at the transport-layer, and is cast in the framework of nonlinear optimization. We say a medium access control protocol is proportionally fair with respect to individual end-to-end flows in a network, if the product of the end-to-end rates of flows is maximized. A key contribution of this work lies in the construction of a distributed dual approach that comes with low computational overhead. We discuss the convergence properties of the proposed scheme and present simulation results to support our conclusions.

Publisher

Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

Series/Report Name or Number

Coordinated Science Laboratory Report no. UILU-ENG-08-2211, DC-238

Type of Resource

text

Language

en

Permalink

http://hdl.handle.net/2142/99608

Sponsor(s)/Grant Number(s)

NSF / CNS-0437415 and NSF ECCS-0426831

Owning Collections