Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Inter-domain routing based on simulated annealing algorithm in optical mesh networks

Open Access Open Access

Abstract

For the first time a real-time and distributed routing algorithm based on Simulated Annealing (SA) algorithm is proposed to promote the intelligence, survivability, and interworking in optical mesh networks. Further, a SA-based Two-steps Optimization Routing Algorithm (SATORA) is proposed to obtain the inter-domain routing of global optimization. Compared with the previous approaches, this SA-based routing algorithm can achieve the routing optimization under multi-constraint condition, and can acquire the working and backup paths at one time for network survivability as well. Two crucial factors, the path hop count and the network congestion degree, are considered evaluating the cost of the path. Simulation experiments on different networks indicate that the SATORA can reduce the congestion degree of the networks and enhance the blocking performance of routing calculation for traffic requests when the inter-domain path protection is required.

©2004 Optical Society of America

Full Article  |  PDF Article
More Like This
Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks

Chengyi Gao, Hakki C. Cankaya, and Jason P. Jue
J. Opt. Commun. Netw. 6(7) 619-628 (2014)

Domain border node pair based network partition for sub-path protection in optical networks

Donghui Gao, Hanyi Zhang, and Zhiyu Zhou
Opt. Express 12(26) 6456-6467 (2004)

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (6)

Fig.1.
Fig.1. An example for the comparison of MDP and SATORA
Fig. 2.
Fig. 2. Flowchart of initialization routing algorithm
Fig. 3.
Fig. 3. Simulation network environment: (a) and (b) NInter =9; (c) NInter =14.
Fig. 4.
Fig. 4. Blocking probability vs. network traffic load for SATORA
Fig. 5.
Fig. 5. Comparing SATORA and MDP for path protection in blocking probability
Fig. 6.
Fig. 6. Comparing SATORA and MDP for path protection in network congestion degree

Tables (5)

Tables Icon

Table 1. The SA-based routing algorithm

Tables Icon

Table 3. The improved SA-based routing algorithm for diverse routing

Tables Icon

Table 4. Improvement of the network congestion degree between SATORA and MDP

Tables Icon

Table 5. Operation time in SATORA and MDP

Equations (3)

Equations on this page are rendered with MathJax. Learn more.

E ( P ) = α * E 1 ( P ) + β * E 2 ( P )
E ( P , G ) = Φ * E ( P Inter , G Inter ) + Ψ * k = 1 P Inter E ( P Intra , k , G Intra , k )
E ( P w ) = Φ * E Inter , w + Ψ * k = 1 P I nter E Intra , w , k
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.