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

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.
Suppose two TCP connections share a path through a router R. The router's queue size is six segments; each connection has a stable congestion window of three segments. No congestion control is used by these connections. A third TCP connection now is attempted, also through R. The third connection does not use congestion control either. Describe a scenario in which, for at least a while, the third connection gets none of the available bandwidth. and the first two connections proceed with 50% each. Does it matter if the third connection uses slow start? How does full congestion avoidance on the part of the first two connections help solve this? 10:33 am Type a message Dorcon 1 tahir re
In TCP Vegas, the calculation of Actual Rate is done by dividing the amount of data transmitted in one RTT interval by the length of the RTT. (a) Show that for any TCP, if the window size remains constant, then the amount of data transmitted in one RTT interval is constant once a full window-full is sent. Assume that the sender transmits each segment instantly upon receiving an ACK, packets are not lost and are delivered in order, segments are all the same size, and the first link along the path is not the slowest. (b) Give a timeline sketch showing that the amount of data per RIT above can be less than Congestion Window.
8. Consider the leaky bucket policer that polices the average rate and burst size of a packet flow. We now want to police the peak rate, p, as well. Show how the output of this leaky bucket policer can be fed into a second leaky bucket policer so that the two leaky buckets in series police the average rate, peak rate, and burst size. Be sure to give the bucket size and token generation rate for the second policer.
Given a single link of length 800 Km and transmission speed of 49 Mbps between a client and a web server. Assume the client web browser sends a small Http request (packet) of 40 bytes to the web server at the other end. Data travels through the links at the speed of (2 x 108 meters/sec) and Queuing delay = processing delay =0. The propagation delay in microseconds is The transmission delay in microseconds of the packet of size 40 bytes is Calculate the Round-trip time (RTT) in microseconds if a upon receiving the packet the web server sends a response packet with the same size.
Consider the Go-Back-N protocol, with a window size N = 50. Suppose 30 packets are sent, but the first send of the 10th packet is lost. There are no other failure assumptions. a. How many packets will be resent? b. Imagine that the Fast Retransmit optimization has been added to the protocol. How many packets will be resent in this case?
Question 2 please (a,b,c,d included)
Please give me correct solution.
Explain the impact on the delay and lossperformance of the low-priority traffic under the following conditions: a. The high-priority traffic consists of uniformly spaced, fixed-length packets b. The high-priority traffic consists of uniformly spaced, variable-length packets
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.
Suppose station X sends a message with 15 packets to station B using sliding window of size 4, selective repeat in used and every 5th packet is lost, number of transmission required to send all 15 packets to Y.
Assume a TCP sender sends four packets of size 1024 bytes, carrying bytes 0-4095. If the second packet is lost, what is the content of the Acknowledgement field sent in response to the third packet? (If you think that no acknowledgement is sent, for example because the third packet is out of order, then answer -1.)