Consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start, that works in units of packets rather than bytes, and that starts each connection with a congestion window equal to one packet. Give a detailed sketch of this algorithm. Assume the delay is latency only and that when a group of packets is sent only a single ACK is returned. Plot the congestion window as a function of round-trip times for the situation in which the following packets are lost: 9, 25, 30, 38, and 50. For simplicity, assume a perfect timeout mechanism that detects a lost packet exactly 1 RTT after it is transmitted.

Consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start, that works in units of packets rather than bytes, and that starts each connection with a congestion window equal to one packet. Give a detailed sketch of this algorithm. Assume the delay is latency only and that when a group of packets is sent only a single ACK is returned. Plot the congestion window as a function of round-trip times for the situation in which the following packets are lost: 9, 25, 30, 38, and 50. For simplicity, assume a perfect timeout mechanism that detects a lost packet exactly 1 RTT after it is transmitted.

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

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.
In TCP connection, congestion occurs if the load on the network is greater than the capacity of the network. TCP uses the following algorithm to handle congestion. The algorithm is based on the size of the congestion window (cwnd) which starts with one maximum segment size (MSS). The MSS is determined during connection establishment. At each time the whole window of segments is acknowledged (one transmission), the size of the window grows exponentially. To stop this exponential growth, the sender keeps the track of a threshold. The threshold is set to 16 MSS. After reaching the threshold, the size of the congestion window is increased by 1. After how many transmissions the congestion window size will be 22 MSS?
Give outcome for given scenario:A source had sent five packets and suddenly pause the animation before those packets had reached its destination. Now kill the first packet's ACK after it reaches its destination.
Give outcome for given scenario: A source had sent five packets and suddenly pause the animation before those packets had reached its destination. Now kill the first packet's ACK after it reaches its destination.
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.
We observed that (n-1)D is the maximal delay in queuing if the fabric of switching is n times faster than the input line rate. Suppose all packets have the same duration, n packets are sent to n entry ports at the same time, and all n packets are sent to separate exit ports. What is the maximum delay for a memory packet?
Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?
Suppose a TCP connection, with window size 1, loses every other packet. Those that do arrive have RTT: 1 second. What = happens? What happens to TimeOut? Do this for two cases: (a) After a packet is eventually received, we pick up where we left off, resuming with Estimated RTT initialized to its pre-timeout value, and TimeOut double that. (b) After a packet is eventually received, we resume with TimeOut initialized to the last exponentially backed-off value used for the timeout interval. In the following four exercises, the calculations involved are straightforward with a spreadsheet.
Material must be played out in a specific time intervals in order to be correctly interpreted by the recipient. Real-time protocols take varying transit times to get from source to destination. Even if packets are sent with the correct intervals, they will arrive at the other end with varying arrival times. Jitter is referred to as a fluctuation of pause time. We can buffer the packets for jitter reduction Let us say that, for the sake of argument, the noise is random, and the buffer is adequate. Armed with this knowledge, tell us what other difficulties are there?
If the number of packets arriving at the leaky bucket is less than rt + b packets in any interval of time of length t for all t, a packet flow is said to adhere to a leaky-bucket specification (r,b) with burst size b and average rate r. Is a leaky bucket specification (r,b) packet flow ever have to wait at a leaky bucket policer with parameters r and b? Justify your answer.
To ensure the quality of service, especially for multiple applications, regulating the rate at which packets are sent to the network is an important strategy. The leaky bucket is just one of such mechanisms. A flow of packets is said to conform to the leaky bucket specification (r, b), where r is the average rate and b is the burst rate, if the number of packets arriving at the leaky bucket is less than r*t + b in every time interval of t. What is the implication of that? What will happen if the number of packets arriving at the leaky bucket is equal to or greater than r*t + b?
Asap