Generalized dynamic frame sizing algorithm for finite-internal-buffered networks

摘要

In this paper, we generalize the Dynamic Frame Sizing (DFS) algorithm proposed in [2] for CICQ switches to a network of queues subject to multicast traffic flows. Under the assumption of Bernoulli arrival processes for the multicast flows, we show that the DFS algorithm guarantees 100% throughput and there are at most two packets in each internal queue.