Overview

15-441: Computer Networking • RSVP

Lecture 21: QoS and • Differentiated services

Mobile/Wireless Networking
• Internet mobility

• TCP Over Noisy Links

Lecture 21: 3-31-05 2

Components of Integrated Services Service Interfaces

1. Type of commitment • Guaranteed Traffic

What does the network promise?
2. Packet scheduling
How does the network meet promises?
3. Service interface
How does the application describe what it wants?
4. Establishing the guarantee
How is the promise communicated
How is admission of new applications controlled?
• Host specifies rate to network
• Why not bucket size b?
• If delay not good, ask for higher rate
• Predicted Traffic
• Specifies (r, b) token bucket parameters
• Specifies delay D and loss rate L
• Network assigns priority class
• Policing at edges to drop or tag packets
• Needed to provide isolation – why is this not done for
guaranteed traffic?
• WFQ provides this for guaranteed traffic

Lecture 21: 3-31-05 3 Lecture 21: 3-31-05 4

•1
Resource Reservation Protocol
RSVP Motivation
(RSVP)
• Carries resource requests all • Resource reservation mechanism
the way through the network
A C for multi-point applications
• Main goal: establish “state” in • E.g., video or voice conference C
B D
each of the routers so they • Heterogeneous receivers
A I
“know” how they should treat • Changing membership
flows.
• State = packet classifier • Use network efficiently J

parameters, bandwidth • Minimize reserved bandwidth

reservation, .. H
• Share reservations between
• At each hop consults admission D receivers
E
G
B F
control and sets up reservation. • Limit control overhead (scaling).
Informs requester if failure • Adapt to routing changes

Lecture 21: 3-31-05 5 Lecture 21: 3-31-05 6

PATH Messages RESV Messages

• PATH messages carry sender’s Tspec
• Token bucket parameters
• Routers note the direction PATH messages
arrived and set up reverse path to sender
• Receivers send RESV messages that follow
reverse path and setup reservations
• If reservation cannot be made, user gets an
error
Lecture 21: 3-31-05
• Forwarded via reverse path of PATH
• Queuing delay and bandwidth requirements
• Source traffic characteristics (from PATH)
• Filter specification
• Which transmissions can use the reserved
resources
• Router performs admission control and
reserves resources
• If request rejected, send error message
7 Lecture 21: 3-31-05 8

•2
Path and Reservation Messages Soft State

• Periodic PATH and RESV msgs refresh

Sender 1 PATH
established reservation state
R • Path messages may follow new routes
Sender 2
PATH
RESV (merged)
RESV
• Old information times out

R R Receiver 1 • Properties
• Adapts to changes routes and sources
• Recovers from failures
R RESV
• Cleans up state after receivers drop out
Reserved bandwidth is maximum of
Receiver 2
what downstream receivers can use
Lecture 21: 3-31-05 9 Lecture 21: 3-31-05 10

Differentiated Services:
Overview
Motivation and Design
• Edge routers do fine grain
enforcement Classification
and conditioning
• RSVP • Typically slower links at edge
• E.g. mail sorting in post offices
• Label packets with a type field
• Uses IP TOS bits
• Differentiated services • E.g. a priority stamp

• Core routers process packets

• Internet mobility based on packet marking and
defined per hop behavior

• TCP Over Noisy Links • More scalable than IntServ

• No per flow state or signaling
Lecture 21: 3-31-05 11 Lecture 21: 3-31-05 12

•3
Expedited Forwarding PHB Expedited Forwarding Traffic Flow
User sends within profile & network commits to delivery with
requested profile Company A
• Strong guarantee
• Possible service: providing a virtual wire Packets in premium Premium packet flow
flows have bit set restricted to R bytes/sec
• Admitted based on peak rate
internal
host router ISP
• Rate limiting of EF packets at edges only, using token
bucket to shape transmission first hop edge
router router
edge
• Simple forwarding: classify packet in one of two queues, router
use priority Unmarked
packet flow
• EF packets are forwarded with minimal delay and loss (up to the
capacity of the router)

Lecture 21: 3-31-05 13 Lecture 21: 3-31-05 14

Assured Forwarding PHB Edge Router Input Functionality

• AF defines 4 classes
• Strong assurance for traffic within profile & allow source to exceed
profile Traffic
• Implement services that differ relative to each other (e.g., gold service, Conditioner 1
silver service…)

