Unicast Routing PDF
Unicast Routing PDF
There are several tools that can be used in the Internet for debugging.
We can determine the viability of a host or router.
We can trace the route of a packet.
We introduce two tools that use ICMP for debugging: ping and traceroute.
Ping
o We can use the ping program to find if a host is alive and responding.
o The source host sends ICMP echo-request messages; the destination, if alive,
responds with ICMP echo-reply messages.
o The ping program sets the identifier field in the echo-request and echo-reply message
and starts the sequence number from 0; this number is incremented by 1 each time a
new message is sent.
o When the packet arrives, it subtracts the arrival time from the departure time to get
the round-trip time (RTT).
Traceroute
The traceroute program in UNIX or tracert in Windows can be used to trace the path
of a packet from a source to the destination.
It can find the IP addresses of all the routers that are visited along the path. The
program is usually set to check for the maximum of 30 hops (routers) to be visited.
The traceroute program gets help from two error-reporting messages: time-exceeded
and destination-unreachable
MOBILE IP
The IP addresses are designed to work with stationary hosts because part of the address
defines the network to which the host is attached.
Mobile IP has two addresses for a mobile host: one home address and one care-of address.
The home address is permanent; the care-of address changes as the mobile host moves from
one network to another.
Three Phases
To communicate with a remote host, a mobile host goes through three phases:
Agent discovery
registration
data transfer
Data Transfer
From Remote Host to Home Agent
From Home Agent to Foreign Agent
From Foreign Agent to Mobile Host
From Mobile Host to Remote Host
Inefficiency in Mobile IP
Double Crossing
Triangle Routing
Unicast Routing
The goal of the network layer is to deliver a datagram from its source to its
destination or destinations.
If a datagram is destined for only one destination (one-to-one delivery), we
have unicast routing.
If the datagram is destined for several destinations (one-to-many delivery), we
have multicast routing.
Unicast routing in the Internet, with a large number of routers and a huge
number of hosts, can be done only by using hierarchical routing: routing in
several steps using different routing algorithms.
There are several routes that a packet can travel from the source to the
destination; what must be determined is which route the packet should take.
An Internet as a Graph
Least-Cost Routing