Packet Scheduling and QoS

Size: px
Start display at page:

Download "Packet Scheduling and QoS"

Transcription

1 Packet Scheduling and QoS EECS 489 Computer Networks Z. Morley Mao Thursday Oct 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1

2 Packet Scheduling Decide when and what packet to send on output link - Usually implemented at output interface of a router flow 1 1 Classifier flow 2 Scheduler 2 flow n Buffer management 2

3 Goals of Packet Scheduling Provide per flow/aggregate QoS guarantees in terms of delay and bandwidth Provide per flow/aggregate protection Flow/Aggregate identified by a subset of following fields in the packet header - source/destination IP address (32 bits) - source/destination port number (16 bits) - protocol type (8 bits) - type of service (8 bits) Examples: - All packets from machine A to machine B - All packets from UMich - All packets between UMich and MIT - All TCP packets from EECS-UMich 3

4 Outline QoS guarantees Link sharing Service curve (short) 4

5 Recap: Token Bucket and Arrival Curve Parameters - r average rate, i.e., rate at which tokens fill the bucket - b bucket depth - R maximum link capacity or peak rate (optional parameter) A bit is transmitted only when there is an available token Arrival curve maximum number of bits transmitted within an interval of time of size t r bps bits Arrival curve b bits b*r/(r-r) slope R slope r <= R bps regulator time 5

6 How Is the Token Bucket Used? Can be enforced by - End-hosts (e.g., cable modems) - Routers (e.g., ingress routers in a Diffserv domain) Can be used to characterize the traffic sent by an end-host 6

7 Source Traffic Characterization Arrival curve maximum amount of bits transmitted during an interval of time?t Use token bucket to bound the arrival curve bps bits Arrival curve time?t 7

8 Source Traffic Characterization: Example Arrival curve maximum amount of bits transmitted during an interval of time?t Use token bucket to bound the arrival curve bits (R=2,b=1,r=1) Arrival curve bps time ?t 8

9 QoS Guarantees: Per-hop Reservation End-host: specify - the arrival rate characterized by token-bucket with parameters (b,r,r) - the maximum maximum admissible delay D Router: allocate bandwidth r a and buffer space B a such that - no packet is dropped - no packet experiences a delay larger than D slope r a bits slope r Arrival curve b*r/(r-r) B a D 9

10 Packet Scheduling Make sure that at any time the flow receives at least the allocated rate r a The canonical example of such scheduler: Weighted Fair Queueing (WFQ) 10

11 Recap: Fair Queueing Implements max-min fairness: each flow receives min(r i, f), where - r i flow arrival rate - f link fair rate (see next slide) Weighted Fair Queueing (WFQ) associate a weight with each flow 11

12 Fair Rate Computation: Example 1 If link congested, compute f such that min( ri, f ) = i C f = 4: min(8, 4) = 4 min(6, 4) = 4 min(2, 4) = 2 12

13 Fair Rate Computation: Example 2 Associate a weight w i with each flow i If link congested, compute f such that min( ri, f wi ) = i C (w 1 = 3) (w 2 = 1) (w 3 = 1) f = 2: min(8, 2*3) = 6 min(6, 2*1) = 2 min(2, 2*1) = 2 Flow i is guaranteed to be allocated a rate >= wi*c/(s k w k ) If S k w k <= C, flow i is guaranteed to be allocated a rate >= w i 13

14 Fluid Flow System Flows can be served one bit at a time WFQ can be implemented using bit-by-bit weighted round robin - During each round from each flow that has data to send, send a number of bits equal to the flow s weight 14

15 Fluid Flow System: Example 1 Flow 1 (w 1 = 1) 100 Kbps Packet Size (bits) Packet inter-arrival time (ms) Rate (Kbps) Flow Flow 2 (w 2 = 1) Flow Flow 1 (arrival traffic) time Flow 2 (arrival traffic) time Service in fluid flow system time (ms) 15

16 Fluid Flow System: Example 2 Red flow has packets backlogged between time 0 and 10 - Backlogged flow flow s queue not empty Other flows have packets continuously backlogged All packets have the same size flows weights link

17 Implementation In Packet System Packet (Real) system: packet transmission cannot be preempted. Why? Solution: serve packets in the order in which they would have finished being transmitted in the fluid flow system 17

18 Packet System: Example 1 Service in fluid flow system time (ms) Select the first packet that finishes in the fluid flow system Packet system time 18

19 Packet System: Example 2 Service in fluid flow system Select the first packet that finishes in the fluid flow system Packet system

20 Implementation Challenge Need to compute the finish time of a packet in the fluid flow system but the finish time may change as new packets arrive! Need to update the finish times of all packets that are in service in the fluid flow system when a new packet arrives - But this is very expensive; a high speed router may need to handle hundred of thousands of flows! 20

21 Example Four flows, each with weight 1 Flow 1 Flow 2 Flow 3 Flow 4 e Finish times computed at time 0 time time time time Finish times re-computed at time e time time 21

