CSE3214 Computer Network
Protocols and Applications
Chapter 4
Examples and Homework Problems
Example 1 (R4)
For a datagram network below,
a. Show the forwarding table in router A, such that all traffic destined
to host H3 is forwarded through interface 3.
b. Can you write down a forwarding table in router A, such that all
traffic from H1 destined to host H3 is forwarded through interface
3, while all traffic from H2 destined to host H3 is forwarded
through interface 4?
Solution to Example 1
(a) Data destined to host H3 is forwarded through interface 3
Destination Address Link Interface
H3 3
(b) No, because forwarding rule is only based on destination
address.
Example 2 (P11)
Consider a datagram network using 8-bit host address. Suppose a
router uses longest prefix matching and has the following forwarding
table:
Prefix Match Interface
00 0
010 1
011 2
10 2
11 3
For each of the four interfaces, give the associated range of
destination host addresses and the number of addresses in
the range.
Solution to Example 2
Destination Address Range Link Interface
00000000 – 00111111 0
01000000 – 01011111 1
01100000 – 01111111 2
10000000 – 10111111 2
11000000 – 11111111 3
number of addresses for interface 0 = 26 =64
number of addresses for interface 1 = 25 =32
number of addresses for interface 2 = 25 +26 =32+64 =96
number of addresses for interface 3 = 26 =64
Example 3 (R27)
1. In the following classful IP addresses, find the class of each
address:
(a) 00000001 00001011 00001011 00001011
(b) [Link]
(c) [Link]
2. In the classless IP address, what is the network address if one of
its address is: [Link]/27
Solution to Example 3
1(a) 00000001 00001011 00001011 00001011
The leading bit is 0, Class A
1(b) [Link]
The first byte is 227, which falls between 224 to 239, Class D
1(c) [Link]
The first byte is 14, which falls between 0 to 127, Class A
Solution to Example 3 (cont)
2. In the classless IP address, what is the network address if one of
it’s address is: [Link]/27
The prefix length is 27 keep the first 27 bits as is and change the
remaining 5 bits to 0s.
The last 5 bits affect only the last byte. The last byte is 01010010.
By setting the last 5 bits to 0s, we get 0100000=64
So network address is : [Link]/27
Example 4
An organization is granted a block of addresses with the beginning
address [Link]/24. There are 256 addresses in this block. The
organization needs to have 11 subnets as shown below:
a. 2 subnets, each with 64 addresses
b. 2 subnets, each with 32 addresses
c. 3 subnets, each with 16 addresses
d. 4 subnets, each with 4 addresses
Design the subnets. (To simplify your work, assume all 0-s and all 1-
s subnet ID are allowed)
Solution to Example 4
a. 2 subnets, each with 64 addresses – 6-bit long hostIDs
b. 2 subnets, each with 32 addresses – 5-bit long hostIDs
c. 3 subnets, each with 16 addresses – 4-bit long hostIDs
d. 4 subnets, each with 4 addresses – 2-bit long hostIDs
The given IP address block is:
Solution to Example 4 (cont 1)
Solution to Example 4 (cont 2)
Homework Problems
Solutions will be available on course website:
[Link]
Problem 1(R15)
1. Suppose there are three routers between a source host and
a destination host. Ignoring fragmentation, an IP datagram
sent from the source host to the destination host will
travel over how many interfaces? How many forwarding
tables will be indexed to move the datagram from the
source to the destination?
Problem 2 (R17)
Suppose Host A sends Host B a TCP segment encapsulated in
an IP datagram. When Host B receives the datagram, how does
the network layer in Host B know it should pass the segment
(that is, the payload of the datagram) to TCP rather than to
UDP or to something else?
Problem 3 (P13)
Consider a router that interconnects three subnets: Subnet 1,
Subnet 2, and Subnet 3. Suppose all of the interfaces in each of
these three subnets are required to have the prefix
223.1.17/24. Also suppose that Subnet 1 is required to
support at least 60 interfaces. Subnet 2 is to support at least
90 interfaces, and Subnet 3 is to support to at least 12
interfaces. Provide three network addresses (of the form
a.b.c.d/x) that satisfy these constraints.
Problem 4 (P18)
Use the whois service at the American Registry for Internet
Numbers ([Link] to determine the IP
address blocks for three universities. Can the whois services
be used to determine with certainty the geographical location
of a specific IP address? Use [Link] to
determine the location of the Web servers at each of these
universities.
3 universities:
1. Polytechnic Institute of New York University
2. Stanford University
3. University of Washington
Problem 5 (P26)
Consider the following
network. With the
indicated link costs, use
Dijkstra’s shortest-path
algorithm to compute
the shortest path from x
to all network nodes.
Show how the algorithm
works by listing each
steps in a table.
Problem 6 (P30)
Consider the network fragment shown on next page, x has
only two attached neighbors, w and y. w has a minimum-cost
path to destination u (not shown) of 5, and y has a minimum-
cost path to u of 6. The complete paths from w and y to u are
not shown. All link costs in the network have strictly positive
values.
a. Give x’s distance vector for destinations w, y, and u.
b. Give a link-cost change for either c(x,w) or c(x,y) such
that x will inform its neighbors of a new minimum-cost
path to u as a result of executing the distance vector
algorithm.
Problem 6 figure (P30)