24-1 Chapter 24. Congestion Control and Quality of Service part 2 23.5 Quality of Service 23.6 Techniques to Improve QoS 23.7 Integrated Services 23.8.

Slides:



Advertisements
Similar presentations
Quality of Service CS 457 Presentation Xue Gu Nov 15, 2001.
Advertisements

Spring 2003CS 4611 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services.
Spring 2000CS 4611 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services.
Computer Networks24-1 Chapter 24. Congestion Control and Quality of Service 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 – QoS.
24.1 Chapter 24 Congestion Control and Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 30 Quality of Service
Xiaowei Yang CS 356: Computer Network Architectures Lecture 19: Integrated Services and Differentiated Services Xiaowei Yang
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 25 Multimedia.
CSE Computer Networks Prof. Aaron Striegel Department of Computer Science & Engineering University of Notre Dame Lecture 20 – March 25, 2010.
1 Providing Quality of Service in the Internet Based on Slides from Ross and Kurose.
Real-Time Protocol (RTP) r Provides standard packet format for real-time application r Typically runs over UDP r Specifies header fields below r Payload.
Differentiated Services. Service Differentiation in the Internet Different applications have varying bandwidth, delay, and reliability requirements How.
CSIS TAC-TOI-01 Quality of Service & Traffic Engineering (QoS & TE) Khaled Mohamed Credit: some of the sides are from Cisco Systems.
15-441: Computer Networking Lecture 18: QoS Thanks to David Anderson and Srini Seshan.
ACN: IntServ and DiffServ1 Integrated Service (IntServ) versus Differentiated Service (Diffserv) Information taken from Kurose and Ross textbook “ Computer.
QoS Protocols & Architectures by Harizakis Costas.
Congestion Control and Quality of Service
CS Summer 2003 Lecture 8. CS Summer 2003 Populating LFIB with LDP Assigned/Learned Labels Changes in the LFIB may be triggered routing or.
CS 268: Differentiated Services Ion Stoica February 25, 2003.
CSE 401N Multimedia Networking-2 Lecture-19. Improving QOS in IP Networks Thus far: “making the best of best effort” Future: next generation Internet.
1 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services.
15-744: Computer Networking
School of Information Technologies IP Quality of Service NETS3303/3603 Weeks
Quality of Service Support
Internet QoS Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE CS/ECE 438: Communication Networks.
CSc 461/561 CSc 461/561 Multimedia Systems Part C: 3. QoS.
Spring 2002CS 4611 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services.
Internet Quality of Service. Quality of Service (QoS) The best-effort model, in which the network tries to deliver data from source to destination but.
CHAPTER 24. CONGESTION CONTROL AND QUALITY OF SERVICE 24-1.
QoS in MPLS SMU CSE 8344.
Computer Networking Quality-of-Service (QoS) Dr Sandra I. Woolley.
Integrated Services (RFC 1633) r Architecture for providing QoS guarantees to individual application sessions r Call setup: a session requiring QoS guarantees.
1 Integrated and Differentiated Services Multimedia Systems(Module 5 Lesson 4) Summary: r Intserv Architecture RSVP signaling protocol r Diffserv Architecture.
IntServ / DiffServ Integrated Services (IntServ)
CSE679: QoS Infrastructure to Support Multimedia Communications r Principles r Policing r Scheduling r RSVP r Integrated and Differentiated Services.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 23 - Multimedia Network Protocols (Layer 3) Klara Nahrstedt Spring 2011.
CSE QoS in IP. CSE Improving QOS in IP Networks Thus far: “making the best of best effort”
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 23 Congestion Control and Quality of Service.
© 2006 Cisco Systems, Inc. All rights reserved. 3.3: Selecting an Appropriate QoS Policy Model.
Computer Networking Intserv, Diffserv, RSVP.
Quality of Service (QoS)
QOS مظفر بگ محمدی دانشگاه ایلام. 2 Why a New Service Model? Best effort clearly insufficient –Some applications need more assurances from the network.
CSC 336 Data Communications and Networking Lecture 8d: Congestion Control : RSVP Dr. Cheer-Sun Yang Spring 2001.
Class-based QoS  Internet QoS model requires per session state at each router  1000s s of flows  per session RSVP is complex => reluctance.
1 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services MPLS.
CSE Computer Networks Prof. Aaron Striegel Department of Computer Science & Engineering University of Notre Dame Lecture 20 – March 25, 2010.
Network Support for QoS – DiffServ and IntServ Hongli Luo CEIT, IPFW.
Bjorn Landfeldt, The University of Sydney 1 NETS3303 Networked Systems.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 23 Congestion Control and Quality of Service.
© Jörg Liebeherr, Quality-of-Service Architectures for the Internet.
CS640: Introduction to Computer Networks Aditya Akella Lecture 21 – QoS.
1 Lecture, November 27, 2002 TCP Other Internet Protocols; Internet Traffic Scalability of Virtual Circuit Networks QoS.
Differentiated Services Two Approaches for Providing QoS on the Internet u “Freeway model” -- integrated services Internet (intserv) – Build a dedicated.
Chapter 6 outline r 6.1 Multimedia Networking Applications r 6.2 Streaming stored audio and video m RTSP r 6.3 Real-time, Interactive Multimedia: Internet.
EE 122: Integrated Services Ion Stoica November 13, 2002.
Univ. of TehranIntroduction to Computer Network1 An Introduction Computer Networks An Introduction to Computer Networks University of Tehran Dept. of EE.
Quality of Service Frameworks Hamed Khanmirza Principles of Network University of Tehran.
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
Chapter 30 Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
10. Mai 20061INF-3190: Multimedia Protocols Quality-of-Service Foreleser: Carsten Griwodz
Instructor Materials Chapter 6: Quality of Service
Topics discussed in this section:
Congestion Control and
RSVP and Integrated Services in the Internet: A Tutorial
Chapter 25 Multimedia TCP/IP Protocol Suite
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Taxonomy of network applications
CIS679: Two Planes and Int-Serv Model
University of Houston Quality of Service Datacom II Lecture 3
Presentation transcript:

