Hierarchical message dissemination in very large WANs

Author

Chatterjee, Samir ; Bassiouni, Mostafa A.

Author_Institution

Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA

fYear

1992

fDate

13-16 Sep 1992

Firstpage

397

Lastpage

403

Abstract

A hierarchical broadcasting technique in very large arbitrary networks which achieves near optimal cost and time measures is proposed. The network is partitioned into hierarchical clusters which are interconnected with each other through gate nodes. The approach is based on using a fully distributed minimum spanning tree algorithm within the gate-node network while achieving time optimal broadcasting within the local clusters by formulating the problem as finding maximum matching in constrained bipartite graphs. Extensive simulation results are presented which show the tradeoff between the two conflicting performance criteria

Keywords

performance evaluation; wide area networks; WAN; constrained bipartite graphs; fully distributed minimum spanning tree algorithm; gate-node network; hierarchical broadcasting technique; maximum matching; message dissemination; near optimal cost; performance criteria; time optimal broadcasting; very large arbitrary networks; wide area networks; Broadcasting; Clustering algorithms; Computer networks; Computer science; Cost function; Intelligent networks; Partitioning algorithms; Routing; Time measurement; Wide area networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Local Computer Networks, 1992. Proceedings., 17th Conference on

Conference_Location

Minneapolis, MN

Print_ISBN

0-8186-3095-7

Type

conf

DOI

10.1109/LCN.1992.228108

Filename

228108