Episode 5. Scheduling and Traffic Management

Size: px
Start display at page:

Download "Episode 5. Scheduling and Traffic Management"

Transcription

1 Episode 5. Scheduling and Traffic Management Part 3 Baochun Li Department of Electrical and Computer Engineering University of Toronto

2 Outline What is scheduling? Why do we need it? Requirements of a scheduling discipline Fundamental choices Scheduling best effort connections Scheduling guaranteed-service connections Packet drop strategies A look at today: datacenter networks

3 Scheduling guaranteed-service connections

4 Scheduling guaranteed-service connections With best-effort connections, the goal is fairness

5 Scheduling guaranteed-service connections With best-effort connections, the goal is fairness With guaranteed-service connections What performance guarantees are achievable? How easy is admission control?

6 Scheduling guaranteed-service connections With best-effort connections, the goal is fairness With guaranteed-service connections What performance guarantees are achievable? How easy is admission control? We now study some scheduling disciplines that provide performance guarantees

7 Weighted Fair Queuing revisited

8 Weighted Fair Queuing revisited Turns out that WFQ also provides performance guarantees

9 Weighted Fair Queuing revisited Turns out that WFQ also provides performance guarantees Bandwidth bound ratio of weights * link capacity Example: connections with weights 1, 2, 7; link capacity 10 connections get at least 1, 2, 7 units of bandwidth each

10 Weighted Fair Queuing revisited Turns out that WFQ also provides performance guarantees Bandwidth bound ratio of weights * link capacity Example: connections with weights 1, 2, 7; link capacity 10 connections get at least 1, 2, 7 units of bandwidth each End-to-end delay bound assumes that the connection doesn t send too much (otherwise its packets will be stuck in queues) more precisely, connection should be leaky-bucket regulated

11 Leaky-bucket regulators TOKEN RUCKET TOKENS ARRIVE PERIODICALLY /p v ]NPUT _--} OUTPUT DATA BUFFER 5

12 Leaky-bucket regulators Implement linear bounded arrival processes # bits transmitted in time [t 1, t 2 ] <= r (t 2 - t 1 ) + s TOKEN RUCKET TOKENS ARRIVE PERIODICALLY /p v ]NPUT _--} OUTPUT DATA BUFFER 5

13 Special cases of a leaky-bucket regulator 6

14 Special cases of a leaky-bucket regulator Peak-rate regulator: Setting the token-bucket limit to one token, and the token replenishment interval to the peak rate 6

15 Special cases of a leaky-bucket regulator Peak-rate regulator: Setting the token-bucket limit to one token, and the token replenishment interval to the peak rate Moving-window average-rate regulator: Setting the token-bucket limit to one token, and the token replenishment interval to the average rate 6

16 Special cases of a leaky-bucket regulator Peak-rate regulator: Setting the token-bucket limit to one token, and the token replenishment interval to the peak rate Moving-window average-rate regulator: Setting the token-bucket limit to one token, and the token replenishment interval to the average rate Augment a leaky-bucket regulator with a peak-rate regulator: controls all three parameters: the average rate, the peak rate, and the largest burst 6

17 Special cases of a leaky-bucket regulator Peak-rate regulator: Setting the token-bucket limit to one token, and the token replenishment interval to the peak rate Moving-window average-rate regulator: Setting the token-bucket limit to one token, and the token replenishment interval to the average rate Augment a leaky-bucket regulator with a peak-rate regulator: controls all three parameters: the average rate, the peak rate, and the largest burst (Keshav, Ch ) 6

18 Parekh-Gallager Theorem Let a connection be allocated weights at each WFQ scheduler along its path, so that the least bandwidth it is allocated is g Let it be leaky-bucket regulated such that # bits sent in time [t 1, t 2 ] <= r (t 2 - t 1 ) + s Let the connection pass through K schedulers, where the k th scheduler has a link rate r(k) Let the largest packet allowed in the network be P D g + K 1 k=1 P g + K k=1 P r(k)

19 Example 8

20 Example Consider a connection with leaky bucket parameters (16384 bytes, 150 Kbps) that traverses 10 hops on a network where all the links have a bandwidth of 45 Mbps. If the largest allowed packet in the network is 8192 bytes long, what g value will guarantee an end-toend delay of 100 ms? Assume a propagation delay of 30 ms. 8

21 Example Consider a connection with leaky bucket parameters (16384 bytes, 150 Kbps) that traverses 10 hops on a network where all the links have a bandwidth of 45 Mbps. If the largest allowed packet in the network is 8192 bytes long, what g value will guarantee an end-toend delay of 100 ms? Assume a propagation delay of 30 ms. Solution The queuing delay must be bounded by = 70 ms. Plugging this into the previous equation, we get 70 x 10-3 = {(16384 x 8) + (9 x 8192 x 8)} / g + (10 x 8192 x 8) / (45 x 10 6 ), so that g = Mbps. This is more than 86 times larger than the source s average rate of 150 Kbps 8

22 Example Consider a connection with leaky bucket parameters (16384 bytes, 150 Kbps) that traverses 10 hops on a network where all the links have a bandwidth of 45 Mbps. If the largest allowed packet in the network is 8192 bytes long, what g value will guarantee an end-toend delay of 100 ms? Assume a propagation delay of 30 ms. Solution The queuing delay must be bounded by = 70 ms. Plugging this into the previous equation, we get 70 x 10-3 = {(16384 x 8) + (9 x 8192 x 8)} / g + (10 x 8192 x 8) / (45 x 10 6 ), so that g = Mbps. This is more than 86 times larger than the source s average rate of 150 Kbps With large packets, packet delays can be quite substantial! 8

23 Significance

24 Significance Theorem shows that WFQ can provide end-to-end delay bounds

25 Significance Theorem shows that WFQ can provide end-to-end delay bounds So WFQ provides both fairness and performance guarantees

26 Significance Theorem shows that WFQ can provide end-to-end delay bounds So WFQ provides both fairness and performance guarantees Bound holds regardless of cross traffic behaviour

27 Problems

28 Problems To get a delay bound, need to pick g the lower the delay bounds, the larger g needs to be large g => exclusion of more competitors from link g can be very large, in our example > 80 times the peak rate!

29 Problems To get a delay bound, need to pick g the lower the delay bounds, the larger g needs to be large g => exclusion of more competitors from link g can be very large, in our example > 80 times the peak rate! WFQ couples delay and bandwidth allocations low delay requires allocating more bandwidth wastes bandwidth for low-bandwidth low-delay sources

30 Delay-Earliest Due Date

31 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected

32 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected Delay-EDD prescribes how to assign deadlines to packets

33 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected Delay-EDD prescribes how to assign deadlines to packets A source is required to send slower than its peak rate

34 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected Delay-EDD prescribes how to assign deadlines to packets A source is required to send slower than its peak rate Bandwidth at scheduler reserved at peak rate

35 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected Delay-EDD prescribes how to assign deadlines to packets A source is required to send slower than its peak rate Bandwidth at scheduler reserved at peak rate Deadline = expected arrival time + delay bound If a source sends faster than contract, delay bound will not apply

36 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected Delay-EDD prescribes how to assign deadlines to packets A source is required to send slower than its peak rate Bandwidth at scheduler reserved at peak rate Deadline = expected arrival time + delay bound If a source sends faster than contract, delay bound will not apply Each packet gets a hard delay bound

37 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected Delay-EDD prescribes how to assign deadlines to packets A source is required to send slower than its peak rate Bandwidth at scheduler reserved at peak rate Deadline = expected arrival time + delay bound If a source sends faster than contract, delay bound will not apply Each packet gets a hard delay bound Delay bound is independent of bandwidth requirement but reservation is at a connection s peak rate

38 Delay-Earliest Due Date Earliest-due-date: packet with earliest deadline selected Delay-EDD prescribes how to assign deadlines to packets A source is required to send slower than its peak rate Bandwidth at scheduler reserved at peak rate Deadline = expected arrival time + delay bound If a source sends faster than contract, delay bound will not apply Each packet gets a hard delay bound Delay bound is independent of bandwidth requirement but reservation is at a connection s peak rate Implementation requires per-connection state and a priority queue

39 Rate-controlled scheduling A class of disciplines two components: regulator and scheduler incoming packets are placed in regulator where they wait to become eligible then they are put in the scheduler Regulator shapes the traffic, scheduler provides performance guarantees TI m II m OUTPUT REGULATOR SCHEDULER

40 Examples of Regulators

41 Examples of Regulators Rate-jitter regulator: packets should arrive to the scheduler less than peak rate bounds maximum outgoing rate

42 Examples of Regulators Rate-jitter regulator: packets should arrive to the scheduler less than peak rate bounds maximum outgoing rate Delay-jitter regulator: packets should arrive to the scheduler at a constant delay after leaving the scheduler at a previous switch compensates for variable delay at previous hop

43 Analysis

44 Analysis First regulator on path monitors and regulates traffic => bandwidth bound

45 Analysis First regulator on path monitors and regulates traffic => bandwidth bound End-to-end delay bound delay-jitter regulator reconstructs traffic => end-to-end delay is fixed (= worst-case delay at each hop) rate-jitter regulator partially reconstructs traffic can show that end-to-end delay bound is smaller than (sum of delay bound at each hop + delay at first hop)

46 Delay-jitter Regulator + Delay- EDD scheduler: provides bandwidth bound, delay bound, and delay-jitter bound

47 Decoupling delay from bandwidth

48 Decoupling delay from bandwidth Can give a low-bandwidth connection a low delay without overbooking

49 Decoupling delay from bandwidth Can give a low-bandwidth connection a low delay without overbooking e.g. consider connection A with rate 64 Kbps sent to a router with rate-jitter regulation and multi-priority FCFS scheduling (called rate-controlled static priority)

50 Decoupling delay from bandwidth Can give a low-bandwidth connection a low delay without overbooking e.g. consider connection A with rate 64 Kbps sent to a router with rate-jitter regulation and multi-priority FCFS scheduling (called rate-controlled static priority) After sending a packet of length l, next packet is eligible at time (now + l/64 Kbps)

51 Decoupling delay from bandwidth Can give a low-bandwidth connection a low delay without overbooking e.g. consider connection A with rate 64 Kbps sent to a router with rate-jitter regulation and multi-priority FCFS scheduling (called rate-controlled static priority) After sending a packet of length l, next packet is eligible at time (now + l/64 Kbps) If placed at highest-priority queue, all packets from A get low delay

52 Decoupling delay from bandwidth Can give a low-bandwidth connection a low delay without overbooking e.g. consider connection A with rate 64 Kbps sent to a router with rate-jitter regulation and multi-priority FCFS scheduling (called rate-controlled static priority) After sending a packet of length l, next packet is eligible at time (now + l/64 Kbps) If placed at highest-priority queue, all packets from A get low delay Can decouple delay and bandwidth bounds, unlike WFQ

53 Evaluation

54 Evaluation Pros flexibility: ability to emulate other disciplines can decouple bandwidth and delay assignments end-to-end delay bounds are easily computed do not require complicated schedulers to guarantee protection can provide delay-jitter bounds

55 Evaluation Pros flexibility: ability to emulate other disciplines can decouple bandwidth and delay assignments end-to-end delay bounds are easily computed do not require complicated schedulers to guarantee protection can provide delay-jitter bounds Cons possibly non-work-conserving delay-jitter bounds at the expense of increasing mean delay delay-jitter regulation is expensive (clock synch, timestamps)

56 Summary

57 Summary Two sorts of applications: best effort and guaranteed service

58 Summary Two sorts of applications: best effort and guaranteed service Best effort connections require fair service provided by GPS, which is unimplementable emulated by WFQ and its variants

59 Summary Two sorts of applications: best effort and guaranteed service Best effort connections require fair service provided by GPS, which is unimplementable emulated by WFQ and its variants Guaranteed service connections require performance guarantees provided by WFQ, but this is expensive may be better to use rate-controlled schedulers

60 Outline What is scheduling? Why do we need it? Requirements of a scheduling discipline Fundamental choices Scheduling best effort connections Scheduling guaranteed-service connections Packet drop strategies A look at today: datacenter networks

61 Packet dropping

62 Packet dropping Packets that cannot be served immediately are buffered

63 Packet dropping Packets that cannot be served immediately are buffered Full buffers => packet drop strategy

64 Packet dropping Packets that cannot be served immediately are buffered Full buffers => packet drop strategy Packet losses happen almost always from best-effort connections (due to admission control in guaranteedservice connections)

65 Packet dropping Packets that cannot be served immediately are buffered Full buffers => packet drop strategy Packet losses happen almost always from best-effort connections (due to admission control in guaranteedservice connections) Shouldn t drop packets unless imperative packet drop wastes resources

66 Classification of drop strategies Degree of aggregation Drop priorities Early or late Drop position

67 Degree of aggregation

68 Degree of aggregation Degree of discrimination in selecting a packet to drop

69 Degree of aggregation Degree of discrimination in selecting a packet to drop e.g. in vanilla FIFO, all packets are in the same class

70 Degree of aggregation Degree of discrimination in selecting a packet to drop e.g. in vanilla FIFO, all packets are in the same class Instead, can classify packets and drop packets selectively

71 Degree of aggregation Degree of discrimination in selecting a packet to drop e.g. in vanilla FIFO, all packets are in the same class Instead, can classify packets and drop packets selectively The finer the classification the better the protection

72 Degree of aggregation Degree of discrimination in selecting a packet to drop e.g. in vanilla FIFO, all packets are in the same class Instead, can classify packets and drop packets selectively The finer the classification the better the protection Max-min fair allocation of buffers to classes drop packet from class with the longest queue

73 Drop priorities Drop lower-priority packets first How to choose? Source marks packets Policer also marks packets Packets are marked with a congestion loss priority (CLP) bit in packet header Source marks some Packets Switch PreferentiallY d.iscardi marked Packets

74 CLP bit: pros and cons

75 CLP bit: pros and cons Pros if network has spare capacity, all traffic is carried during congestion, load is automatically shed

76 CLP bit: pros and cons Pros if network has spare capacity, all traffic is carried during congestion, load is automatically shed Cons separating priorities within a single connection is hard what prevents all packets being marked as high priority?

77 Early vs. late drop

78 Early vs. late drop Early drop: drop even if space is available signals endpoints to reduce rate cooperative sources get lower overall delays, uncooperative sources get severe packet loss

79 Early vs. late drop Early drop: drop even if space is available signals endpoints to reduce rate cooperative sources get lower overall delays, uncooperative sources get severe packet loss Early random drop drop arriving packet with fixed drop probability if queue length exceeds threshold intuition: misbehaving sources more likely to send packets and see packet losses doesn t work well in controlling misbehaving users

80 Early vs. late drop: RED

81 Early vs. late drop: RED Random early detection (RED) makes three improvements

82 Early vs. late drop: RED Random early detection (RED) makes three improvements Metric is moving average of queue lengths small bursts pass through unharmed only affects sustained overloads

83 Early vs. late drop: RED Random early detection (RED) makes three improvements Metric is moving average of queue lengths small bursts pass through unharmed only affects sustained overloads Packet drop probability is a linear function of average queue length prevents severe reaction to mild overload

