Sciweavers

472 search results - page 32 / 95
» Quick-release Fair Scheduling
Sort
View
MOBIHOC
2003
ACM
14 years 2 months ago
Improving fairness among TCP flows crossing wireless ad hoc and wired networks
In scenarios where wireless ad hoc networks are deployed, sometimes it would be desirable that ad hoc nodes can communicate with servers in wired networks to upload or download da...
Luqing Yang, Winston Khoon Guan Seah, Qinghe Yin
SIGMETRICS
2010
ACM
178views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Optimality, fairness, and robustness in speed scaling designs
System design must strike a balance between energy and performance by carefully selecting the speed at which the system will run. In this work, we examine fundamental tradeoffs i...
Lachlan L. H. Andrew, Minghong Lin, Adam Wierman
ICCCN
2008
IEEE
14 years 3 months ago
Work-Conserving Fair-Aggregation with Rate-Independent Delay
—Flow aggregation has been proposed as a technique to improve the scalability of QoS scheduling in the core of the Internet, by reducing the amount of per-flow state necessary a...
Jorge Arturo Cobb
ICCCN
2007
IEEE
14 years 3 months ago
Work-Conserving Fair-Aggregation Across Multiple Core Networks
—In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, Flow Aggregation outperforms Dynamic Packet State...
Jorge Arturo Cobb, Zhe Xu
FOCS
2000
IEEE
14 years 1 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg