Professional Documents
Culture Documents
Untitled
Untitled
Untitled
Islam Hegazy
Information Sciences Academic year: 2021-2022
Ain Shams University Assignment: 1 (17/08/2022)
Course Name: Computer Networks Duration: 3 days
Year: (Summer term) 3rd undergraduate Total Grade: 50
1
10 ∗ 10 ∗ 106 ∗ 8
= max { , 156.25} = 400 𝑠𝑒𝑐
𝑢𝑠
10∗10∗106 ∗8
us = = 2 Mbps
400
𝐹 𝐹 𝑁𝐹 10∗106 ∗8 10∗106 ∗8 10∗10∗106 ∗8
ii. 𝐷𝑝2𝑝 = max {𝑢 , ,𝑢 𝑁 } = max { , , 2∗106 +10∗512∗103}
𝑠 𝑑𝑚𝑖𝑛 𝑠 +∑𝑖=1 𝑢𝑖 2∗106 512∗103
= max {40, 156.25, 112.36} = 156.25 sec
6. Calculate the TimeoutInterval if the SampleRTT is 100 ms with = 0.25 and = 0.25.
Assume that the EstimatedRTT was 190 ms and DevRTT was 50 ms before the given
SampleRTT. (2 marks)
Sol:
EstimatedRTT = (1 - ) * EstimatedRTT + * SampleRTT
= 0.75 * 190 * 10-3 + 0.25 * 100 * 10-3 = 0.1675 sec
DevRTT = (1 - ) * DevRTT + * | SampleRTT – EstimatedRTT |
= 0.75 * 50 * 10-3 + 0.25 * | 100 * 10-3 – 0.1675| = 0.054375 sec
TimeoutInterval = EstimatedRTT + 4 * DevRTT
= 0.1675 + 4 * 0.054375 = 0.385 sec
7. If TCP throughout is 1 Gbps, the segment size is 1250 bytes, and RTT is 100 ms. What
would be the loss probability? (2 marks)
2
Sol:
1.22∗𝑀𝑆𝑆
TCP throughput = 𝑅𝑇𝑇∗√𝐿
1.22 ∗ 1250∗8
1 * 109 = 100∗ 10−3 ∗√𝐿
1.22 ∗ 1250 ∗ 8
L = (100 ∗ 10−3∗ 1∗ 109)2
= 1.49 * 10-8
8. Consider the circuit-switched network shown in the figure below, with circuit switches
A, B, C, and D. Suppose there are 13 circuits between A and B, 14 circuits between B
and C, 13 circuits between C and D, and 16 circuits between D and A. (2 marks)
i. What is the maximum number of connections that can be ongoing in the
network at any one time?
ii. Suppose that these maximum number of connections are all ongoing. What
happens when another call connection request arrives to the network, will it be
accepted?
iii. Suppose that every connection requires 2 consecutive hops, and calls are
connected clockwise. For example, a connection can go from A to C, from B to
D, from C to A, and from D to B. With these constraints, what is the maximum
number of connections that can be ongoing in the network at any one time?
iv. Suppose that 13 connections are needed from A to C, and 10 connections are
needed from B to D. Can we route these calls through the four links to
accommodate all 23 connections?
Sol:
i. 56
ii. No
iii. 26
iv. Yes
i. What is the name of the file that is being retrieved in this GET message?
ii. What version of HTTP is the client running?
iii. Will the client accept jpeg images?
iv. Does the client already has a cached copy of the file?
Sol:
i. quotation5.htm
ii. HTTP/1.1
iii. Yes
iv. Yes
10. Look at the scenario below, where Alice sends an email to Bob. For the questions
below, assume that Alice and Bob user agents use POP3 protocol. (3 marks)
Sol:
i. SMTP
ii. POP3
iii. TCP
iv. Push
v. Pull
vi. 25
vii. 110
4
11. Assume a constant transmission rate of R = 1400000 bps, a constant packet-length L =
6000 bits, and a is the average rate of packets/second. Traffic intensity I = La/R, and
the queuing delay is calculated as I(L/R)(1 - I) for I < 1. (3 marks)
i. Assuming that a = 20, what is the queuing delay?
ii. Assuming the router's buffer is infinite, the queuing delay is 0.7523 ms, and
898 packets arrive. How many packets will be in the buffer 1 second later?
iii. If the buffer has a maximum size of 877 packets, how many of the 898 packets
would be dropped upon arrival from the previous question?
Sol: