Routing Selection Strategy Under Reliability Constraints in Optical Network

DOI

10.2991/isci-15.2015.284How to use a DOI?

Keywords

optical network; routing strategies; comprehensive cost function; reliability constraints; deletion algorithm; Dijkstra algorithm

Abstract

Due to the lack of sufficient bandwidth resources and abnormal burst traffics in public network, the available bandwidth is always put in the first place in routing selection algorithm. While services transmitted in electric power optical communication network, such as relay protection, security and stability control, scheduling phone, require not only high real-time but also high channel reliability, which are rarely considered in current routing algorithm. In this paper, a routing selection algorithm under reliability constrains is proposed. The algorithm uses statistical operating data to assess the reliability of the network nodes and links, and provides k shortest paths for different types of services using Dijkstra algorithm and deletion algorithm according to comprehensive cost function which combined bandwidth resource utilization ratio and path reliability.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Linchang Mei
AU  - Qiang Chen
AU  - Xintong Liu
PY  - 2015/01
DA  - 2015/01
TI  - Routing Selection Strategy Under Reliability Constraints in Optical Network
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 2169
EP  - 2175
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.284
DO  - 10.2991/isci-15.2015.284
ID  - Mei2015/01
ER  -