Presentation is loading. Please wait.

Presentation is loading. Please wait.

ECE358: Computer Networks Fall 2014

Similar presentations


Presentation on theme: "ECE358: Computer Networks Fall 2014"β€” Presentation transcript:

1 ECE358: Computer Networks Fall 2014
Solutions to Homework #1

2 R 11. Suppose there is exactly one packet switch between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and the receiving host are 𝑅 1 and 𝑅 2 , respectively. Assuming that the switch uses store-and-forward packet switching, what is the total end-to-end delay to send a packet of length 𝐿? (Ignore queuing, propagation delay, and processing delay.) A B Switch R1 R2 Store and forward Packet L t1 t2 t3 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  1 = 𝐿 𝑅1 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  2 = 𝐿 𝑅2 Transmitting 1st bit Transmitting last bit No processing delay No propagation delay Time 𝑑 π‘’π‘›π‘‘βˆ’π‘‘π‘œβˆ’π‘’π‘›π‘‘ = 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  1 + 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  2 = 𝐿 𝑅1 + 𝐿 𝑅2

3 R 13. Suppose users share a 2Mbps (Megabits per second) link
R 13. Suppose users share a 2Mbps (Megabits per second) link. Also suppose each user transmits continuously at 1Mbps when transmitting, but each user transmits only 20 percent of the time. a) When circuit switching is used, how many users can be supported? b) Suppose packet switching is used, why will there be essentially no queuing delay before the link if two or fewer users transmit at the same time? Circuit switching Only two users οƒ  1Mbps+1Mbps= 2Mbps X 2Mbps 1Mbps (20%) Since each user requires 1Mbps when transmitting, if two or fewer users transmit simultaneously, a maximum of 2Mbps will be required. Since the available bandwidth of the shared link is 2Mbps, there will be no queuing delay before the link. Whereas, if three users transmit simultaneously, the bandwidth required will be 3Mbps which is more than the available bandwidth of the shared link. In this case, there will be queuing delay before the link.

4 𝑑 π‘π‘Ÿπ‘œπ‘ = 𝑑 𝑠 = 2500 π‘˜π‘š 2.5 βˆ— 10 5 π‘˜π‘š/𝑠𝑒𝑐 =10 π‘šπ‘ π‘’π‘
R 18. How long does it take a packet of length 1,000 bytes to propagate over a link of distance 2,500 Km, propagation speed 2.5 X 108 m/s, and transmission rate 2Mbps? More generally, how long does it take a packet of length L to propagate over a link of distance d, propagation speed s, and transmission rate R bps? Does this delay depend on packet length? Does this delay depend on transmission rate? A B d=2500km S =2.5βˆ— π‘š/𝑠𝑒𝑐 Packet L=1000 Bytes R=2Mbps 𝑑 π‘π‘Ÿπ‘œπ‘ = 𝑑 𝑠 = 2500 π‘˜π‘š 2.5 βˆ— π‘˜π‘š/𝑠𝑒𝑐 =10 π‘šπ‘ π‘’π‘ Depending on packet length οƒŸ No Depending on transmission rate οƒŸ No

5 R 19. Suppose Host A wants to send a large file to Host B
R 19. Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1= 500kbps, R2=2Mbps, and R3=1Mbps. a) Assuming no other traffic in the network, what is the throughput for the file transfer? b) Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B? c) Repeat (a) and (b), but now with R_2 reduced to 100kbps. Throughput=min(R1 , R2 , R3)= R1 = 500Kbps d= 4βˆ— 10 6 βˆ—8 𝑏𝑖𝑑𝑠 500 βˆ— 𝑏𝑖𝑑/𝑠𝑒𝑐 =64 𝑠𝑒𝑐 R2=100Kbps οƒ  throughput = min(R1 , R2 , R3)= R2 = 100Kbps d= 4βˆ— 10 6 βˆ—8 𝑏𝑖𝑑𝑠 100 βˆ— 𝑏𝑖𝑑/𝑠𝑒𝑐 =320 𝑠𝑒𝑐 A B R1=500Kbps X R2=2Mbps R3=1Mbps

