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

In this paper, we generalize the dynamic frame sizing (DFS) algorithm proposed in 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.