C08-Network Protocols
C08-Network Protocols
❑ Motivation ❑ Problems
❑ Data transfer ❑ Micro mobility support
❑ Encapsulation ❑ DHCP
❑ Security ❑ Ad-hoc networks
❑ IPv6 ❑ Routing protocols
Routing
❑ based on IP destination address, network prefix (e.g. 129.13.42)
determines physical subnet
❑ change of physical subnet implies change of IP address to have a
topological correct address (standard IP) or needs special entries in
the routing tables
Specific routes to end-systems?
❑ change of all routing table entries to forward packets to the right
destination
❑ does not scale with the number of mobile hosts and frequent
changes in the location, security problems
Changing the IP-address?
❑ adjust the host IP address depending on the current location
❑ almost impossible to find a mobile system, DNS updates take to
long time
❑ TCP connections break, security problems
Transparency
❑ mobile end-systems keep their IP address
❑ continuation of communication after interruption of link possible
❑ point of connection to the fixed network can be changed
Compatibility
❑ support of the same protocols as IP
❑ no changes to current end-systems and routers required
❑ mobile end-systems can communicate with fixed systems
Security
❑ authentication of all registration messages
Efficiency and scalability
❑ only little additional messages to the mobile system required
(connection typically via a low bandwidth radio link)
❑ world-wide support of a large number of mobile systems in the
whole Internet
HA
MN
router
end-system router
HA
2
MN
FA foreign
network
HA
1 MN
FA foreign
network
receiver
router
home router MN
FA
network HA
foreign
Internet network
CN router
3.
router
home router MN
2. FA
network HA
4.
foreign
Internet network
1.
CN router
Agent Advertisement
❑ HA and FA periodically send advertisement messages into their
physical subnets
❑ MN listens to these messages and detects, if it is in the home or a
foreign network (standard case for home network)
❑ MN reads a COA from the FA advertisement messages
Registration (always limited lifetime!)
❑ MN signals COA to the HA via the FA, HA acknowledges via FA to MN
❑ these actions have to be secured by authentication
Advertisement
❑ HA advertises the IP address of the MN (as for fixed systems), i.e.
standard routing information
❑ routers adjust their entries, these are stable for a longer time (HA
responsible for a MN over a longer period of time)
❑ packets to the MN are sent to the HA,
❑ independent of changes in COA/FA
0 7 8 15 16 23 24 31
type code checksum
#addresses addr. size lifetime
router address 1
preference level 1
router address 2
preference level 2
...
type = 16
length = 6 + 4 * #COAs type = 16 length sequence number
R: registration required registration lifetime R B H F M G r T reserved
B: busy, no more registrations COA 1
H: home agent COA 2
F: foreign agent ...
M: minimal encapsulation
G: GRE encapsulation
r: =0, ignored (former Van Jacobson compression)
T: FA supports reverse tunneling
reserved: =0, ignored
MN FA HA MN HA
0 7 8 15 16 23 24 31
type = 1 S B DMG r T x lifetime
home address
home agent
COA
identification
extensions . . .
S: simultaneous bindings
B: broadcast datagrams
D: decapsulation by MN
M mininal encapsulation
G: GRE encapsulation
r: =0, ignored
T: reverse tunneling requested
x: =0, ignored
original
original data
header
GRE original
outer header original data
header header
Triangular Routing
❑ sender sends all packets via HA to MN
❑ higher latency and network load
“Solutions”
❑ sender learns the current location of MN
❑ direct tunneling to this location
❑ HA informs a sender about the location of MN
❑ big security problems!
Change of FA
❑ packets on-the-fly during the change can be lost
❑ new FA informs old FA to avoid packet loss, old FA now forwards
remaining packets to new FA
❑ this information also enables the old FA to release resources for the
MN
Data Data
MN changes
location
Update Registration
ACK
Data
Data Data
Warning
Request
Update
ACK
Data
Data
t
HA
2
MN
FA foreign
network
1. MN sends to FA
3 2. FA tunnels packets to HA
CN by encapsulation
3. HA forwards the packet to the
receiver (standard case)
receiver
Mobile IP was developed for IPv4, but IPv6 simplifies the protocols
❑ security is integrated and not an add-on, authentication of
registration is included
❑ COA can be assigned via auto-configuration (DHCPv6 is one
candidate), every node has address autoconfiguration
❑ no need for a separate FA, all routers perform router advertisement
which can be used instead of the special agent advertisement;
addresses are always co-located
❑ MN can signal a sender directly the COA, sending via HA not
needed in this case (automatic path optimization)
❑ „soft“ hand-over, i.e. without packet loss, between two subnets is
supported
⚫ MN sends the new COA to its old router
⚫ the old router encapsulates all incoming packets for the MN and
forwards them to the new COA
⚫ authentication is always granted
Security
❑ authentication with FA problematic, for the FA typically belongs to
another organization
❑ no protocol for key management and key distribution has been
standardized in the Internet
❑ patent and export restrictions
Firewalls
❑ typically mobile IP cannot be used together with firewalls, special
set-ups are needed (such as reverse tunneling)
QoS
❑ many new reservations in case of RSVP
❑ tunneling makes it hard to give a flow of packets a special
treatment needed for the QoS
Security, firewalls, QoS etc. are topics of current research and
discussions!
IP-Header
IP header Authentification-Header
authentication header UDP/TCP-Paket
UDP/TCP data
FA MH
response:
EHA-FA {session key}
EHA-MH {session key}
HA
Micro-mobility support:
❑ Efficient local handover inside a foreign domain
without involving a home agent
❑ Reduces control traffic on backbone
❑ Especially needed in case of route optimization
Example approaches:
❑ Cellular IP
❑ HAWAII
❑ Hierarchical Mobile IP (HMIP)
Important criteria:
Security Efficiency, Scalability, Transparency, Manageability
Operation:
❑ „CIP Nodes“ maintain routing Internet
entries (soft state) for MNs
❑ Multiple entries possible Mobile IP
❑ Routing entries updated based
on packets sent by MN CIP Gateway
data/control
CIP Gateway: packets
❑ Mobile IP tunnel endpoint from MN 1
❑ Initial registration processing
Security provisions:
BS BS BS
❑ all CIP Nodes share packets from
„network key“ MN2 to MN 1
❑ MN key: MD5(net key, IP addr)
MN1 MN2
❑ MN gets key upon registration
Advantages:
❑ Initial registration involves authentication of MNs
and is processed centrally by CIP Gateway
❑ All control messages by MNs are authenticated
❑ Replay-protection (using timestamps)
Potential problems:
❑ MNs can directly influence routing entries
❑ Network key known to many entities
(increases risk of compromise)
❑ No re-keying mechanisms for network key
❑ No choice of algorithm (always MD5, prefix+suffix mode)
❑ Proprietary mechanisms (not, e.g., IPSec AH)
Advantages:
❑ Simple and elegant architecture
❑ Mostly self-configuring (little management needed)
❑ Integration with firewalls / private address support possible
Potential problems:
❑ Not transparent to MNs (additional control messages)
❑ Public-key encryption of MN keys may be a problem
for resource-constrained MNs
❑ Multiple-path forwarding may cause inefficient use of available
bandwidth
Operation:
❑ MN obtains co-located COA 1
Internet
and registers with HA 2 HA
❑ Handover: MN keeps COA,
new BS answers Reg. Request 3 Backbone
and updates routers 4 Router
❑ MN views BS as foreign agent
Crossover
Router
Security provisions:
❑ MN-FA authentication mandatory 2
❑ Challenge/Response Extensions
4 Mobile IP
mandatory DHCP
BS BS BS
Server
Mobile IP
3
MN MN DHCP
1
Advantages:
❑ Mutual authentication and C/R extensions mandatory
❑ Only infrastructure components can influence routing entries
Potential problems:
❑ Co-located COA raises DHCP security issues
(DHCP has no strong authentication)
❑ Decentralized security-critical functionality
(Mobile IP registration processing during handover)
in base stations
❑ Authentication of HAWAII protocol messages unspecified
(potential attackers: stationary nodes in foreign network)
❑ MN authentication requires PKI or AAA infrastructure
Advantages:
❑ Mostly transparent to MNs
(MN sends/receives standard Mobile IP messages)
❑ Explicit support for dynamically assigned home addresses
Potential problems:
❑ Mixture of co-located COA and FA concepts may not be
supported by some MN implementations
❑ No private address support possible
because of co-located COA
Operation:
❑ Network contains mobility anchor point
(MAP) Internet
HA
⚫ mapping of regional COA (RCOA) to link
COA (LCOA)
RCOA
❑ Upon handover, MN informs
MAP only MAP
⚫ gets new LCOA, keeps RCOA
❑ HA is only contacted if MAP binding AR AR
changes update
LCOAnew LCOAold
Security provisions:
❑ no HMIP-specific MN MN
security provisions
❑ binding updates should be
authenticated
Advantages:
❑ Local COAs can be hidden,
which provides some location privacy
❑ Direct routing between CNs sharing the same link is possible (but
might be dangerous)
Potential problems:
❑ Decentralized security-critical functionality
(handover processing) in mobility anchor points
❑ MNs can (must!) directly influence routing entries via binding
updates (authentication necessary)
Advantages:
❑ Handover requires minimum number
of overall changes to routing tables
❑ Integration with firewalls / private address support possible
Potential problems:
❑ Not transparent to MNs
❑ Handover efficiency in wireless mobile scenarios:
⚫ Complex MN operations
⚫ All routing reconfiguration messages
sent over wireless link
Application
❑ simplification of installation and maintenance of networked
computers
❑ supplies systems with all necessary information, such as IP
address, DNS server address, domain name, subnet mask, default
router etc.
❑ enables automatic integration of systems into an Intranet or the
Internet, can be used to acquire a COA for Mobile IP
Client/Server-Model
❑ the client sends via a MAC broadcast a request to the DHCP server
(might be via a DHCP relay) DHCPDISCOVER
DHCPDISCOVER
server client
client relay
selection of configuration
DHCPREQUEST DHCPREQUEST
(reject) (options) confirmation of
configuration
DHCPACK
initialization completed
release
DHCPRELEASE delete context
Server
❑ several servers can be configured for DHCP, coordination not yet
standardized (i.e., manual configuration)
Renewal of configurations
❑ IP addresses have to be requested periodically, simplified protocol
Options
❑ available for routers, subnet mask, NTP (network time protocol)
timeserver, SLP (service location protocol) directory,
DNS (domain name system)
A B C
Mobile
Router
Manet
Mobile
Devices
Mobile IP,
DHCP
Fixed
Network
N1 N1
N2 N3
N3 N2
N4 N4
N5 N5
Distance Vector
❑ periodic exchange of messages with all physical neighbors that
contain information about who can be reached at what distance
❑ selection of the shortest path if several paths available
Link State
❑ periodic notification of all routers about the current state of all
physical links
❑ router get a complete picture of the network
Example
❑ ARPA packet radio network (1973), DV-Routing
❑ every 7.5s exchange of routing tables including link quality
❑ updating of tables also by reception of packets
❑ routing problems solved with limited flooding
Problem
❑ protocols have been designed for fixed networks with infrequent
changes and typically assume symmetric links
Early work
❑ on demand version: AODV
Discover a path
❑ only if a path for sending packets to a certain destination is needed
and no path is currently available
Maintaining a path
❑ only while the path is in use one has to make sure that it can be
used continuously
Path discovery
❑ broadcast a packet with destination address and unique ID
❑ if a station receives a broadcast packet
⚫ if the station is the receiver (i.e., has the correct destination address)
then return the packet to the sender (path was collected in the packet)
⚫ if the packet has already been received earlier (identified via ID) then
discard the packet
⚫ otherwise, append own address and broadcast packet
❑ sender receives packet with the current path (address list)
Optimizations
❑ limit broadcasting if maximum diameter of the network is known
❑ caching of address lists (i.e. paths) with help of passing packets
⚫ stations can use the cached information for path discovery (own paths
or paths for other hosts)
Maintaining paths
❑ after sending a packet
⚫ wait for a layer 2 acknowledgement (if applicable)
⚫ listen into the medium to detect if other stations forward the packet (if
possible)
⚫ request an explicit acknowledgement
❑ if a station encounters problems it can inform the sender of a
packet or look-up a new path locally
N1
N2
R1
S1 N3
N4
N5 N6 R2
S2
N8 N9
N7
neighbors
(i.e. within radio range)
Flat
❑ proactive
⚫ FSLS – Fuzzy Sighted Link State
⚫ FSR – Fisheye State Routing
⚫ OLSR – Optimised Link State Routing Protocol
⚫ TBRPF – Topology Broadcast Based on Reverse Path Forwarding
❑ reactive
⚫ AODV – Ad hoc On demand Distance Vector
⚫ DSR – Dynamic Source Routing
Hierarchical
❑ CGSR – Clusterhead-Gateway Switch Routing
❑ HSR – Hierarchical State Routing
❑ LANMAR – Landmark Ad Hoc Routing
❑ ZRP – Zone Routing Protocol
Geographic position assisted
❑ DREAM – Distance Routing Effect Algorithm for Mobility
❑ GeoCast – Geographic Addressing and Routing
❑ GPSR – Greedy Perimeter Stateless Routing
❑ LAR – Location-Aided Routing
Internet
cluster
super cluster