Review: Network link technologies

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.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 – QoS.
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.
Differentiated Services. Service Differentiation in the Internet Different applications have varying bandwidth, delay, and reliability requirements How.
Fall 2006CS 5611 Congestion Control Outline Queuing Discipline Reacting to Congestion Avoiding Congestion Quality of Service.
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.
Congestion Control Outline Queuing Discipline Reacting to Congestion Avoiding Congestion.
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
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.
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.
5-Sep-154/598N: Computer Networks Recap UDP: IP with port abstraction TCP: Reliable, in order, at most once semantics –Sliding Windows –Flow control: ensure.
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.
CSE679: QoS Infrastructure to Support Multimedia Communications r Principles r Policing r Scheduling r RSVP r Integrated and Differentiated Services.
© 2006 Cisco Systems, Inc. All rights reserved. 3.3: Selecting an Appropriate QoS Policy Model.
Computer Networking Intserv, Diffserv, RSVP.
QOS مظفر بگ محمدی دانشگاه ایلام. 2 Why a New Service Model? Best effort clearly insufficient –Some applications need more assurances from the network.
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.
Spring 2001CS Multimedia, QoS Multimedia (7.2, 9.3) Compression RTP Realtime Applications Integrated Services Differentiated Services Quality.
© 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.
Ch 6. Multimedia Networking Myungchul Kim
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
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.
Spring 2002CS 3321 Quality of Service Outline Realtime Applications Integrated Services Differentiated Services.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Integrated Services & RSVP Types of pplications Basic approach in IntServ Key components Service models.
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
Internet Quality of Service
Instructor Materials Chapter 6: Quality of Service
Congestion Control and
Congestion Control, Quality of Service, and Internetworking
CS 268: Computer Networking
RSVP and Integrated Services in the Internet: A Tutorial
EE 122: Lecture 16/17 (Integrated Services)
Congestion Control and Resource Allocation
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
Advanced Computer Networks
QoS Guarantees introduction call admission traffic specification
UNIT IV TRANSPORT LAYER.
So far, On the networking side, we looked at mechanisms to links hosts using direct linked networks and then forming a network of these networks. We introduced.
Taxonomy of real time applications
EE 122: Quality of Service and Resource Allocation
Figure Areas in an autonomous system
EE 122: Differentiated Services
Anup K.Talukdar B.R.Badrinath Arup Acharya
CIS679: Two Planes and Int-Serv Model
Quality-of-Service ECE1545.
University of Houston Quality of Service Datacom II Lecture 3
Computer Networks Protocols
Congestion Control and Resource Allocation
Presentation transcript:

Review: Network link technologies What happens when client send packets back-to-back? What happens when the network is saturated? What about bandwidth/latency/jitter? Nature of packet loss? Ethernet: CSMA/CD - collisions Wireless LAN: CSMA/CA - wireless channel Wireless Cellular - handovers Point-to-point - dialup - Token-Ring - 4/16 Mbps - fair access ATM - cell based - 155 Mbps - pre-determined

TCP components Sliding window protocol to achieve reliable transmission Ideally, bandwidth x delay product worth window RTT estimation algorithms Advertised window for flow control - receiver restriction Congestion window for congestion - network restriction Basically, advertised window and congestion window reduces the amount of data that we can send TCP uses end-point probing to learn about network Causing congestion creates implicit feedback - cannot expect explicit feedback in the Internet Nice = slow to detect network limits, fast = congestion When congestion happens, be nice and backoff

TCP congestion response AIMD - increment slowly to probe network, backoff multiplicatively when congestion happens Slow Start - increment multiplicatively -> causing congestion sooner Using hybrid, slow start to quickly catchup (like in the beginning) and then use AIMD when fine tuning

Other TCP mechanisms Sequence number space is important to avoid packets from previous (independent) TCP connections Initial sequence no. chosen to be less likely to overlap Sequence number space (+ newer timestamp) SYN+SYN/ACK FIN can be initiated by either side SACK and D-SACK are newer mechanisms to allow the receiver to let the sender know what packets have been received (to avoid unnecessary retransmissions in the case of loss)

