Scribd
Upload
26 views

Network Exercises

The document discusses questions about packet and circuit switching, application layer protocols, file distribution time, and distributed hash tables (DHTs). For packet switching, it explains how to calculate the number of users that can be supported based on link bandwidth. For applications, it calculates traffic intensity on access links and LANs for web caching. For file distribution, it derives formulas for minimum distribution time using client-server and peer-to-peer approaches. For DHTs, it shows how to identify the peer responsible for storing a given (key,value) pair based on the peer's identifier in a circular identifier space.

Uploaded by

Mohamad Ballout
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
26 views

Network Exercises

The document discusses questions about packet and circuit switching, application layer protocols, file distribution time, and distributed hash tables (DHTs). For packet switching, it explains how to calculate the number of users that can be supported based on link bandwidth. For applications, it calculates traffic intensity on access links and LANs for web caching. For file distribution, it derives formulas for minimum distribution time using client-server and peer-to-peer approaches. For DHTs, it shows how to identify the peer responsible for storing a given (key,value) pair based on the peer's identifier in a circular identifier space.

Uploaded by

Mohamad Ballout
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

I.

Questions about Packet and Circuit Switching


1. 6 Mbps link
Each user transmits continuously at 2 Mbps when transmitting, but each
user transmits only 30 percent of the time.
How many users can be supported by this link?
Answer:
The link is giving 6 Mbps, then 3 users can be supported because each user
can transmit 2 Mbps continuously (2 [user1] + 2 [user2] + 2 [user3] = 6).
So, the bandwidth can tolerate 3 users. Also, there will not be a delay in the
queue. If the queue adds or accept one another user there will be a delay.
2. 6 Mbps link
Each user transmits continuously at 2 Mbps when transmitting, but each
user transmits only 30 percent of the time.
If 4 or more users try to transmit, will be there a delay?
Answer:
Yes, there will be a delay because 6 Mbps handle maximum 3 users, and
the 4 users need 8 Mbps which is not available, then the 3 users will be
transmitted and the other will be waiting in the queue.

3. 2000 bytes.
Link of distance 3,500 km
Propagation speed 1.5*10^8 m/s
Transmission rate 3Mbps
How much time is needed to propagate over the link?
Answer:
3,500 km ----→ 3,500,000 m (it is converted to meter by multiplying it by
1000)
1.5*10^8 m/s = 150,000,000 m/s
Link of distance x/Propagation speed = 3,500,000 m/150,000,000 m/s =
0.023 s.

II. Questions about Application Layer


Cashing example:
Traffic Intensity = La/R
a is the average rate from the browser to the origin and it is in units of
packets/sec
R is the transmission rate or access link rate
L is the average object rate
All packets consist of L bits

4. How much is the traffic intensity on Access Link and on Local Area Network
(LAN) if:
L = 100 kb
Request (a) = 15/sec
R = 1.54 Mbps (for Access Link)
R = 1 Gbps (for LAN)
Given:
Internet delay: RTT from institutional router to any origin server is 2 sec
Answer:
Traffic intensity on Access Link:
First of all, we should convert R from Mb to Kb by multiplying it by 1000.
La/R = 100*15/1540
= 0.974 (near to 1)
Traffic intensity on LAN:
First of all, we should convert R from Gb to Kb by multiplying it by 1,000,000.
La/R = 100*15/1,000,000
= 0.0015 sec
Total delay = Internet delay + Access Link delay + LAN delay
= 2 + 0.974 + 0.0015
= 2.9755
So, the total delay is in the range of minutes which is not acceptable.
5. How much is the traffic intensity on Access Link and on Local Area Network
(LAN) if:
L = 100 kb
Request (a) = 15/sec
R = 154 Mbps (for Access Link)
R = 1 Gbps (for LAN)
Given:
Internet delay: RTT from institutional router to any origin server is 2 sec
Answer:
Traffic intensity on Access Link:
La/R = 100*15/154,000
= 0.00974 sec

Traffic intensity on LAN:


La/R = 100*15/1,000,000
= 0.0015 sec
The total delay = 2 + 0.00974 + 0.0015
= 2.01124
The total delay is still in seconds, so the delay is small.

Note: to notice if the delay is in the range of minutes or in the range of


seconds, take a look at the traffic intensity of the access link if it is near to
1, if it is then, the delay is in the range of minutes and vice versa.

III. Questions about File Distribution Time


6. Client – Server:
F is the size of the file
Us is the server upload capacity
Di is the peer download capacity
Ui is the peer upload capacity
N is the number of peers
What is the minimum distribution time for Client – Server and for P2P if:
F = 25 Gbps
Us = 30 Mbps
Di = 2Mbps
Ui = 2 Mbps
N = 1000
Note: it is preferable to convert the numbers from Gbps to Mbps

Answer:
Client – Server:
Dc-s >= max {NF/us, F/dmin}

NF/us = 1000*25*1000/30
= 833,333.333
F/dmin = 25*1000/2
= 12,500
{833,333.333; 12,500}
The maximum is 833,333.333
P2P:
Dp2p >= max {F/us, F/dmin, NF/ (us + summation of ui)}
F/us = 25*1000/30
= 833.333
F/dmin = 25*1000/2
= 12,500
NF/ (us + summation of ui) = 1000*25*1000/30 + 2*1000
= 12,315.270
(2*1000 because ui is 2 Mbps for all the peers and the number of peers is
1000)
{833.333; 12,500; 12,315.270}
The maximum is 12,500.

Conversion:
From greater to smaller multiply
From smallest to largest divide
Gb ----→ Mb (*1000)
Micro is 10^-6
Meter is 10^-3
Kilo is 10^3
Mega is 10^6
Gega is 10^9
Terra is 10^12

IV. Questions about Circular Distribution Table (DHT)


Given:
Node Identifier [0; 15]
Seven peers with identifiers 1, 3, 6, 9, 12, 14, 15
(key, value) pairs: (2, 0); (6, 5); (7, 13); (15, 7)
Who is the peer that suits each key?
Answer:
ID space {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}
Seven peers of IDs: 1, 3, 6, 9, 12, 14, 15
Key = 2 assigned to peer 3
Key = 6 assigned to peer 6
Key = 7 assigned to peer 9
Key = 15 assigned to peer 15

You might also like