Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2004, Vol. 27 ›› Issue (2): 14-18.

• PAPERS • Previous Articles     Next Articles

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

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

CLC Number: