Performance of alternate routing methods in all-optical switching networks

Harai, Hiroaki; Murata, Masayuki; Miyahara, Hideo

doi:10.1109/infcom.1997.644501

Cited by 182 publications

(121 citation statements)

References 4 publications

Supporting

Mentioning

117

Contrasting

Unclassified

Order By: Relevance

“…The dynamic RWA is performed online, it is much more challenging; therefore, heuristic algorithms are usually employed in resolving this problem [2] Our work mainly focuses on dynamic RWA problem. In literature, there are static routing approaches available for the dynamic RWA problem, such as shortest-path routing or alternate shortest-path routing [4,5]. These approaches use a set of precomputed shortest paths for lightpath establishment.…”

Section: Routing and Wavelength Assignmentmentioning

confidence: 99%

Ant-based survivable routing in dynamic WDM networks with shared backup paths

Ngo

Jiang

et al. 2006

J Supercomput

View full text Add to dashboard Cite

Abstract. In this paper, we consider the problem of survivable routing in dynamic WDM networks with single link failure model. Our work mainly concerns in how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a node pair) to establish a dependable lightpath with backup paths sharing. This problem is identified as NP-complete, thus a heuristic for finding near optimal solution with reasonable computation time is usually preferred. Inspired from the principle of ant colony optimization, we propose in this paper an ant-based mobile agents algorithm for this problem with improved blocking performance. To enable the new ant-based algorithm, we propose to use on each network node both a routing table that contains a set of feasible protection cycles between source destination nodes and also a pheromone table for mobile agents. By keeping a suitable number of mobile agents in a network to continually and proactively update the routing tables based on the current network congestion state, the routing solution of a connection request can be obtained with a reasonable computation time. Extensive simulation results upon the ns-2 network simulator and two typical network topologies show that our new algorithm can achieve a significantly lower blocking probability than the promising algorithm for dynamic lightpath protection proposed in [11] with a comparable computation complexity.

show abstract

Section: Routing and Wavelength Assignmentmentioning

confidence: 99%

Ant-based survivable routing in dynamic WDM networks with shared backup paths

Ngo

Jiang

et al. 2006

J Supercomput

View full text Add to dashboard Cite

show abstract

“…Wavelength assignment in networks employing fixed-path routing has been analyzed in [28]. Routing in networks with more than one candidate path has been shown to offer signilicant performance improvement [29]. Fixed alternate path routing (FAPR) has been studied in [30] and [31].…”

Section: Prior Work In Connection Establishment In Wdm Grooming Networkmentioning

confidence: 99%

A generalized framework for analyzing time-space switched optical networks

Srinivasan

Somani

2002

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

“…Alternate-path routing relies on a set of predetermined fixed routes between a source node and a destination node [6,7,8,9]. When a connection request arrives, a single route is chosen from the set of predetermined routes, and a lightpath is established on this route.…”

Section: Adaptive Routing Based On Global Informationmentioning

confidence: 99%