Q6) Assuming the router's buffer is infinite, the queuing delay is 1.2957 ms, and 1476 packets arrive. How many packets will be in the buffer 1 second later? Assume a constant transmission rate of R = 300000 bps, a constant packet-length L = 1600 bits, and a is the average rate of packets/second. Traffic intensity I = La/R, and the queuing delay is calculated as I(L/R)(1-1) for I < 1.

Q6) Assuming the router's buffer is infinite, the queuing delay is 1.2957 ms, and 1476 packets arrive. How many packets will be in the buffer 1 second later? Assume a constant transmission rate of R = 300000 bps, a constant packet-length L = 1600 bits, and a is the average rate of packets/second. Traffic intensity I = La/R, and the queuing delay is calculated as I(L/R)(1-1) for I < 1.

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

Que.a) Consider a CSMA/CD network that transmits data at a rate of 400 x 106 bits per second. The maximum signal propagation time from one node to another node is 20 microseconds. The minimum size of a frame in the network is(. bytes).
A network with a bandwidth of 20 Mbps can theoretically pass only an average of 12,000 frames per minute. a) What is the average size of the frame expressed in bits? b) The Achieved throughput is 5 Mbps. What is the ratio of throughput/bandwidth?
I need answer quickly
81. A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs. a. 1 b. 2 c. 3 d. 4
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.
Q5) Assuming that a = 39, what is the queuing delay? Give your answer in milliseconds (ms) Assume a constant transmission rate of R = 300000 bps, a constant packet-length L = 1600 bits, and a is the average rate of packets/second. Traffic intensity I = La/R, and the queuing delay is calculated as I(L/R)(1-1) for I < 1. Average queuing delay 87.860 ms 0.8786 ms 1.2957 ms 1295.7 ms La/R 1
4. Consider the CRC polynomial P=11012=X³ + X² + 1. a) In order to compute the CRC code word for the information, I=1110101102, How many bits of CRC check sum will be appended? b) In order to send the above information, I, what is the message M will be sent to a receiver with check bits(remainder)? c) If the following message, M = 110110100010 is transmitted to the receiver, what is the remainder of this message? Does it have a transmission error or not?
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.
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. If transmission starts at time t=0, how long (in seconds) does it take until Computer B has received the last bit of the complete file transfer?Assume that the switch between link 1 and 2 is a "store-and-forward" switch. Furthermore, assume that processing and queuing delays are negligible and no other stations are using the links.
Networking price Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. Manchester using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.
a) Consider a CSMA/CD network running at 20 Mb/s over 3-km cable with no repeaters. The signal speed in the cable is 2×108 m/s. Suppose station A starts transmitting a frame of size 400 bytes at time T. i. Can it happen that station A detects a collision at time T+10 us (micro seconds) if there was no collision detected between time T and T+10 μs? Justify your answer. Can it happen that the station detects a collision at time T+20 μs, if there was no collision detected between time T and T+20 us? Justify your answer. iii. Can it happen that the station detects a collision at time T+33 μs, if there was no collision detected between time T and T+33 us?? Justify your answer.
. Let A and B be two stations attempting to transmit on an Ethernet. Each has a steady queue of frames ready to send; A's frames will be numbered A1, A2, and so on, and B's similarly. Let T= 51.2 µs be the exponential backoff base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times of 0 x and 1 x T, respectively, meaning A wins the race and transmits A₁ while B waits. At the end of this transmission, B will attempt to retransmit B₁ while A will attempt to transmit A2. These first attempts will collide, but now A backs off for either 0 × T or 1 x T, while B backs off for time equal to one of 0 x T,..., 3 x T. (a) Give the probability that A wins this second backoff race immediately after this first collision; that is, A's first choice of backoff time k x 51.2 is less than B's. (b) Suppose A wins this second backoff race. A transmits A3, and when it is finished, A and B collide again as A tries to transmit A4 and B tries once more to…