Question

In: Computer Science

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.

Solutions

Expert Solution

Solution:

Given,

=>Number of links = 5

=>Transmission rate = R

=>Number of packets = 10

=>Size of each packet = L

Explanation:

=>Host A...link1...(s1)...link2...(s2)....link3....(s3)....link4....(s4)...link5..Host B

=>Here packet switching concept will be used by default.

=>First packet will require all the transmission delays of in between devices and host A and all other packets will required only one transmission delay by host A.

Calculating transmission delay:

=>Tranmission delay = packet length/transmission rate

=>Tranmission delay = L/R

Calculating total delay for first packet:

=>Total delay for first packet = 5*transmission delay

=>Total delay for first packet = 5*(L/R)

Calcualting delay for other 9 packets:

=>Total delay for 9 packet packets = 9*transmission delay

=>Total delay for 9 packet packets = 9*(L/R)

Calculating total delay for 10 packets:

=>Total delay for 10 packets = 5*(L/R) + 9*(L/R)

=>Total delay for 10 packets = 14*(L/R)

I have explained each and every part with the help of statements attached to it.


Related Solutions

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: Suppose the MP3 file is sent as one message. S is a store-and-forward device; it begins retransmitting immediately...
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 there are 4 routers in sequence between Host A and Host B, all of which...
Suppose there are 4 routers in sequence between Host A and Host B, all of which use store-and-forward routing. What is the total end-to-end delay for a packet originating from Host A with destination Host B, under the following conditions. ◘ Each of the link transmission rates are 9.4 Mbps ◘ The total distance from Host A to Host B along its path of transmission is123.4 km ◘ The speed of propagation through the transmission medium is is 2.5 x...
Consider sending a 2,000-byte datagram into a link with a MTU of 980 bytes. Suppose the...
Consider sending a 2,000-byte datagram into a link with a MTU of 980 bytes. Suppose the original datagram has the identification number 227. How many fragments are generated? For each fragment, what is its size, what is the value of its identification, fragment offset, and fragment flag?
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...
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 that B is a 12 × 9 matrix with nullity 5. For each of the...
Suppose that B is a 12 × 9 matrix with nullity 5. For each of the following subspaces, tell me their dimension, along with what value of k is such that the subspace in question is a subspace of R k . (For example, a possible – though incorrect – answer is that Col B is a subspace of R 2 .) So, you’ll need eight answers for this problem (two answers for each of the four parts). • Col...
Provide 5 examples to demonstrate the link between quality and maintenance
Provide 5 examples to demonstrate the link between quality and maintenance
Effect on pipelining We consider the transmission of a message between 2 host A and B...
Effect on pipelining We consider the transmission of a message between 2 host A and B via a router. We dispose of the following information : - the distance between each host and the router is 1500m. - the speed of propagation = 360.000 km/s(speed of light) - the size of each message = 1500 octets. - the speed of the link between host and router = 1Mb/s - the delay of treatment of a message in the router =...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT