Skip to main navigation Skip to search Skip to main content

High performance pattern associative oblivious router for tree topologies

  • State University of New York Binghamton University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In this paper a novel approach to execute implicit routing algorithms is presented. 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, we have selected a number of tee 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 delays.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages541-545
Number of pages5
ISBN (Print)0818656026
StatePublished - 1994
EventProceedings of the 8th International Parallel Processing Symposium - Cancun, Mex
Duration: Apr 26 1994Apr 29 1994

Publication series

NameProceedings of the International Conference on Parallel Processing

Conference

ConferenceProceedings of the 8th International Parallel Processing Symposium
CityCancun, Mex
Period04/26/9404/29/94

Fingerprint

Dive into the research topics of 'High performance pattern associative oblivious router for tree topologies'. Together they form a unique fingerprint.

Cite this