ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
From MaRDI portal
Publication:5286029
DOI10.1142/S0129054192000188zbMATH Open0771.68028OpenAlexW2008534233MaRDI QIDQ5286029FDOQ5286029
Authors: Ying Cheng, Ian F. Akyildiz, D. Frank Hsu, Frank K. Hwang
Publication date: 29 June 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054192000188
Recommendations
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Cited In (14)
- Vertex-colouring of 3-chromatic circulant graphs
- Time complexity of link reversal routing
- A dynamic fault-tolerant message routing algorithm for double-loop networks
- Title not available (Why is that?)
- Fault-tolerant routing in distributed loop networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal message routing algorithm for double-loop networks
- A complementary survey on double-loop networks
- Optimal routing in double loop networks
- Title not available (Why is that?)
- Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
- Algorithms for generalized round robin routing
- Title not available (Why is that?)
This page was built for publication: ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286029)