Adaptive wavelength routing in all-optical networks

Mokhtar, A.; Azizoglu, M.

doi:10.1109/90.664268

Cited by 455 publications

(237 citation statements)

References 22 publications

Supporting

Mentioning

222

Contrasting

Unclassified

Order By: Relevance

“…small setup time and low control overhead. Adaptive routing approaches [6] are more efficient than static routing methods in terms of blocking probability, because the route is chosen adaptively depending on the network state. The main problems of adaptive routing methods are their longer setup delay and higher control overhead, including the requirement of global network's state on each node.…”

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

“…Analytical models that account for dynamic routing based on up-to-date network status are complex, hence have received very little attention [26]. Analytical model for WDM/TDM networks can be found in [9,27].…”

Section: Issues and Motivationmentioning

confidence: 99%

“…A request is forwarded on any one of the preferred outgoing links to the destination. In [26], an analytical model is developed for evaluating the blocking performance of various routing algorithms, including adaptive unconstrained routing which does not restrict the path selection to any pre-defined set of routes. Mechanisms for controlling setup and tear-down of lightpaths and network update procedures for wavelength-routed networks are presented in [35].…”

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

“…The routing problem has its origin at the beginning of networking research (see [9] for a review of previous approaches to the problem). In particular adaptive routing, which incorporates network state information into the routing decision, is considered in [8] in the context of all-optical networks, while previous work on state-dependent routing with trunk reservation in traditional telecommunications networks is considered in [7]. It is also known that flow deviation methods [2], although computationally demanding, can be used to find the optimal routing that minimizes the maximum link load for a given network topology.…”

Section: Introductionmentioning

confidence: 99%

Load Balancing in WDM Networks through Adaptive Routing Table Changes

Brunato

Battiti

Salvadori

2002

NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. In this paper we develop a Load Balancing algorithm for IP-based Optical Networks. The considered networks are based on a routing protocol where the next hop at a given node depends only on the destination of the communication. Our algorithm (RSNE -Reverse Subtree Neighborhood Exploration) performs at each iteration a basic change of a single entry in a routing table in order to minimize the disruption of the network. We study the performance of our algorithm in realistic networks under static and dynamic traffic scenarios. Simulation results show a rapid reduction of the congestion for static networks and a performance of the incremental scheme while tracking a changing traffic matrix comparable to the complete reoptimization of the traffic.

show abstract

Adaptive wavelength routing in all-optical networks

Cited by 455 publications

References 22 publications

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

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

A generalized framework for analyzing time-space switched optical networks

Load Balancing in WDM Networks through Adaptive Routing Table Changes

Contact Info

Product

Resources

About