6 P 6. This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate 𝑅 bps. Suppose that the two hosts are separated by π‘š meters, and suppose the propagation speed along the link ia 𝑠 meter/sec. π»π‘œπ‘ π‘‘ 𝐴 is to send a packet of size 𝐿 bits to π»π‘œπ‘ π‘‘ 𝐡. a) Express the propagation delay , 𝑑 π‘π‘Ÿπ‘œπ‘ , in terms of π‘š and 𝑠. b) Determine the transmission time of the packet , 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  , in terms of 𝐿 and 𝑅. c) Ignoring processing and queuing delays, obtain an expression for the end-to-end delay. d) Suppose π»π‘œπ‘ π‘‘ 𝐴 begins to transmit the packet at time 𝑑=0. At time 𝑑= 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  , where is the last bit of the packet? e) Suppose 𝑑 π‘π‘Ÿπ‘œπ‘ is greater than 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  . At time 𝑑= 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  , where is the first bit of the packet? f) Suppose 𝑑 π‘π‘Ÿπ‘œπ‘ is less than 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  . At time 𝑑= 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  , where is the first bit of the packet? g) Suppose 𝑠=2.5Γ— 10 8 π‘š/𝑠, 𝐿=120 bits, and 𝑅=56 kbps. Find the distance π‘š so that 𝑑 π‘π‘Ÿπ‘ equals 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  . 𝑑 π‘π‘Ÿπ‘œπ‘ = π‘š 𝑠 𝑠𝑒𝑐 A B m meters S π‘š/𝑠𝑒𝑐 Packet L bits R bps

7 𝑑 π‘’π‘›π‘‘βˆ’π‘‘π‘œβˆ’π‘’π‘›π‘‘ = 𝑑 π‘π‘Ÿπ‘œπ‘ + 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘ 
Continue P6. 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  = 𝐿 𝑅 𝑠𝑒𝑐 𝑑 π‘’π‘›π‘‘βˆ’π‘‘π‘œβˆ’π‘’π‘›π‘‘ = 𝑑 π‘π‘Ÿπ‘œπ‘ + 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  At 𝑑=𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  οƒ  the last bit is just leaving host A. The first bit is still in the link, and has not reached Host B yet. The first bit has aready reached host B. 𝑑 π‘π‘Ÿπ‘œπ‘ = π‘š 𝑠 , 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  = 𝐿 𝑅 m= 𝐿𝑠 𝑅 =536 π‘˜π‘š

8 P 7. In this problem, we consider sending real-time voice from Host A to Host B over a packet-switching network (VoIP). Host A converts analog voice to a digital 64 kbps bit streaming on the fly. Host A then groups the bits into 56-byte packets. There is one link between Hosts A and B; its transmission rate is 2Mbps and its propagation delay is 10 msec. as soon as Host A gathers a packet, it sends it to Host B. As soon as Host B receives an entire packet, it converts the packet's bits to an analog signal. How much time elapses from the time a bit created (from the original analog signal at Host A) until the bit is decoded ( as part of analog signal at host B)? A B Packet L = 56 bytes Encode rate= 64Kbps R=2M bps 𝑑 π‘π‘Ÿπ‘œπ‘ =10 π‘šπ‘ π‘’π‘ time 𝑑 π‘π‘Ÿπ‘œπ‘ 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  𝑑 π‘π‘Ÿπ‘œπ‘ Generating the packet 𝑑 π‘π‘Ÿπ‘œπ‘ = 56βˆ—8 𝑏𝑖𝑑𝑠 64βˆ— 10 3 𝑏𝑝𝑠 =7π‘šπ‘ π‘’π‘, 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  = 56βˆ—8 𝑏𝑖𝑑𝑠 2βˆ— 10 6 𝑏𝑝𝑠 =0.224π‘šπ‘ π‘’π‘ Delay till decodeing = =17.224msec

