Shared buffering in nonblocking copy networks

Abstract

This paper investigates the performance of nonblocking copy networks employing the shared buffering scheme. We use the technique of tagged Markov chains to derive the stationary distributions for the occupancy of the buffers. Based on these stationary distributions, the delay, throughput, and packet loss probability are calculated as critical performance measures of the copy network. We also carry out analyses for variations in the copying policy such as fanout splitting wherein a copy request from a single packet may be completed over two time slots, and feed channel priority wherein there exists a certain priority among input channels.<>