Name
Title | ||
|---|---|---|
One-To-All Broadcasting Scheme For Arbitrary Static Interconnection Networks With Bursty Background Traffic |
Abstract | ||
|---|---|---|
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 (C) 2004 John Wiley Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1002/cpe.760 | CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE |
Keywords | DocType | Volume |
broadcasting, graph decomposition, interconnection networks, bursty traffic, queueing network models, maximum entropy principle | Journal | 16 |
Issue | ISSN | Citations |
13 | 1532-0626 | 1 |
PageRank | References | Authors |
0.36 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Demetres Kouvatsos | 1 | 494 | 56.62 |
| Is-Haka Mkwawa | 2 | 65 | 9.07 |
| Irfan Ullah Awan | 3 | 711 | 87.15 |