首页> 外文会议>Computer and Information Technology and Workshops (ICCIT), 2008 11th International Conference on; Khulna,Bangladesh >Lower bound on blocking probability for vertically stacked optical banyan networks with given crosstalk constraint
【24h】

Lower bound on blocking probability for vertically stacked optical banyan networks with given crosstalk constraint

机译:给定串扰约束的垂直堆叠光学榕树网络的阻塞概率下限

获取原文
获取原文并翻译 | 示例

摘要

Vertical stacking of multiple copies of an optical banyan network is a novel scheme for building nonblocking optical switching networks. The resulting network, namely vertically stacked optical banyan (VSOB) network, preserves all the properties of the banyan network, but increases the hardware cost significantly under first order crosstalk-free constraint. Therefore, blocking behavior analysis could be an effective approach to studying network performance, and finding a graceful compromise between hardware costs and blocking probability with different degree of crosstalk constraint. However, lower bound on number of planes for such networks with zero crosstalk constraint has been determined previously. In this paper, we present the simulation results for lower bound on blocking probability with given degree of crosstalk. The results show that blocking probability decreases to low value if we allow some CSEs to the network. The simulation results presented in this paper can guide network designer in finding a tradeoff among the blocking probability, and the degree of crosstalk of VSOB networks.
机译:光学榕树网络的多个副本的垂直堆叠是一种用于构建无阻塞光交换网络的新颖方案。所得的网络,即垂直堆叠的光学榕树(VSOB)网络,保留了榕树网络的所有属性,但在无一阶串扰的约束下,硬件成本显着增加。因此,阻塞行为分析可能是研究网络性能的有效方法,并且可以在不同程度的串扰约束下找到硬件成本与阻塞概率之间的妥协折衷方案。然而,先前已经确定了具有零串扰约束的这种网络的平面数的下限。在本文中,我们给出了在给定串扰度下降低阻塞概率下限的仿真结果。结果表明,如果我们允许某些CSE进入网络,则阻塞概率会降低到较低的值。本文给出的仿真结果可以指导网络设计人员在阻塞概率和VSOB网络的串扰程度之间找到折衷方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号