Performance of a routing and wavelength assignment scheme for an optical‐carrier‐reusable ring network. Issue 4 (1st December 2014)

• Record Type: Journal Article
• Authors: Keri, Masafumi; Kitsuwan, Nattapong; Matsuura, Motoharu; Oki, Eiji
• Is Part Of: IET networks. Volume 3:Issue 4(2014)
• Page Start: 267
• Page End: 274
• Publication Date: 2014-12-01
• Subjects: integer programming -- light sources -- linear programming -- telecommunication network routing -- wavelength assignment; optical carrier reusable ring network -- heuristic routing and wavelength assignment -- heuristic RWA scheme -- multicarrier light source -- wavelength resource efficient channel establishment -- integer linear programming problem -- ILP problem -- source node -- destination node -- wavelength converters; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2012.0222
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : This study investigates a heuristic routing and wavelength assignment (RWA) scheme for an optical‐carrier‐reusable ring network. This network has two unique features. First, only one light source, called the multi‐carrier light source, is required which eases the difficulty of controlling many light source devices. Second, optical carriers are reused in order to improve the efficiency of wavelength usage. Given the target of wavelength‐resource‐efficient channel establishment, performance of the heuristic RWA scheme is evaluated. To realise efficient wavelength usage, the authors formulate the RWA problem as an integer linear programming (ILP) problem of obtaining the minimum number of required wavelengths for given requests. With the ILP approach, the calculation process is not tractable in practical time. The heuristic RWA scheme introduced in this study solves the RWA problem. This scheme consists of two algorithms. Channel routes are obtained by the routing algorithm, and the wavelength assignment algorithm is then performed to assign a wavelength to each route. Moreover, two candidates, considering the shortest path and considering the avoidance of wavelength conversion, for the routing algorithm are examined. Numerical results show that the first candidate is more suitable in terms of reducing the number of required wavelengths than the second candidate.