22 Solution: Virtual Time Key Observation: while the finish times of packets may change when a new packet arrives, the order in which packets finish doesn t! - Only the order is important for scheduling Solution: instead of the packet finish time maintain the number of rounds needed to send the remaining bits of the packet (virtual finishing time) - Virtual finishing time doesn t change when the packet arrives System virtual time index of the round in the bit-by-bit round robin scheme 22

23 System Virtual Time: V(t) Measure service, instead of time V(t) slope normalized rate at which every backlogged flow receives service in the fluid flow system - C link capacity - N(t) total weight of backlogged flows in fluid flow system at time t V(t) V ( t ) t = C N ( t ) time Service in fluid flow system time 23

24 System Virtual Time (V(t)): Example 1 V(t) increases inversely proportionally to the sum of the weights of the backlogged flows Flow 1 (w1 = 1) Flow 2 (w2 = 1) time time V(t) C/2 C 24

25 System Virtual Time: Example w1 = 4 w2 = 1 w3 = 1 w4 = 1 w5 = 1 V(t) C/4 C/8 C/

26 Fair Queueing Implementation Define k F i a i k L i - - virtual finishing time of packet k of flow i k - - arrival time of packet k of flow i - - length of packet k of flow i - w i weight of flow i The finishing time of packet k+1 of flow i is k + 1 k + 1 k k + 1 F i = max( V ( a i ), Fi ) + Li / w i 26

27 Properties of WFQ Guarantee that any packet is transmitted within packet_lengt/link_capacity of its transmission time in the fluid flow system - Can be used to provide guaranteed services Achieve max-min fair allocation - Can be used to protect well-behaved flows against malicious flows 27

28 Outline QoS guarantees Link sharing Service curve (short) 28

29 Hierarchical Link Sharing Link Provider 1 Provider 2 Berkeley Stanford. 155 Mbps 100 Mbps 55 Mbps 50 Mbps 50 Mbps 20 Mbps 10 Mbps EECS Math Campus Resource contention/sharing at different levels Resource management policies should be set at different levels, by different entities - Resource owner - Service providers - Organizations - Applications seminar video seminar audio WEB 29

30 Hierarchical WFQ (H-WFQ) Example Red session has packets backlogged at time 5 Other sessions have packets continuously backlogged First red packet arrives at 5 and it is served at 7.5 Service in fluid flow system

31 Packet Approximation of H-WFQ Fluid Flow H-WFQ 10 WFQ 6 4 WFQ WFQ WFQ WFQ WFQ 1 Packetized H-WFQ 10 WFQ 6 4 WFQ WFQ 2 3 WFQ WFQ WFQ Idea 1 - Select packet finishing first in H-WFQ assuming there are no future arrivals - Problem: Idea 2 Finish order in system dependent on future arrivals Virtual time implementation won t work - Use a hierarchy of WFQ to approximate H-WFQ 31

32 Problems with Idea 1 The order of the 4 th blue packet finish time and of the first green packet finish time changes as a result of a red packet arrival Make decision here 4 1 Green packet finish first Blue packet finish first 32

33 Problem with Idea 2 A packet on the second level can miss its deadline (finish time) First level packet schedule Second level packet schedule First red packet arrives at 5 but it is served at 11! 33

34 Solution Hierarchical-WFQ with a better implementation of WFQ, called Worst-Case Weighted Fair Queueing (WF2Q) Main idea of WF2Q - Consider for scheduling only eligible packets - Eligible packet at time t: a packet that has started being serviced in the fluid flow system at time t 34

35 Example Fluid-Flow System WFQ (smallest finish time first) WF2Q (smallest eligible finish time first) 35

36 Hierarchical-WF2Q Example In WF2Q, all packets meet their deadlines modulo time to transmit a packet (at the line speed) at each level First level packet schedule Second level packet schedule First red packet arrives at 5..and it is served at 7 36

37 Outline QoS guarantees Link sharing Service curve (short) 37

38 Bandwidth-Delay Coupling Assume - An arrival curve specified by token bucket (R, r, b) - A reservation request (r min, D), where r min minimum bandwidth, D maximum delay WFQ can be inefficient: to satisfy delay D, the allocated rate r a may need to be much higher than r! slope r a bits slope r Arrival curve b*r/(r-r) D 38

39 Example End-host: request a worst-case delay D=10ms for a flow characterized by token bucket (R=1Mbps, b=10kb, r=100kbps) Router: allocate rate r a, where r a = b*r / (D*(R-r) + b) = 0.52Mbps Thus, the router needs to allocate to the flow more than 5 times its average rate r! 39

40 Solution: Service Curve Generalize the service allocated to a flow - Assume a flow that is idle at time s and it is backlogged during the interval (s, t) - Service curve: the minimum service received by the flow during the interval (s, t) bits Arrival Curve D B S (t) = service curve t WFQ implements a linear service curve 40

