One-to-all broadcasting scheme for hypercubes with background traffic

A novel one-to-all broadcasting scheme is proposed for hypercube interconnection networks with bursty background traffic having head-of-line priorities, complete buffer sharing and repetitive service blocking with random destination. The scheme facilitates inter-process communication amongst hypercube computers and it is applicable to a single-port mode of message passing communication. The scheme utilizes a queue-by-queue decomposition algorithm for arbitrary open queueing network models, based on the principle of maximum entropy, in conjunction with binomial trees and graph theoretic concepts. Evidence based on empirical studies indicates the suitability of the scheme for achieving an optimal one-to-all broadcasting cost.