A high performance pattern associative oblivious router for tree topologies

Presents a novel approach to execute implicit routing algorithms. The proposed router is based on an associative scheme that uses the attributes of the routing algorithm and the network topology. This router allows implicit oblivious routing algorithms to be mapped onto a set of bit patterns that are matched in parallel. In order to show the applicability of this router, the authors have selected a number of tree interconnection topologies. For the studied tree topologies the number of required bit patterns is of the same order as the topology degree. The proposed organization requires only one comparison and one read delay