Anewalgorithmbasedonauxiliaryvirtualtopologyforsub-pathprotectioninWDMopticalnetworks资源-CSDN下载

79 浏览量 2021-02-20 12:58:38 上传评论收藏 291KB PDF 举报

资源推荐

资源详情

资源评论

A new algorithm based on auxiliary virtual topology for sub-path protection

in WDM optical networks

Xingwei Wang, Lei Guo

, Xuekui Wang, Yu Zhang, Xiaobing Zheng, Weigang Hou, Hongming Li,

Hongpeng Wang

College of Information Science and Engineering, Northeastern University, P.O. Box 365, Shenyang 110004, China

article info

Article history:

Received 19 July 2008

Received in revised form 30 November 2008

Accepted 3 December 2008

Available online 24 December 2008

Keywords:

Optical networks

Virtual topology

Sub-path protection

Protection-switching time

Time complexity

abstract

This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual

topology (SPAVT) to tolerate the single-link failure in WDM optical networks. First, according to the pro-

tection-switching time constraint, SPAVT searches multiple pairs of primary and backup paths for each

node pair in the network by the off-line manner, and then map these paths to the virtual topology. When

a connection request arrives, SPAVT only needs to run one time of the Dijkstra’s algorithm to search a

virtual route in virtual topology, where the route may consist of multiple pairs of sub-paths, to meet

the protection-switching time constraint. Then, according to the shared resources policy, SPAVT chooses

an optimal pair of sub-paths. Simulation results show that SPAVT has smaller blocking probability and

lower time complexity than conventional algorithms.

1. Introduction

In wavelength-division-multiplexing (WDM) optical network,

since each wavelength channel can provide very high transmission

rate, the failure of ﬁber links may cause a lot of data loss. Therefore,

survivability in WDM networks is more important [1]. In recent

years, many papers have studied the survivable mechanism, in

which the general idea is to take account the protection mecha-

nism into the optical layer. According to the state of backup re-

sources, the protection mechanism can be divided into dedicated

protection, shared protection and mixed-shared protection [2–4].

According to the size of protection areas, the protection mecha-

nism also can be divided into link protection, segment protection

[5–8] and path protection [2–4].

In order to protect the single-link failure, the literature [2] pro-

posed shared-path protection (SPP) algorithm, which searches one

pair of a primary path and a link-disjoint backup path for each con-

nection request. For any two connection requests, if their primary

paths are link-disjoint, their corresponding backup paths can share

the backup resources on the common ﬁber links. Although SPP can

provide better resource utilization ratio and lower blocking proba-

bility than other shared protection algorithms, it does not consider

guaranteeing the protection-switching time. The protection-

switching time is an important factor in network performance

and can not be ignored. The shorter the protection-switching time

is, the sooner the restoration from the failures is.

In order to solve the problem of protection-switching time con-

straint, by integrating the merit of link protection and path protec-

tion, the literature [5–8] proposed the shared-sub-path protection

(SSP) algorithm. According to the protection-switching time con-

straint, SSP ﬁrst searches a primary path for each connection re-

quest, and then it separates the primary path into several equal

length sub-primary paths and follows to compute a link-disjoint

sub-backup path for each sub-path. Since the primary path will

be divided into several sub-primary paths, SSP may run multiple

times of the routing algorithm (e.g., Dijkstra’s algorithm) to com-

pute several sub-backup paths, and then the route computation

time will increase and the algorithm time complexity will be high.

In order to improve the problem in previous studies, in this pa-

per, we propose a new survivable algorithm named sub-path pro-

tection based on auxiliary virtual topology (SPAVT) to tolerate the

single-link failure in WDM optical networks. According to the pro-

tection-switching time constraint, SPAVT ﬁrst searches multiple

pairs of working and backup paths for each node pair in the network

by the off-line manner, and then map these paths to the virtual

topology. When a connection request arrives, SPAVT only needs to

doi:10.1016/j.comcom.2008.12.007

The preliminary work of this paper was presented at the International

Conference on Convergence and hybrid Information Technology (ICCIT) 2008. This

work was supported in part by the National Natural Science Foundation of China

(Nos. 60802023, 60673159, 70671020), the National High-Tech Research and

Development Plan of China (No. 2007AA041201), the Key Project of Chinese

Ministry of Education (No. 108040), the Specialized Research Fund for the Doctoral

Program of Higher Education (Nos. 20070145096, 20070145017, 20060145012),

and the Program for New Century Excellent Talents in University.

* Corresponding author. Tel./fax: +86 24 83687758.

E-mail address: [email protected] (L. Guo).

Computer Communications 32 (2009) 777–781

Contents lists available at ScienceDirect

Computer Communications

journal homepage: www.elsevier.com/locate/comcom

本内容试读结束，登录后可阅读更多

下载后可阅读完整内容，剩余4页未读，立即下载

评论收藏

内容反馈

weixin_38606169

粉丝: 4

A new algorithm based on auxiliary virtual topology for sub-path...

最新资源

A new algorithm based on auxiliary virtual topology for sub-path...

Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks

A new green multicast grooming protection algorithm in WDM optical networks

A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks

A new Algorithm

A Heuristic Algorithm for P-Cycles Configuration in WDM Optical Networks

A novel IP-core mapping algorithm in reliable 3D optical network-on-chips

High Bandwidth Sensorless Algorithm for AC Machines Based on Square-wave Type

论文研究-An Improved Method for Solving Equal Weights Sub-Paths Problem in K Shortest Path Algorithm.pdf

MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition.pdf

the-APFs-Placement-Based-on-Instantaneous-Reactive-Power-Theory-by-GA

Research on Indoor Location Algorithm Based on Wi-Fi

Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF

A novel segment-shared protection algorithm based on dynamic domain-sequencing scheme for multi-domain optical mesh networks

Time-bounded Localization Algorithm based on

A new time-delay estimation in multipath

A Polynomial-time Algorithm for the Change-Making Problem.pdf

RGB-Image-encryption-based-on-chaotic-and-DNA-algorithm-matlab

翻译A-fast-learning-algorithm-for-deep-belief-nets.doc编程资料

A Clustering Routing Algorithm Based on Depth and Energy for Three-Dimensional Underwater Sensor Network

Optimization algorithm based on matrix calculus for reference

Impairment-aware traff ic grooming in WDM optical networks

A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks

前端面试题总结----

llamaindex rag

最新资源