首页> 外文会议>International conference on advanced computing >PERMUTATION ROUTING IN WAVELENGTH- ROUTED WRAPPED-AROUND SHUFFLE NETWORKS USING FEWER WAVELENGTHS
【24h】

PERMUTATION ROUTING IN WAVELENGTH- ROUTED WRAPPED-AROUND SHUFFLE NETWORKS USING FEWER WAVELENGTHS

机译:使用较少波长的波长路由包裹缠绕的Wave-Routed包装网络中的置换路由

获取原文

摘要

Optical networks based on wavelength division multiplexing (WDM) and wavelength routing are considered to be potential candidates for the next generation of wide area networks. One of the main issues in these networks is the development of efficient routing algorithms which require minimum number of wavelengths. In this paper, we focus on the permutation routing problem in WDM networks with the shuffle network topology. We present a routing algorithm in these networks which requires O(log~2 TV) wavelengths, where N is the number of nodes in the network, whereas the previous algorithm by Pankaj and Gallager requires O(log~3,N) wavelengths.
机译:基于波分复用(WDM)和波长路由的光网络被认为是下一代广域网的潜在候选。这些网络中的主要问题之一是开发有效的路由算法,其需要最小的波长数。在本文中,我们专注于随机网络拓扑的WDM网络中的置换路由问题。我们在这些网络中提出了一种路由算法,该路由算法需要O(log〜2电视)波长,其中n是网络中的节点的数量,而Pankaj和Gallager的先前算法需要O(log〜3,n)波长。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号