41 Linear Service Curves: Example Service curves bits Video bits FTP Arrival process t t Arrival traffic Service bits bits t bits bits t t Video packets have to wait after ftp packets t t 41

42 Non-Linear Service Curves: Example Service curves bits Video bits FTP Arrival process t t bits bits Arrival traffic bits t bits t Service t t Video packets transmitted as soon as they arrive t 42

43 What You Need to Know Basic concepts - Arrival & service curve - Token-bucket specification - System virtual time / finish virtual time - WFQ properties - Link sharing requirements and challenges - Bandwidth-delay coupling problem Mechanisms: - WFQ implementation in the fluid flow & packet system You don t need to know - Details of WF2Q - How service curve works 43

COMP/ELEC 429/556 Introduction to Computer Networks

COMP/ELEC 429/556 Introduction to Computer Networks COMP/ELEC 429/556 Introduction to Computer Networks Weighted Fair Queuing Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu

More information

of-service Support on the Internet

of-service Support on the Internet Quality-of of-service Support on the Internet Dept. of Computer Science, University of Rochester 2008-11-24 CSC 257/457 - Fall 2008 1 Quality of Service Support Some Internet applications (i.e. multimedia)

More information

Topic 4b: QoS Principles. Chapter 9 Multimedia Networking. Computer Networking: A Top Down Approach

Topic 4b: QoS Principles. Chapter 9 Multimedia Networking. Computer Networking: A Top Down Approach Topic 4b: QoS Principles Chapter 9 Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross Pearson/Addison Wesley April 2016 9-1 Providing multiple classes of service thus far: making

More information

Overview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services

Overview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services Overview 15-441 15-441 Computer Networking 15-641 Lecture 19 Queue Management and Quality of Service Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 What is QoS? Queuing discipline and scheduling

More information

Network Layer Enhancements

Network Layer Enhancements Network Layer Enhancements EECS 122: Lecture 14 Department of Electrical Engineering and Computer Sciences University of California Berkeley Today We have studied the network layer mechanisms that enable

More information

CS 268: Integrated Services

CS 268: Integrated Services Limitations of IP Architecture in Supporting Resource Management CS 268: Integrated Services Ion Stoica February 23, 2004 IP provides only best effort service IP does not participate in resource management

More information

Improving QOS in IP Networks. Principles for QOS Guarantees

Improving QOS in IP Networks. Principles for QOS Guarantees Improving QOS in IP Networks Thus far: making the best of best effort Future: next generation Internet with QoS guarantees RSVP: signaling for resource reservations Differentiated Services: differential

More information

Lecture 24: Scheduling and QoS

Lecture 24: Scheduling and QoS Lecture 24: Scheduling and QoS CSE 123: Computer Networks Alex C. Snoeren HW 4 due Wednesday Lecture 24 Overview Scheduling (Weighted) Fair Queuing Quality of Service basics Integrated Services Differentiated

More information

Master Course Computer Networks IN2097

Master Course Computer Networks IN2097 Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master

More information

Master Course Computer Networks IN2097

Master Course Computer Networks IN2097 Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for

More information

Episode 5. Scheduling and Traffic Management

Episode 5. Scheduling and Traffic Management Episode 5. Scheduling and Traffic Management Part 2 Baochun Li Department of Electrical and Computer Engineering University of Toronto Keshav Chapter 9.1, 9.2, 9.3, 9.4, 9.5.1, 13.3.4 ECE 1771: Quality

More information

Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13

Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13 Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13 Department of Electrical Engineering and Computer Sciences University of California Berkeley Review: Switch Architectures Input Queued

More information

Common network/protocol functions

Common network/protocol functions Common network/protocol functions Goals: Identify, study common architectural components, protocol mechanisms Synthesis: big picture Depth: important topics not covered in introductory courses Overview:

More information

Page 1. Quality of Service. CS 268: Lecture 13. QoS: DiffServ and IntServ. Three Relevant Factors. Providing Better Service.

Page 1. Quality of Service. CS 268: Lecture 13. QoS: DiffServ and IntServ. Three Relevant Factors. Providing Better Service. Quality of Service CS 268: Lecture 3 QoS: DiffServ and IntServ Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,

More information

Real-Time Protocol (RTP)

Real-Time Protocol (RTP) Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of

More information

Mohammad Hossein Manshaei 1393

Mohammad Hossein Manshaei 1393 Mohammad Hossein Manshaei manshaei@gmail.com 1393 Voice and Video over IP Slides derived from those available on the Web site of the book Computer Networking, by Kurose and Ross, PEARSON 2 Multimedia networking:

More information

Fairness, Queue Management, and QoS

