Lower-bound on blocking probability of a class of crosstalk-free optical cross-connects (OXCs)

被引:0
|
作者
Yu, C [1 ]
Jiang, XH
Horiguchi, S
机构
[1] Japan Adv Inst Sci & Technol, Sch Informat Sci, Nomi Shi 9231292, Japan
[2] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808579, Japan
关键词
OXCs; Banyan networks; blocking probability; horizontal expansion and vertical stacking; crosstalk;
D O I
10.1093/ietisy/e89-d.2.719
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A combination of horizontal expansion and vertical stacking of optical Banyan (HVOB) is the general architecture for building Banyan-based optical cross-connects (OXCs), and the intrinsic crosstalk problem of optical signals is a major constraint in designing OXCs. In this paper, we analyze the blocking behavior of HVOB networks and develop the lower bound on blocking probability of a HVOB network that is free of first-order crosstalk in switching elements. The proposed lower-bound is significant because it provides network designers an effective tool to estimate the minimum blocking probability they can expect from a HVOB architecture regardless what kind of routing strategy to be adopted. Our lower bound can accurately depict the overall blocking behavior in terms of the minimum blocking probability in a HVOB network, as verified by extensive simulation based on a network simulator with both random routing and packing routing strategies. Surprisingly, the simulated and theoretical results show that our lower bound can be used to efficiently estimate the blocking. probability of HVOB networks applying packing strategy. Thus, our analytical model can guide network designers to find the tradeoff among the number of planes (stacked copies), the number of SEs, the number of stages and blocking probability in a HVOB network applying packing strategy.
引用
收藏
页码:719 / 727
页数:9
相关论文
共 27 条
  • [1] Modular Optical Cross-Connects (OXCs) for Large-Scale Optical Networks
    Chen, Kui
    Ye, Tong
    He, Hao
    Guo, Zidong
    IEEE PHOTONICS TECHNOLOGY LETTERS, 2019, 31 (10) : 763 - 766
  • [2] Crosstalk performance of integrated optical cross-connects
    Herben, CGP
    Leijtens, XJM
    Maat, P
    Blok, H
    Smit, MK
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 1999, 17 (07) : 1126 - 1134
  • [3] Study of homodyne crosstalk in optical cross-connects
    Rao, M
    Sun, XH
    Zhang, MD
    FIBER OPTICS AND OPTOELECTRONICS FOR NETWORK APPLICATIONS, 2001, 4603 : 156 - 161
  • [4] Upper-bound for blocking probabilities of a class of optical MINs under crosstalk-free constraint
    Jiang, XH
    Khandker, MMUR
    Horiguchi, S
    2001 IEEE WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2001, : 203 - 207
  • [5] Architecture for a class of scalable optical cross-connects
    Panda, MK
    Venkatesh, T
    Sridhar, V
    Singh, YN
    FIRST INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS, PROCEEDINGS, 2004, : 233 - 242
  • [6] Improvement of crosstalk tolerance in optical cross-connects by regenerative frequency converters
    Caspar, C
    Foisel, HM
    Patzak, E
    Strebel, B
    Weich, K
    ELECTRONICS LETTERS, 1996, 32 (19) : 1801 - 1802
  • [7] Noise and crosstalk limitations in optical cross-connects with reshaping wavelength converters
    Öhlén, P
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 1999, 17 (08) : 1294 - 1301
  • [8] Blocking Behavior of crosstalk-free pruned optical Banyan networks
    Khankder, MMUR
    Jiang, XH
    Horiguchi, S
    2005 13th IEEE International Conference on Networks Jointly held with the 2005 7th IEEE Malaysia International Conference on Communications, Proceedings 1 and 2, 2005, : 496 - 500
  • [9] The same-source crosstalk in the WDM dynamic all optical cross-connects
    Chen, WL
    Zhang, HY
    Fei, YS
    Zong, L
    Guo, YL
    Zhou, BK
    FIBER OPTIC COMPONENTS AND OPTICAL COMMUNICATIONS II, 1998, 3552 : 8 - 12
  • [10] Mitigation of optical crosstalk penalty in photonic cross-connects using forward error correction
    Kaman, V
    Zheng, X
    Pusarla, C
    Keating, AJ
    Helkey, RJ
    Bowers, JE
    ELECTRONICS LETTERS, 2003, 39 (08) : 678 - 679