Advanced Computer Networks (CS ZG525) : BITS Pilani

Advanced Computer
Networks (CS ZG525)

BITS Pilani
Pilani Campus
Virendra S Shekhawat
Department of Computer Science and Information Systems
BITS Pilani
Pilani Campus
First Semester 2015-2016

Lecture-17 [25th Oct 2015]
Agenda
TCP Performance Over Wireless Links
[CH-30]
Reading
A Comparison of Mechanisms for Improving TCP Performance over
Wireless Links by H Balakrishnan
Web Reference
http://daedalus.cs.berkeley.edu/publications/sigcomm96.pdf
IP Mobility Problem and Solutions
[CH-31, Ch-32]
Reading
3
First Sem 2015-16
Advanced Computer Networks CS G525
BITS Pilani, Pilani Campus
TCP Problems Over Noisy Links

Wireless links are inherently error-prone
Fades, interference, attenuation
Errors often happen in bursts
TCP cannot distinguish between corruption and

congestion
TCP unnecessarily reduces window, resulting in low
throughput and high latency
Burst losses often result in timeouts

Sender retransmission is the only option
Inefficient use of bandwidth
4
First Sem 2015-16
Performance Degradation
Sequence number (bytes)
2.0E+06
Best possible
TCP with no errors
(1.30 Mbps)
1.5E+06
TCP Reno
(280 Kbps)
1.0E+06
5.0E+05
0.0E+00
0
10
20
30
40
50
60
Time (s)
2 MB wide-area TCP transfer over 2 Mbps Lucent WaveLAN
First Sem 2015-16
Proposed Solutions
End-to-End protocols
Selective ACKs, Explicit Loss Notification (ELN),
Selective Acknowledgement
Split-connection protocols
Separate connections for wired path and wireless hop
Reliable link-layer protocols (Hide link related

losses from the TCP)
Error-correcting codes
Local retransmission
Snooping
6
First Sem 2015-16
Approach Styles (End-to-End)

Improve TCP implementations
Improve loss recovery (SACK, NewReno) i.e. Fast Retransmit
Help it to identify congestion (ELN, ECN).How to implement?
ACKs include flag indicating wireless loss
Trick TCP into doing right thing e.g. send extra dupacks
Wired link
Wireless link
7
First Sem 2015-16
Approach Styles (Split Connection)

Split connections (aka Indirect TCP)
Wireless connection need not be TCP (SRP over UDP)
Hard state at base station
TCP protocol processing at base station twice for each packet

Complicates mobility
Vulnerable to failures
Violates end-to-end semantics
Wired link
Wireless link
8
First Sem 2015-16
Congestion Window (bytes)
Split-Connection Congestion
Window
60000
Wired connection
Wireless connection
50000
40000
30000
20000
10000
0
20
40
60
80
100
120
Time (sec)
Wired connection does not shrink congestion window
But wireless connection times out often, causing sender to stall
9
First Sem 2015-16
Approach Styles (Link Layer)

More aggressive local retransmit than TCP
Bandwidth not wasted on wired links
Adverse interactions with transport layer

Timer interactions
Interactions with fast retransmissions
Large end-to-end round-trip time variation
FEC does not work well with burst losses

Wired link
Wireless link
ARQ/FEC
10
First Sem 2015-16
Hybrid Approach: Snoop

Protocol
Shield TCP sender from wireless losses
Eliminate adverse interactions between protocol layers
Congestion control only when congestion occurs
Modify base station

To cache un-acked TCP packets
and perform local retransmissions
Key ideas
No transport level code in base station
When node moves to different base station, state
eventually recreated there
Preserve TCP/IP service model: end-to-end

semantics
11
First Sem 2015-16
Snoop Protocol: CH to MH
4
6
Correspondent
Host
Snoop Agent
Base Station
Mobile Host
Snoop agent: active interposition agent

Snoops on TCP segments and ACKs
Detects losses by duplicate ACKs and timers
Suppresses duplicate ACKs from MH
First Sem 2015-16
12
6
Snoop Agent
3
5
21
4
Correspondent
Host
Base Station
Mobile Host
Transfer of file from CH to MH

Current window = 6 packets
13
First Sem 2015-16
6
Snoop Agent
5
4
Correspondent
Host
Base Station
Mobile Host
Transfer begins
14
First Sem 2015-16
4
6
Correspondent
Host
Snoop Agent
Base Station
Mobile Host
Snoop agent caches segments that pass by
15
First Sem 2015-16
4
6
Correspondent
Host
Snoop Agent
3
Base Station
Mobile Host
1
Lost Packets
Packet 1 is Lost
16
First Sem 2015-16
5
Snoop Agent
4
3
2
ack 0
Correspondent
Host
Base Station
Mobile Host
1
Lost Packets
Packet 1 is Lost
Duplicate ACKs generated
17
First Sem 2015-16
6
Snoop Agent
6
4
3
2
ack 0
Correspondent
Host
Base Station
ack 0
Mobile Host
1
Lost Packets
Packet 1 is Lost
Duplicate ACKs generated
Packet 1 retransmitted from cache at higher priority

18
First Sem 2015-16
6
Snoop Agent
6
1
4
3
2
ack 4
Correspondent
Host
Base Station
ack 0
Mobile Host
Duplicate ACKs suppressed
19
First Sem 2015-16
6
Snoop Agent
6
1
4
3
2
ack 5
Correspondent
Host
Base Station
Mobile Host
ack 4
Clean cache on new ACK
20
First Sem 2015-16
6
ack 4
Correspondent
Host
Snoop Agent
6 5
1
4
3
2
ack 6
Base Station
Mobile Host
ack 5
Clean cache on new ACK
21
First Sem 2015-16
9
Snoop Agent
8
Correspondent
Host ack 5
Base Station
ack 6
6 5
1
4
3
2
Mobile Host
Active soft state agent at base station

Transport-aware reliable link protocol
Preserves end-to-end semantics
22
First Sem 2015-16
Performance: FH to MH
1.6
1.4
Throughput (Mbps)
Snoop+SACK
1.2
Snoop
SPLIT-SACK
TCP SACK
0.8
SPLIT
0.6
Snoop+SACK
and Snoop
perform best
TCP SACK
performance
disappointing
TCP Reno
0.4
0.2
0
0
500
1000
1500
2000
2500
1/Bit-error Rate (1 error every x Kbits)
2 MB local-area TCP transfer over 2 Mbps Lucent WaveLAN

First Sem 2015-16
23
Summary
End-to-end schemes, while not as effective as local
techniques in handling wireless losses
But no extra support is required
The split-connection approach, with standard TCP used

for the wireless hop, shields the sender from wireless
losses
However the throughput is still slightly less than that for a
well-tuned link-layer scheme that does not split the
connection
The TCP-aware link-layer protocol (snoop) with

Selective Acknowledgment performs the best
24
First Sem 2015-16
Next
What is Mobility?
Why we need Mobility?
IP Mobility Solutions (Routing Solutions)
Ethernet
IP Routing
Mobile IP
25
First Sem 2015-16
Introduction
Mobility in wireless networks refers to a node, Mobile Node
(MN), changing its point of attachment to the network while
its communication to the network remains uninterrupted
Host Mobility
Movement of a node
Network Mobility
Movement of a network
Personal Mobility
Movement of users rather than devices
Session Mobility
Mobility between two terminals
26
First Sem 2015-16
Why Things Move?

Physical Mobility
Devices (Host) move to new attachment point
Multi-homing
Devices starts using different attachment point
e.g. 3G, WiFi
Migration
VM migration
Fail-over
Backup -Primary
27
First Sem 2015-16
Mobility and Internet

