. 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.

. 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.

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

Related questions

Q: The token bucket algorithm is a popular method for traffic shaping (recap the algorithm in textbook…

A: Answer: Given capacity of token buckets 400 MB Rate of token buckets 10 MB/s Initial buckets…

Q: Suppose that a 20-Mbps 802.11 LAN is transmitting 64-byte frames back-to-back over a radio channel…

A: To solve this problem, let's break it down step by step.Calculate the probability that a single bit…

Q: Consider a channel that can lose packets but has a maximum delay that is known. Modify protocol…

A: FSM of modified RDT 2.1 that includes sender timeout and retransmits:

Q: 1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with…

A: i) Message 1: {"Alice", K, RA}Bob, Message 2: RA, RB "Bob" who is authenticated to person "Alice"…

Q: Compare the cypher block chaining method with the cypher feedback mode while you are sending…

A: Symmetric encryption may have stream and block modes. Stream mode means each bit is independently…

Q: noisy communication channel (there is high probability of more than one device speak at the same…

A: Which approach, from your point of view, is efficient and why - If we have: noisy communication…

Q: Imagine a flow specification that has the maximum packet size 800 bytes, token bucket rate of 5 x…

A: I have answered in this question step 2.

Q: Give a simple heuristic for finding two paths through a network from a given source to a given…

A: Introduction: Think of the router as a node and the communication channel as an edge. Consequently,…

Q: Give a simple heuristic for finding two paths through a network from a given source to a given…

A: Give a straightforward heuristic for locating two routes within a network that can still be followed…

Q: The first 32 bits indicate how many LSAs are contained in the LSU packet, and then the LSAs follow.…

A: This particular question belongs to Computer Science and Engineering. Computer Science is an…

Question

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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. b) Suppose the network is a packet-switched datagram network and a connectionless service is used. How long does it take to send the file?
Suppose you want to deliver the gift to your friend, Jashim as a birthday gift. You packed the gift in five different packets, give them serial no and send them to your friend’s address at a time. Jashim has a PA to collect all packets and store them by their serial. If Jashim’s PA can receive all the packets serially then deliver them to Jashim. If any packet is missing, Then the PA inform you to resend the packet again.I. Which protocol you want to use to avoid over cost if resend is required.II. Describe your used protocol with an appropriate diagram using the above description.
The message to be sent from source to destination is 4000B. The link MTU's from source to destination are 1500, 1000, and 750. If we DO NOT use Path MTU, what are the respective fragment sizes to be reassembled? If we DO use Path MTU, what are the respective fragment sizes to be reassembled? Remember, assume that the L3 and L4 headers have length=0.
Suppose that the average object size is 850,000 bits and that the average request rate from the institution’s browsers to the origin servers is 16 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is three seconds on average (see Section 2.2.5). Model the total average response time as the sum of the average access delay (that is, the delay from Internet router to institution router) and the average Internet delay. For the average access delay, use Δ/(1 – Δ ), where Δ is the average time required to send an object over the access link and is the arrival rate of objects to the access link. a. Find the total average response time.b. Now suppose a cache installed in the institutional LAN, Suppose the miss rate is 0.4. Find the total response time.
With the ECB mode, if there is an error in a block of the transmitted ciphertext, only the corresponding plaintext block is affected. However, in the CBC mode, this error propagates. For example, an error in the transmitted C1 obviously corrupts P1 and P21. 1. Are any blocks beyond P2 affected? 2. Suppose that there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect at the receiver? (Encryption algorithms question)
It is possible to send many packets from one host to another using the same connection. Please break down the time it takes for a single package to go from beginning to conclusion. Is there going to be one delay that takes a certain length of time and another that varies?
You can use both the selective-repeat and Go-Back-N approaches to solve the problem if the sequence number space is k bits in size. How large of a window can we construct for the sender?
. 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…
I need the answer as soon as possible
Give a simple heuristic for finding two paths through a network from a given source to a given destination that can survive the loss of any communication line (assuming two such paths exist). The routers are considered reliable enough, so it is not necessary to worry about the possibility of router crashes.
It is possible for a series of packets to be sent from one host to another utilizing the same route between the hosts. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last for a certain period of time, while the other delay's length remains open?