CSFQ Core-Stateless Fair Queueing Presented by Nagaraj Shirali Choong-Soo Lee ACN: CSFQ About the Authors Ion Stoica CMU PhD degree from Carnegie Mellon ...
... 6 experiments with RED, FRED, CSFQ, DRR, Chardonnay and ... Performance of Chardonnay and Chablis is better than RED, FRED and CSFQ and comparable to DRR ...
every time you receive a packet. So: per-flow increase ~ spare / counter ... used in CSFQ (Core Stateless Fair Queueing), which we'll be hitting next time ...
If NC=1, then NA=33 looks new (and NA=66 looks old) ... Core-State Fair Queueing (CSFQ) A way to approximate fair queueing without state in core routers ...
1. Core Stateless Fair Queueing. Ion Stoica Hui Zhang Scott Shenker. CMU CMU Xerox PARC ... The purpose of this paper is to achieve congestion control by allocation of ...
This paper brings forward the concept of 'fair' allocation. ... Each RLM layer I sends 2i 4 Kbps with each receiver subscribing to the first five layers. ...
... of each new packet is computed from the inter arrival time, the length of ... Professor Bob Kinicky WPI for valuable information and advice. Ion Stoica CMU Author ...
1. Network Border Patrol: Preventing Congestion Collapse and Promoting Fairness in the Internet ... NBP is able to prevent congestion collapse from undelivered packets ...
only affects sustained overloads. Packet drop probability is a function of mean queue length ... ECN will work with any scheme. Not clear the solution is in the ...
XCP: Congestion Control for High Bandwidth-Delay Product Network. Dina Katabi, Mark Handley and Charlie Rohrs. Presented by Ao-Jan Su. Outline. Introduction ...
Network Border Patrol Celio Albuquerque, Brett J. Vickers and Tatsuya Suda Jaideep Vaidya CS590F Fall 2000 Need End to End Congestion Control / Avoidance Mechanisms ...
1. Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth ... Each RLM layer I sends 2i 4 Kbps with each receiver subscribing to the first five layers. ...
Round Trip Time. Congestion Window. Feedback = - 0.3 packet. How ... Spare ... with the lowest Fi at any given time. How do you compute Fi? Delay Allocation ...
Computer Science Division. Department of Electrical Engineering and Computer Sciences ... A flow can receive at most the fair rate, i.e., min(f, ri) 17. Example ...
No per-flow state in routers. Assumes that hosts will cooperate' ... Window of size Kc. A' C in window = Congested Link. A' C in window = Uncongested Link ...
A randomly chosen packet more likely from the unresponsive flow. Adversary can't fool the system ... State requirement on the order of # of unresponsive flows ...
Router Congestion Control: RED, ECN, and XCP Where we left off Signal of congestion: Packet loss Fairness: Cooperating end-hosts using AIMD Next lecture: Enforcement ...
Bitwise round robin among all queues. Why not simple round robin? ... Multiple flows: clock ticks when a bit from all active flows is transmitted a 'round' ...
Copy two bit flags (ITR,DTR) between IP header and TCP header ... ( ITR, DTR flag) Introduce a timer for periodical update of target rate. EECS, Seoul Nat'l Univ. ...
if receiver detects loss, it sends back the last nonce it received. Why cumulative? ... Adding a nonce solves problem efficiently. must modify sender and receiver ...
change IP (routers, headers, addressing, ) Towards an Evolvable Internet Architecture IP layer Sylvia Ratnasamy (Intel Research), Scott Shenker (U.C. Berkeley/ICSI),
... the Network: The Emergence of Programmable Network Elements. Randy H. Katz ... Blue 'standard' components. Yellow components added & configured per-application ...
Theorem: System converges to optimal utilization (i.e., stable) for any link ... Utilization as a function of Delay. XCP increases proportionally to spare bandwidth ...
Rate r(t) changes per time unit by = davg Spare - Queue ... increases proportionally to spare bandwidth rather than by ... Each user pays a price per unit time ...
Traffic reports. 20% is Kazaa from Steve's PC. 50% is Kazaa from ... Specific open problem: computing traffic cluster reports in streaming fashion. June 8, 2003 ...
New generation emerging that will be more programmable. E.g., Bivio Networks ... Though classification boosting algorithms may be of interest to hardware designers ...
... flat priced models, and best-effort services ... Given b,r,R and per-hop delay d ... Token bucket: limits input to specified Burst Size (b) and Average Rate (r) ...
This work is partly funded by Trilogy, a research project ... Matt Mathis, Bob Briscoe, Michael Welzl, Mark Handley, Gorry Fairhurst, Hannes Tschofenig, ...
... takes some portion of packets traversing the network and examines them for ... always used (this makes it easier to know how packets will traverse the network) ...
Successfully operates under a wide range of loading conditions ... Unanticipated traffic surges render the network unmanageable (and may cause routers to fail) ...
Source: http://www.dante.net/ten-34/ten34net.gif. APAN ... Source: http://jean-luc.ncsa.uiuc.edu/Movies/Images ... Watch TV programs on your PC and lap top ...
Origin misconfiguration: accidentally inject routes for prefixes into global BGP ... New configuration not saved to stable storage (separate command and no autosave! ...
Applying the Philosophy: Early Experience with Specific Approaches ... diagnosis, prediction, novelty detection, outlier detection, quantile estimation, ...
Present basic concepts and general work plan of our Draft NSF Proposal ... surges rendering campus network unmanageable due to control plane starvation ...