Dynamic-CBT Better Performing Active Queue Management for Multimedia Networking Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic.

Slides:



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

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Computer Networks Transport Layer. Topics F Introduction (6.1)  F Connection Issues ( ) F TCP (6.4)
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
Leon-Garcia & Widjaja: Communication Networks Copyright ©2000 The McGraw Hill Companies A Little More on Chapter 7 And Start Chapter 8 TCP/IP.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Networks: Congestion Control1 Congestion Control.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Packet Scheduling and QoS Computer Science Division Department of Electrical Engineering and.
1 Traffic Sensitive Quality of Service Controller Masters Thesis Submitted by :Abhishek Kumar Advisors: Prof Mark Claypool Prof Robert Kinicki Reader:
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Rate-Based Active Queue Management with Priority Classes for Better Video Transmission Jae Chung and Mark Claypool Computer Science Department Worcester.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
Dynamic-CBT and ChIPS – Router Support for Improved Multimedia Performance on the Internet Jae Chung and Mark Claypool Computer Science Department Worcester.
Stochastic Fair Traffic Management for Efficient and Robust IP Networking Jae Chung Airvana Inc. Chelmsford, MA Mark Claypool, Robert Kinicki WPI.
Dynamic-CBT and ChIPS - Router Support for Improved Multimedia Performance on the Internet Jae Chung and Mark Claypool Department of Computer Science WPI.
Active Queue Management Rong Pan Cisco System EE384y Spring Quarter 2006.
Better-Behaved Better- Performing Multimedia Networking Jae Chung and Mark Claypool (Avanish Tripathi) Computer Science Department Worcester Polytechnic.
ACN: Congestion Control1 Congestion Control and Resource Allocation.
Random Early Detection Gateways for Congestion Avoidance
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Lightweight Active Router-Queue Management for Multimedia Networking M. Parris, K. Jeffay, and F.D. Smith Department of Computer Science University of.
Better Behaved, Better Performing Multimedia Networking Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Proceedings.
Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA.
February 7, 2003BU Computer Science Colloquium Crimson - Traffic Aware Active Queue Management Mark Claypool CS Department Worcester Polytechnic Institute.
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
Performance Evaluation of PISA and PI using NS simulations Presented by Brad Burres Yatin Manjrekar.
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Quality of Service (QoS)
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Oppenheimer.
ACN: CSFQ1 CSFQ Core-Stateless Fair Queueing Presented by Nagaraj Shirali Choong-Soo Lee ACN: CSFQ1.
Link Scheduling & Queuing COS 461: Computer Networks
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Beyond Best-Effort Service Advanced Multimedia University of Palestine University of Palestine Eng. Wisam Zaqoot Eng. Wisam Zaqoot November 2010 November.
Worcester Polytechnic Insitute, Worcester, MA, USA1 Traffic Sensitive Active Queue Management for Improved Multimedia Streaming Authors: Vishal Phirke,
1 Congestion Control Computer Networks. 2 Where are we?
9.7 Other Congestion Related Issues Outline Queuing Discipline Avoiding Congestion.
Network Support for QoS – DiffServ and IntServ Hongli Luo CEIT, IPFW.
15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.
Analysis of QoS Arjuna Mithra Sreenivasan. Objectives Explain the different queuing techniques. Describe factors affecting network voice quality. Analyse.
Efficient Cache Structures of IP Routers to Provide Policy-Based Services Graduate School of Engineering Osaka City University
CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.
Mr. Mark Welton.  Quality of Service is deployed to prevent data from saturating a link to the point that other data cannot gain access to it  QoS allows.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 18: Quality of Service Slides used with.
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.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Weighted Fair Queuing Some slides used with.
CATNIP – Context Aware Transport/Network Internet Protocol Carey Williamson Qian Wu Department of Computer Science University of Calgary.
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
Lect1..ppt - 01/06/05 CDA 6505 Network Architecture and Client/Server Computing Lecture 3 TCP and IP by Zornitza Genova Prodanoff.
Chapter 3 TCP and IP 1 Chapter 3 TCP and IP. Chapter 3 TCP and IP 2 Introduction Transmission Control Protocol (TCP) User Datagram Protocol (UDP) Internet.
Chapter 3 TCP and IP Chapter 3 TCP and IP.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Queue Management Jennifer Rexford COS 461: Computer Networks
Congestion Control and Resource Allocation
Cisco Real Exam Dumps IT-Dumps
EE 122: Router Support for Congestion Control: RED and Fair Queueing
Quality of Service in the Internet
Random Early Detection Gateways for Congestion Avoidance
Congestion Control for Streaming Media
The War Between Mice & Elephants by, Matt Hartling & Sumit Kumbhar
Project-2 (20%) – DiffServ and TCP Congestion Control
Congestion Control and Resource Allocation
Review of Internet Protocols Transport Layer
Presentation transcript:

