Sciweavers

1212 search results - page 59 / 243
» Fairness in Peer-to-Peer Networks
Sort
View
ICCCN
2008
IEEE
14 years 4 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
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
Hisashi Koga
FOCS
2000
IEEE
14 years 2 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
ICDCSW
2006
IEEE
14 years 4 months ago
Fair Dice: A Tilt and Motion-Aware Cube with a Conscience
As an example of digital augmentation of a tiny object, a small cube-sized die is presented that perceives and records what face it rolls on. It is thus able to detect bias and co...
Kristof Van Laerhoven, Hans-Werner Gellersen
WIOPT
2010
IEEE
13 years 8 months ago
On the use of packet scheduling in self-optimization processes: Application to coverage-capacity optimization
—Self-organizing networks (SON) is commonly seen as a way to increase network performance while simplifying its management. This paper investigates Packet Scheduling (PS) in the ...
Richard Combes, Zwi Altman, Eitan Altman