24-1 Chapter 24. Congestion Control and Quality of Service part Quality of Service 23.6 Techniques to Improve QoS 23.7 Integrated Services 23.8 Differentiated Services

24-2 Quality of Service (QoS) Flow Characteristics: Reliability: – needed by flow, Lack of reliability means losing a packet or acknowledgment, which entails retransmission. Delay: – applications can tolerate delay in different degrees. Jitter: – the variation in delay for packets belonging to the same flow – High jitter means the difference between delays is large; low jitter means the variation is small. Bandwidth: – Different applications need different bandwidths. Flow Classes: Based on the characteristics, we can classify flows into groups, with each group having similar levels of characteristics

24-3 QoS Techniques four common techniques that can be used to improve the quality of service : – Scheduling : A good scheduling technique treats the different flows in a fair and appropriate manner. – Traffic shaping: Leaky bucket, token bucket – Resource reservation – Admission control: accept or reject a flow based on predefined parameters called flow specification

1. Scheduling FIFO queuing: packets wait in a buffer (queue) until the (router or switch) is ready to process them. If the average arrival rate is higher than the average processing rate, the queue will fill up and new packets will be discarded. Priority Queuing: Packets are first assigned to priority class. Each priority class has its own queue The packets in the highest-priority queue are processed first Starvation may occurs 24-4

Scheduling (cont..) Weighted Fair Queuing The queues are weighted based on the priority of the queues The system processes packets in each queue in a round-robin fashion with the number of packets selected from each queue based on the weight

Traffic Shaping Traffic shaping is a mechanism to control the amount and the rate of the traffic sent to the network. Two techniques can shape traffic: leaky bucket and token bucket. First technique :Leaky Bucket algorithm shapes bursty traffic into fixed-rate traffic by averaging the data rate. It may drop the packets if the bucket is full.

Traffic Shaping (cont) simple Leaky Bucket Implementation: A FIFO queue holds the packets. If the traffic consists of fixed-size packets the process removes a fixed number of packets from the queue at each tick of the clock. If the traffic consists of variable-length packets, the fixed output rate must be based on the number of bytes or bits. – Algorithm for variable-length packets: 1)Initialize a counter to n at the tick of the clock 2)If n is greater than the size of the packet, send packet and decrement the counter by the packet size. Repeat this step until n is smaller than the packet size 3)Reset the counter and go to step 1

Traffic Shaping (cont) Second technique: Token Bucket The token bucket allows bursty traffic at a regulated maximum rate. The bucket holds tokens. To transmit a packet, we “use” one token. Allows the output rate to vary. Generate a token every r time units For an arriving packet enqueue While buffer not empty and there are tokens send a packet and discard a token

2. Traffic Shaping (cont) 24-9 arrivalqueueToken bucket sent p1 (5)-0- p2 (2)p13- p3 (1)p26-5=1p =1p3,p2 4 6 Token bucket example: parameters: MaxTokens=6 (3 token/time) Combining Token Bucket and Leaky Bucket: The two techniques can be combined to credit an idle host and at the same time regulate the traffic. The leaky bucket is applied after the token bucket the rate of the leaky bucket needs to be higher than the rate of tokens dropped in the bucket.

24-10 Integrated Services (IntServ) Integrated Services is a flow-based QoS model designed for IP Signaling: – implement a flow-based model over a connectionless protocol – Resource Reservation Protocol (RSVP) Flow specification: – Rspec (resource specification) defines the resource that the flow needs to reserve (buffer, bandwidth, etc.) – Tspec (traffic specification) defines the traffic characterization of the flow Admission: – a router decides to admit or deny the flow specification based on the previous commitments of the router and the current availability of the resource. Service classes: guaranteed service and controlled-load service – Guaranteed service class: guaranteed minimum end-to-end delay – Controlled-load service class: accept some delays, but is sensitive to an overloaded network and to the danger of losing packets

24-11 RSVP In IntServ, the resource reservation is for a flow, a kind of virtual circuit network out of the IP RSVP is a signaling protocol to help IP create a flow and consequently make a resource reservation RSVP is a signaling system designed for multicasting Receiver-based reservation RSVP message several types of messages : Path and Resv

24-12 RSVP Messages Resv Messages : Make a resource reservation from each receiver to sender Path message: from sender to all receivers. Recall that the receivers in a flow make the reservation in RSVP.

Reservation Merging the resources are not reserved for each receiver in a flow; the reservation is merged. Rc3 requests a 2-Mbps bandwidth and Rc2 requests a 1-Mbps bandwidth. Router R3 needs to make a bandwidth reservation, merges the two Requests and reserve is made for 2 Mbps so it can handle both requests. The same situation is true for R

24-14 Reservation Styles When there is more than one flow the router needs to make a reservation to accommodate all of them. RSVP defines three types of reservation styles – Wild card filter style: a single reservation for all senders – Fixed filter style: a distinct reservation for each flow – Shared explicit style: a single reservation which can be shared by a set of flow Reservation information (state): soft state Reservation information stored in every node for a flow needs to be refreshed periodically. hard state used in other virtual-circuit protocols such as ATM or Frame Relay, where the information about the flow is maintained until it is erased. Default interval for refreshing is currently 30 s.

Problems with Integrated Services 1.Scalability The Integrated Services model requires that each router keep information for each flow, the Internet is growing every day, this is a serious problem. 2. Service-Type Limitation The Integrated Services model provides only two types of services guaranteed and control-load. Those opposing this model argue that applications may need more than these two types of services

24-16 Differentiated Service (Diffserv) Differentiated Services is a class-based QoS model designed for IP. Diffserv handles the shortcomings of IntServ 1. The main processing was moved from the core of the network to the edge of the network. This solves the scalability problem, where routers do not have to store information about flows applications, or hosts, define the type of service need by each send a packet. 2. The per-flow service is changed to per-class service. The router routes the packet based on the class of service defined in the packet, not the flow. This solves the service-type limitation problem.

Differentiated Service (Diffserv) In Diffserv, each packet contains a field called the DS field. The value of DS field is set at the boundary of the network by the host or the first router designated as the boundary router. Ds filed replace the existing TOS (type of service) field in IPv4 or the class field in IPv6 DS field contains two subfields: – DSCP (DS Code Point) is a 6-bit field that define per-hop behavior (PHB) – CU (currently unused) is 2-bit The Diffserv capable node (router) uses the DSCP 6 bits as an index to table defining the packet-handling mechanism for the current packet being processed

24-18 Per-hop Behavior (PHB) Diffserv defines three PHBs DE PHB (default PHB) is the same as best-effort delivery EF PHB (expedited forwarding PHB) provides the following services: – Low loss, low latency, ensured bandwidth AF PHB (assured forwarding PHB) delivers the packet with a high assurance as long as the class traffic does not exceed the traffic profile of the node

24-19 Traffic Conditioner Meter checks to see if the incoming flow matches the negotiated traffic profile Marker can re-mark a packet with best-effort delivery or down-mark a packet based on the meter information; no up-mark Shaper use the meter information to reshape the traffic if not compliant with the negotiated profile. Dropper, like a shaper with no buffer, discard packets if the flow severely violates the profile