Assume that a reliable delivery of data from a machine M1 to another machine M2 is provided through many intermediate machines. All the intermediate links of these machines are not prone to error such as that in the case of present day wired networks. What layer or layers (transport, network, or data link layer) one will choose to provide reliability? What layer or layers one will choose to not provide reliability? Justify with explanation for both affirmative and negative selections.

Assume that a reliable delivery of data from a machine M1 to another machine M2 is provided through many intermediate machines. All the intermediate links of these machines are not prone to error such as that in the case of present day wired networks. What layer or layers (transport, network, or data link layer) one will choose to provide reliability? What layer or layers one will choose to not provide reliability? Justify with explanation for both affirmative and negative selections.

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

Explain in detail about the addressing and routing techniques in the communication network. You are required to provide any suitable illustration to support your explanation.
Consider the following design problem concerning implementation of virtual-circuit service. If virtual circuits are used internal to the subnet, each data packet must have a 3-byte header and each router must tie up 8 bytes of storage for circuit identification. If datagrams are used internally, 15-byte headers are needed but no router table space is required. Transmission capacity costs 1 cent per 106 bytes, per hop. Very fast router memory can be purchased for 1 cent per byte and is depreciated over two years, assuming a 40-hour business week. The statistically average session runs for 1000 sec, in which time 200 packets are transmitted. The mean packet requires four hops. Which implementation is cheaper, and by how much?
Design an Ethernet network to connect a single client PC to a single server. Both the client and the server will connect to their respective workgroup switches via UTP. Their workgroup switches are connected directly by a trunk link. The two switches are 900 meters apart. They need to communicate at 800 Mbps. Your design will specify the locations of any switches and the transmission link between the switches. Then add another client next to the first client. This client will also communicate with the server and will also need 800 Mbps in transmission speed. Again, your design will specify the locations of switches and the transmission link between the switches.
A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?
Explain the potential problems with routing in superscalar systems and explain the figures (a), (b), and (c) using a relevant example.
Consider a full-duplex 512 kbps link with length 36,000Km connecting two hosts. The data frames carry a useful payload of size 6000 bits. Assume that both ACK and data frames have 400 bits of header information, and that ACK frames carry no data. The propagation speed along this link is 3×108 m/sec. a) What is the RTT on this link? b) What is the effective useful data throughput, in kbps, when using Stop-and-Wait?
Show that if the transfer function of the hidden units is linear, a three-layer network is equivalent to a two-layer one. Explain why, therefore, that a three-layer network with linear hidden units cannot solve a non-linearly separable problem such as XOR or n-bit parity.
not handwritten A 3000-km long, 1 Mbps link is used to transmit 1000-bit data packets using the Selective Repeat protocol. If the speed of light in this link is 2 x 105 km/second. What is the minimum number of bits the sequence numbers should be? Assume no flow control, and negligible transmission and processing times for acknowledgments. (Take 1M = 1000,000.)
Is it feasible to create a single protocol that addresses all issues that arise during data transmission? If that's the case, what's the best way to go about it?
Given that the data connection layer is capable of detecting mistakes between hops, why do you believe that we need an additional checking mechanism at the transport layer?
What is meant by a control plane that is based on per-router control? In such cases, when we say the network control and data planes are implemented "monolithically" what do we mean?
Computer Science Consider two hosts C & D connected by a point-to-point link with a data link rate of 10 Gb/s. The hosts are 2 km apart and the signal propagation speed is 2 × 108 m/s. Given the packet size is 500 bytes, how many packets can be in inflight from C to D?