Abstract
— Space based multicast switches use copy networks to make copies of the inputs before forwarding them to the multiple destinations. In a copy network a copy scheduling policy determines the order in which the copies of the input packets are made and this policy affects the performance of the multicast switch. In this paper we present queueing models for the copy network for three scheduling policies – acyclic service without fanout splitting and cyclic service with and without fanout splitting. From these queueing models we obtain the average copy delay and the sustainable throughput, the maximum load that can be applied to all the input ports without resulting in an unstable queue at any of the inputs, for the above scheduling policies.

This publication has 18 references indexed in Scilit: