cse 30264 computer networks
DESCRIPTION
CSE 30264 Computer Networks. Prof. Aaron Striegel Department of Computer Science & Engineering University of Notre Dame Lecture 20 – March 25, 2010. Today’s Lecture. Project 3 In-Class Exercise Network Issues Congestion Avoidance Quality of Service. Application. Transport. Network. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/1.jpg)
CSE 30264
Computer Networks
Prof. Aaron StriegelDepartment of Computer Science & Engineering
University of Notre Dame
Lecture 20 – March 25, 2010
![Page 2: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/2.jpg)
CSE 30264 2
Today’s Lecture
• Project 3– In-Class Exercise
• Network Issues– Congestion Avoidance– Quality of Service
Spring 2010
Physical
Data
Network
Transport
Application
![Page 3: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/3.jpg)
CSE 30264 3
Project 3
• Ninja C / C++– Pointers / etc.
• Discussion / in-class exercise
Spring 2010
![Page 4: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/4.jpg)
Spring 2009 CSE30264 4
Congestion Control
OutlineCongestion AvoidanceREDTCP Vegas
![Page 5: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/5.jpg)
Spring 2009 CSE30264 5
Random Early Detection (RED)
• Notification is implicit – just drop the packet (TCP will timeout)– could make explicit by marking the packet
• Early random drop– rather than wait for queue to become full, drop each
arriving packet with some drop probability whenever the queue length exceeds some drop level
![Page 6: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/6.jpg)
Spring 2009 CSE30264 6
RED Details (cont)• Computing probability P
TempP = MaxP * (AvgLen - MinThreshold)/ (MaxThreshold - MinThreshold)
P = TempP/(1 - count * TempP)
• Drop Probability Curve
![Page 7: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/7.jpg)
Spring 2009 CSE30264 7
Tuning RED• Probability of dropping a particular flow’s packet(s) is
roughly proportional to the share of the bandwidth that flow is currently getting
• MaxP is typically set to 0.02, meaning that when the average queue size is halfway between the two thresholds, the gateway drops roughly one out of 50 packets.
• If traffic is bursty, then MinThreshold should be sufficiently large to allow link utilization to be maintained at an acceptably high level
• Difference between two thresholds should be larger than the typical increase in the calculated average queue length in one RTT; setting MaxThreshold to twice MinThreshold is reasonable for traffic on today’s Internet
![Page 8: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/8.jpg)
Spring 2009 CSE30264 8
TCP Vegas• Idea: source watches for some sign that router’s queue is
building up and congestion will happen too; e.g.,– RTT grows– sending rate flattens
![Page 9: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/9.jpg)
Spring 2009 CSE30264 9
Algorithm • Let BaseRTT be the minimum of all measured RTTs
(commonly the RTT of the first packet)• If not overflowing the connection, then
ExpectedRate = CongestionWindow/BaseRTT• Source calculates sending rate (ActualRate) once per RTT• Source compares ActualRate with ExpectedRate
Diff = ExpectedRate - ActualRateif Diff < a
increase CongestionWindow linearlyelse if Diff > b
decrease CongestionWindow linearlyelse
leave CongestionWindow unchanged
![Page 10: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/10.jpg)
Spring 2009 CSE30264 10
Algorithm (cont)• Parameters
- a = 1 packet- b = 3 packets
![Page 11: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/11.jpg)
CSE 30264 11
Derivation
• How long will something take via TCP?• Derive
– ROM – Rough Order of Magnitude Estimates– See in-class notes
Spring 2010
![Page 12: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/12.jpg)
Spring 2009 CSE30264 12
Quality of Service
OutlineRealtime ApplicationsIntegrated ServicesDifferentiated Services
![Page 13: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/13.jpg)
Spring 2009 CSE30264 13
Realtime Applications• Require “deliver on time” assurances
– must come from inside the network
• Example application (audio)– sample voice once every 125us– each sample has a playback time– packets experience variable delay in network– add constant factor to playback time: playback point
Microphone
Speaker
Sampler,A Dconverter
Buffer,D A
![Page 14: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/14.jpg)
Spring 2009 CSE30264 14
Playback BufferS
eque
nce
num
ber
Packetgeneration
Networkdelay
Buffer
Playback
Time
Packetarrival
![Page 15: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/15.jpg)
Spring 2009 CSE30264 15
Example Distribution of Delays
![Page 16: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/16.jpg)
Spring 2009 CSE30264 16
Taxonomy
![Page 17: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/17.jpg)
Spring 2009 CSE30264 17
Integrated Services
• Service Classes– guaranteed– controlled-load
• Mechanisms– resource reservation (signalling)– admission control– policing– packet scheduling
![Page 18: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/18.jpg)
Spring 2009 CSE30264 18
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– 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
![Page 19: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/19.jpg)
Spring 2009 CSE30264 19
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
![Page 20: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/20.jpg)
Spring 2009 CSE30264 20
Reservation Protocol• Called signalling 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
![Page 21: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/21.jpg)
Spring 2009 CSE30264 21
RSVP ExampleSender 1
Sender 2
PATH
PATH
RESV(merged)
RESV
RESV
Receiver B
Receiver A
R
R
R
R
R
![Page 22: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/22.jpg)
Spring 2009 CSE30264 22
RSVP
• Associate packet with reservation (classifying):– source address, destination address, protocol number,
source port, destination port• Manage packets in queues (scheduling).
![Page 23: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/23.jpg)
Spring 2009 CSE30264 23
RSVP versus ATM (Q.2931)• RSVP
– 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
![Page 24: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/24.jpg)
Spring 2009 CSE30264 24
Differentiated Services• Problem with IntServ: scalability• Idea: segregate packets into a small number of classes
– e.g., premium vs best-effort• Packets marked according to class at edge of network• 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 WFQ
![Page 25: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/25.jpg)
Spring 2009 CSE30264 25
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
![Page 26: CSE 30264 Computer Networks](https://reader036.vdocuments.us/reader036/viewer/2022062310/56815f48550346895dce25ab/html5/thumbnails/26.jpg)
CSE 30264 26
Moment of Zen
Spring 2010