You are on page 1of 13

# 1)If the tcp round trip time,RTT is currrently 30msec and

## the following acknowledgement come in after 26,32 &

24msec respectively. What is the new RTT estimate
using the Jacobson algorithm.use alpha=0.9

RTT = 30

## 2) A TCP machine is sending full windows 65535 bytes

over a 1Gbps channel that has a 10msec delay one
way. What is the maximum throughput achievable?
What is the line efficiency?

Given RTT=10+10=20msec=1/20*10(pow)-3

= 50bits/sec

Max throughput=(65535*8)bits*50bits/sec

=26.214Mbps

## Line efficiency=Max throughput/Bandwidth

= (26.214Mbps/1Gbps)*100 = 2.62%
3) What is the fastest line speed at which a host can blast
out 1500 bytes 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.

## There are two possibilities: one without segmentation and one

with segmentation.

## Therefore, the maximum number of bytes that a host can send

out without wrapping around the sequence number is 2 ^32/
1500.

## Since Ethernet frames may be sent continuously, the maximum

line speed, V can be:V <= 1566 * 8 * (2^32 / 1500) (bits)/120
(sec)

= 298929723.8016 bits/sec

= 298.9 Mbps
The maximum line speed is 298.9 Mbps.

## 4) A TCP machine is sending full windows 65535 bytes

over a 1Gbps channel that has a 10msec delay one
way. What is the maximum throughput achievable?
What is the line efficiency?

= 50bits/sec

=26.214Mbps

## Line efficiency=Max throughput/Bandwidth

= (26.214Mbps/1Gbps)*100 = 2.62%

## 5)A network has a maximum TPDU size of 128 bytes, a

maximum TPDU life time as 30 sec and a 8bit
sequence number. Find the maximum data rate per
connection?

in 30 sec

## Max data rate per connection=261120/30

seconds=8704bits/sec
6) Suppose that you are measuring the time to receive a
TPDU. When an interrupt occurs. You readout the
system clock in milliseconds. When the TPDU is fully
processed, you read out the clock again. You measure
0 msec 270,000 times and 1 msec 730,000 times. How
long does it take to receive a TPDU?

## Answer: Compute the average: (270,000 × 0 + 730,000 × 1

msec)/1,000,000. It takes 730 µsec.

## 7)For a 1-Gbps network operating over 4000 km the delay

is limiting factor, not the bandwidth. Consider a MAN
with a average source and destination 20km apart. At
what data rate does the round trip delay due to the
speed of light equal the transmission delay for a 1 KB
packet?

## Answer: The speed of light in ﬁber and copper is about 200

km/msec. For a 20-km

line, the delay is 100 µsec one way and 200 µsec round trip. A 1-
KB packet

has 8192 bits. If the time to send 8192 bits and get the
acknowledgement is

is the bit

## time, then we have 8192B = 2 × 10−4sec. The data rate, 1/B, is

40 Mbps.
8) Calculate the bandwidth – delay product for the
following networks

i. T1 (1.5Mbps)

ii.Ethernet(10Mbps)

iii.T3 (45Mbps)

iv.STS-3(155Mbps)

## Assume an RTT of 100ms. Recall that a TCP header has 16

bits reserved for window size. What are its
implications in light of your calculations?

Answer:The answer are: (1) 18.75 KB, (2) 125 KB, (3) 562.5 KB,
(4) 1.937 MB. A

before having to

## wait for an acknowledgement. This means that a sender cannot

transmit con-

tinuously using TCP and keep the pipe full if the network
technology used is

## 9) What is the bandwidth-delay product for 50Mbps

channel on a geostationary satellite? If the packets are
all 1500bytes (including overhead), How big should
the window be in packets?
Answer: The round-trip delay is about 540 msec, so with a 50
Mbps channel the

## bandwidth-product delay is 27 megabits or 3,375,000 bytes. With

packets of

1500 bytes, it takes 2250 packets to ﬁll the pipe, so the window
should be at

## 10) Compute a multicast spanning tree for router C in the

following subnet for a group with members at routers
A, B, C, D, E, F, I, and K.

11 )Suppose that node B in Fig. 5-20 has just rebooted
and has no routing information in its tables. It
suddenly needs a route to H. It sends out broadcasts
with TTL set to 1, 2, 3, and so on. How many rounds
does it take to find a route?

## 12)Describe two major differences between the warning

bit method and the RED method.

## 1. Different ways to notify the source the congestion

In the warning bit method, the router explicitly sets a special bit
in the packet’s header to tell the source the congestion.

In the RED method, the router just discards the selected packet
and not report it, waiting the source eventually notice the
lack of acknowledgement and implicitly know the congestion.

## 2. Different time to drop the packets

In the warning bit method, only when there is no buffer space left
will the router drop the packet.

In the RED method, the router will drop the packet if the average
queue length on some line exceeds a threshold, even though
at that time there is still buffer space left.

## 13) Is fragmentation needed in concatenated virtual-

circuit internets or only in datagram systems?
Answer:Fragmentation is needed in both systems.Because when
a large packet wants to travel through a network whose
maximum packet size is too small, we need to break up the
packet into fragments. And this will occur in both
concatenated virtual-circuit internets and datagram systems,
so fragmentation is needed in both systems.

## 14) Imagine a flow specification that has a maximum

packet size of 1000 bytes, a token bucket rate of 10
million bytes/sec, a token bucket size of 1 million
bytes, and a maximum transmission rate of 50 million
bytes/sec. How long can a burst at maximum speed
last?

C +ρS = MS

S = C / (M – ρ)

## C = 1 million bytes M = 50 million bytes ρ = 10 million bytes

S = 1 / ( 50 – 10 ) = 25 ms.
15) A computer on a 6-Mbps network is regulated by a
token bucket. The tokenbucket is filled at a rate of 1
Mbps. It is initially filled to a capacity with 8
megabits.How long can the computer transmit at a full
6 Mbps?

## 16) A router is blasting out IP packets whose total length

(data plus header) is1024 bytes. Assuming that
packets live for 10 sec., what is the maximum data
linespeed the router can operate at without danger or
cycling through the IP datagram ID number space?

## The IPv4 header provides 16 bits to the Identification field. This

means that there shouldonly be a maximum of 216 packets
alive at a certain time to ensure that they are allunique.

## 1024 bytes/packet * 6553.6 packets/sec * 8 bits/byte

= 53687091.2 bps

= 53.7Mbps
17)Suppose that host A is connected to a router R1,R1 is
connected to another router R2 & R2 is connected to
host B. Suppose that a TCP message that contains 900
bytes of data & 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 & Fragment offset fields
of the IP header in each packet transmitted over the 3
frame size of 1024 bytes including a 14-byte frame
R2-B can support a maximum frame size of 512 bytes

## 18) A network on the Internet has a subnet mask of

255.255.240.0. What is the

## Maximum number of hosts it can handle?

11111111111111111111000000000000
Therefore there are 212 - 2 hosts. The reason 2 is subtracted is
because the values 0 and-1 are reserved. This calculates to
be 4094.

## 19) A large number of consecutive IP addresses are

available starting at 198.16.0.0 . Suppose that four
organizations, A, B, C and D, request 4000, 2000,
4000and 8000 addresses, respectively and in that
order. For each of these, give the first IPaddress
in the w.x.y.z/s notation.

## Ans: In keeping with the practical restrictions of CIDR, the number

of addresses requestedmust first be rounded up to a power of
2 for each request. Accordingly, the requests arefor 4096,
2048, 4096 and 8192 addresses in order. The number of bits
needed in the host part for each network is, therefore, 12, 11,
12 and 13 in order. The masks therefore are going to be /20, /
21, /20 and /19. Now all we have to do is to arrange them in
the earliest available address chunk of that size and aligned
on the appropriate boundary as per CIDR rules. The table
below shows the actual assignments. The last row shows the
state of the address space after satisfying each request.
Notice the “holes” that had to be left in the address space
assignment in order to align the address chunks to the

## The table below shows the actual assignments.

20) Consider the network , Imagine that one new line is
added between D & G. What changes occurs to sink tree &
tree built by reverse path forwarding.

## 21) At a certain router, an IP datagram consisting of 926

data bytes to be fragmented for transmission on a
network with a maximum data field of 256 bytes. The
header length of the original datagram is 36 bytes.
Assuming that all fragments are of the maximum length,
find the values of the header length, total length,
fragment affect & more fields for each fragment.
PACKET NO HEADER TOTAL OFFSET MORE BIT
LENGTH LENGTH

1 36 292 0 1

2 36 292 256 1

3 36 292 512 1

4 36 292 768 0