1
Flow
• Admission based on expected capacity usage profiles
• Within each class, there are three drop priorities Traffic

N
• Traffic unlikely to be dropped if user maintains profile

ow
Conditioner N
Arriving

Fl
packet Packet Forwarding
• User and network agree to some traffic profile engine
classifier Best effort
• Edges mark packets up to allowed rate as “in-profile” or high
priority
• Other packets are marked with one of 2 lower “out-of-profile”
priorities
• A congested router drops lower priority packets first
classify packets based on packet header
• Implemented using clever queue management (RED with In/Out bit)

Lecture 21: 3-31-05 15 Lecture 21: 3-31-05 16

•4
Traffic Conditioning Router Output Processing

Drop on overflow
EF
What type? High-priority Q
Packet Wait for Packet
Set EF bit output Packets out
input token AF

Low-priority Q
with priority drop
No token AQM (RIO)

Packet Test if token Set AF Packet

input token “in” bit output

Lecture 21: 3-31-05 17 Lecture 21: 3-31-05 18

Edge Router Policing Comparison

Best-Effort Diffserv Intserv

Service • Connectivity • Per aggregation • Per flow isolation

• No isolation isolation • Per flow guarantee
• No guarantees • Per aggregation
Token no guarantee
Clear “in” bit
available? Service Scope • End-to-end • Domain • End-to-end
AF “in” set

Arriving Is packet Not marked Forwarding

Complexity • No set-up • Long term setup • Per flow setup
packet marked? engine

EF set Scalability • Highly scalable • Scalable (edge • Not scalable (each

• (nodes maintain routers maintains router maintains
Token no only routing state) per aggregate state; per flow state)
Drop packet
available? core routers per
class state)

Lecture 21: 3-31-05 19 Lecture 21: 3-31-05 20

•5
Overview Wireless Challenges

• Force us to rethink many assumptions

• Need to share airwaves rather than wire
• RSVP
• Don’t know what hosts are involved
• Host may not be using same link technology
• Differentiated services • Mobility
• Other characteristics of wireless
• Noisy lots of losses
• Internet mobility • Slow
• Interaction of multiple transmitters at receiver
• Collisions, capture, interference
• TCP Over Noisy Links • Multipath interference

Lecture 21: 3-31-05 21 Lecture 21: 3-31-05 22

How to Handle Mobile Nodes?

Routing to Mobile Nodes
(Addressing)
• Obvious solution: have mobile nodes • Dynamic Host Configuration (DHCP)
advertise route to mobile address/32 • Host gets new IP address in new locations
• Should work!!! • Problems
• Host does not have constant name/address how
• Why is this bad? do others contact host
• Consider forwarding tables on backbone • What happens to active transport connections?
routers
• Would have an entry for each mobile host
• Not very scalable
• What are some possible solutions?
Lecture 21: 3-31-05 23 Lecture 21: 3-31-05 24

•6
How to Handle Mobile Nodes? How to Handle Mobile Nodes?
(Naming) (Transport)
• Naming • TCP currently uses 4 tuple to describe
• Use DHCP and update name-address mapping connection
whenever host changes address
• <Src Addr, Src port, Dst addr, Dst port>
• Fixes contact problem but not broken transport
connections • Modify TCP to allow peer’s address to be
changed during connection
• Security issues
• Can someone easily hijack connection?
• Difficult deployment both ends must
support mobility
Lecture 21: 3-31-05 25 Lecture 21: 3-31-05 26

How to Handle Mobile Nodes? How to Handle Mobile Nodes?

(Link Layer) (Routing)
• Link layer mobility • Allow mobile node to keep same address and
name
• Learning bridges can handle mobility this is • How do we deliver IP packets when the endpoint
how it is handled at CMU moves?
• Encapsulated PPP (PPTP) Have mobile host • Can’t just have nodes advertise route to their address
act like he is connected to original LAN • What about packets from the mobile host?
• Routing not a problem
• Works for IP AND other network protocols
• What source address on packet? this can cause
problems
• Key design considerations
• Scale
• Incremental deployment

Lecture 21: 3-31-05 27 Lecture 21: 3-31-05 28

•7
Basic Solution to Mobile Routing Interception

• Same as other problems in computer • Somewhere along normal forwarding path

