Question

In: Computer Science

We are sending a MP3 file of 300,000 bits from Host A to Host B. Host...

We are sending a MP3 file of 300,000 bits from Host A to Host B. Host A and B are each connected to a switch S via 100 Mbps links. Assume that each link introduces a propagation delay of 10 µs (microsecond). Calculate the total transfer time of the entire file (from first bit sent to last bit received) for the following:

  1. Suppose the MP3 file is sent as one message. S is a store-and-forward device; it begins retransmitting immediately after it has finished receiving the packet.
  2. Suppose that the MP3 file is broken into 6 packets, each of 50,000 bits. S is a store-and-forward device; it begins retransmitting immediately after it has finished receiving the packet.
  3. Suppose that the MP3 file is broken into 6 packets, each of 50,000 bits. S implements ‘cut-through” switching: It is able to begin retransmitting the packet after the first 500 bits have been received.

Solutions

Expert Solution

venereology answered 10 months ago
Next > < Previous

Related Solutions

We are sending a MP3 file of 1,000,000 bits from a source host to a destination...
We are sending a MP3 file of 1,000,000 bits from a source host to a destination host. All links in the path between source and destination have a bandwidth of 10 Mbps. Assume that the propagation speed is 2.5 * 10 8 meters/sec, and the distance between source and destination is 10,000 km. 1. Now suppose there are two links between source and destination, with one switch connecting the two links. Each link is 5,000 km long. Again suppose the...
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 (that is, no queuing delays). 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. Find the value of S that minimizes the delay of...
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 (that is, no queuing delays). 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. The link propagation delay, let's call it d, was not...
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 = 200 kbps, R2 = 2 Mbps, and R3 = 1 Mbps. Assuming no other traffic in the network, what is the average throughput for the file transfer? Suppose the file is 4 million bytes, on average, how long will it take to transfer the file to Host B? Repeat (a) and (b), but...
Suppose there are 5 links between sending host A and receiving host B, where each link...
Suppose there are 5 links between sending host A and receiving host B, where each link has the same transmission rate R. What is the end-to-end delay of sending 10 packets of length L from A to B? (Ignore propagation delay and nodal processing delay). Assume there are no other packets on the network.
1. A file of size 500 MB is to be transferred from host H1 to host...
1. A file of size 500 MB is to be transferred from host H1 to host H2 through routers R1, R2 and R3. See Figure 1 below. h1=2mbs=>R1==8mbs=>R2==10mbs==>R3=1mbs==>h2 (a) If the file is transmitted is one entity, without dividing it into smaller chunks, estimate how long it would take for the file to arrive at the receiver. [4 marks] (b) If the file is first divided into smaller chunks, and each chunk is transmitted and then combined, estimate how long...
How long does it take to send a 15 MiB file from Host A to Host...
How long does it take to send a 15 MiB file from Host A to Host B over a circuit-switched network, assuming: - Total link transmission rate = 49.7 Gbps. - Network is FDM, with 7 permitted users, each with an equal bandwidth share. - A link connection requires a setup time of 84.5 ms. Your answer should be in miliseconds (ms) with one decimal place, and without the unit (e.g. "140.6" without the quotes)
In an organization there are four Hosts (i.e. Host A, Host B, Host C and Host...
In an organization there are four Hosts (i.e. Host A, Host B, Host C and Host D) connected to a Router (i.e. Router0). Explain in your own words (a) what happens when each of the four Hosts send a broadcast (b) How many broadcast domains are on the Router0? (c) If the Router (i.e. Router0) is replaced by a hub, how many broadcast domains are on the hub? (d) If the Router (i.e. Router0) is replaced by a switch, how...
Part (b): Reversing the order of bits in a word Recall that in our course we...
Part (b): Reversing the order of bits in a word Recall that in our course we define a word to be a 32-bit sequence (i.e., four consecutive bytes). For some algorithms it is useful to have a reversed version of that 32-bit sequence. (The deeply curious can read a brief description about such use in Fast Fourier Transform algorithm implementations by visiting Wikipedia at this link: http://bit.ly/2rnvwz6 ). Your task for part (b) is to complete the code in reverse.asm...
Consider a scenario where Host A and Host B want to send messages to Host C....
Consider a scenario where Host A and Host B want to send messages to Host C. Hosts A and C are connected by a channel that can lose and corrupt (but not reorder) messages. Hosts B and C are connected by another channel (independent of the channel connecting A and C) with the same properties. The transport layer at Host C should alternately deliver M (M>1) consecutive messages received from A to its application layer and N (N>1) consecutive messages...
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT