Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
20 bytes
CSCE515 – Computer Network Programming
Data
Redirect
0 78 15 16 31
Time Exceeded type(17 or 18) code(0) checksum
there are more ... identifier sequence number
subnet mask
TTL = 2 TTL = 3
WHY?
TTL = 1 39 bytes
S R1 R2 D
Ethernet IP ICMP IP header of datagram UDP
ICMP TE ICMP TE ICMP TE?? Header header header that generated error header
14 20 8 20 8
UDP “port unreachable”
ICMP
Entries M
P s
IC rect tagram
our packet (one of
di forward da our IP address or
re abled) broadcast addresses)?
IP output: rdi ng en
(if forwa
routing calculate next hop
table router (if necessary) sourc
e rou
tin g
process IP options
IP input queue
IP layer
network interfaces
CSCE515 – Computer Network Programming
host host
129.252.1.180 129.252.1.180
(1) IP datagram (1) IP datagram
0 78 15 16 31
Autonomous Systems
Collection of networks with same policy
ICMP
network interfaces
CSCE515 – Computer Network Programming CSCE515 – Computer Network Programming
Routing Protocols Distance-vector Protocols
Executed by routing daemon to Maintain a vector of
distances
communicate routing information with
Each router updates its
other routers routing table based on
vector of distances
received from neighbors
Two types of routing algorithms (IGPs) Example: RIP
Distance-vector routing
most widely used routing
protocol
Link-state routing
the metrics used: hop
count
(must be 0)
metric(1-16)
B
No security protection
(must be 0)
Fix some deficiencies of RIP command
address family
version
(must be 0)
32-bit IP address
Support multiple domain (must be 0)
0 78 15 16 31
20
(must be 0) bytes command(1-6) version(2) routing domain
Include subnet mask metric(1-16)
address family(2) route tag
Some simple authentication scheme (up to 24 more routes)
32-bit IP address
added 32-bit subnet mask 20 bytes
RIP-1 Message Format
32-bit next-hop IP address
metric(1-16)
Once a router receives all the link state packets from the
network, it can reconstruct the complete topology and
compute a shortest path between itself and any other
node using Dijkstra’s algorithm (shortest path).
Open Shortest Path First (OSPF) OSPF: Modified Link State Routing
Routing algorithm now used in the Internet Recall:
In link state routing, routers flood their routing information to all other
OSPF uses the Link State Routing algorithm with modifications to routers in the network
support:
Multiple distance metrics (geographical distance, delay, throughput) In OSPF, routers only send their information to “adjacent routers”,
Support for real-time traffic not to all routers.
Support for subnets
Hierarchical routing
Adjacent does NOT mean nearest-neighbor in OSPF
Security – a simple authentication scheme
One router in each area is marked as the “designated router”
Use IP to carry its message Designated routers are considered adjacent to all other routers in
Provide features superior to RIP the area
198.0.0.0 255.0.0.0
Local preference
AS3
Multi-Exit Discriminator (MED) AS3
AS4
AS4
160.10.0.0/16
AS5
AS5 160.10.0.0/16
Next Lecture:
DNS