1 Probabilistic Packet Scheduling (PPS) Ming Zhang, Randy Wang, Larry Peterson, Arvind Krishnamurthy Department of Computer Science Princeton University.

Slides:

Advertisements

Similar presentations

1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.

Advertisements

RED Enhancement Algorithms By Alina Naimark. Presented Approaches Flow Random Early Drop - FRED By Dong Lin and Robert Morris Sabilized Random Early Drop.

TCP Vegas: New Techniques for Congestion Detection and Control.

WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.

Modeling Differentiated Services -- the first step Martin May Jean-Chrysostome Bolot Alain Jean-Marie Christophe Diot.

Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.

CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.

CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.

Router-assisted congestion control Lecture 8 CS 653, Fall 2010.

Network Border Patrol Celio Albuquerque, Brett J. Vickers and Tatsuya Suda Jaideep Vaidya CS590F Fall 2000.

Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.

Ion Stoica, Scott Shenker, and Hui Zhang SIGCOMM’98, Vancouver, August 1998 subsequently IEEE/ACM Transactions on Networking 11(1), 2003, pp Presented.

XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.

1 Core Stateless Fair Queueing Ion Stoica Hui Zhang Scott Shenker CMU CMU Xerox PARC CMU CMU Xerox PARC.

1 Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Core-Stateless Fair Queueing:

The War Between Mice and Elephants Liang Guo and Ibrahim Matta Boston University ICNP 2001 Presented by Thangam Seenivasan 1.

The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP

Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.

1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, All our slides and papers.

Generalized Processing Sharing (GPS) Is work conserving Is a fluid model Service Guarantee –GPS discipline can provide an end-to-end bounded- delay service.

Proportional Bandwidth Allocation in DiffServ Networks Usman Raza Chohan

ACN: IntServ and DiffServ1 Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook “ Computer.

Congestion Control and Resource Allocation

A & M University1 Design, and Evaluation of a Partial State Router Phani Achanta A. L. Narasimha Reddy Dept. of Electrical Engineering.

1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,

1 Probabilistic Packet Scheduling (PPS): Achieving Proportional Share Bandwidth Allocation for TCP Flows Ming Zhang, Randy Wang, Larry Peterson Department.

Endpoint Admission Control WebTP Presentation 9/26/00 Presented by Ye Xia Reference: L. Breslau, E. W. Knightly, S. Shenkar, I. Stoica, H. Zhang, “Endpoint.

1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.

SACRIO - An Active Buffer Mangement Scheme for Differentiaed Services Networks Saikrishnan Gopalakrishnan Cisco Systems Narasimha Reddy Texas A & M University.

Computer Networking Lecture 17 – Queue Management As usual: Thanks to Srini Seshan and Dave Anderson.

1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,

Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.

Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.

UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.

1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,

Grid simulation (AliEn) Network data transfer model Eugen Mudnić Technical university Split -FESB.

Multicast Congestion Control in the Internet: Fairness and Scalability

Integrated Services (RFC 1633) r Architecture for providing QoS guarantees to individual application sessions r Call setup: a session requiring QoS guarantees.

1 Liquid Software Larry Peterson Princeton University John Hartman University of Arizona

INFOCOM A Receiver-Driven Bandwidth Sharing System (BWSS) for TCP Puneet Mehra, Avideh Zakhor UC Berkeley, USA Christophe De Vleeschouwer Université.

1 MaxNet and TCP Reno/RED on mice traffic Khoa Truong Phan Ho Chi Minh city University of Technology (HCMUT)

Advance Computer Networking L-5 TCP & Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan.

ACN: CSFQ1 CSFQ Core-Stateless Fair Queueing Presented by Nagaraj Shirali Choong-Soo Lee ACN: CSFQ1.

Korea Advanced Institute of Science and Technology Network Systems Lab. 1 Dual-resource TCP/AQM for processing-constrained networks INFOCOM 2006, Barcelona,

Worcester Polytechnic Insitute, Worcester, MA, USA1 Traffic Sensitive Active Queue Management for Improved Multimedia Streaming Authors: Vishal Phirke,

Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.

Presented by: Peng Wang EE Department University of Delaware A Probabilistic Approach for Achieving Fair Bandwidth Allocation in CSFQ.

15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.

Florida State UniversityZhenhai Duan1 BCSQ: Bin-based Core Stateless Queueing for Scalable Support of Guaranteed Services Zhenhai Duan Karthik Parsha Department.

CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.

Exploiting Spectral Reuse in Resource Allocation, Scheduling,and Routing for IEEE Mesh Networks Lien-Wu Chen, Yu-Chee Tseng Department of Computer.

