Equations:

1- Question requires a little bit of background in probability:

Consider the two scenarios below:
 A circuit-switching scenario in which Ncs users, each requiring a bandwidth of 20 Mbps, must
share a link of capacity 100 Mbps.
 A packet-switching scenario with Nps users sharing a 100 Mbps link, where each user again
requires 20 Mbps when transmitting, but only needs to transmit 20 percent of the time.

Answer the following questions:

A. When circuit switching is used, what is the maximum number of circuit-switched users that can be
supported? Explain your answer.
 When circuit switching is used, at most 10 circuit-switched users that can be supported.
 This is because each circuit-switched user must be allocated its 10 Mbps bandwidth, and there is
100 Mbps of link capacity that can be allocated.
 So, since each user have Bandwidth of 10Mbps and the link capacity is 100Mbps 
Number of user = 100Mbps/10Mbps = 10 user.

B. For the remainder of this problem, suppose packet switching is used. Suppose there are 19 packet-
switching users (i.e., Nps =19). Can this many users be supported under circuit-switching? Explain.
 No. Under circuit switching, the 19 users would each need to be allocated 10 Mbps, for an
aggregate of 190 Mbps - more than the 100 Mbps of link capacity available.
 If Number of user 19 and each user have bandwidth 10Mbps  19*10Mbps= 190Mbps, and the
MAX capacity is 100Mbps so it cannot be supported under circuit-switching.

C. What is the probability that a given (specific) user is transmitting, and the remaining users are not
transmitting?
 The probability that a given (specific) user is busy transmitting, which we'll denote p, is just the
fraction of time it is transmitting, i.e., 0.200. The probability that one specific other user is not
busy is (1-p), and so the probability that all of the other Nps-1 users are not transmitting is
(1-p)Nps-1.Thus the probability that one specific user is transmitting and the remaining users
are not transmitting is p1(1-p)Nps-1, which has the numerical value of 0.0036028797018964.
This user will be transmitting at a rate of 10 Mbps over the 100 Mbps link, using a fraction 0.1000
of the link's capacity when busy.
D. What is the probability that one user (any one among the 9 users) is transmitting, and the remaining
users are not transmitting? When one user is transmitting, what fraction of the link capacity will be
used by this user?
 The probability that exactly one (any one) of the Nps users is busy is Nps times the probability
that a given specific user is transmitting and the remaining users are not transmitting (our
answer to (c) above), since the one transmitting user can be any one of the Nps users. The
answer to (d) is thus Npsp1(1-p)Nps-1, which has the numerical value of 0.068454714336032.

E. What is the probability that any 5 users (of the total 9 users) are transmitting, and the remaining
users are not transmitting? (Hint: you will need to use the binomial distribution [1, 2]).
 The probability that 10 specific users of the total 19 users are transmitting and the other 9 users
are idle is p10(1-p)9. Thus the probability that any 10 of the 19 users are busy is
choose(19,10)p10(1-p)9, where choose(19,10) is the (19,10)coefficient of the binomial
distribution [1, 2]). The numerical value of this probability is 0.0012696335643836.

F. What is the probability that more than 5 users are transmitting? Comment on what this implies
about the number of users supportable under circuit switching and packet switching.
 The probability that more than 10 users of the total 19 users are transmitting is Σ i=11,19
choose(19,i)pi(1-p)19 - i. The numerical value of this probability is 0.00030948698478346. Note
that 10 is the maximum number of users that can be supported using circuit switching (the
answer to part (a)). With packet switching, nearly twice as many users (19) are supported with a
small probability that more than 10 of these packet-switching users are busy at the same time.
2-
a) suppose an organization is given the block 18.15.1.125/26, which contains a block of 64 addresses.
The organization has four offices and needs to divide the addresses into four subblocks of 14, 14,6
and 6 usable addresses. Design the subblocks and Fill the following table:

