Lecture 22

Anycast Routing, Routing for Mobile Nodes and Congestion Control

Anycast Routing
not to deliver to everyone in the group (multicast)
but to deliver to anyone in the group
just enough to reach the closest node
eg. DNS
all the members of group 1 will be given the label 1, now every node will try to reach 1 with the
shortest path
DVR can distribute vectors and nodes can choose
DVR cannot differentiate between 2 nodes labelled as 1 and it would still work
This will result in nodes sending to the nearest instance of destination 1

Routing for Mobile Hosts

when communication is happening your device's location could physically change
Network has to find it first.
all mobile hosts have a permanent home location (4G)
where you got your sim card/registered
home agent : it will take packets on behalf of you.
method 1: packets reach home and then the mobile host
method 2: recompute routes as the mobile host moves and the topology changes
ISSUES With this ?? (SIR Q)
Another alternative would be to provide mobility above the network

layer. When they are moved to new Internet locations, laptops

acquire new network addresses. In coming packets would need a

higher layer location service. Moreover, connections cannot be

maintained while the host is moving

Example

first mobile host was on the east coast of US

now host reaches west coast
 now it will acquire a care of address from the tower to communicate with the tower
register the care of address with the home agent
user on north west wants to send something, sender knows home address, so it sends to that,
now home agent tunnels it to the care of address.
once the connection between sender and host it can make a direct tunnel and go through it
without sender home_address host
IMPORTANT : here only the endpoints change the infrastructure doesn't

Routing for Adhoc Networks

when routers is moving ??
network topology is changing
Ad hoc :: not fixed infrastructure
Each node communicates wirelessly and acts as both a host and a router. Networks of nodes that
just happen to be near each other are called ad hoc networks or MANETs (Mobile Ad hoc
NETworks)
We will look at AODV (Ad hoc On-demand Distance Vector) (Perkins and Royer, 1999). It is a
relative of the distance vector algorithm that has been adapted to work in a mobile environment, in
which nodes often have limited bandwidth and battery lifetimes
 in first round B and D get it from A
arrow points to parent
root discovery packet eventually reaches I
when I receives this , it sends it in the reverse order.
I to G to D to A
now all these routers update their routing table and hops table etc.
G to I : through I and hop 1
D to I : through G and hop 2
A to I : through D and hop 3
the source A could get multiple route reply packets from (ADGI, ADFHI etc) it will store the one
with the lowest cost

Congestion Control
Too many packets present in (a part of) the network causes packet delay and loss that degrades
performance
This situation is called congestion.
The network and transport layers share the responsibility for handling congestion
good put refers to the useful part of the packets send
routes updates, discovery reply, DNS are all not considered here but considered in throughput
 ideally once goodput increases beyond capacity it should still be able to output at capacity.
desirable is eventually reach there (smoothen)
but at some point congestion happens
all packets eventually could reach there, but it could result in timer running out and packet not
reaching
when 1 packet is not reached we again pump now again that is not reached we again pump and
so on and congestion collapse occurs (due to queuing, scheduling)
maybe read about this

Congestion control

Congestion control has to do with making sure the network is able to

carry the offered traffic.

It is a global issue, involving the behavior of all the hosts and routers.

Flow

between 2 nodes
Flow control, in contrast, relates to the traffic between a particular sender and a particular receiver
Its job is to make sure that a fast sender cannot continually transmit data faster than the receiver
is able to absorb it.
Methods for Congestion Control

load shedding is whenever a packet comes you drop it

this like road
Provision - build new roads
Traffic aware routing : 1 way during traffic heavy time etc.