• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Conference on Optical Transmission, Switching, and Subsystems >Multi-class service based on the adaptive routing algorithm in WDM networks
【24h】

Multi-class service based on the adaptive routing algorithm in WDM networks

机译：基于WDM网络自适应路由算法的多级服务

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

It is important to analyse blocking probability in the WDM networks. In this paper, we present an analytical model for supporting multi-class service with the blocking probability analysis and adaptive routing algorithm to solve the potential shortcomings in the real network. We make the use of the idea of segmented routes according to the finite wavelength conversion resources. We then combine the each segment to get the whole blocking probability. The results show that, by adopting the adaptive routing algorithms, the network can calculate the blocking probability for all the candidate routes, and the request which takes the highest priority will choose the minimum blocking probability route. There are two features in our paper. First, a method of segmented route is designed. Second, use k-shortest routing algorithm to get the minimum blocking probability routing between source node and destination node.
机译：重要的是要分析WDM网络中的阻塞概率。在本文中，我们提出了一种支持多级服务的分析模型，通过阻塞概率分析和自适应路由算法来解决真实网络中的潜在缺点。根据有限波长转换资源，我们利用分段路线的想法。然后，我们将每个段组合以获得整个阻塞概率。结果表明，通过采用自适应路由算法，网络可以计算所有候选路由的阻塞概率，并且需要最高优先级的请求将选择最小阻塞概率路线。纸质中有两个功能。首先，设计了一种分段路线的方法。其次，使用k-shortest路由算法获取源节点和目标节点之间的最小阻塞概率路由。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号