Scribd
Upload
0 views8 pages

Introduction to Routing and Summarization

The document discusses route summarization for various cities in a network, detailing how to derive summary routes based on common bits in IP addresses. It provides specific examples for Winnipeg, Calgary, Edmonton, and Vancouver, illustrating the summarization process and resulting routes. Additionally, it contrasts Distance Vector and Link State routing protocols, highlighting their differences in topology awareness and update mechanisms.

Uploaded by

إسلاميات - Islamic
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 views8 pages

Introduction to Routing and Summarization

The document discusses route summarization for various cities in a network, detailing how to derive summary routes based on common bits in IP addresses. It provides specific examples for Winnipeg, Calgary, Edmonton, and Vancouver, illustrating the summarization process and resulting routes. Additionally, it contrasts Distance Vector and Link State routing protocols, highlighting their differences in topology awareness and update mechanisms.

Uploaded by

إسلاميات - Islamic
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Introduction to Routing and

Summarization
Summarization

Figure 1: Network without route summarization


Summarization..

Refer to Figure 1:
1. Summarization for Winnipeg’s Routes:

[Link] = 10101100.00010000.01000000.00000000
[Link] = 10101100.00010000.01000001.00000000
[Link] = 10101100.00010000.01000010.00000000
[Link] = 10101100.00010000.01000011.00000000
Common bits: 10101100.00010000.010000xx

The first 22 bits of the four networks are common


Therefore the summary route is: [Link]/22
Summarization..

Refer to Figure 1:
2. Summarization for Calgary’s Routes:

[Link] = 10101100.00010000.01000100.00000000
[Link] = 10101100.00010000.01000101.00000000
[Link] = 10101100.00010000.01000110.00000000
[Link] = 10101100.00010000.01000111.00000000
Common bits: 10101100.00010000.010001xx

The first 22 bits of the four networks are common


Therefore the summary route is: [Link]/22
Summarization..

Refer to Figure 1:
3. Summarization for Edmonton’s Routes:

[Link] = 10101100.00010000.01001000.00000000
[Link] = 10101100.00010000.01001001.00000000
[Link] = 10101100.00010000 01001010.00000000
[Link] = 10101100.00010000 01001011.00000000
[Link] = 10101100.00010000.01001100.00000000
[Link] = 10101100.00010000.01001101.00000000
[Link] = 10101100.00010000.01001110.00000000
[Link] = 10101100.00010000.01001111.00000000
Common bits: 10101100.00010000.01001xxx

The first 21 bits of the four networks are common


Therefore the summary route is: [Link]/21
Summarization..

Refer to Figure 1:
4. Summarization for Vancouver’s Routes:

[Link] = 10101100.00010000.01000000.00000000
[Link] = 10101100.00010000.01000100.00000000
[Link] = 10101100.00010000.01001000.00000000
Common bits: 10101100.00010000.0100xxxx

The first 20 bits of the four networks are common


Therefore the summary route is: [Link]/20
Summarization..
Distance Vector vs Link State

Distance Vector Link State


Limited scope topology, 15 hops Have full scope of the topology
Routers see only directly Routers see the whole network
connected routers
Periodic updates including the Includes information regarding
entire tables every 30 seconds the changed network in the
routing updates.
Class full/classless routing Classless routing protocols
protocols ABCD

You might also like