Sciweavers

372 search results - page 9 / 75
» Congestion control in utility fair networks
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control
— We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re...
Atilla Eryilmaz, R. Srikant
INFOCOM
2010
IEEE
13 years 7 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
ICNP
2002
IEEE
14 years 1 months ago
A Theory of Window-Based Unicast Congestion Control
This work presents a comprehensive theoretical framework for window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive ...
Nishanth R. Sastry, Simon S. Lam

Publication
767views
15 years 7 months ago
Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...
D. Chiu and R. Jain
CCR
2008
83views more  CCR 2008»
13 years 8 months ago
Stability and fairness of explicit congestion control with small buffers
Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottlene...
Frank P. Kelly, Gaurav Raina, Thomas Voice