Systolic Routing in an Optical Fat Tree | Zendy

Risto T. Honkanen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Systolic Routing in an Optical Fat Tree

Author(s) -

Risto T. Honkanen

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29769-3

DOI - 10.1007/11576235_53

Subject(s) - computer network , computer science , enhanced interior gateway routing protocol , link state routing protocol , dynamic source routing , zone routing protocol , static routing , routing information protocol , routing protocol , distributed computing , routing (electronic design automation)

In this paper we present an all-optical network architecture and a systolic routing protocol for it. An r-dimensional optical fat tree network ( $\mathcal{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 $\mathcal{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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research