Sciweavers

546 search results - page 75 / 110
» Network Information Flow in Network of Queues
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
13 years 7 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
SIGCOMM
1999
ACM
14 years 17 hour ago
Load-Sensitive Routing of Long-Lived IP Flows
Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet and wide fluctuations in the underlying traffic pa...
Anees Shaikh, Jennifer Rexford, Kang G. Shin
SIGCOMM
2012
ACM
11 years 10 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
INFOCOM
2012
IEEE
11 years 10 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 7 months ago
Polymatroids with Network Coding
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
Te Sun Han