9 P 10. Consider a packet of length 𝐿 which begins at end system 𝐴 and travels over three links to a destination end system. These three links are connected by two packet switches. Let 𝑑 𝑖 , 𝑠 𝑖 and 𝑅 𝑖 denote the length, propagation speed, and the transmission rate of link 𝑖, for 𝑖=1, 2, 3. The packet switch delays each packet by 𝑑 π‘π‘Ÿπ‘œπ‘ . Assuming no queuing delays, in terms of 𝑑 𝑖 , 𝑠 𝑖 , 𝑅 𝑖 , (𝑖=1, 2, 3), and 𝐿, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5 x 108 m/s, the transmission rates of all three links are 2Mbps, the packet switch processing delay is 3msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, the length of the last link is 1,000 km . for these values, what is the end-to-end delay? A B Packet L R1 time 𝑑 π‘π‘Ÿπ‘œπ‘ 2 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  1 𝑑 π‘π‘Ÿπ‘œπ‘ 1 R2 R3 d1 d2 d3 s1 s2 s3 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  2 𝑑 π‘π‘Ÿπ‘œπ‘ 2 𝑑 π‘π‘Ÿπ‘œπ‘ 3 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  3 𝑑 π‘π‘Ÿπ‘œπ‘ 3 𝑑 π‘’π‘›π‘‘βˆ’π‘‘π‘œβˆ’π‘’π‘›π‘‘ = 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  1 + 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  2 + 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  3 + 𝑑 π‘π‘Ÿπ‘œπ‘ 1 + 𝑑 π‘π‘Ÿπ‘œπ‘ 2 + 𝑑 π‘π‘Ÿπ‘œπ‘ 3 + 𝑑 π‘π‘Ÿπ‘œπ‘ 2 + 𝑑 π‘π‘Ÿπ‘œπ‘ 3 = 𝐿 𝑅1 + 𝐿 𝑅2 + 𝐿 𝑅3 + 𝑑1 𝑠1 + 𝑑2 𝑠2 + 𝑑3 𝑠3 +2βˆ— 𝑑 π‘π‘Ÿπ‘œπ‘ =64π‘šπ‘ π‘’π‘

10 P 11. In the above problem. Suppose 𝑅 1 = 𝑅 2 = 𝑅 3 =𝑅 and 𝑑 π‘π‘Ÿπ‘œπ‘ =0
P 11. In the above problem. Suppose 𝑅 1 = 𝑅 2 = 𝑅 3 =𝑅 and 𝑑 π‘π‘Ÿπ‘œπ‘ =0. Further suppose the packet switch does not store-and– forward packets but instead immediately transmits each bit it receives before waiting for the entire packet to arrive. What is the end-to-end delay? A B Packet L R time 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  1 𝑑 π‘π‘Ÿπ‘œπ‘ 1 d1 d2 d3 s1 s2 s3 𝑑 π‘π‘Ÿπ‘œπ‘ 2 𝑑 π‘π‘Ÿπ‘œπ‘ 3 𝑑 π‘’π‘›π‘‘βˆ’π‘‘π‘œβˆ’π‘’π‘›π‘‘ = 𝑑 π‘‘π‘Ÿπ‘Žπ‘›π‘  1 + 𝑑 π‘π‘Ÿπ‘œπ‘ 1 + 𝑑 π‘π‘Ÿπ‘œπ‘ 2 + 𝑑 π‘π‘Ÿπ‘œπ‘ 3 = 𝐿 𝑅 + 𝑑1 𝑠1 + 𝑑2 𝑠2 + 𝑑3 𝑠3


Download ppt "ECE358: Computer Networks Fall 2014"

Similar presentations


Ads by Google