Sciweavers

326 search results - page 1 / 66
» A distributed utility max-min flow control algorithm
Sort
View
INFOCOM
2008
IEEE
13 years 11 months ago
Utility Max-Min Fair Congestion Control with Time-Varying Delays
Abstract—We present a framework for designing delayindependent end-to-end congestion control algorithms, where each end-user may have a different utility function. We only requir...
Konstantin Miller, Tobias Harks
IPPS
2007
IEEE
13 years 11 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
TPDS
2008
92views more  TPDS 2008»
13 years 4 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu
IPPS
2009
IEEE
13 years 11 months ago
Throughput-fairness tradeoff in Best Effort flow control for on-chip architectures
We consider two flow control schemes for Best Effort traffic in on-chip architectures, which can be deemed as the solutions to the boundary extremes of a class of utility maximi...
Fahimeh Jafari, Mohammad Sadegh Talebi, Mohammad H...
COMCOM
1999
141views more  COMCOM 1999»
13 years 4 months ago
A flow control scheme on ATM networks with max-min fairness
Asynchronous Transfer Mode (ATM) does not guarantee Quality of Service (QoS) for Available Bit Rate (ABR) service type during connection establishment. The bandwidth left for ABR ...
W. K. Lai, J.-Y. Tsai