Sie sind auf Seite 1von 4

Computer Networks (CS 453), Fall 2014

Homework 3
Instructor: V. Arun

Note: Show as much of your work as you can. Be precise. Use variable names, not numerical
values, until all but the last step. In questions that are right out of the textbook, the
corresponding problem numbers are also included below.

Problem 1 (Quickies, 32 points)
1. State the key difference between a UDP or TCP checksum for a packet and a
cryptographic hash function (or a digest). (2)
2. How does BitTorrent determine that a chunk uploaded by another peer is legitimate
data as opposed to junk? (2)
3. Give one similarity and one difference between a BitTorrent tracker and a Napster
directory. (2)
4. [Ch. 3, R7] Suppose a process in Host C has a UDP socket with port number 6789.
Suppose both Host A and Host B each send a UDP segment to Host C with destination
port number 6789. Will both of these segments be directed to the same socket at Host
C? If so, how will the process at Host C know that these two segments originated from
two different hosts? (3)
5. [Ch. 3, R8] Suppose that a Web server runs in Host C on port 80. Suppose this Web
server uses persistent connections, and is currently receiving requests from two
different hosts, A and B. Are all of the requests being sent through the same socket at
Host C? If they are being passed through different sockets, do both of these sockets
have port 80? Explain. (3)
6. [Ch. 3, R9] In our rdt protocols, why did we need to introduce sequence numbers?
7. [Ch. 3, R10] In our rdt protocols, why did we need to introduce timers? (2)
8. Name two fields in a UDP header and their purpose. (2)
9. A TCP server program blocks on an _________ method until a client issues a
connect request, at which point the method returns a __________. Fill in the
blanks. (2)
10. Name one method each in the TCP client socket API and the TCP server socket API
respectively that are not present in UDP. (4)
11. [Ch. 2, P21] Suppose that your department has a local DNS server for all computers in
the department. You are an ordinary user (i.e., not a network/system administrator).
Can you determine if an external Web site was likely accessed from a computer in
your department a couple of seconds ago? Explain. (3)
12. [Ch. 2, P32] Suppose that in, after we create the socket, we add the line:
clientSocket.bind((, 5432))

Will it become necessary to change What are the port numbers for the
sockets in UDPClient and UDPServer? What were they before making this change? (5)
Problem 2 (Reliable transport, 12 points) rdt 2.1, 2.2
1. [Ch. 3, P6] Consider our motivation for correcting protocol rdt 2.1. Show that the
receiver, shown in Figure 3.57, when operating with the sender shown in Figure 3.11,
can lead the sender and receiver to enter into a deadlock state, where each is waiting
for an event that will never occur. (8)

2. Suppose a stop-and-wait protocol similar to rdt 2.1 or rdt 2.2 that used four sequence
numbers, 0, 1, 2, and 3. How many states do the sender and receiver respectively
have? (4)

Problem 3: (Checksum, 16 points) Suppose UDP and TCP computed checksums over
8-bit bytes (as opposed to 16-bit words) and the checksum itself is one byte long.
A. Consider a packet with the following two bytes: 01110011 and 00110011. Compute the
checksum over these two bytes of data (ignoring any packet headers).

B. Give an example where one bit is flipped in each of the two bytes and yet the
checksum remains unchanged.
C. Suppose only one bit got flipped in the pack. Can the checksum still remain
unchanged? What about three bits?
D. Suppose the sum (with carries wrapped around) of the packets headers is 11100010.
What is the UDP checksum of the packet?

Problem 4 (More reliable transport, 20 points) rdt 3.0.
A. [Ch. 3, P7] Draw the FSM for the receiver side of the protocol. Be precise and
complete. (7)
B. [Ch. 3 P13] Consider the rdt 3.0 protocol. Draw a diagram showing that if the network
connection between the sender and receiver can reorder messages (that is, that two
messages propagating in the medium between the sender and receiver can be
reordered), then the alternating-bit protocol will not work correctly. Make sure you
clearly identify the sense in which it will not work correctly. Your diagram should
have the sender on the left and the receiver on the right, with the time axis running
downward showing the exchange of data (D) and acknowledgment (A) messages.
Make sure you indicate the sequence number associated with any data or
acknowledgment segment. (9)
C. [Ch. 3, P7] In protocol rdt 3.0, the ACK packets flowing from the receiver to the sender
do not have sequence numbers (although they do have an ACK field that contains the
sequence number of the packet they are acknowledging). Why is it that our ACK
packets do not require sequence numbers. Give a precise one sentence answer. (4)

Problem 5 (Even more reliable transport, 20 points)
1. [Ch. 3, P17] Consider two network entities, A and B, which are connected by a
perfect bi-directional channel (i.e., any message sent will be received correctly; the
channel will not corrupt, lose, or re-order packets). A and B are to deliver data
messages to each other in an alternating manner: First, A must deliver a message to B,
then B must deliver a message to A, then A must deliver a message to B, and so on. If
an entity is in a state where it should not attempt to deliver a message to the other side,
and there is an event like rdt_send(data)call from above that attempts to pass data
down for transmission to the other side, this call from above can simply be ignored
with a call to rdt_unable_to_send(data), which informs the higher layer that it
is currently unable to send data. [Note: This simplifying assumption is made so you
dont have to worry about buffering data.]

Draw an FSM specification for this protocol (one FSM for A, and one FSM for B).
Note that you do not have to worry about a reliability mechanism here; the main
point of this question is to create an FSM specification that reflects the synchronized
behavior of the two entities. You should use the following events and actions that have
the same meaning as protocol rdt 1.0 in Figure 3.9: rdt_send(data),

extract(packet, data), deliver_data(data). Make sure your protocol
reflects the strict alternation of sending between A and B. Also, make sure to indicate
the initial states for A and B in your FSM descriptions. (8)

2. Now suppose, the channel from A to B can corrupt packets (but not lose or reorder
packets), but the channel from B to A continues to be perfect. Fix the FSM
specification above so that the applications running at A and B continue to perceive the
channel as a perfect, bi-directional channel and continue to exchange messages in an
alternating order as above. (12)