• Author : Alexander McGrath Kraak


Fair Adaptive Dynamic Thresholds

Description Fair Adaptive Dynamic Thresholds (FADT) provides efficient allocation of shared packet buffer resources amongst various virtual output queues. FADT is useful when queues are getting congested and buffer resources should be allocated in a way that prioritizes certain queues while avoiding starvation of lower priority queues. The scheme works on each incoming packet by calculating instantaneous queue threshold based on available free resources. Queue buffer threshold is calculated as: Queue threshold = Shared free buffers * (2)/(2+1) Alpha () values range from -7 to 7. Dynamic threshold is always bound to static threshold configuration. The figure below shows for...
Continue reading →


Get every new post on this blog delivered to your Inbox.

Join other followers: