1 A client uses TCP to send data to a server. The data consist of 16 bytes.

Calculate
the efficiency of this transmission at the TCP level (ratio of useful bytes to total
bytes). Calculate the efficiency of transmission at the IP level. Assume no options
for the IP header. Calculate the efficiency of transmission at the data link layer.
Assume no options for the IP header and use Ethernet at the data link layer.

2 A transport layer consist of 1500 bytes of data and 160bits of header is sent to an
internet layer, which appends another 160 bits of header. This is then transmitted
through two networks, each of which uses a 24-bit packet header. The destination
network has a maximum packet size of 800 bytes. How many bits including
headers, are delivered to the network layer protocol at destination?

3 Frames of 1000 bits are sent over a 1-Mbps channel using a geostationary satellite
whose propagation time from the earth is 270 msec. Acknowledgements are
always piggybacked onto data frames. The headers are very short. Three-bit
sequence numbers are used. What is the maximum achievable channel utilization
for stop and wait?

Consider three nodes A, B, C connected in series. Node A is connected to node B

4 via a 3Gbps fiber optic link, 500km in length. Node B is connected to node C via
60 Mbps link, 15 km in length. The links are full duplex. The rate of transmission
errors on the links, the switching time at B, and the time to transmit an ACK are
all negligible and can be ignored. A large file is to be sent from node A to node C,
and there is no other traffic on the links. Packets are 1024B, including headers.
;1. Ignoring reliability and packet headers, what is the maximum throughput that
can be achieved? Explain.
2. What is the round-trip time from A to C?
3. What is the round-trip bandwidth delay product for the path from A to C?

5 What is the fastest line speed at which a host can blast out 1500-byte TCP
payloads with a 120-sec maximum packet lifetime without having the sequence
numbers wrap around? Take TCP, IP, and Ethernet overhead into consideration.
Assume that Ethernet frames may be sent continuously?

6 In modern packet-switched networks, including the Internet, the source host segments
long, application layer messages (for example an image or a music file) into smaller
packets and sends the packets into the network. The receiver then reassembles the packets
back into the original message. We refer to this process as message segmentation.
Consider a message that is 8*106 bits long that is to be sent from a source to a destination
which are separated by two routers in between. Suppose each of the three link in this path
is 2 Mbps. Ignore propagation, queueing and processing delays.
a. Consider sending the message without message segmentation. How long does it
take to move the message from the source host to the first router ? Keeping in
mind that each router uses a store-and-forward packet switching, what is the total
time to move the message from source to destination?
b. Now suppose the packet is segmented into 800 packets with each packet being
10000 bits long. How long does it take to move the first packet to the first router ?
When the first packet is being sent from the first router to the second one, the
second packet is on its way to the first router. At what time will the second packet
be fully received by the second router?
c. What is the total time to move the message to destination host ? Compare this
result with your answer in part a.
 d. In addition to reducing delay, what are the reasons to use message segmentation?
e. Discuss the drawbacks of message segmentation.

Suppose that host A is connected to a router R1, R1 is connected to another router, R2,
and R2 is connected to host B. Suppose that a TCP message that contains 900 bytes of
7 data and 20 bytes of TCP header is passed to the IP code at host A for delivery to B. Show
the Total length, Identification, DF, MF, and Fragment offset fields of the IP header in
each packet transmitted over the three links. Assume that link A-R1 can support a
maximum frame size of 1024 bytes including a 14-byte frame header, link R1-R2 can
support a maximum frame size of 512 bytes, including an
8-byte frame header, and link R2-B can support a maximum frame size of 512 bytes
including a 12-byte frame header.
Link A-R1

Length= (900Bdata+20Bheader)=920B

Link R1-R2(here the packet is being fragmented into 2 packets)

Packet1:Length=(504B data+ 8B header)=512B [It is correct bcz data's length i.e 504
is divisible by 8]

Packet 2:Length=(416B data + 8B header)=424B [It is correct bcz data's length i.e 416
is divisible by 8]

Link R2-B( here packet 1 from link R1-R2 is fragmented into to two packets say
packet1,1 and packet 1,2)

Packet1.1 Length=(496 B data+ 12 bytes header)=508 B [It is correct bcz data's length
i.e 496 is divisible by 8]

