Finding shortest paths in distributed loop networks

DOI10.1016/S0020-0190(98)00099-4zbMath1339.68020MaRDI QIDQ293346

Nimmagadda Chalamaiah, Badrinath Ramamurthy

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000994?np=y

zbMATH Keywords

shortest pathdistributed systemsloop networksmodular arithmetic

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Optimal routing in double loop networks

Cites Work

• Reliable circulant networks with minimum transmission delay
• Fault-tolerant routing in distributed loop networks

This page was built for publication: Finding shortest paths in distributed loop networks