Premium
One‐to‐all broadcasting scheme for arbitrary static interconnection networks with bursty background traffic
Author(s) -
Kouvatsos D. D.,
Mkwawa I. M.,
Awan I.
Publication year - 2004
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.760
Subject(s) - computer science , queueing theory , broadcasting (networking) , computer network , distributed computing , scheme (mathematics) , asynchronous communication , interconnection , mathematics , mathematical analysis
A novel one‐to‐all broadcasting scheme is proposed for arbitrary static 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 parallel computers and grid computing networks as well as asynchronous transfer mode space division architectures 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 an information theoretic decomposition criterion and graph theoretic concepts. Evidence based on empirical studies indicates the suitability of the scheme for achieving an optimal one‐to‐all broadcasting cost. Copyright © 2004 John Wiley & Sons, Ltd.