An efficient network-wide broadcasting based on hop-limited shortest-path trees

DOI10.1016/J.COMNET.2008.08.015MaRDI QIDQ2377894zbMATH OpenOpenAlexFDO

Authors Shigeo Shioda, Kenji Ohtsuka, Takehiro Sato

Publication date 20 January 2009

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2008.08.015

zbMATH Keywords

floodingP2Proutingshortest path treewired networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Broadcast Networks of Bounded Degree
• BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING
• Topology broadcast algorithms
• Multiple message broadcasting in communication networks
• Spanners and message distribution in networks.

Cited in

(2)

• Leveraging Indirect Signaling for Topology Inference and Fast Broadcast
• Evolutionary design of oriented-tree networks using Cayley-type encodings

Describes a project that uses

Uses Software

• AHBP

This page was built for publication: An efficient network-wide broadcasting based on hop-limited shortest-path trees

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