Professional Documents
Culture Documents
SCCS 420 CH 22-1 (Delivery Forwarding Routing)
SCCS 420 CH 22-1 (Delivery Forwarding Routing)
LECTURE 6
• I. Delivery
Delivery, Forwarding and Routing
• II. Forwarding
• III. Unicast Routing Protocols
— Autonomous System (AS)
— Distance Vector Routing - RIP
Chapter 22 Network Layer: Delivery, Forwarding and Routing — Link State Routing - OSPF
(Forouzan, Data Communications and Networking, 4th Edition)
— Path Vector Routing - BGP
1 2
Figure 22.3 Host-specific versus network-specific method Figure 22.4 Default method
Solution
Table 22.1 shows the corresponding table.
11 12
Figure 22.6 Configuration for Example 22.1 Table 22.1 Routing table for router R1
m3
m3
Network cloud
(logical), not a
physical IP address
13 14
17 18
19 20
Figure 22.8 Longest mask matching Hierarchical Routing
• To take advantage of address aggregation, we can
assign a block of IP addresses hierarchically
• The Internet is divided into international and national
ISPs
• National ISPs are divided into regional ISPs
• Regional ISPs are divided into local ISPs
• Local ISP can assign addresses in its block to various
sizes of customer organizations
• Allow one aggregated entry for all ISPs under the same
national ISP
— The rest of Internet does not have to be aware of how
addresses are divided by this national ISP
• Only one entry in every router in the world for this ISP
• Reduce the size of routing table
21 22
to divide this block into four subblocks, each with 4096 ISP
Household (4) Reserved
addresses. Three of these subblocks are assigned to three
Regional
local ISPs; the second subblock is reserved for future use. ISP
Large (1024)
Note that the mask for each block is /20 because the organization
local
ISP
original block with mask /18 is divided into 4 blocks.
Small (256) local
The first local ISP has divided its assigned subblock into organization ISP
8 smaller blocks and assigned each to a small ISP (/23).
Each small ISP provides services to 128 households, each
using four addresses (with mask of /30). 23 24
Example 22.5 (continued) Quiz #7 (1pt, 11:39-11:54 AM)
The second local ISP has divided its block into 4 blocks • 22-18) Show the routing table for the regional
and has assigned the addresses to four large ISP in Figure 22.9
organizations. small
ISP
The third local ISP has divided its block into 16 blocks local
ISP
and assigned each block to a small organization. Each small
small organization has 256 addresses, and the mask is ISP
Household (4) Reserved
/24. Regional
ISP
There is a sense of hierarchy in this configuration. All Large (1024) local
organization
routers in the Internet send a packet with destination ISP
31 32
Netstat -rnes
III. UNICAST ROUTING PROTOCOLS
Distance Vector Routing Figure 22.15 Initialization of tables in distance vector routing
• Initialization
—Each node knows the distance between itself and its
immediate neighbors, those directly connected to it
• Sharing
—Node shares its table with other nodes to allow
communication with non-neighboring nodes
• Node C shares its table with Node A, enable Node A to reach
Node E
—Entire table is shared
• The information receiver decides if it want to use which part
of the table and discard which part of the table
• Third column (next hop) is replaced with sender’s name
In distance vector routing, each node shares its routing table with its
39 immediate neighbors periodically and when there is a change.40
Figure 22.16 Updating in distance vector routing One exception to the rule
1. Receiver (A) adds the 4. If old cost is equal or 6. If next node entry is the 6 C
cost between itself (A) lower, it is kept same, the new row must
and sender (C) to each 5. If old cost is higher, be used
value in the second the entry from the new
column table is used
2. ∞ + 2 = ∞
3. Name of the sender (C)
is added to third column 41 42
• Define infinity to a smaller number, such as 100 • Cannot be solved by split horizon
• Split Horizon
—Only parts of the table is sent to neighbors
—If node B thinks that optimum route to X is via A, then
it does not need to advertise this information to A
• A should already know this information
• Split Horizon and Poison Reverse
—Normally, distance vector protocol uses a timer to
delete a route from its table if there is no news about
this route • Loop continues
—Some update is still needed
—A advertises the route to X to C, with increased cost
—Node B can still advertise value for X, but with a
warning “Do not use this value; what I know about this —Loop stops when cost reaches infinity
route comes from you” 45 46
49 50
55 56
Figure 22.24 Areas in an autonomous system Figure 22.25 Types of links
• Point-to-point link connects directly between two • Transient link = network with several routers attached to it
routers — Data can enter and leave through any routers
—Each router only has one neighbor at the other side of — All LANs represent transient link
• Some WANs with more than one router also are transient link
the link
— Each router has many neighbors
—Does not need network address
• Figure b shows neighborhood relationship
—Metrics are shown at two ends, one for each direction — Fully connected network need 20 advertisement messages
• Figure c shows another representation, with designated
59 router representing the network 60
Figure 22.28 Stub link Figure 22.29 Example of an AS and its graphical representation in OSPF
61 62