Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 6 figures

Scientific paper

Multistage Interconnection Networks (MINs) are very popular in switching and communication applications. A MIN connects N inputs to N outputs and is referred as an N \times N MIN; having size N. Optical Multistage Interconnection Network (OMIN) represents an important class of Interconnection networks. Crosstalk is the basic problem of OMIN. Switch Conflict and Link Conflict are the two main reason of crosstalk. In this paper, we are considering both problems. A number of techniques like Optical window, Improved Window, Heuristic, Genetic, and Zero have been proposed earlier in this research domain. In this paper, we have proposed two algorithms called Address Selection Algorithm and Route Selection Algorithm (RSA). RSA is based on Improved Window Method. We have applied the proposed algorithms on existing Omega network, having shuffle-exchange connection pattern. The main functionality of ASA and RSA is to minimize the number of switch and link conflicts in the network and to provide conflict free routes.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing the Switch and Link Conflicts in an Optical Multi-stage Interconnection Network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-661758

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.