8. We want to send a file of size 4000 MB from Source to Destination, using the network path given below.SourceR1= 1KbpsR2= 2Kbps destinationLink ID1=100KmLink 2D2=10KmAssume speed of propagation to be 3x108 m/sec, and find out the following?a. Transmission delay at Link 1; Transmission delay at Link 2; Total Transmission delayb. What will be the effect on total transmission delay if we change D2=100 KM?c. Propagation delay on link 1; Propagation delay on link 2; Total propagation delayd. What will be the effect on total propagation delay if we change R1 to 4 Kbpse. Ignoring all other delays, what is the total (end-end) delayf. What is the throughput achieved

Transmission delay can be defined in such a way that it is the time it takes for a signal to travel…

Answered: 8. We want to send a file of size 4000…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

14. The link length is 2000km, the data transmission rate is 1kbit/s, and the data that needs to be sent is 100bit. The data propagation rate on this link is 2x10 m/s. Suppose we can see the bits transmitted on the link, try to draw the bits on the line we see: a) When 100bit is just sent. b) After another 0.05s
Computer Science Two flows are transmitting at a constant rate of 4Mbps and 8Mbps and compete for service at a 10Mbps link. If the link adopts an RED policy, what is the expected drop probability for each flow?
Assume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with threerepeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assumethat the signal propagation speed across the cable is 2*10^8 m/sec, CSMA/CD uses back-off intervals ofmultiples of 512 bits, and each repeater will insert a store-and-forward delay equivalent to 20-bittransmission time. At time t=0, both A and B attempt to transmit. After the first collision, A draws K = 0and B draws K = 1 in the exponential back-off protocol after sending the 48bits jam signal. a. What is the one-way propagation delay (including all repeater delays) between A and B inseconds? At what time is A's packet completely delivered at B? b. Now suppose that only A has a packet to send and that the repeaters are replaced with switches.Suppose that each switch has an 8-bit processing delay in addition to a store-and-forward delay.At what time, in seconds, is A's packet delivered at B?
Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput: a) When using Stop and Wait? b) When using sliding windows with a sender window size of W = 5 data frames?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. If transmission starts at time t=0, how long (in seconds) does it take until Computer B has received the last bit of the complete file transfer?Assume that the switch between link 1 and 2 is a "store-and-forward" switch. Furthermore, assume that processing and queuing delays are negligible and no other stations are using the links.
question
We have a 4 km down CSMA / CD channel with a capacity of 10 Mbps. Assume the average negotiableinterval is 2 ∗ ∆ size, and that the propagation rate is 2 ∗ 10^8 m/s, the length of frames is 50B. By how much is it necessary to increase the minimum size of frames if we want to achieve at least 90% efficiency? Write down all the necessary assumptions.
a) Consider a CSMA/CD network running at 20 Mb/s over 3-km cable with no repeaters. The signal speed in the cable is 2×108 m/s. Suppose station A starts transmitting a frame of size 400 bytes at time T. i. Can it happen that station A detects a collision at time T+10 us (micro seconds) if there was no collision detected between time T and T+10 μs? Justify your answer. Can it happen that the station detects a collision at time T+20 μs, if there was no collision detected between time T and T+20 us? Justify your answer. iii. Can it happen that the station detects a collision at time T+33 μs, if there was no collision detected between time T and T+33 us?? Justify your answer.
Suppose Host X wants to send a large file to Host Y. The path from Host X to Host Y has three links of rates R1 = 10 Mbps, R2 = 1 Mbps, and R3 = 4 Mbps. (i) Assuming no other traffic in the network, what is the throughput for the file transfer? (ii) Suppose the file is 16 million bytes. Roughly how long will it take to transfer the file to Host Y?
1. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps.What is the throughput if the system(All stations together)produces 100 frame per second.(Hints:44.5; 10.5) 2. what is the vulnerable time frame size of pure ALOHA?If the time unit is P then find it out.[Hints: 2P;0.2P]
Consider a satellite link with a capacity of 1 Mbps, bit error rate 10^-8 , and propagation delay of 270 msec. Assuming selective reject ARQ with a window of 64 and 10,000 bit frames, calculate the maximum link utilization

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS