ECE453 – Introduction to Computer Networks Lecture 4 – Data Link Layer (I)
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
-
Upload
percival-watts -
Category
Documents
-
view
218 -
download
0
Transcript of 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
![Page 1: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/1.jpg)
1
ECE453 – Introduction to Computer Networks
Lecture 10 – Network Layer (Routing II)
![Page 2: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/2.jpg)
2
Hierarchical Routing
Problem with maintaining one routing table ???
Administrative autonomy Autonomous System (AS) routers in same AS run same routing protocol -
“intra-AS” routing protocol (intra-domain routing)
routers in different AS can run different intra-AS routing protocol – “inter-AS” routing (inter-domain routing)
![Page 3: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/3.jpg)
3
Intra-AS and Inter-AS Routing
Gateways:•perform inter-AS routing amongst themselves•perform intra-AS routers with other routers in their AS
inter-AS, intra-AS routing in
gateway A.c
network layer
link layer
physical layer
a
b
b
aaC
A
Bd
A.a
A.c
B.a
cb
c
C.b
![Page 4: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/4.jpg)
4
Intra-AS and Inter-AS Routing
Host h2
a
b
b
aaC
A
Bd c
A.a
A.c
C.bB.a
cb
Hosth1
Intra-AS routingwithin AS A
Inter-AS routingbetween A and B
Intra-AS routingwithin AS B
![Page 5: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/5.jpg)
5
Routing in the Internet
The Global Internet consists of Autonomous Systems (AS) interconnected with each other: Stub AS: small corporation Multihomed AS: large corporation (no transit) Transit AS: provider (ISP)
Two-level routing: Intra-AS: administrator is responsible for choice Inter-AS: unique standard
![Page 6: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/6.jpg)
6
Intra-AS Routing
Also known as Interior Gateway Protocols (IGP)Most common IGPs:
RIP: Routing Information Protocol (distance vector) – RIP v2
OSPF: Open Shortest Path First (link state) – OSPF v2
![Page 7: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/7.jpg)
7
RIP ( Routing Information Protocol)
Distance vector algorithmIncluded in BSD-UNIX Distribution in 1982
Originate from Xerox Network System (XNS)
Distance metric: # of hops (max = 15 hops) Use # of hops as the link cost
Distance vectors: exchanged every 30 sec via Response Message (also called advertisement), is actually the routing tableEach advertisement: route to up to 25 destination nets
![Page 8: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/8.jpg)
8
RIP (Routing Information Protocol)
Destination Network Next Router Num. of hops to dest. w A 2
y B 2 z B 7
x -- 1…. …. ....
w x y
z
A
C
D B
Routing table in D
![Page 9: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/9.jpg)
9
RIP: Link Failure and Recovery
If no advertisement heard after 180 sec --> neighbor/link declared dead routes via neighbor invalidated new advertisements sent to neighbors neighbors in turn send out new
advertisements (if tables changed) link failure info quickly propagates to
entire net
![Page 10: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/10.jpg)
10
RIP Table ExampleRouter: giroflee.eurocom.fr
Three attached class C networks (LANs) Router only knows routes to attached LANs Default router used to “go up” Route multicast address: 224.0.0.0 Loopback interface (for debugging)
Destination Gateway Flags Ref Use Interface -------------------- -------------------- ----- ----- ------ --------- 127.0.0.1 127.0.0.1 UH 0 26492 lo0 192.168.2. 192.168.2.5 U 2 13 fa0 193.55.114. 193.55.114.6 U 3 58503 le0 192.168.3. 192.168.3.5 U 2 25 qaa0 224.0.0.0 193.55.114.6 U 3 0 le0 default 193.55.114.129 UG 0 143454
![Page 11: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/11.jpg)
11
OSPF (Open Shortest Path First)
“open”: publicly availableUses Link State algorithm
LS packet dissemination Topology map at each node Route computation using Dijkstra’s algorithm
Advertisements disseminated to entire AS (via flooding)Run on top of IP and send out through raw socket
![Page 12: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/12.jpg)
12
OSPF “Advanced” Features (not in RIP)
Security: all OSPF messages authenticated (to prevent malicious intrusion) – over IPMultiple same-cost paths allowed (only one path in RIP) – traffic load balancingHierarchical OSPF in large domains (RIP doesn’t support hierarchical routing.)
![Page 13: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/13.jpg)
13
Hierarchical OSPF
![Page 14: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/14.jpg)
14
Hierarchical OSPF
Two-level hierarchy: local area, backbone Link-state advertisements only within area each nodes has detailed area topology; only
know direction (shortest path) to nets in other areas
Area border routers: “summarize” distances to nets in own area, advertise to other Area Border routersBackbone routers: run OSPF routing limited to backboneBoundary routers: connect to other AS’s
![Page 15: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/15.jpg)
15
3-Phase Routing Database Synchronization Procedure
Hello Phase – each router establishes neighbor relationship by saying “I am here”DB Exchange Phase: each router tells its neighbors about his knowledge on the “partial maps”Flooding Phase: each router will flood the new information it receives on the “partial maps” from others
the process will cease after DB is synchronized
![Page 16: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/16.jpg)
16
Inter-AS Routing
![Page 17: 1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)](https://reader036.fdocuments.us/reader036/viewer/2022082505/56649da15503460f94a8de96/html5/thumbnails/17.jpg)
17
Internet Inter-AS routing: BGP
BGP (Border Gateway Protocol): the de facto standard, the current version is 4, known as BGP4Path Vector protocol: similar to Distance Vector protocol each Border Gateway broadcasts to
neighbors (peers) entire path (I.e, sequence of ASs) to destination
E.g., Gateway X may send its path to dest. Z:
Path (X,Z) = X,Y1,Y2,Y3,…,Z