84 Early vs. late drop: RED Random early detection (RED) makes three improvements Metric is moving average of queue lengths small bursts pass through unharmed only affects sustained overloads Packet drop probability is a linear function of average queue length prevents severe reaction to mild overload Can mark packets instead of dropping them allows sources to detect network state without losses

85 Early vs. late drop: RED Random early detection (RED) makes three improvements Metric is moving average of queue lengths small bursts pass through unharmed only affects sustained overloads Packet drop probability is a linear function of average queue length prevents severe reaction to mild overload Can mark packets instead of dropping them allows sources to detect network state without losses RED improves performance of a network of cooperating TCP sources

86 Early vs. late drop: RED Random early detection (RED) makes three improvements Metric is moving average of queue lengths small bursts pass through unharmed only affects sustained overloads Packet drop probability is a linear function of average queue length prevents severe reaction to mild overload Can mark packets instead of dropping them allows sources to detect network state without losses RED improves performance of a network of cooperating TCP sources No bias against bursty sources

87 Drop position Can drop a packet from head, tail, or random position in the queue Tail easy Head default approach harder lets source detect loss earlier O*! Full buffer \ / \ )a Dropped 5 4 /u'1! ll -lf-l!-----._ Previously packet creates served packet "hole" Acks Destination

88 Drop position (contd.)

89 Drop position (contd.) Random hardest hurts bandwidth hogs most unlikely to make it to real routers

90 Drop position (contd.) Random hardest hurts bandwidth hogs most unlikely to make it to real routers Drop entire longest queue easy almost as effective as drop tail from longest queue

91 Datacenter Networks

92 Unique characteristics in datacenter networks 1000s of server ports 30 30

93 Unique characteristics in datacenter networks web app cache db 1000s of server ports MapRe duce Spark monitoring 30 30

94 Unique characteristics in datacenter networks Large number of flows from distributed workloads, most are fairly short 1000s of server ports web app cache db MapRe duce Spark monitoring 30 30

95 Unique characteristics in datacenter networks Large number of flows from distributed workloads, most are fairly short We care more about delays than fairness 1000s of server ports web app cache db MapRe duce Spark monitoring 30 30

96 Unique requirements Goal: Complete flows quickly Requires scheduling flows such that: High throughput for large flows Fabric latency (no queuing delays) for small flows Lots of recent work on the use of rate control to schedule flows DCTCP [SIGCOMM 10], HULL [NSDI 11], D 2 TCP [SIGCOMM 12], D3 [SIGCOMM 11], PDQ [SIGCOMM 12] Most are quite complex 31

97 pfabric: critique paper on November 10 Packets carry a single priority number The priority can be a flow s remaining size pfabric switches Very small buffers (20-30KB for 10Gbps fabric) Send highest priority / drop lowest priority packets pfabric hosts Send/retransmit aggressively Minimal rate control: just prevent congestion collapse 32

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

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

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) Fair Queueing

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay)  Fair Queueing Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Fair Queueing 2 Today Wireline Queue Drop Wireless Queue Drop 3 Types of Congestion Control Strategies

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

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

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

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

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

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

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

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

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

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

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

Packet Scheduling in Data Centers. Lecture 17, Computer Networks (198:552)

