• Home
  • Search
  • CROSSTALK-FREE REARRANGEABLE MULTISTAGE INTERCONNECTION NETWORKS
  • https://doi.org/10.11650/twjm/1500557299Copy DOI Icon

CROSSTALK-FREE REARRANGEABLE MULTISTAGE INTERCONNECTION NETWORKS

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

In this paper, the notion of crosstalk-free rearrangeability (CF-rearrangeability) of multistage interconnection networks (MINs) is formally defined. Using the concept of line digraphs from graph theory, we show that the problem of crosstalk-free routing on any bit permutation network (BPN) is always equivalent to the classical permutation routing problem on a BPN of smaller size and with fewer stages. We also show the CF-rearrangeability and minimality (in stage number) of three families of BPNs, including the dilated Benes network. Some necessary conditions for a BPN to be CF-rearrangeable are given, and a brief discussion of CF-rearrangeable networks with dilation in time or space is included.

Similar Papers
  • Research Article
  • Citations61

Serial array time slot interchangers and optical implementations

  • Jan 01, 1994
  • IEEE Transactions on Computers
  • H.F Jordan +3
  • PDF
  • Research Article
  • Citations5

Fault Tolerant Gamma-Minus Network

  • Feb 13, 2023
  • ECS Advances
  • S Gupta
  • Dissertation

Generalizable neural solvers for vehicle routing problems

  • Jan 01, 2025
  • Jianan Zhou
  • Research Article
  • Citations2

A fault tolerant multistage interconnection network with partly duplicated switches

  • Mar 12, 2002
  • Journal of Systems Architecture
  • Naotake Kamiura +2
  • Conference Article
  • Citations13

Nonblocking optical MINs under crosstalk-free constraint

  • May 29, 2001
  • Xiaohong Jiang +2
  • Conference Article
  • Citations1

Two expansible multistage interconnection networks

  • Dec 19, 1994
  • C.S Yang +1
  • Conference Article
  • Citations4

Pollution routing problem with time window and split delivery

  • Sep 01, 2019
  • Sameh M Saad +1
  • Research Article
  • Citations4

VA-DE: Valuable ATAPE with dynamic embedding and super-pipeline scheduling on partitionable multistage interconnection [formula omitted

  • Nov 30, 2016
  • Journal of Parallel and Distributed Computing
  • Roselin Petagon +1
  • Research Article
  • Citations5

Design and analysis of a generalized architecture for reconfigurable m-ary tree structures

  • Jan 01, 1992
  • IEEE Transactions on Computers
  • S Srinivas +1
  • Conference Article
  • Citations1

Design of optical rearrangeable nonblocking MINs under various crosstalk constraints

  • Oct 20, 2003
  • X Jiang +2
  • Research Article
  • Citations75

Picker routing in rectangular mixed shelves warehouses

  • Mar 26, 2018
  • Computers & Operations Research
  • Felix Weidinger
  • Research Article
  • Citations410

Routing for Relief Efforts

  • May 01, 2008
  • Transportation Science
  • Ann Melissa Campbell +2
  • PDF
  • Research Article
  • Citations12

A Challenge for Routing Algorithms in Optical Multistage Interconnection Networks

  • Nov 01, 2011
  • Journal of Computer Science
  • Moudi
  • Research Article
  • Citations38

A visual interactive approach to classical and mixed vehicle routing problems with backhauls

  • Jan 02, 2007
  • Omega
  • G Yazgitutuncu +2
  • Research Article

Contributors

  • Feb 01, 2011
  • Operations Research
  • Sandro Bosio
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.