Since the standard Internet combines the unique
host identifier with the topology location using
IP addresses, it cannot provide support for
mobility
IETF Support for Mobility
Mobile IP supports mobility by decoupling the
binding between the host identifier and topology
location using a fixed indirection point
28
First Sem 2015-16
Requirements of Mobility
Efficient Handoff
Location management
Security
Efficient Routing
A mobility scheme is said to be scalable if its performance does not drop as the number of nodes
(MNs and CNs) increases.
Fault Tolerance
Simultaneous Mobility
Compatibility with IP Routing
Link layer Independence
Transparency
Packets should be routed with the latency as low as possible, optimally close to the shortest path
provided by IP routing.
Scalability
If a mobile host offers services to other nodes, it must be able to be located by these nodes as it
moves as well as keeping the privacy of its topological location.
Transparent to the applications
29
QoS
First Sem 2015-16
Handling Mobility
Change Address of Mobile Node
Change the mapping of name to address
Mobility is a directory problem
Keeping the Address same

Change the routes to reach the new location
Mobility is a routing problem
30
First Sem 2015-16
Internet Design Decisions

Socket abstraction
Connection between a pair of fixed IP addresses
and port numbers
Leads to more emphasis on routing solutions
Interface addresses
Addresses refer to interfaces (adaptors)
Not the host, or the service
31
First Sem 2015-16
IP Mobility
IP address changes as the mobile device moves
and changes its point of attachment
Problem:
Active TCP connections break
Can DNS solve it?
Too slow: new IP address might be unknown to clients that
want to access the mobile node
32
First Sem 2015-16
Routing Solutions
Ethernet
MAC learning of the new location
IP routing
Inject IP address(es) at new location
Mobile IP
Stationary home agent directs traffic to new
location
33
First Sem 2015-16
Ethernet
Ethernet handles mobility
IP address and MAC address stay the same
Switches learn to route to the new location
But, larger networks have multiple segments

Cannot retain your IP address as you move
Solution: virtual local area networks (VLAN)

Logical Ethernet segment spanning a campus
e.g., interconnecting the WiFi access points
34
First Sem 2015-16
Pros and Cons

Advantages
Seamless mobility, no changes to hosts or apps
No changes to MAC or IP addresses
Disadvantages
Ethernet does not scale
Long paths, state per MAC address, flooding,
Widely used approach in campus networks

35
First Sem 2015-16
IP Routing
Node has a persistent address (e.g., 15.30.40.7)
Injected into routing protocol (e.g., OSPF)
15.30.40.0/24
15.30.40.7
36
First Sem 2015-16
Pros and Cons

Advantages
Seamless mobility, no MAC or IP address changes
Traffic follows an efficient path to new location
Disadvantages
Does not scale to large number of mobile hosts
More routing-protocol messages
Larger routing tables to store smaller address
blocks
First Sem 2015-16
37
37
Mobile IP[1]
MN
HA
Home Subnet
Foreign Subnet
MN
CN
FA
38
First Sem 2015-16
Mobile IP[2]: MN to CN
Communication
MN
HA
Home Subnet
Foreign Subnet
MN
CN
FA
39
First Sem 2015-16
Mobile IP: Agent discovery

Agent advertisement: foreign/home agents advertise service by
broadcasting ICMP messages (typefield = 9)
0
type = 9
24
checksum
=9
code = 0
=9
H,F bits: home and/or

foreign agent
R bit: registration
required
16
standard
ICMP fields
router address
type = 16
length
registration lifetime
sequence #
RBHFMGV
bits
reserved
0 or more care-ofaddresses
mobility agent
advertisement
extension
40
Mobile IP: Registration example

home agent
HA: 128.119.40.7
foreign agent
COA: 79.129.13.2
visited network: 79.129.13/24
ICMP agent adv.

