Suppose we need to design a stop-and-wait, reliable data transfer protocol between a sender A and a receiver B, over a direct link with the following characteris . The channel from A to B is unreliable and can lose packets. . The channel from B to A is reliable. . Neither channel will corrupt a packet (if a packet is received, it must be correct). . Neither channel will reorder packets. • The maximum RTT between A and B is known and is guaranteed to be D. For each of the following techniques for building reliable data transfer protocol, please match on whether or not, it is needed in the design of the protocol. Acknowledgement Choose... + Negative Acknowledgement Choose... + Sequence Number Choose... →

Suppose we need to design a stop-and-wait, reliable data transfer protocol between a sender A and a receiver B, over a direct link with the following characteris . The channel from A to B is unreliable and can lose packets. . The channel from B to A is reliable. . Neither channel will corrupt a packet (if a packet is received, it must be correct). . Neither channel will reorder packets. • The maximum RTT between A and B is known and is guaranteed to be D. For each of the following techniques for building reliable data transfer protocol, please match on whether or not, it is needed in the design of the protocol. Acknowledgement Choose... + Negative Acknowledgement Choose... + Sequence Number Choose... →

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

Similar questions

Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
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?
Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive 100 Mbps links of 2000 km length each.Assume that the signal propagation speed on both links is 2 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1480 bytes and that Computer A fills each packet to the max, if possible. How many bytes will be contained in the last packet?
In this problem you will be doing some elementary calculations of transmission and propagation delays. Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission time?
Compare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. The previous expert did the wrong question and the answer was incorrect. The 3rd packet is lost not the 2nd packet
hdet b) Consider sending a packet contains 1100 bits from Host A to Host B in a store and forward nerwork. There are 10 links (and 9 routers) between A and B, and the links are congested (there Is a queuing delays). Assume propagation delay over the links are negligible. As a packet travels along the route, it encounters an average of 5 packets already waiting in the queue to be transmitted when it arrives at each router, How long does it take for the packet to get to the receiver if the nodes transmit on a "first come first served" basis (in ms)?
show step by step
Question 1a and 1b please
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 many bytes will be contained in the last packet?
In this problem you will be doing some elementary calculations oftransmission and propagation delays.Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and thelength of the link is 100Km. a). Now suppose that node C is connected to node B also by a 2 Mbps, 100Km link. How long does it take from when the first bit is transmitted by Ato when the last bit is received at C, assuming B operates in a store-andforward manner?
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? (c) hops required per received packet?