b) Find out how many addresses are still available after these allocations.
3- suppose an organization is given the block 18.15.1.128/26, which contains a block of 64 addresses. The
organization has four offices and needs to divide the addresses into four subblocks of 14, 14,6 and 6
usable addresses. Design the subblocks and Fill the following table: (Note Don't use VLSM)

4- suppose an organization is given the block 192.168.1.0/24, which contains a block of 256 addresses. The
organization needs to divide the addresses into four subblocks. Design the subblocks and Fill the following
table:
5-
5- Consider a Transport layer segment with size of 4,500 bytes, no options, and IP header size of 20 bytes, so
the IP packet size is 4,520 bytes. Assume ID=555 and the packet travels over a link with an MTU of 1,500
Design fragment size and fill the following table

Fragment Total bytes Header bytes Data bytes ID Flag Fragment Offset (8-byte blocks)
1 1500 20 1480 555 1 0
2 1500 20 1480 555 1 185
3 1500 20 1480 555 1 370
4 80 20 60 555 0 555

6- Consider a Transport layer segment with size of 8000 bytes includes an IP header of 20 bytes, no options,
Assume ID=555 and the packet travels over a link with an MTU of 2000 bytes. Design fragment size and fill
the following table

Fragment Total bytes Header bytes Data bytes ID Flag Fragment Offset (8-byte blocks)
1 2000 20 1980 555 1 247
2 2000 20 1980 555 1 495
3 2000 20 1980 555 1 742
4 2000 20 1980 555 1 990
5 80 20 60 555 0 1237

7- Consider a Transport layer segment with size of 8000 bytes includes an IP header of 20 bytes, no options,
Assume ID=555 and the packet travels over a link with an MTU of 1500 bytes. Design fragment size and fill
the following table

Fragment Total bytes Header bytes Data bytes ID Flag Fragment Offset (8-byte blocks)
1 1500 20 1480 555 1 0
2 1500 20 1480 555 1 185
3 1500 20 1480 555 1 370
4 1500 20 1480 555 1 555
5 1500 20 1480 555 1 740
6 600 20 580 555 0 925

8- Consider a Transport layer segment with size of 6000 bytes, no options, and IP header size of 20 bytes, so
the IP packet size is 6020 bytes. Assume ID=222 and the packet travels over a link with an MTU of 1,500
Design fragment size and fill the following table

Fragment Total bytes Header bytes Data bytes ID Flag Fragment Offset (8-byte blocks)
1 1500 20 1480 222 1 0
2 1500 20 1480 222 1 185
3 1500 20 1480 222 1 370
4 1500 20 1480 222 1 555
5 100 20 80 222 0 740
 9- In real life scenario, some subnets may require large number of host addresses while
other may require only few addresses.

For example, assume that you are a network administrator at any Company has three
departments connected with wan links.
 Development department has 74 computers.
 Production department has 52 computers.
 Administrative department has 28 computers.
 All departments are connected with each other via wan link.
 Each wan link requires two IP addresses.

Using the 192.168.1.0/24 and VLSM to Fill the following table:

Name of subnet CIDR New mask Network ID First address Last address Broadcast
(used host)
Development
department(74)
Production
department(52)
Administrative
department(28)
WAN Link 1 (2)
WAN Link 2 (2)
WAN Link 3 (2)

How many addresses available after VLSM subnets?

 10- In real life scenario, some subnets may require large number of host addresses while
other may require only few addresses.

For example, assume that you are a network administrator at any Company has three
departments connected with wan links.
 Development department has 74 computers.
 Production department has 52 computers.
 Administrative department has 28 computers.
 All departments are connected with each other via wan link.
 Each wan link requires two IP addresses.

Using the 192.168.1.0/24 and VLSM to Fill the following table:

11-
12-
13-
14- TCP sender sends initial window of five segments. Suppose the initial value of the sender-to-receiver
sequence number is 100 and the first five segments each contain 512bytes as shown in the figure, two of
the five segment(s) are lost.

Fill the following table with Sender-to-receiver segment sequence number field value & Receiver-to
sender ACK field value
 15-
Consider the figure below in which TCP a sender and receiver communicate over a connection in which the
sender-to-receiver segments may be lost. The TCP sender sends initial window of five segments at
t=1,2,3,4,5, respectively. Suppose the initial value of the sender-to-receiver sequence number is 145 and
the first five segments each contain 593 bytes. The delay between the sender and the receiver is 7 time
units, and so the first segment arrives at the receiver at t=8. As shown in the figure, two of the five
segment(s) are lost between the sender and the receiver.

Answer the following questions:

o Give the sequence numbers associated with each of the five segments sent by the sender
o List the sequence of acknowledgements transmitted by the TCP receiver in response to the receipt
of the segments actually received. In particular, give the value in the acknowledgement field of
each receiver-to-sender acknowledgement, and give a brief explanation as to why that particular
acknowledgement number value is being used
 Solution:
 The sequence numbers for each of the five segments sent by the sender are:

Time Sender-to-receiver Time segment

Sender-to-
segment segment sequence received, and ACK Receiver-to-sender ACK field value
Receiver
sent number field value segment sent

Segment 1 1 145 8 738

Segment 2 2 738 9 1331

No ACK is sent, since this segment

Segment 3 3 1331
was lost

No ACK is sent, since this segment

Segment 4 4 1924
was lost

1331. Note that ACK this re-

Segment 5 5 2517 12 acknowledges the last correctly
received, in-order byte (1331).
 16- Consider the rdt2.2 protocol from the text (pages 209-212). The sender and receiver FSMs for the sender and
receiver sre shown below:

Suppose that the channel connecting the sender and receiver can corrupt but not lose or reorder packets. Now
consider the figure below, which shows four data packets and three corresponding ACKs being exchanged between
an rdt 2.2 sender and receiver. The actual corruption or successful transmission/reception of a packet is indicated
by the corrupt and OK labels, respectively, shown above the packets in the figure below.

 Fill out the table below indicating (i) the state of the sender and the receiver just after the the transmission of a new
packet in response to the received packet at time t , (ii) the sequence number associated with the data packet or
the ACK number associated with the ACK packet sent at time t.

t sender state receiver state packet type sent seq. # or ACK # sent
0 Wait 0 from below data

1 ACK

2 data

3 ACK

4 data

5 ACK

6 data

 How many times is the payload of the received packet passed up to the higher layer at the receiver in the above
example? At what times is the payload data passed up?
Solution:

 The completed table is shown below:

t sender state receiver state packet type sent seq. # or ACK # sent
0 Wait ACK0 Wait0 from below data 0
1 Wait ACK0 Wait1 from below ACK 0
2 Wait ACK1 Wait1 from below data 1
3 Wait ACK1 Wait1 from below ACK 0
4 Wait ACK1 Wait1 from below data 1
5 Wait ACK1 Wait0 from below ACK 1
6 Wait ACK0 Wait0 from below data 0

 2 packets were passed up to the higer layer at the receiver, at times t = 1, 5.

17- Consider the figure below in which a TCP sender and receiver communicate over a connection in which the
sender-to-receiver segments may be lost. The TCP sender sends initial window of five segments at
t=1,2,3,4,5, respectively. Suppose the initial value of the sender-to-receiver sequence number is 93 and all
sender-to-receiver segments each contain 563 bytes. The delay between the sender and the receiver is 7
time units, and so the first segment arrives at the receiver at t=8, and a receiver-to-sender ACK for this
segment arrives at the TCP sender at t=15. As shown in the figure, 3 of the five segments are lost between
the sender and the receiver, but none of the receiver-to-sender ACKs are lost. Answer the following
questions:

 Give the sequence number field value in the sender-to-receiver segments in the first set of segments that
are sent beginning at t=1, and the acknowledgement number field value in the receiver-to-sender ACK
segments that are sent from the receiver back to the sender beginning at t=8.
 Next consider the sender-to-receiver segments generated by the sender in response to the ACKS that are
received beginning at t=15. Give the sequence number of the segments transmitted and a brief explanation
of why a given segment is transmitted, or not transmitted, on receipt of an ACK.

Solution:
 The sequence number in the sender-to-receiver segments and the acknowledgement number in the
receiver-to-sender ACK segments are given as:

Time
Sender-to- Sender-to-receiver segment Time segment received, Receiver-to-sender
segment
Receiver sequence number field value and ACK segment sent ACK field value
sent

Segment 1 t=1 93 8 656

Segment 2 t=2 656 9 1219

No ACK sent since the

Segment 3 t=3 1219
segment was lost.

No ACK sent since the

Segment 4 t=4 1782
segment was lost.

No ACK sent since the

Segment 5 t=5 2345
segment was lost.

 The sequence numbers of the segments transmitted in response to each ACK are given as:

Sender-to- Time segment Sender-to-receiver segment sequence number in response to

Explanation
Receiver sent the ACK received

Segment 1 t=15 1219

Segment 2 t=16 1782

18- Consider the figure below in which TCP a sender and receiver communicate over a connection in
which the sender-to-receiver segments may be lost. The TCP sender sends initial window of five
segments at t=1,2,3,4,5, respectively. Suppose the initial value of the sender-to-receiver sequence number
is 145 and the first five segments each contain 500 bytes. The delay between the sender and the receiver
is 7 time units, and so the first segment arrives at the receiver at t=8. As shown in the figure, two of the
five segment(s) are lost between the sender and the receiver.
19-
 20- Consider distributing a file of F = 25* 10^9 bits to N peers. The server has an upload rate of us = 50
Mbps, and each peer has a download rate of di = 20 Mbps and an upload rate of u. a. For N = 10,
100, and 1,000 and u = 2 Mbps, 10 Mbps, and 20 Mbps, Filling the following table with minimum
distribution time for each of the combination of N and u for both client-server distribution and P2P
distribution.

Solution:

client-server distribution
N
10 100 1000
ui 2 Mbps 5000 50000 500000
10 Mbps 5000 50000 500000
20 Mbps 5000 50000 500000

Peer-to-Peer:

N
10 100 1000
ui 2 Mbps 4807.69 48076.9 480769.23
10 Mbps 4166.67 41666.67 4166666.67
20 Mbps 3571.43 35714.28 357142.85
 21- Consider the figure below, with three links, each with the specified transmission rate and link length

Find the end-to-end delay (including the transmission delays and propagation delays on each of the three links,
but ignoring queueing delays and processing delays) from when the left host begins transmitting the first bit of a
packet to the time when the last bit of that packet is received at the server at the right. The speed of light
propagation delay on each link is 3x10**8 m/sec. Note that the transmission rates are in Mbps and the link
distances are in Km. Assume a packet length of 8000 bits. Give your answer in milliseconds.

Solution:
Link 1 transmission delay = L/R = 8000 bits / 1000 Mbps = 0.008000 msec.
Link 1 propagation delay = d/s = 2 Km / 3*10**8 m/sec = 0.006667 msec.
Link 2 transmission delay = L/R = 8000 bits / 1 Mbps = 8.000000 msec.
Link 2 propagation delay = d/s = 500 Km / 3*10**8 m/sec = 1.666667 msec.
Link 3 transmission delay = L/R = 8000 bits / 1000 Mbps = 0.008000 msec.
Link 3 propagation delay = d/s = 3 Km / 3*10**8 m/sec = 0.010000 msec.

Thus, the total end-to-end delay is the sum of these six delays: 9.699333 msecs.
22- Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to
compute the shortest path from x to all network nodes. Show how the algorithm works by computing a
table

Solution
23- Consider the 6-node network shown below, with the given link costs.

Using Dijkstra's algorithm, find the least cost path from source node u to all other destinations. Show your
work in following Table.

24-
25- Use the line with arrow and number to explain the following scenario of iterative and recursive DNS
queries?
26-

27- The following two figures illustrates HTTP delays for the retrieval of a Web page consisting of a base HTML
page and a number of objects. Assumes that all objects are of the same size (including HTML object). Base
on a certain choices in the figures, including the number of objects (in addition to the HTML object) and
the transmission delay in terms of the RTT. Calculate the total time in terms of RTTs response time in
terms of RTTs.
28-
29- Consider the scenario shown below, with four different servers connected to four different clients over
four three-hop paths. The four pairs share a common middle hop with a transmission capacity of R = 200
Mbps. The four links from the servers to the shared link have a transmission capacity of R S = 100 Mbps.
Each of the four links from the shared middle link to a client has a transmission capacity of RC = 90 Mbps
per second. What is the maximum achievable end-end throughput (in Mbps) for each of four client-to-
server pairs, assuming that the middle link is fair-shared (i.e., divides its transmission rate equally among
the four pairs). Which link is the bottleneck link for each session? [Hint: You might want to review Figure
1.20 in the text before answering this question.]

Solution:
The maximum achievable end-end-throughput is 50 Mbps. This is one quarter of the transmission capacity
of the shared middle hop, which is the bottleneck link. The overall transmission capacity of the shared hop
is 200 Mbps, which is shared equally among the four server-client pairs, giving each an equal share of 50
Mbps. This is less than the first-hop transmission capacity of 100 Mbps and also less than the third-hop
transmission capacity of 90 Mbps.

30-
31- Consider the following Figure. Assuming TCP Reno is the protocol experiencing
the behavior, answer the following questions. a. Identify the intervals of time
when TCP slow start is operating.
 32- Consider the figure below, in which a single router is transmitting packets, each of length L bits, over a single
link with transmission rate R Mbps to another router at the other end of the link.

Suppose that the packet length is L= 16000 bits, and that the link transmission rate along the link to router on the
right is R = 1 Mbps.

a) What is the transmission delay (the time needed to transmit all of a packet's bits into the link?

The link transmission delay = L/R = 16000 bits / 1 Mbps = 16.000000 msec.

b) what is the maximum number of packets per second that can be transmitted by the link?

The link can transmit 62.500000 packets per second

33- Consider the figure below, which plots the evolution of TCP's congestion window at the beginning of each time
unit (where the unit of time is equal to the RTT); see Figure 3.53 in the text. In the abstract model for this
problem, TCP sends a "flight" of packets of sizecwnd at the beginning of each time unit. The result of sending
that flight of packets is that either (i) all packets are ACKed at the end of the time unit, (ii) there is a timeout for
the first packet, or (iii) there is a triple duplicate ACK for the first packet. In this problem, you are asked to
reconstruct the sequence of events (ACKs, losses) that resulted in the evolution of TCP's cwnd shown below.

Consider the evolution of TCP's congestion window in the example above and answer the following questions. The
initial value ofcwnd is 1 and the initial value of ssthresh (shown as a red +) is 8.

 Give the times at which TCP is in slow start, congestion avoidance and fast recovery at the start of a time
slot, when the flight of packets is sent.
 Give the times at which the first packet in the sent flight of packets is lost, and indicate whether that packet
loss is detected via timeout, ot by triple duplicate ACKs.
 Give the times at which the value of ssthresh changes, and give the new value of ssthresh.
Solution:
The solution is shown in the figure below. For intervals of time when TCP is in slow start, the plotted value
of cwnd is shown as a green square. For intervals of time when TCP is in congestion avoidance, the plotted value
of cwnd is shown as a yellow square. For intervals of time when TCP is in fast reccovery, the plotted value
of cwnd is shown as an orange square. The values for ssthreshare shown following a change, as a red plus
sign. A flight of packets experiencing a loss has the loss type (which determines the next value of cwnd labeled
above.
34-
35- In TCP fill in the blank the name of each field using key words :
 36- Suppose within your Web browser you click on a link to obtain a web page. The IP address for the associated
URL is not cached in your local host, so a DNS lookup is necessary to obtain the IP address. Suppose that n
DNS servers are visited before your host receives the IP address from DNS; the successive visits incur an RTT
of RTT1, …, RTTn. Further suppose that the web page associated with the link contains exactly one object,
consisting of a small amount of HTML text. Let RTT0 denote the RTT between the local host and the server
containing the object.
a. Assuming zero transmission time of the object, how much time elapses from when the client clicks
on the link until the client receives the object?

Now assume the HTML file references seven very small objects on the same server. Neglecting
transmission times, how much time elapses with

b. Non-persistent HTTP with no parallel TCP connections?

c. Non-persistent HTTP with the browser configured for 5 parallel connections?
d. Persistent HTTP?

NOTE: * it may come as a MCQ

Solution:

a. The total amount of time to get the IP address is . Once the IP address is known, RTTO elapses to set
up the TCP connection and another RTTO elapses to request and receive the small object. The total
response time is 2RTTo + RTT1 + RTT2 +…….+ RTTn
b. RTT1+…+RTTn+2RTTO+7*2RTTO = 16* RTTO+ RTT1+…+RTTn.
c. RTT1+…+RTTn+2RTTO+2*2RTTO = 6* RTTO+ RTT1+…+RTTn.
d. RTT1+…+RTTn+2RTTO+RTTO = 3* RTTO+ RTT1+…+RTTn..