Fairness, Queue Management, and QoS Fairness, Queue Management, and QoS 15-441 Fall 2017 Profs Peter Steenkiste & Justine Sherry Slides borrowed from folks at CMU, Berkeley, and elsewhere. YINZ I AM GETTING T-SHIRTS If you TA for me next

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) EE 122: Intro to Communication Networks Fall 2007 (WF 4-5:30 in Cory 277) Vern Paxson TAs: Lisa Fowler, Daniel Killebrew & Jorge Ortiz http://inst.eecs.berkeley.edu/~ee122/ Materials

More information

Announcements. Quality of Service (QoS) Goals of Today s Lecture. Scheduling. Link Scheduling: FIFO. Link Scheduling: Strict Priority

Announcements. Quality of Service (QoS) Goals of Today s Lecture. Scheduling. Link Scheduling: FIFO. Link Scheduling: Strict Priority Announcements Quality of Service (QoS) Next week I will give the same lecture on both Wednesday (usual ) and next Monday Same and room Reminder, no lecture next Friday due to holiday EE : Intro to Communication

More information

EP2210 Scheduling. Lecture material:

EP2210 Scheduling. Lecture material: EP2210 Scheduling Lecture material: Bertsekas, Gallager, 6.1.2. MIT OpenCourseWare, 6.829 A. Parekh, R. Gallager, A generalized Processor Sharing Approach to Flow Control - The Single Node Case, IEEE Infocom

More information

Multiplexing. Common network/protocol functions. Multiplexing: Sharing resource(s) among users of the resource.

Multiplexing. Common network/protocol functions. Multiplexing: Sharing resource(s) among users of the resource. Common network/protocol functions Goals: Identify, study common architectural components, protocol mechanisms Synthesis: big picture Depth: Important topics not covered in introductory courses Overview:

More information

Network Support for Multimedia

Network Support for Multimedia Network Support for Multimedia Daniel Zappala CS 460 Computer Networking Brigham Young University Network Support for Multimedia 2/33 make the best of best effort use application-level techniques use CDNs

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete

More information

Internet Services & Protocols. Quality of Service Architecture

Internet Services & Protocols. Quality of Service Architecture Department of Computer Science Institute for System Architecture, Chair for Computer Networks Internet Services & Protocols Quality of Service Architecture Dr.-Ing. Stephan Groß Room: INF 3099 E-Mail:

More information

Fair Queueing. Presented by Brighten Godfrey. Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey

Fair Queueing. Presented by Brighten Godfrey. Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey Fair Queueing Presented by Brighten Godfrey Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey Traditional queueing Traditional Internet - Congestion control mechanisms

More information

Internet is Based on Packet Switching. EECS 122: Introduction to Computer Networks Semester Wrap-Up. Design Principles. Recap: Course Goals

Internet is Based on Packet Switching. EECS 122: Introduction to Computer Networks Semester Wrap-Up. Design Principles. Recap: Course Goals Internet is Based on Packet Switching CS 1: Introduction to Computer s Semester Wrap-Up Node in a packet switching network incoming links Node Memory outgoing links Computer Science Division Department

More information

Advanced Computer Networks

Advanced Computer Networks Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr

More information

Lecture Outline. Bag of Tricks

