Premium
Construction of centered shortest‐path trees in networks
Author(s) -
Wall David W.,
Owicki Susan
Publication year - 1983
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.3230130206
Subject(s) - shortest path problem , computer science , node (physics) , construct (python library) , routing (electronic design automation) , computer network , tree (set theory) , center (category theory) , path (computing) , distributed computing , theoretical computer science , mathematics , combinatorics , graph , engineering , chemistry , structural engineering , crystallography
Many researchers in the area of distributed networks have found it convenient to assume the existence of a facility for routing broadcast messages to all the nodes in the network. We are investigating an approach called center‐based forwarding which routes messages via the branches of the shortest‐path tree for some node near the center of the network. In this article we show that this approach results in broadcasts that finish with low delay; we then explain how to construct centered trees in a loosely coupled network environment.