One-to-all broadcasting scheme for arbitrary static interconnection networks with bursty background traffic

Concurrency and Computation: Practice and Experience

Volumn 16, Issue 13, 2004, Pages 1365-1383

  Kouvatsos, D D ^a   Mkwawa, I M ^a   Awan, I ^a  

^a UNIVERSITY OF BRADFORD   (United Kingdom)

Author keywords

Broadcasting; Bursty traffic; Graph decomposition; Interconnection networks; Maximum entropy principle; Queueing network models

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; BROADCASTING; COSTS; ENTROPY; GRAPH THEORY; TELECOMMUNICATION TRAFFIC;

BURSTY TRAFFIC; GRAPH DECOMPOSITION; MAXIMUM ENTROPY PRINCIPLE; QUEUEING NETWORK MODELS;

INTERCONNECTION NETWORKS;

EID: 8344228467     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.760     Document Type: Conference Paper

References (19)

1. Akers SB, Harel D, Krishnamurthy B. The star graph: An attractive alternative to the n-cube. International Conference on Parallel Processing, 1987; 393-400.
2. Kouvatsos D. Performance modelling and cost-effective analysis of multiservice integrated networks. Electronics and Communication Engineering 1997; 9(3): 127-135.
3. Kouvatsos D. Performance Evaluation and Applications of ATM Networks. Kluwer Academic: Boston, MA, 2000.
4. Jang-Piag S, Chao-Tsung W, Tzung-Shi C. An optimal broadcast algorithm without message redundancy in star graphs. IEEE Parallel and Distributed Systems 1995; 6(6):653-658.
5. Mendia VE, Sakar D. Optimal broadcasting on the star graph. IEEE Parallel and Distributed Systems 1992; 3(4):389-396.
6. Pascal B, Ferreira A, Perennes S. Optimal information dissemination in star and pancake networks. IEEE Parallel and Distributed Systems 1996; 7(12):1292-1300.
7. Chatterjee S, Bassiouni M. Scalable and efficient broadcasting algorithms for very large internetworks. Computer Communication 1998; 21(10):912-923.
8. Kouvatsos DD. Mathematical methods for the modular design of complex systems. Computers and Operations Research 1977; 4:55-63.
9. Kouvatsos DD. Entropy maximization and queueing network models. Annals of Operation Research 1994; 48:63-126.
10. Kouvatsos DD, Awan I. Entropy maximization and open queueing networks with priorities and blocking. Performance Evaluation 2003; 51:191-227.
11. Yu-Chee T, San-Yuan W, Chin-Wen H. Efficient broadcasting in wormhole-routed multicomputers: A network-partitioning approach. IEEE Parallel and Distributed Systems 1960; 10(1):44-61.
12. Perros HG. Queueing Networks with Blocking. Oxford University Press: Oxford, 1994.
13. Balsamo S, De Nitto Persone V, Onvural R. Analysis of Queueing Networks with Blocking. Kluwer Academic: Dordrecht, 2001.
14. Williams AC, Bhandiwad RA. A generating function approach to queueing network analysis of multiprogrammed computers. Networks 1976; 6(1): 1-22.
15. Kouvatsos DD, Tabet-Aouel NM. A maximum entropy priority approximation for a stable G/G/1 queue. Acta Informatica 1989; 27(4):247-286.
16. Shannon CE. A mathematical theory of communication. Bell Systems Technical Journal 1948; 27:379-623.
17. Watanabe S. Information theoretical analysis of multivariate correlation. IBM Journal of Research and Development 1960; 4:66-81.
18. Littlewood DE. The Theory of Group Characters and Matrix Representations of Groups. Clarendon Press: Oxford, 1950.
19. Hsu DF, Wei DS. Efficient routing and sorting schemes for de Bruijn networks. IEEE Transactions on Parallel and Distributed Systems 1997; 8(11): 1157-1170.