Nonblocking conditions for a multicast WSW architecture based on subtree scheme for elastic optical networks

被引:0
|
作者
Lin, Bey-Chi [1 ]
机构
[1] Dept. of Applied Math, National University of Tainan, Taiwan
关键词
Network architecture;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] Nonblocking conditions for a multicast WSW architecture based on subtree scheme for elastic optical networks
    Lin, Bey-Chi
    OPTICAL SWITCHING AND NETWORKING, 2022, 44
  • [2] A Layered Subtree Scheme for Multicast Communications in Large-Scale Elastic Translucent Optical Networks
    Tarhani, Mehdi
    Khosravi Eghbal, Morad
    Shadaram, Mehdi
    IEEE ACCESS, 2020, 8 (08): : 37902 - 37913
  • [3] Rearrangeable Nonblocking Conditions for Four Elastic Optical Data Center Networks
    Lin, Bey-Chi
    APPLIED SCIENCES-BASEL, 2020, 10 (21):
  • [4] The necessary conditions for Clos-type nonblocking multicast networks
    Yang, YY
    Masson, GM
    10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 789 - 795
  • [5] Necessary conditions for Clos-type nonblocking multicast networks
    State Univ of New York at Stony, Brook, Stony Brook, United States
    IEEE Trans Comput, 11 (1214-1227):
  • [6] A New Architecture for Nonblocking Optical Switching Networks
    Md. Mamun-ur-Rashid Khandker
    Xiaohong Jiang
    Hong Shen
    Susumu Horiguchi
    Photonic Network Communications, 2001, 3 : 393 - 400
  • [7] Wide-sense nonblocking multicast in optical WDM networks
    M. Sabrigiriraj
    R. Karthik
    Cluster Computing, 2019, 22 : 13021 - 13026
  • [8] Nonblocking conditions of multicast three-stage interconnection networks
    Pattavina, A
    Tesei, G
    NETWORKS, 2005, 46 (04) : 163 - 170
  • [9] The necessary conditions for Clos-type nonblocking multicast networks
    Yang, YY
    Masson, GM
    IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (11) : 1214 - 1227
  • [10] A new architecture for nonblocking optical switching networks
    Khandker, M
    Jiang, X
    Shen, H
    Horiguchi, S
    PHOTONIC NETWORK COMMUNICATIONS, 2001, 3 (04) : 393 - 400