Title

Hierarchical Message Dissemination In Very Large Wans

Abstract

Message dissemination or broadcasting is the process whereby a message, originated by one source node, is transmitted to all the nodes of the network. Unfortunately, the current IP and emerging OSI Internet algorithms for broadcasting does not scale well with the tremendous growth of network size. Moreover, optimizing broadcast time and the cost of routing is difficult as they are conflicting performance measures. We propose a hierarchical broadcasting technique in very large arbitrary networks which achieves near optimal cost and time measures. The network is partitioned into hierarchical clusters which are interconnected with each other through gate nodes. Our 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.

Publication Date

1-1-1992

Publication Title

Proceedings - Conference on Local Computer Networks, LCN

Number of Pages

397-403

Document Type

Article; Proceedings Paper

Identifier

scopus

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/LCN.1992.228108

Socpus ID

0347410138 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0347410138

This document is currently not available here.

Share

COinS