scispace - formally typeset
Open AccessProceedings ArticleDOI

Integrating RLP and Fast Zero Algorithm to Improve Routing Performance in Optical Multistage Interconnection Networks

TLDR
Simulation results have shown that integrating RLP to FastZ algorithm successfully improved routing performance and the new fast zero with RLP (FastRLP) algorithm is developed based on the time domain approach for solving optical crosstalk in the optical omega network.
Abstract
In this paper, we explore the idea of integrating the remove last pass (RLP) algorithm to the fast zero (FastZ) algorithm as the prior initial solution to improve routing performance in optical multistage interconnection networks (OMINs). OMINs are popular for its cost-effectiveness and self-routable characteristics to meet the demand for high speed switching capability. A great challenge in dealing with OMINs is the optical crosstalk caused by optical signal coupling when propagating through the switching elements comprising the architecture. Many algorithms have been developed to solve optical crosstalk using different approaches. The new fast zero with RLP (FastRLP) algorithm is developed based on the time domain approach for solving optical crosstalk in the optical omega network. Simulation results have shown that integrating RLP to FastZ algorithm successfully improved routing performance.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Reliability Evaluation and Routing Integration in Shuffle Exchange Omega Network

TL;DR: The relationship between reliability performance and number of network size are compared in shuffle exchange network (SEN) and SEN with minus one stages (S SEN-).
Book ChapterDOI

The Development of Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks

TL;DR: The chapter covers the development of crosstalk-free scheduling algorithms for routing in an OMIN and the interest is on how to efficiently schedule messages using the time domain approach in order to avoid crosStalk.
Journal ArticleDOI

AWG-Based Nonblocking Shuffle-Exchange Networks

TL;DR: This article proposes an approach to construct modular optical SENs, using a set of arrayed waveguide gratings (AWGs) and tunable wavelength converters (TWCs), and demonstrates for the first time that an AWG is functionally equivalent to a classical shuffle network by nature.
Posted Content

AWG-based Nonblocking Shuffle-Exchange Networks

TL;DR: In this paper, the authors proposed an approach to construct modular optical SENs, using a set of arrayed waveguide gratings (AWGs) and tunable wavelength converters (TWCs).

Integration of zero and sequential algorithm inshuffle exchange with Minus One Stage

TL;DR: This paper focused on comparing the algorithm based on shuffle exchange network connection to achieve the optimal routing time as well as the number of passes to route in a given permutation.
References
More filters
Journal ArticleDOI

Permutation Capability of Optical Multistage Interconnection Networks

TL;DR: A new concept, semi-permutation, is introduced to analyze the permutation capability of optical MINs under the constraint of avoiding crosstalk, and it is applied to two examples of opticalMINs, the banyan network and the Benes network.

Genetic Algorithms vs. Simulated Annealing: A Comparison of Approaches for Solving the Circuit Partitioning Problem

TL;DR: The genetic algorithm was found to produce similar results for one circuit and better results for the other two circuits and genetic algorithms may also yield better results than simulated annealing when applied to the placement problem.
Journal ArticleDOI

A time domain approach for avoiding crosstalk in optical blocking multistage interconnection networks

TL;DR: The proposed time domain to the space domain approach for avoiding crosstalk is compared by analyzing the tradeoffs involved in these two approaches.
Journal ArticleDOI

Equivalent permutation capabilities between time-division optical omega networks and non-optical extra-stage omega networks

TL;DR: An optimal O(N) time algorithm is presented for identifying whether a given permutation belongs to class θ or not and it is proves an interesting result that theclass θ is identical to the class Ω + 1 which represents the set of N-permutations admissible to a nonoptical N × N × one-extra stage Omega network.
Proceedings ArticleDOI

Applying ant colony optimization to routing in optical multistage interconnection networks with limited crosstalk

TL;DR: This paper shows how the ACO technique can be applied to the routing problem, and its performance is compared to that of the degree-descending algorithm using simulation techniques, and the lower bound estimate on the minimum number of passes required is calculated.
Related Papers (5)
Frequently Asked Questions (1)
Q1. What are the contributions mentioned in the paper "Integrating rlp and fast zero algorithm to improve routing performance in optical multistage interconnection networks" ?

In this paper, the authors explore the idea of integrating the Remove Last Pass ( RLP ) algorithm to the Fast Zero ( FastZ ) algorithm as the prior initial solution to improve routing performance in optical multistage interconnection networks ( OMINs ).