1.

Determine the shortest path using Dijkstras algorithm from node v to all other nodes in the
network. You need to draw a table similar to the one shown in class and clearly illustrate all the
steps. You will not get credit for just writing the final answer. (5 points)

2. What is the difference between routing and forwarding? (1 point)

3. What is 32 bit equivalent of the IP address 223.2.7.61? (1 point)

4. Write the largest possible subnet mask if three routers 223.2.7.7, 223.2.7.1 and 223.2.7.5 are
all in the same subnet. (2 points)

5. How big is the MAC address space? Compare it against the IPv4 address space? (2 points)

6. What is the main difference between non-persistent and persistent HTTP? (1 point)

7. Why is an ARP query sent within a broadcast frame? Why is an ARP response sent within a
frame with a specific destination MAC address? (2 points)

8. Describe TCP congestion control namely the slow start, congestion avoidance and fast
recovery phases. (2 points)

9. Consider the scenario in the figure below, in which three hosts are each connected to a router
by a 100 Mbps link, with an near-zero ms propagation delay. That router in turn is connected to
another router over a 30 Mbps link with a 50 ms propagation delay, and that latter router is
connected to two remote logging servers, each over a 20 Mbps link with a 10 ms propagation
delay.
Suppose one of the hosts sends a message directly to one of the remote logging servers. The
message is 10K bits long. What is the end-to-end delay from when the message is first
transmitted by the host to when it is received at the remote server? Assume that the request goes
directly to the server, that there are no queueing delays, and that node (router) packet-processing
delays are also zero. (3 points)

10) Describe the primary function of DNS, DHCP and NAT. (3 points)

11) Describe the ALOHA protocol. (2 points)

12) Host A is sending Host B a large file over a TCP connection. Assume Host B has no data to
send Host A. Host B will not send acknowledgments to Host A because Host B cannot
piggyback these acknowledgements on data. True or False? (1 point)

13) Suppose Host A sends a few TCP segments back to back to Host B over a TCP connection.
The first segment has sequence number 90; the second has sequence number 110.

a) How much data is in the first segment?

b) Suppose that the first segment is lost but the second segment arrives at B. In the
acknowledgment that Host B sends to Host A, what will be the acknowledgment number? (2
points)

14. Consider the application layer protocol SMTP. What transport layer protocol does SMTP run
over? Explain your answer (2 points)

15. UDP provides reliable data transfer in the transport layer True or False? (1 point)
Chris Pina
CCST 311
Final
June 18, 2016

Step N' D(t), p(t) D(u), p(u) D(w), p(w) D(x), p(x) D(y), p(y) D(z), p(z)
0 V 4, V 3, V 4, V 3, V 8, V
1 V, U 4, V 4, V 3, V 8, V
2 V, U, X 4, V 4, V 8, V 11, X
3 V, U X, T 4, V 8, V 11, X
4 V, U, X, T, W 8, V 11, X
5 V, U, X, T, W, Y 11, X
1. 6 V, U, X, T, W, Y, Z 11, X
The shortest paths using Dijkstras algorithm are shows in each column along with the
previous node.

2. Forwarding is an action local to the router. It is the process of transferring an incoming

packet from the input interface to the appropriate output interface based on the routers local
forwarding table. Routing on the other hand is a network-wide process that uses specific
algorithms to determine the end-to-end path that packet take from any source to a given
destination. The biggest difference between the two lies in their local vs. more global scope.

3. The 32-bit equivalent of the IP address 223.2.7.61is: 11011111 00000010 00000111

00111101.

4. The largest possible subnet mask would be: 223.2.7.0/24.

5. The MAC address space is 6 bytes long. This allows for a 248 possible MAC Addresses.
Compares to the IP address which is 4 bytes long and allows for a possible 236 possible
addresses.

6. Persistent HTTP refers to an HTTP connection in which the client and server exchange
messages using the same socket. Non-persistent HTTP on the other hand requires that new
TCP connection be made and terminated after every message exchanged, this also means that
new socket has to be created and closed for every client/server exchange.

7. An ARP query is sent when the hosts does not know the MAC address of the destination. It
therefore cannot address the frame directly to its target. The host must therefore use a
broadcast frame and send the ARP query using the broadcast address. This broadcast address
allows all hosts and routers on the subnet to pass the frame to their respective ARP modules.
Without the use of this broadcast frame the query would get discarded by all hosts. ARP
responses on the other hand can be addressed to the host who sent the original query by using
the source MAC address included in the query. Broadcasting this response would be
inefficient since the destination address is known.

8. TCP congestion control is done through the congestion window variable (cwnd), which is a
variable kept by the sender that monitors the amount of unacknowledged data in the network.
TCP congestion control is based on the notion that packet loss events indicate congestion.
 Therefore, packet loss events (measured through acknowledgements received and not
received) are used to adjust the send rate, which is defined as cwnd/RTT bytes per second.
TCP congestion control algorithm has three major states. Slow start, which is the initial state,
sets cwnd to 1 MSS and doubles the rate for every acknowledgement received. Slow start
ends when the sender encounters a loss event or when ssthresh is reach. Ssthresh is yet
another variable stored that is equal to have the value of cwnd when the last loss even
occurred. If ssthresh is reach algorithm enters the congestion avoidance state, at which cwnd
is increased by 1 MSS every RTT. This means that the send rate is increased in a linear
fashion. Fast recovery refers to the state that follows a loss event in which the sending rate is
dropped to the ssthresh value and increased by 1 MSS for every duplicate acknowledgement,
once the correct acknowledgement is received TCP once again enters the congestion
avoidance state. Fast recovery is not mandatory and is a part of certain versions of TCP.

9. The end-to-end delay would be 60.93 ms.

10. DNS is responsible for translating hostnames to IP addresses. DNS is a distributed database
that is implemented in a hierarchy of DNS servers. These DNS serves can be queried to
translate hostnames into IP addresses. DHCP is responsible for providing IP addresses to
incoming hosts to a network. DHCP does this dynamically without the need for intervention
from a network administrator. NAT (network address translation) allows for the creation of
private network. NAT enabled routers create their own network of IP addresses that are
significant only to devices within the network. NAT enabled routers are seen from the
outside as single/independent devices. All incoming traffic is addresses to the router.

11. The ALOHA protocol is a random access protocol that divides time into slots. Nodes can
transmit frames only at the beginning of a time slot. If there is a collision, it is detected by all
nodes in the network and the frame is retransmitted by the node in a future time slot. In an
attempt to avoid a collision upon retransmission each node retransmits its frame within a time
slot with a certain probability. This means that not all nodes retransmitting will send their
frame in the same slot again. However, this does not guarantee that there wont be another
collision since the probability is random.

12. False

13. Question 13
a. 20 bytes of data
b. The acknowledgement number from B to A would be 110.

14. SMTP runs over TCP. SMTP is the application-layer protocol for e-mail and it requires the
reliable delivery that TCP has to offer. When sending an e-mail, the sendners mail service
opens a TCP connection to the receivers server. The reliability of TCP is imperative for
SMTP.

15. False