Systolic routing in an optical fat tree

Abstract

In this paper we present an all-optical network architecture and a systolic routing protocol for it. An r-dimensional optical fat tree network (OFT) consists of 2r -1 routing nodes and n = 2r processing nodes deployed at the leaf nodes of the network. In our construction packets injected into the OFT carry no routing information. Routing is based on the use of a cyclic control bit sequence and scheduling. The systolic routing protocol ensures that no electro-optical conversion is needed in the intermediate routing nodes and all the packets injected into the routing machinery will reach their target without collisions. A work-optimal routing of an h-relation is achieved with a reasonable size of h. © Springer-Verlag Berlin Heidelberg 2005.