New upper bound for a rearrangeable non-blocking WSW architecture

被引:6
|
作者
Lin, Bey-Chi [1 ]
机构
[1] Natl Univ Tainan, Dept Appl Math, Tainan, Taiwan
关键词
optical switches; telecommunication network routing; optical links; elastic optical switches; three-stage WSW; waveband switching-space switching-waveband switching; elastic optical networks; interstage link partition scheme; rearrangeable nonblocking WSW architecture; routing algorithm; frequency slot units; optical node architecture; FSU; ELASTIC OPTICAL NETWORKS; NODE ARCHITECTURES;
D O I
10.1049/iet-com.2019.0242
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An optical network based on elastic optical switches allows requests using different spectrum widths to improve utilisation efficiency. This study considers one three-stage WSW (waveband switching-space switching-waveband switching), optical node architecture for elastic optical networks. A sufficient condition for a rearrangeable non-blocking WSW architecture with limited input/output links has been derived in an earlier work. In this study, the author improves the upper bound by adopting a new interstage link partition scheme associated with a tricky routing algorithm. Suppose a WSW architecture has r input/output links each of which has n frequency slot units (FSUs). Compared with earlier results, the results of the proposed scheme show that s - 1 (or 3s - 4) FSUs per interstage link can be reduced for even (or odd) min{r, n}, where s = min{ left ceiling r/2 right ceiling , left ceiling n/2 right ceiling }. The reduction gain is at least 3.5% (or 10%) for even (or odd) min{r, n} if r = n <= 26, even achieving 23.3% for limited odd r = n.
引用
收藏
页码:3425 / 3433
页数:9
相关论文
共 50 条
  • [21] Matrix switches: Blocking versus non-blocking
    Chermansky, Brett
    MICROWAVE JOURNAL, 2006, 49 (07) : 116 - +
  • [22] Matrix switches: Blocking versus non-blocking
    Chermansky, Brett
    Microwave Journal, 2006, 49 (07): : 116 - 118
  • [23] Generalized recursive network: a new architecture for self-routing non-blocking optical switch networks
    Khandker, MMR
    Jiang, XH
    Horiguchi, S
    Shen, H
    OPTICS COMMUNICATIONS, 2002, 208 (4-6) : 299 - 308
  • [24] Ultra-compact and low loss silicon-photonic rearrangeable non-blocking perfect shuffle-exchange network
    Peng, Zheng
    Feng, Junbo
    Du, Te
    Ma, Hansi
    Cheng, Wei
    Wang, Yan
    Zang, Shengyin
    Cheng, Hao
    Ren, Xiaodong
    Shuai, Yubei
    Liu, Hao
    Wu, Jiagui
    Yang, Junbo
    OPTIK, 2022, 269
  • [25] A new non-blocking synchronous checkpointing scheme for distributed systems
    Gupta, B
    Rahimi, S
    Naskar, P
    Proceedings of the ISCA 20th International Conference on Computers and Their Applications, 2005, : 26 - 31
  • [26] The Anchor Verifier for Blocking and Non-blocking Concurrent Software
    Flanagan, Cormac
    Freund, Stephen N.
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (04):
  • [27] An Adaptive Non-Blocking GVT Algorithm
    Mikida, Eric
    Kale, Laxmikant
    PROCEEDINGS OF THE 2019 ACM SIGSIM CONFERENCE ON PRINCIPLES OF ADVANCED DISCRETE SIMULATION (SIGSIM-PADS'19), 2019, : 25 - 36
  • [28] Non-blocking hashtables with open addressing
    Purcell, C
    Harris, T
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2005, 3724 : 108 - 121
  • [29] Efficient and non-blocking agreement protocols
    Suyash Gupta
    Mohammad Sadoghi
    Distributed and Parallel Databases, 2020, 38 : 287 - 333
  • [30] A general technique for non-blocking trees
    Brown, Trevor
    Ellen, Faith
    Ruppert, Eric
    arXiv, 2017,