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?

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?

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

Is that so, or not? Consider a TCP connection where the most recent SampleRTT was 1 second. It is recommended that the TimeoutInterval be set to more than one second.
For the sake of this example, let's assume that a packet is being sent from its point of origin to an address at the other end of the network via the fixed route. The different delays-causing variables are also listed below: How many of the overall delays are time-dependent, and what proportion of the total delays are continuous for how long?
Several bits can be sent over a link between two hosts at the same time. I'd appreciate it if you could give me a plan of all the things that need to be done to finish one package. Is it expected that one delay will last for a certain amount of time and that the length of the other delay will depend on what's going on?
Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose that a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually, the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?
In an RPC-like protocol, many requests can be active at the same time, and responses can be sent in any order: Assume that requests are sequentially numbered and that ACK[N] acknowledges reply[N]. Should ACKs be added up? If not, what should happen if an ACK is not received?
Using the same connection between two hosts, it is possible to send a series of packets in a single transmission. 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 while the other delay's length will be more malleable?
Consider the situation in the previous exercise, except this time assume that the router has a queue size of 1; that is, it can hold one packet in addition to the one it is sending (in each direction). Let A's timeout be 5 seconds, and let SWS again be 4. Show what happens at each second from Time=0 until all four packets from the first window-full are successfully delivered.
Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a file from a remote server residing at a well-known address. The client first sends a request with file name, and the server responds with a sequence of data packets containing different parts of the requested file. To ensure reliability and sequenced delivery, client and server use a stop-and-wait protocol. Ignoring the obvious performance issue, do you see a problem with this protocol? Think carefully about the possibility of processes crashing.
A connection between two hosts is capable of carrying several packets at the same time. I would appreciate it if you could provide a schedule that details all of the activities that need to be completed in order to finish one shipment. Is it anticipated that one delay would last for a certain amount of time, whilst the other delay's length may be adjusted according to the circumstances?
Consider a TCP connection betweek two hosts between A and B. The first data byte sent by A is numbered 1. The LastByteRcvd at B is 500. Then, the range of values SendBase at A may take is from to 500
For the Zhou-Gollman non-repudiation protocol discussed in the lecture on “Non-Repudiationand Anonymity Protocols”, which one of the following statements is false:
Give a simple heuristic for finding two paths through a network from a given source to a given destination that can survive the loss of any communication line (assuming two such paths exist). The routers are considered reliable enough, so it is not necessary to worry about the possibility of router crashes.