Multi-Constrained Routing Optimization Algorithm Based on DAG

A new multiconstrained routing algorithm based on quality of Service (QoS), DAG_DMCOP, is proposed. The algorithm is divided into two parts: (1) Pruning strategy. Find all paths that meet the needs of multiple constraints and convert the network topology into a Directed Acyclic Graph (DAG). (2) Sear...

Full description

Saved in:
Bibliographic Details
Published inIECON 2018 - 44th Annual Conference of the IEEE Industrial Electronics Society pp. 5906 - 5910
Main Authors Hu, Xia, Wang, Kaidong, Wang, JinJiang, Wang, Kun, Hu, Youbing, Wang, Shuangqin
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2018
Subjects
adaptive
Bandwidth
Cost function
Delays
Directed Acyclic Graph (DAG)
Jitter
link cost function
multiconstrained routing
Network topology
pruning
Quality of service
Routing
Online AccessGet full text

Cover

More Information
Summary:A new multiconstrained routing algorithm based on quality of Service (QoS), DAG_DMCOP, is proposed. The algorithm is divided into two parts: (1) Pruning strategy. Find all paths that meet the needs of multiple constraints and convert the network topology into a Directed Acyclic Graph (DAG). (2) Search strategy. The link synthesis cost function is introduced to adjust the multiconstrained conditions (bandwidth, delay, delay jitter and other QoS parameters) adaptively. Then an improved Dijkstra algorithm is used to find out the optimal path that meets the needs of multiple constraints. Simulation show the algorithm can quickly find the path with the least cost and is suitable for large-scale multiconstrained routing networks. It is an efficient new algorithm for solving multiconstrained routing problems.
ISSN:2577-1647
DOI:10.1109/IECON.2018.8591086