science • At source
• Any router along path
• Add a level of indirection
• Router to home network
• Keep some part of the network informed • Machine on home network (masquerading as mobile
about current location host)
• Need technique to route packets through this • Clever tricks to force packet to particular
location (interception) destination
• Need to forward packets from this location • “Mobile subnet” – assign mobiles a special address
range and have special node advertise route
to mobile host (delivery)
Lecture 21: 3-31-05 29 Lecture 21: 3-31-05 30

Delivery Mobile IP (RFC 2290)

• Need to get packet to mobile’s current • Interception

location • Typically home agent – a host on home network
• Tunnels • Delivery
• Tunnel endpoint = current location • Typically IP-in-IP tunneling
• Tunnel contents = original packets • Endpoint – either temporary mobile address or foreign
agent
• Source routing
• Terminology
• Loose source route through mobile current
• Mobile host (MH), correspondent host (CH), home
location
agent (HA), foreign agent (FA)
• Care-of-address, home address

Lecture 21: 3-31-05 31 Lecture 21: 3-31-05 32

•8
Mobile IP (MH at Home) Mobile IP (MH Moving)

Packet Packet
Correspondent Host (CH)
Correspondent Host (CH)

Internet
Internet

Home Visiting
Home Visiting Location
Location
Home Agent (HA) Mobile Host (MH)
Mobile Host (MH) I am here

Lecture 21: 3-31-05 33 Lecture 21: 3-31-05 34

Mobile IP (MH Away – FA) Mobile IP (MH Away - Collocated)

Packet
Packet
Correspondent Host (CH) Mobile Host (MH) Correspondent Host (CH)

Internet Internet

Home Visiting Home Visiting

Location Location
Encapsulated Encapsulated
Home Agent (HA) Foreign Agent (FA) Home Agent (HA) Mobile Host (MH)

Lecture 21: 3-31-05 35 Lecture 21: 3-31-05 36

•9
Other Mobile IP Issues Overview

• Route optimality
• Resulting paths can be sub-optimal
• Can be improved with route optimization • RSVP
• Unsolicited binding cache update to sender
• Authentication
• Registration messages
• Differentiated services
• Binding cache updates
• Must send updates across network • Internet mobility
• Handoffs can be slow
• Problems with basic solution
• Triangle routing • TCP Over Noisy Links
• Reverse path check for security
Lecture 21: 3-31-05 37 Lecture 21: 3-31-05 38

Wireless Bit-Errors TCP Problems Over Noisy Links

• Wireless links are inherently error-prone

Router • Fades, interference, attenuation
Computer 1 Computer 2
• Errors often happen in bursts
Loss Congestion
• TCP cannot distinguish between corruption
3
2 and congestion
22
1
0 • TCP unnecessarily reduces window, resulting
in low throughput and high latency
Loss Congestion • Burst losses often result in timeouts
Burst losses lead to coarse-grained timeouts
Wireless • Sender retransmission is the only option
Result: Low throughput • Inefficient use of bandwidth
Lecture 21: 3-31-05 39 Lecture 21: 3-31-05 40

•10
Performance Degradation Proposed Solutions

2.0E+06
• Incremental deployment
Best possible
Sequence number (bytes)
TCP with no errors • Solution should not require modifications to fixed hosts
1.5E+06
(1.30 Mbps) • If possible, avoid modifying mobile hosts
TCP Reno
1.0E+06 (280 Kbps) • End-to-end protocols
• Selective ACKs, Explicit loss notification
5.0E+05 • Split-connection protocols
• Separate connections for wired path and wireless hop
0.0E+00
0 10 20 30 40 50 60
• Reliable link-layer protocols
• Error-correcting codes
Time (s)
• Local retransmission
2 MB wide-area TCP transfer over 2 Mbps Lucent WaveLAN
Lecture 21: 3-31-05 Lecture 21: 3-31-05 42

Approach Styles (End-to-End) Approach Styles (Link Layer)

• Improve TCP implementations • More aggressive local rexmit than TCP
• Not incrementally deployable • Bandwidth not wasted on wired links
• Improve loss recovery (SACK, NewReno)
• Possible adverse interactions with transport layer
• Help it identify congestion (ELN, ECN)
• ACKs include flag indicating wireless loss • Interactions with TCP retransmission
• Trick TCP into doing right thing E.g. send extra • Large end-to-end round-trip time variation
dupacks • FEC does not work well with burst losses
Wired link Wireless link
Wired link Wireless link

ARQ/FEC

Lecture 21: 3-31-05 43 Lecture 21: 3-31-05 44

