Nearly Poisson transfer traffic in real-time networks

Consideration is given to a homogeneous distributed network of nodes with a quasi-dynamic random task-sharing discipline and identical Poisson hard real-time traffic at each node. The task-sharing discipline under consideration permits tasks to be shared randomly around the network as long as remaining task laxity permits. Analysis of task loss in such a network requires the assumption that the transferred task stream from all nodes form a Poisson stream. The authors study the requirements for such an assumption to be justified by using computer simulation to examine transferred traffic for both independence and its fit to an exponential distribution as a function of network size. A rough rule of thumb for estimating independence is to assume the transfers are independent after the system size exceeds the average number of transfers between nodes