2nd International ICST Conference on Broadband Networks

Research Article

Evaluation of routing algorithms for distributed lightpath establishment in wavelength-routed networks

  • @INPROCEEDINGS{10.1109/ICBN.2005.1589757,
        author={Shinichi Arakawa and Takahiro Toku and Masayuki Murata},
        title={Evaluation of routing algorithms for distributed lightpath establishment in wavelength-routed networks},
        proceedings={2nd International ICST Conference on Broadband Networks},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2006},
        month={2},
        keywords={},
        doi={10.1109/ICBN.2005.1589757}
    }
    
  • Shinichi Arakawa
    Takahiro Toku
    Masayuki Murata
    Year: 2006
    Evaluation of routing algorithms for distributed lightpath establishment in wavelength-routed networks
    BROADNETS
    IEEE
    DOI: 10.1109/ICBN.2005.1589757
Shinichi Arakawa1,*, Takahiro Toku2,*, Masayuki Murata2,*
  • 1: Graduate School of Economics, Osaka University
  • 2: Graduate School of Information Science and Technology, Osaka University
*Contact email: arakawa@econ.osaka-u.ac.jp, t-toku@nal.ics.es.osaka-u.ac.jp, murata@ist.osaka-u.ac.jp

Abstract

Optical networks, where all-optical wavelength channels (called lightpaths) convey traffic, have been considered to effectively utilize WDM technology. In distributed lightpath networks, each node sets up and tears down the lightpath between a pair of communicating nodes. Therefore, conflicts about wavelength reservations during signaling operations may occur because of a lack of precise link-state information. In this paper, we evaluate effects of delayed link-state information on reservation protocols and routing algorithms through some simulations. More specifically, we evaluated the average path setup time for routing algorithms in distributed networks, and found how the frequency of link-state information exchange affects the precision of collected link-state information. From simulation results, we conclusively confirmed that a backward reservation-protocol lessens the effect delayed link-state information has. The effect is less than 0.2% increase of blocking probability with the backward reservation protocol, while the forward reservation protocol increases the blocking probability more than 15%. We also confirm the proposed alternate routing algorithm shortens lightpath setup time about 20% than the least loaded routing algorithm assuming ideal conditions