Network Architectures 3329 Name:

Spring 2018 Homework 4

03/30/2018 Due 04/06/2018

• Print your name.

Problem Points Score

1 2

2 2

3 2

4 2

5 2

Total: 10
 c. Now suppose that this network is a virtual circuit network and that there is
one ongoing call between H1 and H3, and another ongoing call between
H2 and H3. 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.
Network Architectures 3329 the sameHomework
d. Assuming scenario as (c),4write
- Page
down2the
offorwarding
4 tables in 03/30/2018
nodes B, C, and D.

1 B 2
1 3 1
3
H1 A D
2 4 1 2 2

C H3

H2
P5. Consider a VC network with a 2-bit field for the VC number. Suppose that
the network wants to set up a virtual circuit over four links: link A, link B,
1. Consider the network above.
(a) (1 point) Show the forwarding table in router A, such that all traffic destined to host H3
is forwarded through interface 3.

Solution: Data destined to host H3 is forwarded through interface 3

Destination Address H3: Link Interface 3
Problem 5
a)
(b) (1 point) Can you write down a forwarding tableLink
Prefix Match
in router A, such that all traffic from
Interface
H1 destined to host H3 is forwarded
11100000 00 through interface 3,0 while all traffic from H2 destined
11100000 01000000 1
to host H3 is forwarded through interface 4? (Hint: this is a trick question.)
420 CHAPTER 4 •
THE NETWORK LAYER
1110000 2
11100001 1 3
Solution: No, because forwarding rule is only based 3on destination address.
otherwise

b) Prefix match for first address is 5th entry: link interface 3

P11.Prefix
Consider
2. (2 points) Consider a datagram match a datagram
network
for using
second network
8-bit
address using
host
is 3nd 8-bit
addresses.
entry: host addresses.
link interfaceSuppose
2 Suppose
a routera uses
router
longest prefix matching and uses
Prefix longest
hasmatch prefix matching
for third address
the following th and has the following forwarding table:
is 4 entry:
forwarding link interface 3
table:

ProblemPrefix
6 Match Interface

Destination Address
00 Range 0 Link Interface
00000000
through 010 1 0
00111111 011 2
01000000 10 2
through 11 3 1
01011111

01100000
For each of the four interfaces, give theaddresses
associated and
rangethe
of destination
For interface 2, give through
the associated range of destination host 2 number ofhost
addresses and the number of addresses in the range.
01111111
addresses in the range.
P12. Consider a datagram network using 8-bit host addresses. Suppose a
10000000 router uses longest prefix matching and has the following forwarding
throughaddress range Link interface 2
Solution: Destination table:
10111111

11000000 Prefix Match Interface

through 3
11111111
1 0
10 for interface 0 = 2 =1 64
6
number of addresses
number
Number of addresses for ofinterface
addresses 3 26 = 64
111 for=interface 1 = 2 5 = 32
2
number of addresses for interface 2 = 2 6 + 25 = 64 + 32 = 96
otherwise for interface 3 = 2 6 =3 64
number of addresses
3. (2 points) 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
For each of the four interfaces, give the associated range of destination host
addresses and the number of addresses in the range.
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
Network Architectures 3329 Homework 4 - Page 3 of 4 03/30/2018

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 at least 12 interfaces. Provide
three net- work addresses (of the form a.b.c.d/x) that satisfy these constraints.

Solution: 223.1.17.0/26
223.1.17.128/25
223.1.17.192/28

4. (2 points) Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes.
Suppose the original datagram is stamped with the identification number 422. How many
fragments are generated? What are the values in the various fields in the IP datagram(s)
generated related to fragmentation?

Solution: The maximum size of data field in each fragment = 680 (because there are
20 bytes IP header). Thus the number of required fragments = d240020/680e = 4 Each
fragment will have Identification number 422. Each fragment except the last onewill be of
size 700 bytes (including IP header). The last datagram will be of size 360 bytes (including
IP header). The offsets of the 4 fragments will be 0, 85, 170, 255. Each of the first 3
fragments will have flag=1; the last fragment will have flag=0.

5. (2 points) Consider the SDN OpenFlow network shown in the following figure. Suppose that
the desired forwarding behavior for datagrams arriving from host h3 or h4 at s2 is as follows:

• any datagrams arriving from host h3 and destined for h1, h2, h5 or h6 should be forwarded
in a clockwise direction in the network
OpenFlow)example)
• any datagrams arriving from host h4 and destined for h1, h2, h5 or h6 should be forwarded
in a counter clockwise direction in the network

Host h6
10.3.0.6
1 s3 controller
2

3 4
Host h5
10.3.0.5

1 s1 1 s2
2 Host h4
4 2 4
10.2.0.4
Host h1 3 3
10.1.0.1
Host h2
10.1.0.2
Host h3
10.2.0.3

Specify the flow table entries in s2 that implement this forwarding behavior.
 Ingress Port = 2; IP Dst = 10.2.0.3 Forward (3)
Ingress Port = 1; IP Dst = 10.2.0.4 Forward (4)
Ingress Port = 2; IP Dst = 10.2.0.4 Forward (4)
Ingress Port = 4 Forward (3)
Network
IngressArchitectures
Port = 3 3329 Homework 4 - Page 4 of 4 Forward (4) 03/30/2018

Problem 20
Solution:

S2 Flow Table
Match Action
Ingress Port = 3; IP Dst = 10.1.*.* Forward (2)
Ingress Port = 3; IP Dst = 10.3.*.* Forward (2)
Ingress Port = 4; IP Dst = 10.1.*.* Forward (1)
Ingress Port = 4; IP Dst = 10.3.*.* Forward (1)