Fairness and priority implementaton in non-blocking copy network

The issues of fairness and priority implementation in copy networks are addressed. The copy network is non-blocking and is realized by a sequential packet selection scheme, which can result in unfair packet access to the copy network. An SSP (shift sequence permutation) network based on a Banyan MIN (multistage interconnection network) is proposed to provide fairness, and an analytic model based on generating functions for evaluating the exact blocking probabilities of copy networks with the fairness improvement is introduced. In addition, the issue of priority copying is investigated. The authors provide numerical results to show the performance degradation experienced by class-2 traffic due to the presence of class-1 traffic for a 64×64 network