Backtrack routing and priority-based wavelength assignment in WDM networks

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

In this paper, we consider two key problems in the WDM networks: the wavelengh assignment and routing problems. The objective of the problems is to minimize the request blocking rate. We propose two priority-based methods for the wavelength assignment problem: static and dynamic strategies. Based on the priority of an incoming request, the proposed methods allocate a wavelength among the available wavelengths for the given priority. Analytic models and simulations are presented for the proposed wavelength assignment methods so as to analyse the link blocking rate. The simulation results show that the link blocking rate by the dynamic strategy is less than that by the assignment strategy. We also develop a routing algorithm that works together with the proposed wavelength assignment methods to reduce the overall blocking rates. The proposed routing method maintains a routing tree for a given connection request. Based on the routing tree, the algorithm finds a route with one available wavelength for each link along the route. We compare the proposed routing method with the fixed routing and fixed alternate routing algorithms. The experiments show that the proposed routing algorithm performs better than the fixed routing and the alternate routing methods.

Original languageEnglish
Pages (from-to)1-10
Number of pages10
JournalComputer Communications
Volume22
Issue number1
Publication statusPublished - 1999 Dec 1

Fingerprint

Wavelength division multiplexing
Wavelength
Routing algorithms
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{dd467507ad5c43b1aebd218888b9db10,
title = "Backtrack routing and priority-based wavelength assignment in WDM networks",
abstract = "In this paper, we consider two key problems in the WDM networks: the wavelengh assignment and routing problems. The objective of the problems is to minimize the request blocking rate. We propose two priority-based methods for the wavelength assignment problem: static and dynamic strategies. Based on the priority of an incoming request, the proposed methods allocate a wavelength among the available wavelengths for the given priority. Analytic models and simulations are presented for the proposed wavelength assignment methods so as to analyse the link blocking rate. The simulation results show that the link blocking rate by the dynamic strategy is less than that by the assignment strategy. We also develop a routing algorithm that works together with the proposed wavelength assignment methods to reduce the overall blocking rates. The proposed routing method maintains a routing tree for a given connection request. Based on the routing tree, the algorithm finds a route with one available wavelength for each link along the route. We compare the proposed routing method with the fixed routing and fixed alternate routing algorithms. The experiments show that the proposed routing algorithm performs better than the fixed routing and the alternate routing methods.",
author = "Sheng-Tzong Cheng",
year = "1999",
month = "12",
day = "1",
language = "English",
volume = "22",
pages = "1--10",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "1",

}

Backtrack routing and priority-based wavelength assignment in WDM networks. / Cheng, Sheng-Tzong.

In: Computer Communications, Vol. 22, No. 1, 01.12.1999, p. 1-10.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Backtrack routing and priority-based wavelength assignment in WDM networks

AU - Cheng, Sheng-Tzong

PY - 1999/12/1

Y1 - 1999/12/1

N2 - In this paper, we consider two key problems in the WDM networks: the wavelengh assignment and routing problems. The objective of the problems is to minimize the request blocking rate. We propose two priority-based methods for the wavelength assignment problem: static and dynamic strategies. Based on the priority of an incoming request, the proposed methods allocate a wavelength among the available wavelengths for the given priority. Analytic models and simulations are presented for the proposed wavelength assignment methods so as to analyse the link blocking rate. The simulation results show that the link blocking rate by the dynamic strategy is less than that by the assignment strategy. We also develop a routing algorithm that works together with the proposed wavelength assignment methods to reduce the overall blocking rates. The proposed routing method maintains a routing tree for a given connection request. Based on the routing tree, the algorithm finds a route with one available wavelength for each link along the route. We compare the proposed routing method with the fixed routing and fixed alternate routing algorithms. The experiments show that the proposed routing algorithm performs better than the fixed routing and the alternate routing methods.

AB - In this paper, we consider two key problems in the WDM networks: the wavelengh assignment and routing problems. The objective of the problems is to minimize the request blocking rate. We propose two priority-based methods for the wavelength assignment problem: static and dynamic strategies. Based on the priority of an incoming request, the proposed methods allocate a wavelength among the available wavelengths for the given priority. Analytic models and simulations are presented for the proposed wavelength assignment methods so as to analyse the link blocking rate. The simulation results show that the link blocking rate by the dynamic strategy is less than that by the assignment strategy. We also develop a routing algorithm that works together with the proposed wavelength assignment methods to reduce the overall blocking rates. The proposed routing method maintains a routing tree for a given connection request. Based on the routing tree, the algorithm finds a route with one available wavelength for each link along the route. We compare the proposed routing method with the fixed routing and fixed alternate routing algorithms. The experiments show that the proposed routing algorithm performs better than the fixed routing and the alternate routing methods.

UR - http://www.scopus.com/inward/record.url?scp=0032675908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032675908&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0032675908

VL - 22

SP - 1

EP - 10

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 1

ER -