Lecture 8: Lottery Scheduling 1. Class Plan Lottery scheduling: – Motivation – Solution proposed Group work and answers on: – Implementation issues: challenges?

We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.

1 Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Core-Stateless Fair Queueing:

1 Network Simulation and Testing Polly Huang EE NTU

XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science

CS492B Project #2 TCP Tutorial # Jin Hyun Ju.

Achievable Service Differentiation with Token Bucket Marking for TCP S. Sahu, D.Towsley University of Massachusetts P. Nain INRIA C. Diot Sprint Labs V.

A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.

A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.

1 May 13, 2004 IFIP Networking 2004 L ink-Based Fair Aggregation: A Simple Approach to Scalable Support of Per-Flow Service Guarantees Yuming Jiang Centre.

Internet Quality of Service

Corelite Architecture: Achieving Rated Weight Fairness

Simulation and Exploration of

Queue Dynamics with Window Flow Control

Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Ion Stoica, Scott Shenker, and Hui.

Columbia University in the city of New York

Multi-hop Coflow Routing and Scheduling in Data Centers

EE 122: Differentiated Services

Presentation transcript:

1 Probabilistic Packet Scheduling (PPS) Ming Zhang, Randy Wang, Larry Peterson, Arvind Krishnamurthy Department of Computer Science Princeton University

2 Motivation – Lottery Scheduling OS defines currency and assigns lottery tickets to processes Processes proportionally divide CPU cycles A Process can make local CPU allocation decision 900 OS P1P2 P4P5P

3 Proportional Bandwidth Allocation Router defines currency in tickets/s and assigns tickets to its inputs Link maintains currency exchange rate Bandwidth at bottleneck is proportional to ticket share Local bandwidth allocation decision and isolation 2Mb/s 900t/s 1Mb/s 300t/s B 10Mb/s 500t/s A 10Mb/s 1000t/s C 10Mb/s 1000t/s 1Mb/s 2000t/s S0 S1 S3 S2 S4 S5S6

4 Algorithm in Brief TCP source tags tickets on each packet Each router runs a variant of RED to decide whether to drop or accept a packet Relabel packets at each link based on currency exchange rate

5 Ticket Tagging OutTktRate – t/s assigned to a TCP source AvgRate - average throughput of a flow Tag OutTktRate / AvgRate onto each packet Tickets on packet are inversely proportional to the average throughput

6 Ticket-based RED (TRED) InTkt is the tickets on an incoming packet. ExpectTkt is the tickets “should” be on an incoming packet ExpectTkt is computed as average tickets on all incoming packets Bottlenecked flows put approximately ExpectTkt tickets on their packets If MinThresh < AvgQLen < MaxThresh compute probability p the same as in RED p’ = p * (ExpectTkt / InTkt) 3 drop the packet with probability p’

7 Exchange Rate A multi-hop flow may go through many routers Different routers have their own currencies Convert tickets between different currencies Exchange rate at each link XRate = OutTktRate / InTktRate Relabel packets according to exchange rate OutTkt = InTkt * XRate

8 Receiver-based Algorithm Controlling bandwidth allocation at receiver AckOutTktRate – t/s assigned to an output Tagging and relabeling of ACKs are similar Compute OutTktRate from tickets on ACKs OutTktRate = AckInTktRate

9 One-Hop Configuration 4.65Mb/s 26ms P Q 100t/s 200t/s 3000t/s Simulations are run in NS-2 Sender-based and receiver-based

10 One-Hop Results

11 Multi-Hop Configuration 1.65Mb/s 26ms A1 A2 A10 P1 P2 P4S2 B1 B2 B10 P3 S1 S t/s 11000t/s 100t/s 200t/s 1000t/s 100t/s 200t/s 1000t/s

12 Multi-Hop Results

13 Fairly Share Unused Bandwidth

S8 S Mb/s ? Mb/s 10 Mb/s 3Mb/s 10Mb/s B S0 S1 S4 S3 S5 S6S7 A 10Mb/s 1.2Mb/s 1000 S C 10Mb/s 10Mb/s D 1200 Multiple Bottlenecks Configuration

15 Multiple Bottlenecks Results FlowMeasured (Mb/s) Expected (Mb/s) Measured (Mb/s) Expected (Mb/s) A B C D

16 Comparison with CSFQ

17 One-Hop Configuration 4.65Mb/s 26ms P Q 100t/s 200t/s 3000t/s

18 One-Hop Results

19 Related Work WFQ, IntServ DiffServ CSFQ User-share differentiation

20 Conclusion and Future Work Proportional bandwidth allocation A modified RED algorithm (TRED), no per-flow state, scalable Routers make local bandwidth allocation and isolation Sender-based and receiver-based Experiment with more realistic traffic load and complex topologies