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

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.
Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
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 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?
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.
The token bucket algorithm is a popular method for traffic shaping. A computer uses a token bucket with acapacity of 400 megabytes (MB) and a rate of 10 MB/sec. The computer continuously generates20 MB/sec for transmission from time 0. Assume the bucket’s water level is 200 MB at time 0.1a. How long will it take to send 1000 MB? Show the steps.1b. Draw a figure showing how the bucket’s water level evolves
Assume the following parameters for Go-Back-N (GBN): a) N = 5 b) Round Trip Time (RTT) = 10 milliseconds c) Retransmission Timeout period = 40 milliseconds d) Segment Size = 3300 bytes. Suppose that a sender sent 15 data segments, numbered 1 through 15, to a receiver using the GBN mechanism. Suppose that data segment 4 and data segment 10 were lost the first time the sender sent the segments (but reached the receiver correctly when retransmitted). Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all the data segments (in bytes/sec)? Draw a diagram to show the communication of the segments in detail.
Assume that an end-to-end communications system is made up of three networks with date rate in Mbps ρ1, ρ2, and ρ3, respectively. Ignoring the other delay components, what is the total end-to-end delay to transmit a packet size of λ?
For each of the following sets of codewords, please give the appropriate (n,k,d) designation where n is number of bits in each codeword, k is the number of message bits transmitted by each code word and d is the minimum Hamming distance between codewords. Also give the code rate. {111, 100, 001, 010}
Assume that in an organization there are 16 employees which are connected to a network which is wireless, the network offers a maximum data rate of 500 Mbit/s and have a throughput of 40%. Find out the average message data rate (in Kbit/s) of each employee.
The parity check matrix is given as shown:Determine the format of the codeword. c = [message | parity bits] c = [parity bits | message] c = [message | parity bits | message] none of the answers