QUESTION 5 ITOTAL MARKS: 25] [13 Marks] Consider a leaky bucket with a capacity

Question

QUESTION 5 ITOTAL MARKS: 25] [13 Marks] Consider a leaky bucket with a capacity of b tokens and a refill rate of r tokens per Q 5(a) second i) Describe how a leaky bucket policy works. (4 marks) i) What three factors can be controlled by use of one or more leaky buckets? (3 marks) ii) Under a leaky bucket policy, prove that the long-term average rate for the flow is given by r. (6 marks) Q 5(b) Suppose we wish to implement a DiffServ Architecture as follows [12 Marks] There are three classes of traffic o The first class should be allocated 60% of available bandwidth o The second class should be allocated 30% of the available bandwidth o The third class should receive the rest Additionally, streams for the classes transmit at different rates The first class transmits at 1Mbps . The second class transmits at 50kbps . The third class transmits at 10kbps i) Suggest a Weighted Fair Queuing policy to enforce the allocation requirement for the system. (4 marks) bandwidth li) Suppose the overall system bandwidth is 4 Mbps 1) What is the maximum number of streams of each traffic class that may be supported 2) Why might that maximum number not be achievable in practice? (5 marks) ii) Suppose that the third class requires absolutely no bandwidth guarantees while the first and second are as before. Suggest your own policy to share the bandwidth according to this scenario. (3 marks)

Explanation / Answer

Answer:

i. The leaky bucket is used to realize traffic policing and traffic shaping in Ethernet and cellular data networks. The algorithm can likewise be utilized to control metered-bandwidth Internet associations with counteract going over the distributed bandwidth for multi month, in this manner keeping away from additional charges. The algorithm works also to the manner in which a genuine leaky bucket holds water: The leaky bucket takes data and gathers it up to a most extreme capacity. Data in the bucket is just discharged from the bucket at a set rate and size of parcel. At the point when the bucket comes up short on data, the spilling stops. In the event that approaching data would overfill the bucket, at that point the bundle is thought to be non-conformant and isn't added to the bucket. Data is added to the bucket as space ends up accessible for accommodating packets.

ii. Elements controlled by leaky buckets are :

a) It controls in parcel exchanged computer networks and media communications networks in both the traffic policing and

traffic shaping of data transmissions, as packets.

b) beyond what many would consider possible on bandwidth and burstiness (a measure of the unevenness or assortments in the traffic stream).

c) It can likewise be utilized as a planning algorithm to determine the planning of transmissions that will follow the points of confinement set for the bandwidth and burstiness connected by the system.

iii. The rate at which cells are permitted to collect in the bucket, communicated in cells every second. Average rate: The average number of cells every second that "hole" from the opening in the base of the bucket and enter the system. For instance, if the average burst rate is 10 cells for every second, a burst of 10 seconds enables 100 cells to aggregate in the bucket. Since given refill rate is r, at that point long term average rate is r.

DEAR PLEASE DO RATE IT IF HELPS ELSE LET ME KNOW YOUR DOUBT.

THANK YOU!!

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.