On determining the fair bandwidth share for ABR connections in ATM networks

Get BibTex-formatted data

Author

Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Rohit Goyal, Bobby Vandalore

Entry type

article

Abstract

In a multi-service network such as ATM, adaptive data services (such as ABR) share the bandwidth left unused by higher priority services. The network indicates to the ABR sources the fair and efficient rates at which they should transmit to minimize their cell loss. Switches must constantly measure the demand and available capacity, and divide the capacity fairly among the contending connections. In this paper, we propose a new method for determining the "effective" number of active connections, and the fair bandwidth share for each connection. We prove the efficiency and fairness of the proposed method analytically, and use several simulations to illustrate its fairness dynamics and transient response properties.

Date

2002

URL

http://iospress.metapress.com/content/xdlr85r6hr142klt/

Journal

Journal of High Speed Networks

Key alpha

Fahmy

Number

Pages

121-135

Publisher

IOS Press

Volume

Affiliation

Purdue University

Publication Date

2002-00-00

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ Fahmy,
	title = " On determining the fair bandwidth share for ABR connections in ATM networks",
	author = "Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Rohit Goyal, Bobby Vandalore",
	year = "2002",
	journal = "Journal of High Speed Networks",
	number = "2",
	pages = "121-135",
	publisher = "IOS Press",
	volume = "11",
	abstract = "In a multi-service network such as ATM, adaptive data services (such as ABR) share the bandwidth left unused by higher priority services. The network indicates to the ABR sources the fair and efficient rates at which they should transmit to minimize their cell loss. Switches must constantly measure the demand and available capacity, and divide the capacity fairly among the contending connections. In this paper, we propose a new method for determining the "effective" number of active connections, and the fair bandwidth share for each connection. We prove the efficiency and fairness of the proposed method analytically, and use several simulations to illustrate its fairness dynamics and transient response properties.",
	affiliation = "Purdue University",
	url = "http://iospress.metapress.com/content/xdlr85r6hr142klt/",
}