Sciweavers

56 search results - page 2 / 12
» Core-stateless fair rate estimation fair queuing
Sort
View
INFOCOM
2002
IEEE
14 years 13 days ago
Self-Verifying CSFQ
— Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that ha...
Ion Stoica, Hui Zhang, Scott Shenker
INFOCOM
2007
IEEE
14 years 1 months ago
Multimodal Congestion Control for Low Stable-State Queuing
— To discover an efficient fair sending rate for a flow, Transmission Control Protocol (TCP) saturates the bottleneck link and its buffer until the router discards a packet. Su...
Maxim Podlesny, Sergey Gorinsky
TPDS
2008
92views more  TPDS 2008»
13 years 7 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
PODC
2006
ACM
14 years 1 months ago
Adversarial queuing on the multiple-access channel
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A....
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 10 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield