Computer Networks

CSE 323 (C)

Homework # 3

Fall 2013

Network and Data Link Layer Services

Date: Saturday, January 18, 2014

Due: Wednesday, January 22, 2014

Q.1 Consider a network setting in the following figure. Node A and node B are in a LAN behind the NAT.
143.89.160.192/26

A
Server

I1
220.32.19.244

192.168.0.2
00:0A:45:B5:34:53

Router
NAT

I2
I3

192.168.0.3
04:77:ED:78:00:A0

143.89.160.200

192.168.0.1
00:0A:45:B5:34:54

143.89.160.128/25

Answer the following questions:

a) Show the routing table at Router with entries for the following fields:
Subnet number

Subnet Mask

[4]

Next Hop (interface)

b) Describe with which interface the packets of the following destinations will be delivered:
i. 200.32.19.201
ii. 143.89.160.197
iii. 143.89.160.145

[3]

Q.2 Assume a DSL residential broadband access connection (PPP over ATM) with MTU 1478 bytes and a UDP
datagram with 5400 bytes of application layer data. IPv4 is used at the network layer.
a) How many fragments are transmitted?
[1]
b) Show all the fragments with the values of the flag bit, the offset and the total length field of the IP
header of each fragment.
[3]
Q.3 Consider the scenario in Figure 4.22 on page 360 of the text. Suppose that host 10.0.0.2 initiates a connection,
using source port 5500 to a web server listening at port 80 at 128.119.40.186.
a) Complete the NAT translation table for this TCP connection.
[3]
b) What are the source and destination IP addresses and port numbers on the IP datagram arriving to the
WAN side of the router with interface address 138.76.29.7?
[2]
Q.4 Consider the network shown below with link costs as indicated in the figure. To get credit for this question,
you should show all iterations of the algorithm.

a) From the topology you have constructed, use Dijkstras

algorithm to compute the shortest path from node z to all other
nodes in the network (Show your steps).
[8]
b) Construct the forwarding table for node z.

Mohammad Mamun Elahi

Page # 1

[2]

January 15, 2014

Computer Networks
CSE 323 (C)

Homework # 3

Fall 2013

Q.5 Consider the following network with 3 hosts and 2 routers. The IP address and MAC address for each
interface are indicated in the figure.
[2+3=5]

a) Suppose all of ARP table in the network is empty. If C wants to send a packet to B,
how many ARP requests will be send out? Identify each pair of requester and responder.
b) List the links the data packet from C to B will go through and corresponding headers.
Link

MAC Source

Dest MAC

IP Source

IP Dest

Q.6 Two hosts, A and B, are connected to an Ethernet Network along with some other hosts. Host A
wishes to send frame a and host B wants to send frame b to some other hosts on the Ethernet. Suppose
that host A has had 5 collisions while trying to send frame a (with some hosts other than host B) and host
B has had 3 collisions while trying to send frame b (with some hosts other than host A). At time T, only
hosts A and B are the ones that are ready to transmit some data. All other hosts remain idle.
a) What is the maximum number K that A & B can get to calculate waiting time for
retransmission?
[2]
b) If bit time is 1 s, K= 10 for A, K = 5 for B, calculate waiting times for both A and B.
[2]
Q.7 Assume we want to protect a data frame from transmission errors with CRC. Given that the frame data
to be transmitted using CRC is 11010111010. Assuming the generator polynomial coefficients are given by
the bit string 10011, how many CRC bits we need? Calculate the CRC bits, showing all the steps. [ 5 ]

Mohammad Mamun Elahi

Page # 2

January 15, 2014