AWG-Based Nonblocking Shuffle-Exchange Networks

被引:6
|
作者
Ye, Tong [1 ]
Ding, Jingjie [2 ]
Lee, Tony T. [3 ]
Maier, Guido [4 ]
机构
[1] Shanghai Jiao Tong Univ, State Key Lab Adv Opt Commun Syst & Networks, Shanghai 200240, Peoples R China
[2] NetEase, Hangzhou 310052, Peoples R China
[3] Chinese Univ Hong Kong Shenzhen, Sch Sci & Technol, Shenzhen 518172, Peoples R China
[4] Politecn Milan, Dipartimento Elettron Informaz & Bioingn, I-20133 Milan, Italy
基金
美国国家科学基金会;
关键词
Optical switches; Optical sensors; Wavelength division multiplexing; High-speed optical techniques; Optical fiber networks; Arrayed waveguide gratings; Optical polarization; Shuffle-exchange network (SEN); routing and wavelength assignment (RWA); arrayed-waveguide grating (AWG); wavelength division multiplexing (WDM); DESIGN; SCALE;
D O I
10.1109/TNET.2020.3017500
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Optical shuffle-exchange networks (SENs) have wide application in different kinds of interconnection networks. This article proposes an approach to construct modular optical SENs, using a set of arrayed waveguide gratings (AWGs) and tunable wavelength converters (TWCs). According to the wavelength routing property of AWGs, we demonstrate for the first time that an AWG is functionally equivalent to a classical shuffle network by nature. Based on this result, we devise a systematic method to design a large-scale wavelength-division-multiplexing (WDM) shuffle network using a set of small-size AWGs associated with the same wavelength set. Combining the AWG-based WDM shuffle networks and the TWCs with small conversion range, we finally obtain an AWG-based WDM SEN, which not only is scalable in several ways, but also can achieve 100% utilization when the input wavelength channels are all busy. We also study the routing and wavelength assignment (RWA) problem of the AWG-based WDM SEN, and prove that the self-routing property and the nonblocking routing conditions of classical SENs are preserved in such AWG-based WDM SEN.
引用
收藏
页码:2699 / 2712
页数:14
相关论文
共 50 条
  • [31] Embedding de Bruijn, Kautz and shuffle-exchange networks in books
    Hasunuma, T
    Shibata, Y
    DISCRETE APPLIED MATHEMATICS, 1997, 78 (1-3) : 103 - 116
  • [32] SWITCHING STRATEGIES IN SHUFFLE-EXCHANGE PACKET-SWITCHED NETWORKS
    KUMAR, M
    DIAS, DM
    JUMP, JR
    IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (02) : 180 - 186
  • [33] A new policy to solve routing conflicts in shuffle-exchange networks
    FangBin Ge
    Min Zhao
    Tao Zhang
    JianXin Wang
    Science China Information Sciences, 2011, 54 : 1512 - 1523
  • [34] All-to-All Personalized Exchange Algorithms in Generalized Shuffle-exchange Networks
    Chou, Well Y.
    Chen, Richard B.
    Chen, Chiuyuan
    2009 EIGHTH INTERNATIONAL CONFERENCE ON NETWORKS, 2009, : 185 - 190
  • [35] GOOD PERMUTATION CODES BASED ON THE SHUFFLE-EXCHANGE NETWORK
    Goldreich, Oded
    Wigderson, Avi
    ISRAEL JOURNAL OF MATHEMATICS, 2023, 256 (01) : 283 - 296
  • [36] Communication performance of shuffle-exchange networks with shortest-path routing
    Broadwater, A
    Jayadev, BD
    Efe, K
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1259 - 1267
  • [37] Rearrangeability of (2n-1)-stage shuffle-exchange networks
    Çam, H
    SIAM JOURNAL ON COMPUTING, 2003, 32 (03) : 557 - 585
  • [38] IS THE SHUFFLE-EXCHANGE BETTER THAN THE BUTTERFLY
    RAGHUNATHAN, A
    SARAN, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 32 - 41
  • [39] A general packet replication scheme for multicasting with application to shuffle-exchange networks
    Liew, SC
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (08) : 1021 - 1033
  • [40] Matrix Shuffle-Exchange Networks for Hard 2D Tasks
    Ozolins, Emils
    Freivalds, Karlis
    Sostaks, Agris
    2021 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2021,