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 hypercu...

Full description

Saved in:
Bibliographic Details
Main Authors: Kouvatsos, D., Mkwawa, I.-H., Awan, I.
Format: Conference Proceeding
Language:English
Subjects:
Broadcasting
Cost function
Entropy
Hypercubes
Message passing
Multiprocessor interconnection networks
Queueing analysis
Telecommunication traffic
Traffic control
Tree graphs
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1080-241X
2331-107X
DOI:10.1109/SIMSYM.2003.1192806