Lecture Outline. Bag of Tricks Lecture Outline TELE302 Network Design Lecture 3 - Quality of Service Design 1 Jeremiah Deng Information Science / Telecommunications Programme University of Otago July 15, 2013 2 Jeremiah Deng (Information

More information

TELE Switching Systems and Architecture. Assignment Week 10 Lecture Summary - Traffic Management (including scheduling)

TELE Switching Systems and Architecture. Assignment Week 10 Lecture Summary - Traffic Management (including scheduling) TELE9751 - Switching Systems and Architecture Assignment Week 10 Lecture Summary - Traffic Management (including scheduling) Student Name and zid: Akshada Umesh Lalaye - z5140576 Lecturer: Dr. Tim Moors

More information

Week 7: Traffic Models and QoS

Week 7: Traffic Models and QoS Week 7: Traffic Models and QoS Acknowledgement: Some slides are adapted from Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition, J.F Kurose and K.W. Ross All Rights Reserved,

More information

Episode 5. Scheduling and Traffic Management

Episode 5. Scheduling and Traffic Management Episode 5. Scheduling and Traffic Management Part 3 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling

More information

Multimedia networking: outline

Multimedia networking: outline Multimedia networking: outline 9.1 multimedia networking applications 9.2 streaming stored video 9.3 voice-over-ip 9.4 protocols for real-time conversational applications: SIP Skip RTP, RTCP 9.5 network

More information

Models and Algorithms for Hierarchical Resource Management in Integrated Services Networks. Other Contributors

Models and Algorithms for Hierarchical Resource Management in Integrated Services Networks. Other Contributors Models and Algorithms for Hierarchical Resource Management in Integrated Services Networks Hui Zhang School of Computer Science University 1998 Hui Zhang 1 Other Contributors Jon Bennett Yanghua Chu Eugene

More information

Mul$media Networking. #10 QoS Semester Ganjil 2012 PTIIK Universitas Brawijaya

Mul$media Networking. #10 QoS Semester Ganjil 2012 PTIIK Universitas Brawijaya Mul$media Networking #10 QoS Semester Ganjil 2012 PTIIK Universitas Brawijaya Schedule of Class Mee$ng 1. Introduc$on 2. Applica$ons of MN 3. Requirements of MN 4. Coding and Compression 5. RTP 6. IP Mul$cast

More information

CSE 461 Quality of Service. David Wetherall

CSE 461 Quality of Service. David Wetherall CSE 461 Quality of Service David Wetherall djw@cs.washington.edu QOS Focus: How to provide better than best effort Fair queueing Application Application needs Transport Traffic shaping Guarantees IntServ

More information

The Diffie-Hellman Key Exchange

The Diffie-Hellman Key Exchange ISC: SECURITY AND QOS The Diffie-Hellman Key Exchange A mechanism to establish secret keys without the need for CAs Based on the difficulty of computing discrete logarithms of large numbers Public (or

More information

Unit 2 Packet Switching Networks - II

Unit 2 Packet Switching Networks - II Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source

More information

Quality of Service in the Internet

Quality of Service in the Internet Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

More information

Quality of Service in the Internet

Quality of Service in the Internet Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

More information

EE 122: Router Support for Congestion Control: RED and Fair Queueing. Ion Stoica Oct. 30 Nov. 4, 2002

EE 122: Router Support for Congestion Control: RED and Fair Queueing. Ion Stoica Oct. 30 Nov. 4, 2002 EE 122: Router Support for Congestion Control: RED and Fair Queueing Ion Stoica Oct. 30 Nov. 4, 2002 Router Support For Congestion Management Traditional Internet - Congestion control mechanisms at end-systems,

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive

More information

Computer Networking. Queue Management and Quality of Service (QOS)

Computer Networking. Queue Management and Quality of Service (QOS) Computer Networking Queue Management and Quality of Service (QOS) Outline Previously:TCP flow control Congestion sources and collapse Congestion control basics - Routers 2 Internet Pipes? How should you

More information

Performance Evaluation of Scheduling Mechanisms for Broadband Networks

Performance Evaluation of Scheduling Mechanisms for Broadband Networks Performance Evaluation of Scheduling Mechanisms for Broadband Networks Gayathri Chandrasekaran Master s Thesis Defense The University of Kansas 07.31.2003 Committee: Dr. David W. Petr (Chair) Dr. Joseph

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson TAs: Dilip Antony Joseph and Sukun Kim http://inst.eecs.berkeley.edu/~ee122/ Materials with

More information

Announcements. Quality of Service (QoS) Goals of Today s Lecture. Scheduling. Link Scheduling: Strict Priority. Link Scheduling: FIFO

Announcements. Quality of Service (QoS) Goals of Today s Lecture. Scheduling. Link Scheduling: Strict Priority. Link Scheduling: FIFO Announcements Homework #3 solutions now available Quality of Service (QoS) Reminder, phase of Project #3 due this Thurs evening with no slip days EE : Intro to Communication Networks Fall 006 (MW -5:30

More information

Network Model for Delay-Sensitive Traffic

Network Model for Delay-Sensitive Traffic Traffic Scheduling Network Model for Delay-Sensitive Traffic Source Switch Switch Destination Flow Shaper Policer (optional) Scheduler + optional shaper Policer (optional) Scheduler + optional shaper cfla.

More information

Resource allocation in networks. Resource Allocation in Networks. Resource allocation

Resource allocation in networks. Resource Allocation in Networks. Resource allocation Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers

More information

Queuing. Congestion Control and Resource Allocation. Resource Allocation Evaluation Criteria. Resource allocation Drop disciplines Queuing disciplines

Queuing. Congestion Control and Resource Allocation. Resource Allocation Evaluation Criteria. Resource allocation Drop disciplines Queuing disciplines Resource allocation Drop disciplines Queuing disciplines Queuing 1 Congestion Control and Resource Allocation Handle congestion if and when it happens TCP Congestion Control Allocate resources to avoid

More information

Project Computer Networking. Resource Management Approaches. Start EARLY Tomorrow s recitation. Lecture 20 Queue Management and QoS

Project Computer Networking. Resource Management Approaches. Start EARLY Tomorrow s recitation. Lecture 20 Queue Management and QoS Project 3 15-441 Computer Networking Start EARLY Tomorrow s recitation Lecture 20 Queue Management and QoS Lecture 20: QOS (c) CMU, 2005-10 2 Traffic and Resource Management Resource Management Approaches

More information

Scheduling. Scheduling algorithms. Scheduling. Output buffered architecture. QoS scheduling algorithms. QoS-capable router

Scheduling. Scheduling algorithms. Scheduling. Output buffered architecture. QoS scheduling algorithms. QoS-capable router Scheduling algorithms Scheduling Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Scheduling: choose a packet to transmit over a link among all

More information

QoS Guarantees. Motivation. . link-level level scheduling. Certain applications require minimum level of network performance: Ch 6 in Ross/Kurose

QoS Guarantees. Motivation. . link-level level scheduling. Certain applications require minimum level of network performance: Ch 6 in Ross/Kurose QoS Guarantees. introduction. call admission. traffic specification. link-level level scheduling. call setup protocol. reading: Tannenbaum,, 393-395, 395, 458-471 471 Ch 6 in Ross/Kurose Motivation Certain

More information

Lesson 14: QoS in IP Networks: IntServ and DiffServ

Lesson 14: QoS in IP Networks: IntServ and DiffServ Slide supporting material Lesson 14: QoS in IP Networks: IntServ and DiffServ Giovanni Giambene Queuing Theory and Telecommunications: Networks and Applications 2nd edition, Springer All rights reserved

More information

Overview. Lecture 22 Queue Management and Quality of Service (QoS) Queuing Disciplines. Typical Internet Queuing. FIFO + Drop tail Problems

Overview. Lecture 22 Queue Management and Quality of Service (QoS) Queuing Disciplines. Typical Internet Queuing. FIFO + Drop tail Problems Lecture 22 Queue Management and Quality of Service (QoS) Overview Queue management & RED Fair queuing Khaled Harras School of Computer Science niversity 15 441 Computer Networks Based on slides from previous

More information

Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Leaky Bucket Algorithm

Quality of Service in the Internet. QoS Parameters. Keeping the QoS. Leaky Bucket Algorithm Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:

More information

CSE 123b Communications Software

CSE 123b Communications Software CSE 123b Communications Software Spring 2002 Lecture 10: Quality of Service Stefan Savage Today s class: Quality of Service What s wrong with Best Effort service? What kinds of service do applications

More information

Episode 5. Scheduling and Traffic Management

Episode 5. Scheduling and Traffic Management Episode 5. Scheduling and Traffic Management Part 2 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling

More information

Performance Modeling

Performance Modeling Performance Modeling EECS 489 Computer Networks http://www.eecs.umich.edu/~zmao/eecs489 Z. Morley Mao Tuesday Sept 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1 Administrivia

More information

Real-Time Control Protocol (RTCP)

Real-Time Control Protocol (RTCP) Real-Time Control Protocol (RTCP) works in conjunction with RTP each participant in RTP session periodically sends RTCP control packets to all other participants each RTCP packet contains sender and/or

More information

TDDD82 Secure Mobile Systems Lecture 6: Quality of Service

TDDD82 Secure Mobile Systems Lecture 6: Quality of Service TDDD82 Secure Mobile Systems Lecture 6: Quality of Service Mikael Asplund Real-time Systems Laboratory Department of Computer and Information Science Linköping University Based on slides by Simin Nadjm-Tehrani

More information

CSCD 433/533 Advanced Networks Spring Lecture 22 Quality of Service

CSCD 433/533 Advanced Networks Spring Lecture 22 Quality of Service CSCD 433/533 Advanced Networks Spring 2016 Lecture 22 Quality of Service 1 Topics Quality of Service (QOS) Defined Properties Integrated Service Differentiated Service 2 Introduction Problem Overview Have

More information

Congestion Control Open Loop

Congestion Control Open Loop Congestion Control Open Loop Muhammad Jaseemuddin Dept. of Electrical & Computer Engineering Ryerson University Toronto, Canada References 1. A. Leon-Garcia and I. Widjaja, Communication Networks: Fundamental

More information

Scheduling (Chapter 9) Outline

Scheduling (Chapter 9) Outline Scheduling (Chapter 9) An Engineering Approach to Computer Networking S. Keshav (Based on slides of S. Keshav http://www.cs.cornell.edu/home/skeshav/book/slides/index.html and material of J. Liebeherr,

More information

048866: Packet Switch Architectures

048866: Packet Switch Architectures 048866: Packet Switch Architectures Output-Queued Switches Deterministic Queueing Analysis Fairness and Delay Guarantees Dr. Isaac Keslassy Electrical Engineering, Technion isaac@ee.technion.ac.il http://comnet.technion.ac.il/~isaac/

More information

Telematics 2. Chapter 3 Quality of Service in the Internet. (Acknowledgement: These slides have been compiled from Kurose & Ross, and other sources)

Telematics 2. Chapter 3 Quality of Service in the Internet. (Acknowledgement: These slides have been compiled from Kurose & Ross, and other sources) Telematics 2 Chapter 3 Quality of Service in the Internet (Acknowledgement: These slides have been compiled from Kurose & Ross, and other sources) Telematics 2 (WS 14/15): 03 Internet QoS 1 Improving QOS

More information

Networking Issues in LAN Telephony. Brian Yang

Networking Issues in LAN Telephony. Brian Yang Networking Issues in LAN Telephony Brian Yang 5-3-00 Topics Some background Flow Based QoS Class Based QoS and popular algorithms Strict Priority (SP) Round-Robin (RR), Weighted Round Robin (WRR) and Weighted

More information

DiffServ Architecture: Impact of scheduling on QoS

DiffServ Architecture: Impact of scheduling on QoS DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics

More information

Kommunikationssysteme [KS]

Kommunikationssysteme [KS] Kommunikationssysteme [KS] Dr.-Ing. Falko Dressler Computer Networks and Communication Systems Department of Computer Sciences University of Erlangen-Nürnberg http://www7.informatik.uni-erlangen.de/~dressler/

More information

Internet Quality of Service: an Overview

Internet Quality of Service: an Overview Internet Quality of Service: an Overview W. Zhao and et al, Columbia University presented by 리준걸 2006.10.25 INC Lab, Seoul Nat l University Outline Introduce QoS framework IntServ DiffServ Detailed mechanism

More information

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren Lecture 22: Buffering & Scheduling CSE 123: Computer Networks Alex C. Snoeren Lecture 23 Overview Buffer Management FIFO RED Traffic Policing/Scheduling 2 Key Router Challenges Buffer management: which

More information

Congestion Control In the Network

Congestion Control In the Network Congestion Control In the Network Brighten Godfrey cs598pbg September 9 2010 Slides courtesy Ion Stoica with adaptation by Brighten Today Fair queueing XCP Announcements Problem: no isolation between flows

More information

Multimedia networking: outline

Multimedia networking: outline Multimedia networking: outline 7.1 multimedia networking applications 7.2 streaming stored video 7.3 voice-over-ip 7.4 protocols for real-time conversational applications: RTP, SIP 7.5 network support

More information

QoS Services with Dynamic Packet State

QoS Services with Dynamic Packet State QoS Services with Dynamic Packet State Ion Stoica Carnegie Mellon University (joint work with Hui Zhang and Scott Shenker) Today s Internet Service: best-effort datagram delivery Architecture: stateless

More information

Congestion Control and Resource Allocation

Congestion Control and Resource Allocation Congestion Control and Resource Allocation Lecture material taken from Computer Networks A Systems Approach, Third Edition,Peterson and Davie, Morgan Kaufmann, 2007. Advanced Computer Networks Congestion

More information

Multicast and Quality of Service. Internet Technologies and Applications

Multicast and Quality of Service. Internet Technologies and Applications Multicast and Quality of Service Internet Technologies and Applications Aims and Contents Aims Introduce the multicast and the benefits it offers Explain quality of service and basic techniques for delivering

More information

CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007

CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 Question 344 Points 444 Points Score 1 10 10 2 10 10 3 20 20 4 20 10 5 20 20 6 20 10 7-20 Total: 100 100 Instructions: 1. Question

More information

MQC Hierarchical Queuing with 3 Level Scheduler

MQC Hierarchical Queuing with 3 Level Scheduler MQC Hierarchical Queuing with 3 Level Scheduler The MQC Hierarchical Queuing with 3 Level Scheduler feature provides a flexible packet scheduling and queuing system in which you can specify how excess

More information

Prof. Dr. Abdulmotaleb El Saddik. site.uottawa.ca mcrlab.uottawa.ca. Quality of Media vs. Quality of Service

Prof. Dr. Abdulmotaleb El Saddik. site.uottawa.ca mcrlab.uottawa.ca. Quality of Media vs. Quality of Service Multimedia Communications Multimedia Technologies & Applications Prof. Dr. Abdulmotaleb El Saddik Multimedia Communications Research Laboratory School of Information Technology and Engineering University

More information

RSVP 1. Resource Control and Reservation

RSVP 1. Resource Control and Reservation RSVP 1 Resource Control and Reservation RSVP 2 Resource Control and Reservation policing: hold sources to committed resources scheduling: isolate flows, guarantees resource reservation: establish flows

More information

Resource Control and Reservation

Resource Control and Reservation 1 Resource Control and Reservation Resource Control and Reservation policing: hold sources to committed resources scheduling: isolate flows, guarantees resource reservation: establish flows 2 Usage parameter

More information

Quality of Service II

Quality of Service II Quality of Service II Patrick J. Stockreisser p.j.stockreisser@cs.cardiff.ac.uk Lecture Outline Common QoS Approaches Best Effort Integrated Services Differentiated Services Integrated Services Integrated

More information

QUALITY of SERVICE. Introduction

QUALITY of SERVICE. Introduction QUALITY of SERVICE Introduction There are applications (and customers) that demand stronger performance guarantees from the network than the best that could be done under the circumstances. Multimedia

More information

Multimedia Networking

Multimedia Networking CMPT765/408 08-1 Multimedia Networking 1 Overview Multimedia Networking The note is mainly based on Chapter 7, Computer Networking, A Top-Down Approach Featuring the Internet (4th edition), by J.F. Kurose

More information

Towards Service Differentiation on the Internet

Towards Service Differentiation on the Internet Towards Service Differentiation on the Internet from New Internet and Networking Technologies and Their Application on Computational Sciences, invited talk given at Ho Chi Minh City, Vietnam March 3-5,

More information

Link-sharing and Resource Management Models for Packet Networks

Link-sharing and Resource Management Models for Packet Networks Link-sharing and Resource Management Models for Packet Networks Sally Floyd Lawrence Berkeley Laboratory floyd@ee.lbl.gov February 7, 1995 (Joint work with Van Jacobson. Credits to other members of the

More information

Master Course Computer Networks IN2097

Master Course Computer Networks IN2097 Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master

More information

Master Course Computer Networks IN2097

Master Course Computer Networks IN2097 Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for

More information

H3C S9500 QoS Technology White Paper

H3C S9500 QoS Technology White Paper H3C Key words: QoS, quality of service Abstract: The Ethernet technology is widely applied currently. At present, Ethernet is the leading technology in various independent local area networks (LANs), and

More information

Lecture 13. Quality of Service II CM0256

Lecture 13. Quality of Service II CM0256 Lecture 13 Quality of Service II CM0256 Types of QoS Best Effort Services Integrated Services -- resource reservation network resources are assigned according to the application QoS request and subject

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) shivkuma@ecse.rpi.edu http://www.ecse.rpi.edu/homepages/shivkuma Based in part on slides of Ion Stoica, Jim Kurose, Srini Seshan, Srini Keshav 1 Overview Why better-than-best-effort

More information

Advanced Lab in Computer Communications Meeting 6 QoS. Instructor: Tom Mahler

Advanced Lab in Computer Communications Meeting 6 QoS. Instructor: Tom Mahler Advanced Lab in Computer Communications Meeting 6 QoS Instructor: Tom Mahler Motivation Internet provides only single class of best-effort service. Some applications can be elastic. Tolerate delays and

More information

Defining QoS for Multiple Policy Levels

Defining QoS for Multiple Policy Levels CHAPTER 13 In releases prior to Cisco IOS Release 12.0(22)S, you can specify QoS behavior at only one level. For example, to shape two outbound queues of an interface, you must configure each queue separately,

More information

Configuring QoS CHAPTER

Configuring QoS CHAPTER CHAPTER 34 This chapter describes how to use different methods to configure quality of service (QoS) on the Catalyst 3750 Metro switch. With QoS, you can provide preferential treatment to certain types

More information

Principles for QOS Guarantees. Improving QOS in IP Networks

Principles for QOS Guarantees. Improving QOS in IP Networks Improving QOS in IP Networks Thus far: making the best of best effort Future: next generation Internet with QoS guarantees RSVP: signaling for resource reservations Differentiated Services: differential

More information

Computer Network Fundamentals Fall Week 12 QoS Andreas Terzis

Computer Network Fundamentals Fall Week 12 QoS Andreas Terzis Computer Network Fundamentals Fall 2008 Week 12 QoS Andreas Terzis Outline QoS Fair Queuing Intserv Diffserv What s the Problem? Internet gives all flows the same best effort service no promises about

More information

CS551 Router Queue Management

CS551 Router Queue Management CS551 Router Queue Management Bill Cheng http://merlot.usc.edu/cs551-f12 1 Congestion Control vs. Resource Allocation Network s key role is to allocate its transmission resources to users or applications

More information

Quality of Service (QoS)

Quality of Service (QoS) CEN445 Network Protocols and Algorithms Chapter 5 Network Layer 5.4 Quality of Service Dr. Mostafa Hassan Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud

More information

Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel

Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Semra.gulder@crc.ca, mathieu.deziel@crc.ca Abstract: This paper describes a QoS mechanism suitable for Mobile Ad Hoc Networks

More information

Problems with IntServ. EECS 122: Introduction to Computer Networks Differentiated Services (DiffServ) DiffServ (cont d)

Problems with IntServ. EECS 122: Introduction to Computer Networks Differentiated Services (DiffServ) DiffServ (cont d) Problems with IntServ EECS 122: Introduction to Computer Networks Differentiated Services (DiffServ) Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,

More information

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies CSCD 433/533 Priority Traffic Advanced Networks Spring 2016 Lecture 21 Congestion Control and Queuing Strategies 1 Topics Congestion Control and Resource Allocation Flows Types of Mechanisms Evaluation

More information

different problems from other networks ITU-T specified restricted initial set Limited number of overhead bits ATM forum Traffic Management

different problems from other networks ITU-T specified restricted initial set Limited number of overhead bits ATM forum Traffic Management Traffic and Congestion Management in ATM 3BA33 David Lewis 3BA33 D.Lewis 2007 1 Traffic Control Objectives Optimise usage of network resources Network is a shared resource Over-utilisation -> congestion

More information