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 moving the file from Host A to Host B. Disregard propagation delay.

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 moving the file from Host A to Host B. Disregard propagation delay.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: In this problem, we consider sending real-time voice from Host A to Host B over a packet-switched…

A: We need to find the elapsed time when the first bit is formed.

Q: A sender with window size (W=3) is connected to a selective repeat receiver by a link with…

A: Solution: Given, the window size (W) of the sender is 3, the bandwidth of the link is 106…

Q: Consider delivering voice through a direct connection network from Host A to Host B. (for example,…

Q: P27. Host A and B are communicating over a TCP connection, and Host B has already received from A…

A: Hey, since multiple sub-parts questions posted, we will answer first three question according to our…

Q: e. Suppose dprop is greater than dtrans. At time t = durans, where is the first bit of the packet?…

A: Requested answers are given below:

Q: es. The delay be re shown. The 1

Q: Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive…

A: Computer networking which refers to interconnected computing devices that can exchange data and…

Q: What is the number of messages required to send a file F of 4 Mbits from one station to another?…

A: In networking, data transmission involves breaking information into small pieces called…

Q: Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both…

A: total time for all received objects is given by: (200/150+Tp + 200/150 +Tp + 200/150+Tp +…

Q: Consider a simple protocol for transferring files over a link. After some initial negotiation, A…

A: Stop-and-wait stop and wait, implies, that anything the information that the shipper needs to send,…

Q: Equation 1.1 gives a formula for the end-to-end delay of sending one packet of length L over N links…

A: A packet is a discrete chunk of data transferred via a network, like the Internet or a local area…

Q: The RDT 3.0 protocol (b). Consider the rdt3.0 sender and receiver shown below, with FSM…

A: Transition t1: This transition happens after the receiver has processed the first packet and sends…

Q: (and two switches) between A and B, and the links are uncongested (that is, no queuing delays). Host…

Q: Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive…

A: Given that, Size of the file= 100 KB Bandwidth of the link= 10 Mbps Distance of each link= 1000 Km…

Q: Consider four Internet hosts, each with a TCP session. These four TCP sessions share a common…

A: The solution for the above given question is given below:

Q: Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second…

Question

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 moving the file from Host A to Host B. Disregard propagation delay.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,500 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
TCP a. Consider two TCP connections, one between Hosts A (sender) and B (receiver), and another between Hosts C (sender) and D (receiver). The RTT between A and B is half that of the RTT between C and D. Suppose that the senders' (A's and C's) congestion window sizes are identical. Is their throughput (number of segments transmitted per second) the same? Explain. b. Now suppose that the average RTT between A and B, and C and D are identical. The RTT between A and B is constant (never varies), but the RTT between C and D varies considerably. Will the TCP timer values of the two connections differ, and if so, how are they different, and why are they different? Give one reason why TCP uses a three-way (SYN, SYNACK, ACK) handshake rather than a two-way handshake to initiate a connection. a.
Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time by ts = 250 milliseconds. How long does it take to send the file from source to destination?
Consider a router buffer preceding an outbound link. In this problem, you will use Little’s formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little’s formula is N=a⋅d . Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link’s transmission rate is 100 packets/sec. Using Little’s formula, what is the average packet arrival rate, assuming there is no packet loss?
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 moving the file from Host A to Host B. Disregard propagation delay.
1. Consider a path from host A to host B through a router X as follows: A- -X-B The capacity of the link AX is denoted Ra, while the capacity of the link XB is denoted Rb in units of [bits/s]. Assume that Ra Ri. Is it possible that the second packet queues at input queue of the second link? Explain. Now suppose that host A sends the second packet T seconds after sending the first packet. How large must T be to ensure no queueing before the second link? Explain.
a. Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? b. Now suppose that N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?
Consider sending a 3500-byte datagram that has arrived at a router R₁ that needs to be sent over a link that has an MTU size of 1000 bytes to R2. Then it has to traverse a link with an MTU of 600 bytes. Let the identification number of the original datagram be 465. How many fragments are delivered at the destination? Show the parameters associated with each of these fragments.
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. How "long" (in meters) is one bit on link 1?
Host A and B are communicating over a TCP connection. Host B has already received from Host A all bytes up through byte 23. Suppose Host A then sends two segments to Host B back-to-back. The first and the second segments contain 30 and 50 bytes of data, respectively. In the first segment, the sequence number is 24, the source port number is 3000, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. A. In the second segment sent from Host A to B, what arethe sequence number_________,source port number __________,and destination port number__________?B. If the second segment arrives after the first segment, in the acknowledgment of the second segment, what arethe acknowledgment number___________,the source port number__________,and the destination port number __________?C. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment,what is the acknowledgment number ___________?D.…
It is possible for a series of packets to be sent from one host to another over the same route. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last a certain period of time and the other delay's length will be more variable?
4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of