Mesh and Torus Chaotic Routing (Update)

Abstract
The chaos router is an adaptive nonminimal message router for multicomputers that is simple enough to compete with the fast, oblivious routes now in use in commercial machines. It improves on previous adaptive routers by using randomization, which eliminates the need for complex livelock protection and speeds the router. The two-dimensional chaos router is shown to be theoretically sound and physically realizable. Extensive simulation chaos router is shown to be theoretically sound and physically realizable. Extensive simulation studies compare chaos routing with oblivious and deflection routing in mesh and torus networks. Chaos routing is shown to be competitive for mesh networks and superior for torus networks. This high performance is perhaps, unexpected for the mesh since there is no finite bound on the delivery time of any message.

This publication has 0 references indexed in Scilit: