Sciweavers

9 search results - page 1 / 2
» Rate-proportional servers a design methodology for fair queu...
Sort
View
66
Voted
TON
1998
63views more  TON 1998»
14 years 9 months ago
Rate-proportional servers a design methodology for fair queueing algorithms
Dimitrios Stiliadis, Anujan Varma
SIGCOMM
1996
ACM
15 years 1 months ago
Hierarchical Packet Fair Queueing Algorithms
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
Jon C. R. Bennett, Hui Zhang
MOBICOM
2003
ACM
15 years 2 months ago
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Significant TCP unfairness in ad hoc wireless networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and ...
Kaixin Xu, Mario Gerla, Lantao Qi, Yantai Shu
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase
MTA
2002
110views more  MTA 2002»
14 years 9 months ago
Fundamentals of Scheduling and Performance of Video Tape Libraries
Robotic tape libraries are popular for applications with very high storage requirements, such as video servers. Here, we study the throughput of a tape library system, we design a...
Costas Georgiadis, Peter Triantafillou, Christos F...