The generic cell rate algorithm, or GCRA, is a leaky-bucket-type scheduling algorithm used in Asynchronous Transfer Mode networks. It measures the timing of cells on a virtual channel or virtual path against the bandwidth and jitter limits written into that connection's traffic contract. Cells that do not conform may be delayed, which is traffic shaping, or dropped or reduced in priority, which is traffic policing. The ATM Forum and ITU-T recommendation I.371 describe it in two equivalent ways, as a continuous-state leaky bucket and as a virtual scheduling algorithm that tracks a theoretical arrival time. Unlike a token bucket, it does not simulate the bucket leaking: each arriving cell triggers a calculation of when the bucket will next empty, and because ATM cells have a fixed length that calculation needs no multiplication or division. It is given only as a reference, so network providers may use any other algorithm that gives the same result, and two copies can be run together as a dual leaky bucket to limit both the sustained cell rate and the peak cell rate.
Connections
In Field
Source Generic cell rate algorithm (Wikipedia)
Sources
Generic cell rate algorithm (Wikipedia)
In Group: Traffic Shaping and Medium Access, Lead paragraph
to measure the timing of cells on virtual channels
In Field: Computer Networking, Lead paragraph [in-field]
is a leaky bucket-type scheduling algorithm for the network scheduler that is used in Asynchronous Transfer Mode (ATM) networks
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.