Premium
Minimum‐time line broadcast networks
Author(s) -
Farley Arthur M.
Publication year - 1980
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230100106
Subject(s) - broadcasting (networking) , computer science , broadcast communication network , computer network , line (geometry) , schedule , tree (set theory) , process (computing) , telecommunications , mathematics , geometry , operating system , mathematical analysis
Broadcasting refers to the process of message dissemination in a communication network whereby a message, originated by one member, becomes known to all members. Line broadcasting assumes that members may “switch‐through” any number of calls during a time unit. An algorithm is presented which produces a calling schedule completing line broadcasting in minimum time from any member of any tree. A discussion of three types of broadcasting and their associated minimum time networks is included.