Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

CN
2006

favoriteEmaildiscussreport

69views more CN 2006»

A distributed utility max-min flow control algorithm

13 years 4 months ago

A distributed utility max-min flow control algorithm

Download netsys.kaist.ac.kr

A fair allocation of utility (application-layer performance) is essential in providing QoS (Quality of Service) guarantee. However, there have been few researches in the literature of utility-fair network resource allocation scheme. In this paper, we propose a distributed utility max

Hyang-Won Lee, Song Chong

Real-time Traffic

Algorithm | Bottleneck Links | CN 2006 | Single Bottleneck Link |

claim paper

Related Content

» Utility MaxMin Fair Congestion Control with TimeVarying Delays

» MaxMin Fair Bandwidth Allocation Algorithms for Packet Switches

» MaxMin Fair Scheduling in InputQueued Switches

» Throughputfairness tradeoff in Best Effort flow control for onchip architectures

» A flow control scheme on ATM networks with maxmin fairness

» A Rate Allocation Policy with MCRPCR Support and Distributed ABR Implementation Using Expl...

» Utilitybased asynchronous flow control algorithm for wireless sensor networks

» Fair sampling across network flow measurements

» MaxNet Faster Flow Control Convergence

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CN
Authors	Hyang-Won Lee, Song Chong

Comments (0)