• DocumentCode
    1080802
  • Title

    Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks

  • Author

    Yu, Chen ; Jiang, Xiaohong ; Horiguchi, Susumu ; Guo, Minyi

  • Author_Institution
    Sch. of Inf. Sci., Tohoku Univ., Sendai
  • Volume
    17
  • Issue
    9
  • fYear
    2006
  • Firstpage
    1037
  • Lastpage
    1047
  • Abstract
    Banyan networks are attractive for serving as the optical switch architectures due to their nice properties of small depth and absolutely signal loss uniformity. Combining the horizontal expansion and vertical stacking of optical banyan networks is a general scheme for constructing banyan-based optical switching networks. The resulting horizontally expanded and vertically stacked optical banyan (HVOB) networks usually take either a high hardware cost or a large network depth to guarantee the nonblocking property. Blocking behavior analysis is an effective approach to studying network performance and finding a graceful compromise among hardware cost, network depth, and blocking probability; however, little has been done to analyze the blocking behavior of general HVOB networks. In this paper, we study the overall blocking behavior of general HVOB networks, where an upper bound on the blocking probability of a HVOB network is developed with respect to the number of planes (stacked copies) and the number of stages. The upper bound accurately depicts the overall blocking behavior of a HVOB network as verified by an extensive simulation study, and it agrees with the strictly nonblocking condition of the network. The derived upper bound is significant because it reveals the inherent relationship among blocking probability, network depth, and network hardware cost, so that a desirable tradeoff can be made among them. In particular, our bound gives network developers an effective tool to estimate the maximum blocking probability of a HVOB network, in which different routing strategies can be applied with a guaranteed performance in terms of blocking probability, hardware cost and network depth. Our upper bound model predicts some unobvious qualitative behaviors of HVOB networks, and it draws an important conclusion that a very low blocking probability (e.g., less than 0.001 percent) can be achieved in a HVOB network without introducing either a significantly high hardware c- - ost or a large network depth
  • Keywords
    multistage interconnection networks; optical fibre networks; optical switches; performance evaluation; probability; telecommunication network routing; banyan-based optical switching network; blocking behavior analysis; maximum blocking probability; network depth; network hardware cost; network performance; network routing strategy; optical banyan network horizontal expansion; optical banyan network vertical stacking; optical switch architecture; Costs; Hardware; Optical fiber networks; Optical losses; Optical switches; Performance analysis; Predictive models; Routing; Stacking; Upper bound; Optical switching networks; banyan networks; blocking probability; horizontal expansion; vertical stacking.;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/TPDS.2006.126
  • Filename
    1668067