Packet 1.2 Length=(8 B data+ 12 bytes header)=20 B [It is correct bcz data's length i.e
8 is divisible by 8]

Packet 2 Length=(416 B data+ 12 bytes header)=428 B [It is correct bcz data's length
i.e 416 is divisible by 8]

So Receiver receives three packets.

PACKET ID MF HL=Headersize/4 TL OFFSET

PACKET 1,1 X 1 3 508 0
PACKET 1,2 X 1 3 20 496/8=62
PACKET 2 X 0 3 428 (496+8)/8=63
8 Consider a TCP connection in which Congestion threshold is 16 KB; available buffer size
at the receiver is 64KB and the current window is also 16KB. Assume TCP segment size
(MSS) = 1KB.

i. If a packet is dropped and is detected by timeout; how long will it take the congestion
window to go up to 16KB? Justify your answer. Assume round-trip time (RTT) = 100ms.

ii. If a packet is dropped and is detected by duplicate ACKs, how long will it take the
congestion window to go up to 16KB? Justify your answer.
9 Calculate the total time required to transfer a 5 MB file in the following cases, assuming
an RTT of 40ms, a packet size of 1 KB data, and an initial 1.5RTT of "handshaking"
before data is sent:
i. The bandwidth is 2 Mbps, and data packets can be sent continuously.
ii. The bandwidth is 2 Mbps, but after we finish sending each data packet we must wait
one RTT before sending the next.
iii. The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets
can be sent per RTT.
iv. Zero transmit time as in (iii), but during the first RTT we can send one (2 0) packet,
during the second RTT we can send two (2 1) packets, during the third we can send four
(22), and so on.
ANSWER

10 In a topology frames are generated at node A and sent to node C through node B.
Determine the minimum data rate required between nodes B and C so that the
buffer of
node B are not flooded, based on the following:
 Distance between A and B is 4000 km and between B and C is 1000 km
 The data rate between A and B is 100 kbps
 The propagation delay is 5 microsec/km for both lines
 There are full duplex lines between nodes
 All data frames are 1000 bit long; ACK frames are separate frames of negligible
length
 Between A and B a sliding window protocol of window size of size 3 is used
 Between B and C stop and wait is used
 There are no errors
11 The following is a dump of a TCP header in hexadecimal format.
(05320017 00000001 00000000 500207FF 00000000)16
a. What is the source port number?
b. What is the destination port number?
c. What the sequence number?
d. What is the acknowledgment number?
e. What is the length of the header?

12 A TCP connection is using a window size of 10,000 bytes, and the previous
acknowledgment number was 22,001. It receives a segment with acknowledgment
number 24,001 and window size advertisement of 12,000. Draw a diagram to
show the situation of the window before and after.
13 A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel
that
has a 10-msec one-way delay. What is the maximum throughput achievable? What
is the line efficiency?
Given-
 Window size = 65535 bytes
 Bandwidth = 1 Gbps
 One way delay = 10 msec

Method-01:
Maximum amount of data that can be sent in 1 RTT
= 1 Gbps x (2 x 10 msec)
= (109 bits per sec) x 20 x 10-3 sec
= 20 x 106 bits
= 25 x 105 bytes

Amount of data that is actually being sent in 1 RTT = 65535 bytes

Thus,
Line Efficiency(η)
= Amount of data being sent in 1 RTT / Maximum amount of data that can be
sent in 1 RTT
= 65535 bytes / 25 x 105 bytes
= 0.026214
= 2.62%

Now,
Maximum Achievable Throughput
= Efficiency x Bandwidth
= 0.0262 x 1 Gbps
= 26.214 Mbps

Method-02:

Maximum Achievable Throughput

= Number of bits sent per second
= 65535 B / 20 msec
= (65535 x 8 bits) / (20 x 10-3 sec)
= 26.214 Mbps
 Now,
Line Efficiency
= Throughput / Bandwidth
= 26.214 Mbps / 1 Gbps
= 26.214 x 10-3
= 0.026214
= 2.62%

14 A TCP connection is in the ESTABLISHED state. The following events

occur one after another:
a. A FIN segment is received.
b. The application sends a “close” message.
What is the state of the connection after each event? What is the
action after each event?