EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 1, Problem P16P
Explanation of Solution
The average packet arrival rate can be calculated using the little’s formula from queuing theory
The total number packets present in the router are packets present in the buffer and that are transmitting.
So, substitute “10+1 = 11” for “N”.
The average total delay time is
Thus, the queuing delay is
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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?
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?
We consider a noisy communication link in which the message is encoded into binary digits (0,1) (bits)before being transmitted. We will denote the length of the encoded message by n. Since the channel isnoisy, the bits can get flipped; a 0 to 1 or a 1 to 0. We will assume that each bit is flipped independently withprobability p. In order to be able to detect that the received message is in error, a simple method is to add aparity bit at the transmitter. There can two types of parity - even parity and odd parity. If even (odd) parityis used , the parity bit is set such that total number of 1s in the encoded message is even (odd). For the sakeof this problem, we will only consider even parity. Here are a few examples1) message: 0001 + parity bit: 1 --> encoded message: 000112) message: 0101 + parity bit: 0 --> encoded message: 010103) message: 0111 + parity bit: 1 --> encoded message: 01111At the receiver, the parity bit is computed from the message bits. If the received parity…
Chapter 1 Solutions
EBK COMPUTER NETWORKING
Ch. 1 - What is the difference between a host and an end...Ch. 1 - The word protocol is often used to describe...Ch. 1 - Why are standards important for protocols?Ch. 1 - Prob. R4RQCh. 1 - Prob. R5RQCh. 1 - Prob. R6RQCh. 1 - Prob. R7RQCh. 1 - Prob. R8RQCh. 1 - Prob. R9RQCh. 1 - Prob. R10RQ
Ch. 1 - Prob. R11RQCh. 1 - What advantage does a circuit-switched network...Ch. 1 - Prob. R13RQCh. 1 - Prob. R14RQCh. 1 - Prob. R15RQCh. 1 - Prob. R16RQCh. 1 - Prob. R17RQCh. 1 - Prob. R18RQCh. 1 - Suppose Host A wants to send a large file to Host...Ch. 1 - Prob. R20RQCh. 1 - Prob. R21RQCh. 1 - Prob. R22RQCh. 1 - What are the five layers in the Internet protocol...Ch. 1 - Prob. R24RQCh. 1 - Prob. R25RQCh. 1 - Prob. R26RQCh. 1 - Prob. R27RQCh. 1 - Prob. R28RQCh. 1 - Equation 1.1 gives a formula for the end-to-end...Ch. 1 - Prob. P3PCh. 1 - Prob. P4PCh. 1 - Prob. P5PCh. 1 - This elementary problem begins to explore...Ch. 1 - Prob. P7PCh. 1 - Suppose users share a 3 Mbps link. Also suppose...Ch. 1 - Prob. P9PCh. 1 - Prob. P10PCh. 1 - In the above problem, suppose R1 = R2 = R3 = R and...Ch. 1 - Prob. P13PCh. 1 - Consider the queuing delay in a router buffer. Let...Ch. 1 - Prob. P15PCh. 1 - Prob. P16PCh. 1 - Prob. P17PCh. 1 - Prob. P20PCh. 1 - Prob. P21PCh. 1 - Prob. P22PCh. 1 - Prob. P23PCh. 1 - Prob. P24PCh. 1 - Prob. P25PCh. 1 - Prob. P26PCh. 1 - Prob. P27PCh. 1 - Prob. P28PCh. 1 - Prob. P29PCh. 1 - Prob. P30PCh. 1 - Prob. P31PCh. 1 - Prob. P32PCh. 1 - Prob. P33PCh. 1 - Prob. P34P
Knowledge Booster
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.arrow_forwardGiven 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 NICarrow_forwardWhen Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm? From Data Structures and Algorithms C-7.56arrow_forward
- 3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A = 850 and u 1000. Find the smallest value of B such that P(N > B) < e = 10¬4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B. 4. Consider the M/M/1 queue from Problem 3. (a) Find an expression for E[N], i.e., the average number of packets in the system in steady- state. For the values of A and µ specified in Problem 4(b), compute the value of E[N]. What happens when A→ µ? (b) Find an expression for Var[N], i.e., the variance…arrow_forward3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A and u = 850 %3D 1000. Find the smallest value of B such that P(N > B) < € = 10-4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B.arrow_forwardb) Let's say a networking company uses a compression technique to encode the message before transmitting over the network. Suppose the message contains 6 unique characters of your name and their frequencies are similar to the last 6 non-zero digits of your mobile number. For example, your name is Badhon and the last 6 digits of your mobile number is 123456. So the frequency Frequency (in thousands) Characters B table of characters will be: 2 3 H. 4 Now, if the compression technique used is Huffman Coding instead of variable-length coding, how many bits will be saved in the message? Show the saving percentage. 6.arrow_forward
- Computer Networks Problem In the CSMA/CD protocol, the network adapter waits K-512 bit times after a collision, where K is drawn randomly. For K=20, how long does the adapter wait until returning to Step 2 for a 10 Mbps broadcast channel?arrow_forwardngineering Computer EngineeringQ&A Library2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission t 2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the…arrow_forwardA messaging system reads message as 4-digit positive integer d1d2d3d4 and stores encoding of the message e1e2e3e4 for security reason. The encoding process is as follows: ei = (di+i) mod 3 For example, if message is 4590, the encoded message is 2101. Read any arbitrary message and display the encoded message in the following format: Original message = Encoded message = language : Carrow_forward
- 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.arrow_forwardAsaparrow_forwardConsider 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?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education