Packet Scheduling in Data Centers. Lecture 17, Computer Networks (198:552) Packet Scheduling in Data Centers Lecture 17, Computer Networks (198:552) Datacenter transport Goal: Complete flows quickly / meet deadlines Short flows (e.g., query, coordination) Large flows (e.g., data

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

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

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

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

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers Overview 15-441 Computer Networking TCP & router queuing Lecture 10 TCP & Routers TCP details Workloads Lecture 10: 09-30-2002 2 TCP Performance TCP Performance Can TCP saturate a link? Congestion control

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

Flow Control. Flow control problem. Other considerations. Where?

Flow Control. Flow control problem. Other considerations. Where? Flow control problem Flow Control An Engineering Approach to Computer Networking Consider file transfer Sender sends a stream of packets representing fragments of a file Sender should try to match rate

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

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

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

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

15-744: Computer Networking. Overview. Queuing Disciplines. TCP & Routers. L-6 TCP & Routers

15-744: Computer Networking. Overview. Queuing Disciplines. TCP & Routers. L-6 TCP & Routers TCP & Routers 15-744: Computer Networking RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay Product Networks L-6

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

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

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

CS 268: Computer Networking

CS 268: Computer Networking CS 268: Computer Networking L-6 Router Congestion Control TCP & Routers RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay

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

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

QoS Configuration. Overview. Introduction to QoS. QoS Policy. Class. Traffic behavior

QoS Configuration. Overview. Introduction to QoS. QoS Policy. Class. Traffic behavior Table of Contents QoS Configuration 1 Overview 1 Introduction to QoS 1 QoS Policy 1 Traffic Policing 2 Congestion Management 3 Line Rate 9 Configuring a QoS Policy 9 Configuration Task List 9 Configuring

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

MUD: Send me your top 1 3 questions on this lecture

MUD: Send me your top 1 3 questions on this lecture Administrivia Review 1 due tomorrow Email your reviews to me Office hours on Thursdays 10 12 MUD: Send me your top 1 3 questions on this lecture Guest lectures next week by Prof. Richard Martin Class slides

More information

Congestion in Data Networks. Congestion in Data Networks

Congestion in Data Networks. Congestion in Data Networks Congestion in Data Networks CS420/520 Axel Krings 1 Congestion in Data Networks What is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet

More information

What Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues

What Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues 168 430 Computer Networks Chapter 13 Congestion in Data Networks What Is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet handling capacity

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

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

TCP Congestion Control : Computer Networking. Introduction to TCP. Key Things You Should Know Already. Congestion Control RED

TCP Congestion Control : Computer Networking. Introduction to TCP. Key Things You Should Know Already. Congestion Control RED TCP Congestion Control 15-744: Computer Networking L-4 TCP Congestion Control RED Assigned Reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [TFRC] Equation-Based Congestion Control

More information

Chapter 6 Queuing Disciplines. Networking CS 3470, Section 1

Chapter 6 Queuing Disciplines. Networking CS 3470, Section 1 Chapter 6 Queuing Disciplines Networking CS 3470, Section 1 Flow control vs Congestion control Flow control involves preventing senders from overrunning the capacity of the receivers Congestion control

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

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

Quality of Service (QoS) Computer network and QoS ATM. QoS parameters. QoS ATM QoS implementations Integrated Services Differentiated Services

Quality of Service (QoS) Computer network and QoS ATM. QoS parameters. QoS ATM QoS implementations Integrated Services Differentiated Services 1 Computer network and QoS QoS ATM QoS implementations Integrated Services Differentiated Services Quality of Service (QoS) The data transfer requirements are defined with different QoS parameters + e.g.,

More information

Packet Scheduling and QoS

Packet Scheduling and QoS Packet Scheduling and QoS EECS 489 Computer Networks http://www.eecs.umich.edu/~zmao/eecs489 Z. Morley Mao Thursday Oct 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1 Packet

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

Lecture 4 Wide Area Networks - Congestion in Data Networks

Lecture 4 Wide Area Networks - Congestion in Data Networks DATA AND COMPUTER COMMUNICATIONS Lecture 4 Wide Area Networks - Congestion in Data Networks Mei Yang Based on Lecture slides by William Stallings 1 WHAT IS CONGESTION? congestion occurs when the number

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

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

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

Module objectives. Integrated services. Support for real-time applications. Real-time flows and the current Internet protocols

Module objectives. Integrated services. Support for real-time applications. Real-time flows and the current Internet protocols Integrated services Reading: S. Keshav, An Engineering Approach to Computer Networking, chapters 6, 9 and 4 Module objectives Learn and understand about: Support for real-time applications: network-layer

More information

CS557: Queue Management

CS557: Queue Management CS557: Queue Management Christos Papadopoulos Remixed by Lorenzo De Carli 1 Congestion Control vs. Resource Allocation Network s key role is to allocate its transmission resources to users or applications

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

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

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS 28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the

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

Part1: Lecture 4 QoS

Part1: Lecture 4 QoS Part1: Lecture 4 QoS Last time Multi stream TCP: SCTP Multi path TCP RTP and RTCP SIP H.323 VoIP Router architectures Overview two key router functions: run routing algorithms/protocol (RIP, OSPF, BGP)

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

Last time! Overview! 14/04/15. Part1: Lecture 4! QoS! Router architectures! How to improve TCP? SYN attacks SCTP. SIP and H.

Last time! Overview! 14/04/15. Part1: Lecture 4! QoS! Router architectures! How to improve TCP? SYN attacks SCTP. SIP and H. Last time Part1: Lecture 4 QoS How to improve TCP? SYN attacks SCTP SIP and H.323 RTP and RTCP Router architectures Overview two key router functions: run routing algorithms/protocol (RIP, OSPF, BGP) forwarding

More information

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica CMU Scott Shenker Xerox PARC Hui Zhang CMU Congestion Control in Today s Internet Rely

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

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

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

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

A Preferred Service Architecture for Payload Data Flows. Ray Gilstrap, Thom Stone, Ken Freeman

A Preferred Service Architecture for Payload Data Flows. Ray Gilstrap, Thom Stone, Ken Freeman A Preferred Service Architecture for Payload Data Flows Ray Gilstrap, Thom Stone, Ken Freeman NASA Research and Engineering Network NASA Advanced Supercomputing Division NASA Ames Research Center Outline

More information

The Network Layer and Routers

The Network Layer and Routers The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in

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

Before configuring standard QoS, you must have a thorough understanding of these items: Standard QoS concepts.

Before configuring standard QoS, you must have a thorough understanding of these items: Standard QoS concepts. Prerequisites for Quality of Service, on page 1 QoS Components, on page 2 QoS Terminology, on page 2 Information About QoS, on page 3 QoS Implementation, on page 4 QoS Wired Model, on page 8 Classification,

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

Kent State University

Kent State University CS 4/54201 Computer Communication Network Kent State University Dept. of Computer Science www.mcs.kent.edu/~javed/class-net06f/ 1 A Course on Networking and Computer Communication LECT-11, S-2 Congestion

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

Lecture 14: Performance Architecture

Lecture 14: Performance Architecture Lecture 14: Performance Architecture Prof. Shervin Shirmohammadi SITE, University of Ottawa Prof. Shervin Shirmohammadi CEG 4185 14-1 Background Performance: levels for capacity, delay, and RMA. Performance

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

Integrated and Differentiated Services. Christos Papadopoulos. CSU CS557, Fall 2017

Integrated and Differentiated Services. Christos Papadopoulos. CSU CS557, Fall 2017 Integrated and Differentiated Services Christos Papadopoulos (Remixed by Lorenzo De Carli) CSU CS557, Fall 2017 1 Preliminary concepts: token buffer 2 Characterizing Traffic: Token Bucket Filter Parsimonious

More information

On Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering

On Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering On Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering Shivendra S. Panwar New York State Center for Advanced Technology in Telecommunications (CATT) Department of Electrical

More information

SELECTION OF METRICS (CONT) Gaia Maselli

SELECTION OF METRICS (CONT) Gaia Maselli SELECTION OF METRICS (CONT) Gaia Maselli maselli@di.uniroma1.it Computer Network Performance 2 Selecting performance metrics Computer Network Performance 3 Selecting performance metrics speed Individual

More information

Contents. QoS overview 1

Contents. QoS overview 1 Contents QoS overview 1 QoS service models 1 Best-effort service model 1 IntServ model 1 DiffServ model 1 QoS techniques overview 1 Deploying QoS in a network 2 QoS processing flow in a device 2 Configuring

More information

Activity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks

Activity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks Communication Networks Activity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks Michael Menth and Nikolas Zeitler http://kn.inf.uni-tuebingen.de Outline The problem Definition

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

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

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

CS244 Advanced Topics in Computer Networks Midterm Exam Monday, May 2, 2016 OPEN BOOK, OPEN NOTES, INTERNET OFF

CS244 Advanced Topics in Computer Networks Midterm Exam Monday, May 2, 2016 OPEN BOOK, OPEN NOTES, INTERNET OFF CS244 Advanced Topics in Computer Networks Midterm Exam Monday, May 2, 2016 OPEN BOOK, OPEN NOTES, INTERNET OFF Your Name: Answers SUNet ID: root @stanford.edu In accordance with both the letter and the

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

CSE398: Network Systems Design

CSE398: Network Systems Design CSE398: Network Systems Design Instructor: Dr. Liang Cheng Department of Computer Science and Engineering P.C. Rossin College of Engineering & Applied Science Lehigh University February 21, 2005 Outline

More information

Wireless Networks (CSC-7602) Lecture 8 (15 Oct. 2007)

Wireless Networks (CSC-7602) Lecture 8 (15 Oct. 2007) Wireless Networks (CSC-7602) Lecture 8 (15 Oct. 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark 1 Today Wireline Fair Schedulling Why? Ideal algorithm Practical algorithms Wireless Fair Scheduling

More information

Router Architectures

Router Architectures Router Architectures Venkat Padmanabhan Microsoft Research 13 April 2001 Venkat Padmanabhan 1 Outline Router architecture overview 50 Gbps multi-gigabit router (Partridge et al.) Technology trends Venkat

More information

QoS provisioning. Lectured by Alexander Pyattaev. Department of Communications Engineering Tampere University of Technology

QoS provisioning. Lectured by Alexander Pyattaev. Department of Communications Engineering Tampere University of Technology QoS provisioning Lectured by Alexander Pyattaev Department of Communications Engineering Tampere University of Technology alexander.pyattaev@tut.fi March 6, 2012 Outline 1 Introduction 2 QoS support elements

More information

ADVANCED COMPUTER NETWORKS

ADVANCED COMPUTER NETWORKS ADVANCED COMPUTER NETWORKS Congestion Control and Avoidance 1 Lecture-6 Instructor : Mazhar Hussain CONGESTION CONTROL When one part of the subnet (e.g. one or more routers in an area) becomes overloaded,

More information

Configuring QoS. Understanding QoS CHAPTER

Configuring QoS. Understanding QoS CHAPTER 29 CHAPTER This chapter describes how to configure quality of service (QoS) by using automatic QoS (auto-qos) commands or by using standard QoS commands on the Catalyst 3750 switch. With QoS, you can provide

More information

Queuing Mechanisms. Overview. Objectives

Queuing Mechanisms. Overview. Objectives Queuing Mechanisms Overview Objectives This module describes the queuing mechanisms that can be used on output interfaces. It includes the following topics: Queuing Overview FIFO Queuing Priority Queuing

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

What Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control

What Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control Chapter 12 Congestion in Data Networks Effect of Congestion Control Ideal Performance Practical Performance Congestion Control Mechanisms Backpressure Choke Packet Implicit Congestion Signaling Explicit

More information

Congestion Management Overview

Congestion Management Overview Congestion management features allow you to control congestion by determining the order in which packets are sent out an interface based on priorities assigned to those packets. Congestion management entails

More information

Chapter 24 Congestion Control and Quality of Service 24.1

Chapter 24 Congestion Control and Quality of Service 24.1 Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control

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

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