[go: up one dir, main page]
Scribd
Upload
245 views7 pages

Numericals On Routing

The document contains several numerical problems related to routing in computer networks. It provides solutions to routing problems involving concepts like flooding, distance vector routing, reverse path forwarding, subnet masks and IP addressing. It also includes questions on topics like traffic shaping, fragmentation, virtual circuits and IP address space utilization.

Uploaded by

devgarg792004
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
245 views7 pages

Numericals On Routing

The document contains several numerical problems related to routing in computer networks. It provides solutions to routing problems involving concepts like flooding, distance vector routing, reverse path forwarding, subnet masks and IP addressing. It also includes questions on topics like traffic shaping, fragmentation, virtual circuits and IP address space utilization.

Uploaded by

devgarg792004
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
You are on page 1/ 7

Numericals on Routing

1. Consider the following network.

Suppose that it uses flooding as the routing algorithm. If a packet sent by A to D has a
maximum hop count of 3, list all the routes it will take. Also tell how many hops worth of
bandwidth it consumes.
Solution
It will follow all of the following routes:
ABCD, ABCF, ABEF, ABEG, AGHD, AGHF, and AGEB
The number of hops used is 24.

2. Consider the following network. Suppose that it uses flooding as the routing
algorithm. If a packet sent by A to G has a maximum hop count of 3, list all the routes
it will take. Also tell how many hops worth of bandwidth it consumes.

Solution
It will follow all of the following routes:
AEHK, AEHI, AFIH, AFIN, AFIJ, AFDC, AFDG
The number of hops used is 21

3. Consider a network (A, B, C, D, E, F) where distance vector routing is used. Router C has
received the following vectors from B(3, 0, 6, 8, 4, 2), D(12, 13, 5, 0, 8, 10) and F(8, 9, 7, 4, 4, 0).
Assume the delay links from C to B, D and F are 3, 2 and 1 respectively.
What will be C's routing table?

Solution

Router C has recived routing table from B, D and F.

Going via B gives (3 + 3, 0 + 3, 6 + 3, 8 + 3, 4 + 3, 2 + 3) = (6, 3, 9, 11, 7, 5)

Going via D gives ( 12 + 2, 13 + 2 + 2, 5 + 2, 0 + 2, 8 + 2, 10 + 2) = (14, 17, 7, 2, 10, 12)

Going via F gives (8 + 1, 9 + 1, 7 + 1, 4 + 1, 4 + 1, 0 + 1) = (9, 10, 8, 5, 5, 1)

Taking the minimum for each destination (A, B, C, D, E, F) except for C is (6, 3, 0, 2, 5, 1) via
(B, B, -, D, F, F).

3. Consider the following subnet. Apply Distance vector routing and find the distance
vector for each router

Step 1 : Create initial routing table for each router

For Router A For Router B

For Router C For Router D


Step2: Each router shares its routing table with its neighbours and
update its table using received tables and by finding minimum
distance using distance vector formula of bellman ford algorithm
e.g For router A
 Cost of reaching destination B from router A = min { 2+0 , 1+7 } = 2 via B.
 Cost of reaching destination C from router A = min { 2+3 , 1+11 } = 5 via B.
 Cost of reaching destination D from router A = min { 2+7 , 1+0 } = 1 via D.

Updated A table Similarly, updated B table

updated C table updated D table

So, distance vector of router A is (0,2,5,1)


distance vector of router B is (2,0,3,3)
distance vector of router C is (5,3,0,6)
distance vector of router D is (1,3,6,0)
If delays are recorded as 8-bit numbers in a 50-router network, and delay vectors are
exchanged twice a second, how much bandwidth per (full-duplex) line is chewed up by
the distributed routing algorithm? Assume that each router has three lines to other
routers.
ANS:
The routing table is 400 bits. Twice a second this table is written onto each line, so 800
bps are needed on each line in each direction.
(Chapter 5, Problem 14)

Looking at the following subnet, how many packets are generated by a broadcast from
B, using a) reverse path forwarding and b) the sink tree? Sketch diagrams.