Dynamic-CBT Better Performing Active Queue Management for Multimedia Networking Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA

Outline  Introduction  CBT  D-CBT  Evaluation  Issues

Internet Routers Today n Volume of traffic increasing n More simultaneous active flows n Increase in multimedia flows –Tight timing constraints –Different flow-control mechanism than TCP n Emphasis on Congestion Control and Fairness among active flows

Current Router Queue Mgmt Drop Tail (FIFO) Resource Reservation... (Lin, Morris ‘97) Congestion handling? Fairness (tcp, other)? Support QoS? FRED Active Queue Mgmt... Class-Based Threshold (CBT) Class-Based Threshold (CBT) ( Floyd, Jacobson ‘95) CBQ ( Floyd, Jacobson ‘93) RED (Parris, Jeffay, Smith ‘99)

CBT Design

CBT - Pros and Cons n Pros: RED + Class-Based Isolation –Early congestion notification –Protect TCP and protect Tagged UDP (MM) –Different classes of flows coexist with predefined fairness n Cons: CBQ function w/o admission control – Fairness for changing traffic mixes – Utilization on outgoing link – Changes “Best-Effort” nature of Internet

Dynamic-CBT (D-CBT) Drop Tail (FIFO) Resource Reservation... CBQ RED FRED Active Queue Mgmt... Class-Based Threshold (CBT) Class-Based Threshold (CBT) Dynamic-CBT

D-CBT Design RED TCP Untagged UDP Tagged UDP (MM) Calc Thrsh Thrsh * Test Calc Thrsh Thrsh * Test Early Drop Test Queue Manager * Threshold Test is activated when red_avg > red_min Classify Count Active Flows In Each Class Update Class Avgs & RED Avg

Evaluation using NS n Developed a flow-controlled Multimedia Application (for tagged UDP class) –AIMD Media Scaling (5 discrete rates) –“MPEG-1 like” transmission rates n Implemented and validated CBT n Implemented D-CBT and measured congestion time fairness –RED vs. CBT vs. D-CBT

Simulation (RED, CBT, D-CBT) FTP-TCP 30 FTP-TCP 2 CBR-UDP (5Mbps each) 10 MM-UDP s1 n1 s2 s66 s67 n2 r2 r66 r67 25Mbps, 20ms 25Mbps, 5ms n1-n2: q_size = 60 RED: max_th = 15 min_th = 5 qweight = max_prb = 0.1 CBT: mmu_th = 2.9 udp_th = 0.6 Second

Fairness: RED

Fairness: CBT

Fairness: D-CBT

D-CBT Issues n Tagging UDP packets –Who tags packets? (End Host? ISP?) –Which field of IP header to use? IPv4: Unused Bit in Type-Of-Service Field IPv4: Another Protocol in Protocol Field IPv6: Use Priority Field n Define a flow –IPv4: Source-Destination Address –IPv6: Plus Flow-ID

D-CBT Issues n Active Flow Counting (Overhead) –For every incoming packet, insert or update info and update count Hash Table - O(1) –Every  ms, delete old flows and update count Hash Table - O(n) –Measure Active Flow Counting overheads: Linux implementation Processing Time and Memory Usage

D-CBT Issues n Test D-CBT with other (available) flow- controlled MM Applications –Effect of the thresholds on MM quality n Sensitivity of D-CBT to RED parameters n How many different classes are needed? –Example 1 class is RED 1 class per flow is FRED –Overhead per class