TCP and Networks Sequence number management Handshakes Initial sequence number total space Handshakes AIMD or Slow-Start SACK/D-SACK Ethernet Wireless LAN Cellular Token Ring ATM dialup

TCP scenarios High speed web server clients: Dialup user - bandwidth is low Wireless lan user Network errors are bursty Networks can be lossy ADSL user TCP paces itself with ACKs Downlink != uplink Cellular user Handoff delays can throw off TCP Satellite user Asymmetric High bandwidth x delay networks

Quality of Service Outline Realtime Applications Integrated Services Networking with specified delay components Integrated Services Per flow QoS Differentiated Services QoS for aggregated traffic

Streaming Audio The media player buffers input from the media server and plays from the buffer rather than directly from the network.

Realtime Applications Require “deliver on time” assurances must come from inside the network Example application (audio) sample voice once every 125µs each sample has a playback time packets experience variable delay in network add constant factor to playback time: playback point Similar to skip protection in portable CD players Microphone Speaker Sampler, A D converter Buffer, D A

Playback Buffer Playback point as insurance against Internet delays Multimedia care about delay and jitter (variability within delay) Packet arrival Packet generation Playback Sequence number Buffer Network delay T ime

Example Distribution of Delays What is a good delay? 200 msec Not acceptable for chat application 90% 97% 98% 99% 3 2 1 50 100 150 200 Delay (milliseconds)

Video transmission Frame sender receiver Time Network delay Playback

Taxonomy of real time applications Elastic (tcp, udp) Download mp3 Intolerant (remote surgery) Tolerant Nonadaptive Adaptive Rate adaptive (change video b/w) Delay adaptive (add delay)

QoS Approaches Fine grained - individual application or flows Intserv E.g. for my video chat application Coarse grained - aggregated traffic Diffserv E.g. All traffic from CSE (costs $$)

Integrated Services IETF - 1995-97 time frame Service Classes guaranteed controlled-load (tolerant, adaptive applications) Simulates lightly loaded link Mechanisms signaling protocol: signals required service admission control: rejects traffic that cannot be serviced Policing: make sure that senders stick to agreement packet scheduling: manage how packets are queued

Flowspec Rspec: describes service requested from network controlled-load: none guaranteed: delay target Tspec: describes flow’s traffic characteristics average bandwidth + burstiness: token bucket filter token rate r and bucket depth B must have a token to send a byte must have n tokens to send n bytes start with no tokens accumulate tokens at rate of r per second can accumulate no more than B tokens

Per-Router Mechanisms Admission Control decide if a new flow can be supported answer depends on service class not the same as policing Packet Processing classification: associate each packet with the appropriate reservation scheduling: manage queues so each packet receives the requested service

Reservation Protocol Called signaling in ATM Proposed Internet standard: RSVP Consistent with robustness of today’s connectionless model Uses soft state (refresh periodically) Designed to support multicast Receiver-oriented Two messages: PATH and RESV Source transmits PATH messages every 30 seconds Destination responds with RESV message Merge requirements in case of multicast Can specify number of speakers

RSVP Example (multicast) Sender 1 Sender 2 PATH RESV (merged) Receiver B Receiver A R

RSVP versus ATM (Q.2931) RSVP ATM receiver generates reservation soft state (refresh/timeout) separate from route establishment QoS can change dynamically receiver heterogeneity ATM sender generates connection request hard state (explicit delete) concurrent with route establishment QoS is static for life of connection uniform QoS to all receivers

Differentiated Services Problem with IntServ: scalability, IntServ operates in a per-flow basis Idea: segregate packets into a small number of classes e.g., premium vs best-effort Packets marked according to class at edge of network (ND will mark certain packets) Core routers implement some per-hop-behavior (PHB) Example: Expedited Forwarding (EF) rate-limit EF packets at the edges PHB implemented with class-based priority queues or Weighted Fair Queue (WFQ)

DiffServ (cont) Assured Forwarding (AF) customers sign service agreements with ISPs edge routers mark packets as being “in” or “out” of profile core routers run RIO: RED with in/out