COA: 79.129.13.2
registration req.
COA: 79.129.13.2
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 9999
identification: 714
encapsulation format
.
Mobile agent
MA: 128.119.40.186
registration req.
COA: 79.129.13.2
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 9999
identification:714
.
registration reply
time
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 4999
Identification: 714
encapsulation format
.
registration reply
HA: 128.119.40.7
MA: 128.119.40.186
Lifetime: 4999
Identification: 714
.
41
First Sem 2015-16
Problem: MN to CN
Communication
The IP address of the MN is topologically incorrect
inside the foreign network (remember MN keeps
fixed IP)
Firewall in foreign network may prevent packets
from being transmitted with topologically incorrect
source address
Solution: Reverse tunneling
Establish a topologically correct reverse tunnel from CoA
to HA
Outgoing packets tunneled to the HN and then routed to
the CN
42
First Sem 2015-16
Mobile IP[3]: Reverse Routing
MN
HA
Home Subnet
Foreign Subnet
MN
CN
FA
43
First Sem 2015-16
Mobile IP[3]
Advantages
Seamless to the remote end-point
No routing-protocol overhead
Disadvantages
Overhead of running home and foreign agents
Inefficient triangle routing (high stretch)
Foreign agent sends spoofed IP source address
44
First Sem 2015-16
Enhancements-Efficient Routing
Problem: Triangular Routing in Mobile IPv4
Solution:
HA informs the CN about the location of MN
CN caches the current COA of the MN for some time
CN directly tunnels packets to COA, instead of using HA
Problem: Security issues
45
First Sem 2015-16
Smooth Handover
Problem: MN moves from one FA to another
Cached COA (at CN or HA) is outdated
Solution:
The new FA sends a binding update to the old FA
The old FA forwards remaining packets to new FA and releases
resources for the MN
If the old FA receives packets for an MN, but it is not its
current FA, it can send a binding warning to the sender of the
packet
46
First Sem 2015-16
Mobile IPv4 and NAT Traversal

Mobile IP uses IP-in-IP tunneling between HA and FA
Not enough information to allow packets to traverse
NAT (no port information)
Solution:
Extending the registration and tunnel procedure
Registration message sent using UDP
HA detects presence of NAT by comparing source IP with
COA
MN indicates UDP tunneling capability by including the
UDP tunneling extension in the registration request
(includes the NAT tunnel port number)
HA sets up UDP tunnel using the NAT tunnel port: packets
correctly forwarded to MN
47
First Sem 2015-16
Mobile IPv6
No FA needed
IPv6 has auto configuration (a node can assign itself
a topologically valid IPv6 address composed from
the network address and its MAC address)
Use auto configuration to get a topologically correct
COA
Packets are sent with COA as source address
COA is the current source address of the MN in the
foreign network
No firewall problems
48
First Sem 2015-16
Need of Mobility
Increasing demand for seamless IP mobility
E.g., continue a VoIP call while on the train
E.g., virtual machine migration within and between
data centers
Increasing integration of WiFi and cellular

E.g., multi-homed cell phones that can use both
networks (announced for Samsung Galaxy S5)
E.g., servers with multiple interface cards
Need better mobility & multi-homing solutions!

49
First Sem 2015-16
Mobile IP in practice
First RFC 1996

Mobile IPv6, 2011
Proxy Mobile IPv6
Similar to Mobile IP, but implemented entirely inside the network
3G and UMTS have Mobile IP (conceptually) implemented
Internally
Mobility support for 802.11, WiMAX
As a mechanism to perform IP handover across different wireless
Technologies
LTE->UMTS, WiMAX, 802.11
50
First Sem 2015-16
Thank You!
51
First Sem 2015-16

Advanced Computer Networks (CS ZG525) : BITS Pilani

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Advanced Computer Networks (CS ZG525) : BITS Pilani

Încărcat de

Drepturi de autor:

Formate disponibile

Advanced Computer

Networks (CS ZG525)

First Semester 2015-2016

IP Mobility Problem and Solutions

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

TCP Problems Over Noisy Links

TCP cannot distinguish between corruption and

Burst losses often result in timeouts

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Reliable link-layer protocols (Hide link related

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Approach Styles (End-to-End)

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Approach Styles (Split Connection)

TCP protocol processing at base station twice for each packet

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Congestion Window (bytes)

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Approach Styles (Link Layer)

Adverse interactions with transport layer

FEC does not work well with burst losses

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Hybrid Approach: Snoop

Modify base station

Preserve TCP/IP service model: end-to-end

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Snoop agent: active interposition agent

Advanced Computer Networks CS G525

Transfer of file from CH to MH

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Snoop agent caches segments that pass by

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Packet 1 retransmitted from cache at higher priority

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Duplicate ACKs suppressed

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Clean cache on new ACK

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Clean cache on new ACK

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Active soft state agent at base station