ANS:
a) The reverse path forwarding algorithm takes five rounds to finish. The packet
recipients on these rounds are AC, DFIJ, DEGHHIIJKN, EFHLLMOO, GMLH,
respectively. A total of 28 packets are generated.
b) The sink tree needs four rounds and 14 packets.

(Chapter 5, Problem 38)

Convert the IP address whose hexadecimal representation is A44FF1BC to dotted


decimal notation.

ANS:
(A) 16=(1010)2
(4)16=(0100)2
(F)16=(1111)2
(1)16=(0001)2
(B) 16=(1011)2
(C) 16=(1100)2
(A44FF1BC)16=(10100100.01001111.11110001.10111100)2
(10100100)=27+25+22=128+32+4=(164)10
(01001111)=26+23+22+21+20=64+8+4+2+1=(79)10
(11110001)=27+26+25+24+20=128+64+32+16+1=(241)10
(10111100)= 27+25+24+23+22=128+32+16+8+4=(188)10
(A44FF1BC)16=164.79.241.188

(Chapter 5, Problem 39-1)

A network on the Internet has a subnet mask of 255.255.240.0. What is the maximum
number of hosts it can handle?

ANS:
255.255.240.0 in binary is 11111111.11111111
The mask is 20 bits long, so the network part is 20 bits. The remaining 12 bits are for the
host, so 4096 host addresses exist.

(Chapter 5, Problem 39-2)


A network on the Internet has a subnet mask of 255.255.224.0. What is the maximum
number of hosts it can handle?
ANS:
The mask is 19 bits long, so the network part is 19 bits. The remaining 13 bits are for the
host, so 8192 host addresses exist.

(Chapter 5, Problem 40-1)

A large number of consecutive IP address are available starting at 198.16.0.0. Suppose


that four organizations, A, B, C, and D, request 4000, 2000, 4000, and 8000 addresses,
respectively, and in that order. For each of these, give the first IP address assigned, the
last IP address assigned, and the mask in the w.x.y.z/s notation.

ANS:
To start with, all the requests are rounded up to a power of two. The starting address,
ending address, and mask are as follows:
A: 198.16.0.0 – 198.16.15.255 written as 198.16.0.0/20
B: A: 198.16.16.0 – 198.23.15.255 written as 198.16.16.0/21
C: A: 198.16.32.0 – 198.47.15.255 written as 198.16.32.0/20
D: A: 198.16.64.0 – 198.95.15.255 written as 198.16.64.0/19

(Chapter 5, Problem 40-2)

A large number of consecutive IP address are available starting at 198.16.0.0. Suppose


that four organizations, A, B, C, and D, request 2000, 4000, 6000, and 8000 addresses,
respectively, and in that order. For each of these, give the first IP address assigned, the
last IP address assigned, and the mask in the w.x.y.z/s notation.

ANS:
Starting address Ending address Mask
A: 198.16.0.0 198.16.7.255 198.16.0.0/21
B: 198.16.16.0 198.16.31.255 198.16.16.0/20
C: 198.16.32.0 198.16.63.255 198.16.32.0/19
D: 198.16.64.0 198.16.95.255 198.16.064.0/19

(Chapter 5)

An ATM network uses a token bucket scheme for traffic shaping. Anew token is put into
the bucket every 5 msec. Each token is good for one cell which contains 48 bytes of data.
What is the maximum sustainable data rate?

ANS:
With a token every 5 msec, 200,000 cells/sec can be sent. Each cell holds 48 data bytes or
384 bits. The net data rate is then 76.8 Mbps.

(Chapter 5)
Is fragmentation needed in concatenated virtual-circuit internets or only in datagram
systems?
ANS:
Fragmentation is needed in both. Even in a concatenated virtual-circuit network,
some networks along the path might accept 1024 – byte packets, and others might
only accept 48-byte packets. Fragmentation is still needed.

(Chapter 5)

Suppose that instead of using 16 bits for the network part of a class B address
originally, 20 bits had been used. How many class B networks would there have been?

ANS:
With a 2 – bit prefix, there would have been 18 bits left over to indicate the network.
Consequently, the number of networks would have been 2 power of 18 or 262,144.
However, all 0s and all 1s are special, so only 262,142 are available.

You might also like