北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2004, Vol. 27 ›› Issue (2): 14-18.

• 论文 • 上一篇    下一篇

WDM网络路由计算中的平衡最短路算法

李培源, 龚涌涛, 顾畹仪   

  1. 北京邮电大学 电信工程学院, 北京 100876
  • 收稿日期:2002-12-06 出版日期:2004-02-28
  • 作者简介: 李培源(1977—),男,博士生。 E-mail:lipeiyuan@263.net
  • 基金资助:
    北电网络以及国家自然科学基金资助项目(60132020,60372096)

Balanced Shortest Path Algorithm for Routing
in WDM Networks

LI Pei-yuan, GONG Yong-tao, GU Wan-yi   

  1. Telecommunication Engineering School, Beijing University of Posts andTelecommunications, Beijing 100876, China
  • Received:2002-12-06 Online:2004-02-28

摘要: 对波分复用(WDM,wavelength division multiplexing)网络中的波长路由分配问题进行了深入的研究,提出了路由预计算部分的平衡最短路(BSP,balanced shortest path)算法。这种算法可以在路由预计算的过程中考虑业务的均衡,而且时间复杂度较低。在不同的网络拓扑结构上对多种波长路由算法进行了仿真,仿真结果说明BSP可以有效地改善网络性能。

关键词: 路由波长分配, 全光网, 波长路由, 波分复用

Abstract: The routing and wavelength assignment (RWA) problem in wavelength routed all-optical WDM networks is studied. An optimizing algorithm, balanaced shortest path (BSP) algorithm, is proposed to determine the alternate paths between source-destination pair and pre-balance the traffic in the network simultaneously as well. The simulation result shows that the network performance can be improved significantly by the BSP algorithm.

Key words: RWA, all-optical network, wavelength routing, WDM

中图分类号: