Question

Consider sending a large file of F bits from host A to host B. There are...

Consider sending a large file of F bits from host A to host B. There are three links, (and two switches) between A and B, and the links are uncongested (i.e., no queuing delays at the switches). Host A segments the file into segments of S bits each and adds 80 bits of header to each segment, forming packets of L = 80 + S bits. Each link has a transmission rate of R bps and the hosts A and B send/receive at that rate.

Derive the formula from this information that computes the total time to transmit the file (that means the file is sent in its entirety by A and completely received by B).

Hint: How long for first packet? How long for each of the additional packets?

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider sending a file of 1 Mbits over a path of 5 links. Each link transmits...
Consider sending a file of 1 Mbits over a path of 5 links. Each link transmits at 10 Mbps. The network is lightly loaded so that there are no queuing delays. Propagation delay is negligible. When a form of packet switching is used, the file is broken up into 10 packets; each packet with 100 Kbits. Suppose the network is packet-switched virtual-circuit network. Denote the VC setup time by 10 milliseconds. Suppose the sending layer add a total of 100...
Consider a packet of length L bits which begins at end host A and travels over...
Consider a packet of length L bits which begins at end host A and travels over two links to a destination end host B. These two links are connected by a router. Let di, si and Ri denote the length, propagation speed and the transmission rate of link i, for i = 1, 2. Assume the router delays each packet by dproc. Assuming no queuing delays, in terms of di, si and Ri, (i = 1, 2), and L, write...
1.       In modern packet- switched networks, including the Internet, the source host segments long, application- layer messages...
1.       In modern packet- switched networks, including the Internet, the source host segments long, application- layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end- to- end transport of a message with and without message segmentation. Consider a message that is 8 · 106 bits long that is...
Let host A send a large file to host B over a pipelined transport protocol with...
Let host A send a large file to host B over a pipelined transport protocol with a fixed sliding window (e.g., GBN or SR). How big does the sender’s window need to be to ensure maximum use of the network path capacity between A and B if the path has the following idealistic characteristics: (i) the round-trip delay between the end hosts (measured for a very small packet so that it is not affected by the transmission delay) is 10...
Multiple choice questions: Circle the correct answer 1) Suppose two hosts, A and B are separated...
Multiple choice questions: Circle the correct answer 1) Suppose two hosts, A and B are separated by 1500 kilometers and are connected by a link of R = 2 Mbps. Suppose the propagation speed over the link is 3 x 108 meters/s. Considering sending a file of 100,000 bits from Host A to Host B. Suppose the file is sent continuously as one large message. The maximum number of bits that will be in the link at any time is...
Suppose Host A wants to send a large file to Host B. The path from Host...
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 = 500 Kbps, R2 = 2 Mbps, and R3=1 Mbps.      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?...
1. Host A and Host B are connected by a network with 2 store-and-forward switches. Each...
1. Host A and Host B are connected by a network with 2 store-and-forward switches. Each link has a bandwidth of 5 megabits/second and is 1,000 kilometers long. The network propagation speed is 200,000 kilometers/second. Host A sends 10,000-bit packets to Host B. Give proper units on each answer. (For these and other numerical problems it is required that you give a formula, using numbers from the problem, that can be evaluated to give the numerical answer.) a) What is...
Consider sending a large file from a host to another over a TCP connectionthat has no...
Consider sending a large file from a host to another over a TCP connectionthat has no loss.a. Suppose TCP uses AIMD for its congestion control without slow start.Assuming cwnd increases by 1 MSS every time a batch of ACKs is receivedand assuming approximately constant round-trip times, how long does it takefor cwnd increase from 1 MSS to 6 MSS (assuming no loss events)?b. What is the average throughout (in terms of MSS and RTT) for this connectionup through time =...
Consider sending a large file from one host to another over a TCP connection that has...
Consider sending a large file from one host to another over a TCP connection that has no loss. a) Suppose TCP uses AIMD for its congestion control without slow start. Assuming cwnd increases by 1MSS every time a batch of ACKs is received and assuming constant roundtrip times, how long does it take for cwnd to increase from 1 MSS to 6 MSS? What is the average throughput (in terms of MSS and RTT) for this connection up through time...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT