Which queue operation is used for holding the packets in Leaky Bucket implementation?

Q.  Which queue operation is used for holding the packets in Leaky Bucket implementation?
- Published on 23 Sep 15

a. LIFO
b. FILO
c. FIFO
d. All of the above

ANSWER: FIFO

Related Content

 

    Discussion

  • Prajakta Pandit   -Posted on 14 Oct 15

    Leaky Bucket implementation

        - A leaky bucket is an algorithm used in packet switched computer networks and telecommunications networks.

        - A FIFO queue is used for holding the packets.

        - It can be used to check the data transmission in the form of packets.

        - It is the algorithm used to control congestion in network traffic.

        - It can also be used as a scheduling algorithm to determine the timing of transmission.

        - A version of the leaky bucket is the Generic Cell Rate Algorithm which is recommended for Asynchronous Transfer Mode (ATM).

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