•11
Important Lessons

• Many assumptions built into Internet design

• Wireless forces reconsideration of issues
• Network EXTRA SLIDES
• Mobile endpoints – how to route with fixed identifier?
• Link layer, naming, addressing and routing solutions
• What are the +/- of each? The rest of the slides are FYI
• Transport
• Losses can occur due to corruption as well as
congestion
• Impact on TCP?
• How to fix this hide it from TCP or change TCP

Lecture 21: 3-31-05 45

RSVP Goals RSVP Service Model

• Used on connectionless networks • Make reservations for simplex data streams
• Should not replicate routing functionality
• Should co-exist with route changes • Receiver decides whether to make
• Support for multicast reservation
• Different receivers have different capabilities and want different
QOS • Control msgs in IP datagrams (proto #46)
• Changes in group membership should not be expensive • PATH/RESV sent periodically to refresh soft
• Reservations should be aggregate – I.e. each receiver in group
should not have to reserve state
• Should be able to switch allocated resource to different senders
• One pass:
• Modular design – should be generic “signaling” protocol
• Result
• Failed requests return error messages -
• Receiver-oriented
receiver must try again
• Soft-state • No e2e ack for success
Lecture 21: 3-31-05 47 Lecture 21: 3-31-05 48

•12
RSVP State in Switches Receiver Initiated Reservations
• Have to keep sink tree information. • Receiver initiates reservation by sending a
• no such thing as inverse multicast routing reservation over the sink tree.
• Also have to keep information on sources if filters are • Assumes multicast tree has been set up previously
used. • also uses receiver-initiated mechanism
• selected in path message
• Uses existing routing protocol, but routers have to store
• used in aggregation and propagating propagating information to
switches the sink tree (reverse path from forwarding path)
• Also used in limiting protocol overhead.
• switches do not propagate periodic reservation and path messages • Properties.
• they periodically regenerate copies that summarize the information • Scales well: can have parallel independent connect and
they have
disconnect actions - single shared resource required
• Raises concerns about scalability. • Supports receiver heterogeneity: reservation specifies
receiver requirements and capabilities

Lecture 21: 3-31-05 49 Lecture 21: 3-31-05 50

DiffServ Per-hop Behaviors (PHBs)

• Analogy: • Define behavior of individual routers rather
• Airline service, first class, coach, various restrictions on coach as a
function of payment than end-to-end services – there may be
many more services than behaviors
• Best-effort expected to make up bulk of traffic, but revenue
from first class important to economic base (will pay for • Multiple behaviors – need more than one bit
more plentiful bandwidth overall)
in the header
• Not as motivated by real-time! Motivated by economics • Six bits from IP TOS field are taken for
and assurances Diffserv code points (DSCP)
• Supports QoS for flow aggregates.
• Architecture does not preclude more fine grain guarantees

Lecture 21: 3-31-05 51 Lecture 21: 3-31-05 52

•13
Red with In or Out (RIO) RIO Drop Probabilities
P (drop in) P (drop out)
• Similar to RED, but with two separate
probability curves
• Has two classes, “In” and “Out” (of profile) P max_out
• “Out” class has lower Minthresh, so packets
are dropped from this class first
• Based on queue length of all packets
P max_in
• As avg queue length increases, “in” packets
are also dropped
min_in max_in min_out max_out
• Based on queue length of only “in” packets avg_in avg_total

Lecture 21: 3-31-05 53 Lecture 21: 3-31-05 54

Overview Adapting Applications

• Adapting Applications to Slow Links • Applications make key assumptions

• Hardware variation
• E.g. how big is screen?
• Software variation
• E.g. is there a postscript decoder?
• Network variation
• E.g. how fast is the network?
• Reason why we are discussing in this class ☺
• Basic idea – distillation
• Transcode object to meet needs of mobile host

Lecture 21: 3-31-05 55 Lecture 21: 3-31-05 56

•14
Transcoding Example Source Adaptation
• Generate reduced
quality variant of Web
page at proxy
• Must predict how much
size reduction will result
from transcoding
• How long to transcode?
• Can also just have source
• Send appropriate provide different versions
reduced-size variant • Common solution today
• Target response time? • No waiting for transcoding
• Full version not sent across
network
• Can’t handle fine grain adaptation
Lecture 21: 3-31-05 57 Lecture 21: 3-31-05 58

•15