Consider a router buffer preceding an outbound link. In this problem, you will use Little's formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little's formula is N = a - d. Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link's transmission rate is 100 packets/sec. Using Little's formula, what is the average packet arrival rate, assuming there is no packet loss?

Consider a router buffer preceding an outbound link. In this problem, you will use Little's formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little's formula is N = a - d. Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link's transmission rate is 100 packets/sec. Using Little's formula, what is the average packet arrival rate, assuming there is no packet loss?

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

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?
Problem 2. Consider a packet of L bits that is sent over a path of Q links (i.e., a source and destination connected by a sequence of (Q-1) routers or switches). Each link transmits at R bps. This packet is the only traffic transmitted by the network (so there are no queuing delays) and the propagation delay and processing delay at routers are negligible. How long does it take to send this packet from source to destination if the network is: a) a packet-switched datagram network b) a circuit-switched network. Assume that bandwidth of R bps on each link is sliced into five individual circuits, so that cach circuit receives (R/5) bandwidth. Also assume that the circuit setup time is t,.. Give an expression for the number of links Q such that the packet delivery from the sender to the receiver will be faster over the packet-switched network, and the expression for the number of links Q such that the circuit-switched network will be faster.
Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NIC
a. Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? b. Now suppose that N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?
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.
Copy from chegg == Report! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing
In a data communication system, several messages that arrive at a node are bundled into a packet before they are transmitted over the network. Assume that the messages arrive at the node according to a Poisson process with rate 30 messages per minute (0.5 per second). Five messages are used to form a packet.What is the mean time until a packet is formed, that is, until five messages arrive at the node?
5.03-5. Dijkstra's Algorithm (3, part 5). Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? OF (A) 3 2 4 B 8 D 10 4 E 4 2 F
Given a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.
Equation 1.1 gives a formula for the end-to-end delay of sending one packet of length L over N links of transmission rate R. Generalize this formula for sending P such packets back-to-back over the N links. Explain
Consider a half-duplex point-to-point link using a stop-and-wait scheme, in which a series of messages is sent, with each message segmented into a number of frames. Ignore errors and frame overhead. A. What is the effect on line utilization of increasing the message size so that fewer messages will be required? Other factors remain constant. B. What is the effect on line utilization of increasing the number of frames for a constant message size? C. What is the effect on line utilization of increasing frame size?
Computer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it…