FROOTS – Fault Handling in Up*/Down* Routed Networks with Multiple Roots
- 311 Downloads
Faults in irregular networks have previously been handled through a global or local network reconfiguration, which leaves the network unavailable or disconnected until the reconfiguration is finished. We present FRoots, which leaves the network available and connected by using redundant paths. Only packets residing in the network at the fault time might become unroutable, and FRoots can be designed to offer an alternative path for such packets. To accommodate sequential, multiple faults, reconfiguration of the obsolete paths is done without a severe downgrade of network throughput. FRoots is based on a load balancing version of Up*/Down* routing, and uses a modest number of virtual channels to achieve redundancy properties. However, FRoots utilizes all channels in the fault-free case, thus experiencing no performance loss compared to its predecessor routing algorithm.
KeywordsSpan Tree Leaf Node Fault Tolerance Virtual Channel Articulation Point
Unable to display preview. Download preview PDF.
- 1.InfiniBand Trade Association, InfiniBand Architecture SpecificationGoogle Scholar
- 2.Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. IEEE, Los Alamitos (1997)Google Scholar
- 3.Schröder, M.D., et al.: Autonet: a High-Speed, Self-Configuring Local Area Network Using Point-to-point Links. SRC Research Report 59 (December 1990)Google Scholar
- 4.Boden, N.J., et al.: Myrinet–A Gigabit-per-Second Local-Area Network. In: IEEE MICRO (1995)Google Scholar
- 5.Lysne, O., Skeie, T.: Load Balancing of Irregular System Area Networks through Multiple Roots. In: Int. Conf. on Communications in Computing (2001)Google Scholar
- 7.Skeie, T., Lysne, O., Theiss, I.: Layered Shortest Path (LASH) Routing in Irregular System Area Networks. In: Proc. of IPDPS 2002, IEEE, Los Alamitos (2002)Google Scholar
- 10.Theiss, I., Lysne, O.: LORE - Local Reconfiguration for Fault Managment in Arbitrary Networks. Report 2003-02, Simula Research Laboratory, Norway (2003)Google Scholar
- 11.Casado, R., et al.: Performance evaluation of dynamic reconfiguration in highspeed local area networks. In: Proc. of the 6th Int. Symp. on High-Performance Computer Architecture (2000)Google Scholar
- 12.Pang, R., Pinkston, T., Duato, J.: The Double Scheme: Deadlock-Free Dynamic Reconfiguration of Cut-Through Networks. In: Proc. of ICPP 2000, IEEE, Los Alamitos (2000)Google Scholar
- 14.Weiss, M.A.: Data Structures and Algorithm Analysis. Benjamin/Cummings (1992)Google Scholar