Topology broadcast algorithms

DOI10.1016/0169-7552(89)90066-4MaRDI QIDQ3815538zbMATH OpenOpenAlexFDO

Authors Pierre A. Humblet, Stuart R. Soloway

Publication date 1989

Published in Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/3007

zbMATH Keywords

broadcast network topologydistributed algorithmsfault-toleranceminimum depth spanning treesrouting

Mathematics Subject Classification ID

Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Event driven topology broadcast without sequence numbers
• scientific article; zbMATH DE number 4058884
• A trade-off between information and communication in broadcast protocols
• scientific article; zbMATH DE number 4062584
• Broadcasting spanning forests on a multiple-access channel

Cited in

(11)

• An efficient network-wide broadcasting based on hop-limited shortest-path trees
• Characterization of layer-2 unique topologies
• Time-efficient broadcast in radio networks
• Distributed Disaster Disclosure
• scientific article; zbMATH DE number 4055050 (Why is no real title available?)
• Event driven topology broadcast without sequence numbers
• Leveraging Indirect Signaling for Topology Inference and Fast Broadcast
• Mobile agent-based topology discovery scheme for large-scale network
• High Performance Computing for Computational Science - VECPAR 2004
• Adaptive broadcast by fault-tolerant spanning tree switching
• An efficient algorithm for topology discovery of a blackbox communication network

This page was built for publication: Topology broadcast algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815538)