Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Faculty of Computing, Health and Science

School

School of Engineering and Mathematics / Centre for Communications Engineering Research

RAS ID

3568

Comments

This is an Author's Accepted Manuscript of: Lo, K. , Habibi, D. , Phung, Q.V. , & Nguyen, H. N. (2005). Dynamic Wavelength routing in all optical mesh network. Proceedings of Asia Pacific Conference on Communications. (pp. 178-182). Perth, WA. IEEE. Available here

© 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Abstract

Wavelength-division multiplexing (WDM) offers the capability to handle the increasing demand of network traffic in a manner that takes advantage of already deployed optical fibers. Lightpaths are optical connections carried end-to-end over a wavelength on each intermediate link. Wavelengths are the main resource in WDM networks. Due to the inherent channel constraints, a dynamic control mechanism is required to efficiently utilize the resource to maximize lightpath connections. In this paper, we investigate a class of adaptive routing called dynamic wavelength routing (DWR), in which wavelength converters (WCs) are not utilized in the network. The objective is to maximize the wavelength utilization and reduces the blocking probability in an arbitrary network. This approach contains two sub-algorithms: least congestion with least nodal-degree routing algorithm (LCLNR) and dynamic two-end wavelength routing algorithm (DTWR). We demonstrate that DWR can significantly improve the blocking performance, and the results achieved as good as placing sparse WCs in the network

DOI

10.1109/APCC.2005.1554043

Access Rights

free_to_read

Included in

Engineering Commons

Share

 
COinS
 

Link to publisher version (DOI)

10.1109/APCC.2005.1554043