article · 2010

Stateless Proportional Bandwidth Allocation

Prasanna K. Jagannathan *a, Arjan Durresi *a, Raj Jain **b

Cited by 0Abstract and details only

Abstract

This paper proposes a new method of bandwidth allocation during congestion, called the proportional allocation of bandwidth. Traditionally, max-min fairness has been proposed to allocate bandwidth under congestion. Our allocation scheme considers the situation where flows might have different subscribed information rates, based on their origin. In proportional allocation of bandwidth, during congestion all flows get a share of available bandwidth, which is in proportion to their subscribed information rate. We suggest a method for implementing this with minimum signaling and without storing per-flow state. Our method is based on the principles of differentiated services – diffserv. We show by simulation that it is possible to obtain proportional bandwidth allocation without per-flow state storing and minimum signaling.

Cite this paper

APA 7

a, P. K. J., a, A. D., & **b, R. J. (2010). Stateless Proportional Bandwidth Allocation.

MLA 9

*a, Prasanna K. Jagannathan, et al. “Stateless Proportional Bandwidth Allocation.” 2010.

Chicago

a, Prasanna K. Jagannathan, Arjan Durresi a, and Raj Jain **b. 2010. “Stateless Proportional Bandwidth Allocation.”

Harvard

a, P.K.J., a, A.D. and **b, R.J. (2010) ‘Stateless Proportional Bandwidth Allocation’.

BibTeX

@article{a2010stateless,
  title = {{Stateless Proportional Bandwidth Allocation}},
  author = {*a, Prasanna K. Jagannathan and *a, Arjan Durresi and **b, Raj Jain},
  year = {2010}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.