Taiwanese Journal of Mathematics


Xuewen Bao and Qiao Li

Full-text: Open access


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.

Article information

Taiwanese J. Math., Volume 10, Number 5 (2006), 1225-1243.

First available in Project Euclid: 20 July 2017

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 68M07: Mathematical problems of computer architecture 68M10: Network design and communication [See also 68R10, 90B18] 90B18: Communication networks [See also 68M10, 94A05]

multistage interconnection network bit permutation network crosstalk-free rearrangeability


Bao, Xuewen; Li, Qiao. CROSSTALK-FREE REARRANGEABLE MULTISTAGE INTERCONNECTION NETWORKS. Taiwanese J. Math. 10 (2006), no. 5, 1225--1243. doi:10.11650/twjm/1500557299. https://projecteuclid.org/euclid.twjm/1500557299

Export citation


  • D. P. Agrawal, Graph theoretical analysis and design of multistage interconnection networks, IEEE Trans. Comput., 32 (1983) 637-648.
  • X. Bao, F. K. Hwang and Q. Li, Rearrangeability of bit permutation networks, Theoretical Computer Science, 352 (2006) 197-214.
  • C. Berge, Graphs and Hypergraphs., North Holland, Amsterdam, 1976.
  • J. C. Bermond, J. M. Fourneau and A. Jean-Marie, Equivalence of multistage interconnection networks, Info. Proc. Lett., 26 (1987) 45-50.
  • T. Calamoneri and A. Massini, A new approach to the rearrangeability of (2$logN$-1) stage MINs, Proc. IASTED Int'l Symp. Applied Informatics (AI 2001), 2001, 365-370.
  • G. J. Chang, F. K. Hwang and L.-D. Tong, Characterizing bit permutation networks, Networks, 33 (1999), 261-267.
  • F. Harary and R. Z. Norman, Some properties of line digraphs, Rend. Circ. Mat. Palermo, 9 (1960), 161-168.
  • C. Heuchenne, Sur une certaine correspondence entre graphes, Bull. Soc. Roy. Sci. Liège, 33 (1964), 743-753.
  • F. K. Hwang and C.-H. Yen, Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks, Networks, 38 (2001), 1-5.
  • F. K. Hwang and W.-D. Lin, A general construction for nonblocking crosstalk-free photonic switching networks, Networks, 42 (2003), 20-25.
  • X. Jiang, H. Shen, Md. Mamun-ur-Rashid Khandker and Susumu Horiguchi, Vertically stacked Benes networks for crosstalk-free permutation, Proceedings of the First International Symposium on Cyber Worlds (CW'02), 2002.
  • C.-T. Lea, Bipartite graph design principle for photonic switching systems, IEEE Trans. Commun., 38 (1990), 529-538.
  • K. Padmanabhan and A. N. Netravali, Dilated networks for photonic switching, IEEE Trans. Commun., 35 (1987), 1357-1365.
  • Y. Wu, X. Bao, X. Jia and Q. Li, Graph theoretical characterizations of bit permutation networks, manuscript.
  • Y. Yang, J. Wang and Y. Pan, Permutation capability of optical multistage interconnection networks, J. Parallel and Distrib. Comput., 60 (2000), 72-91.