Leaky bucket algorithm

from Wikipedia, the free encyclopedia

The leaky bucket algorithm is a simple technique for shaping traffic . This regulates the amount of data transferred. The maximum data rate is limited. A similar algorithm is the token-bucket algorithm .

Leaky bucket algorithm

All packages are in a FIFO - snake sorted. This snake is characterized by two characteristics.

  1. The capacity β describes the snake's maximum capacity. If the queue is full, all subsequent packets are discarded.
  2. The output rate ρ describes how many packets or bytes leave the queue per second (hence the name: the packets drip out of the queue like through a hole in a bucket).

The leaky bucket algorithm is used in Asynchronous Transfer Mode (ATM) and is also called Generic Cell Rate Algorithm (GCRA) there.

literature

  • Erwin Rathgeb, Eugen Wallmeier: ATM - infrastructure for high-performance communication. Springer Verlag, Berlin / Heidelberg 1997, ISBN 978-3-642-64373-6 .
  • Bernd Heinrichs: Multimedia on the Net. Springer Verlag, Berlin / Heidelberg 1996, ISBN 978-3-540-58349-3 .
  • Peter Mandl, Andreas Bakomenko, Johannes Weiss: Basic course in data communication. TCP / IP-based communication, 2nd edition, Friedrich Vieweg & Sohn Verlagsgesellschaft mbH, Wiesbaden 2010, ISBN 978-3-8348-0810-3 .
  • Manfred Broy, Otto Spaniol (Hrsg.): VDI-Lexikon Informatik und Kommunikationstechnik. 2nd edition, Springer Verlag Berlin Heidelberg, Berlin Heidelberg 1999, ISBN 978-3-642-46846-9 .
  • Volker Jung, Hans-Jürgen Warnecke (Hrsg.): Handbook for telecommunications. Springer Verlag, Berlin / Heidelberg 1998, ISBN 978-3-642-97703-9 .

Web links