Abstract:
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 al...Show MoreMetadata
Abstract:
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.
Date of Conference: 21-23 October 2018
Date Added to IEEE Xplore: 30 December 2018
ISBN Information:
ISSN Information:
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Directed Acyclic Graph ,
- Service Quality ,
- Cost Function ,
- Network Topology ,
- Optimal Path ,
- Multiple Constraints ,
- Routing Problem ,
- Dijkstra’s Algorithm ,
- Routing Algorithm ,
- Running Time ,
- Shortest Path ,
- Neighboring Nodes ,
- Weight Coefficient ,
- Mathematical Description ,
- Source Node ,
- Constraint Conditions ,
- Wrong Direction ,
- Current Node ,
- Destination Node ,
- Original Topology ,
- Typical Topology ,
- Quality Of Service Constraints ,
- Packet Loss Rate ,
- Reverse Search ,
- Forward Search ,
- Path Values ,
- Single Constraint ,
- Complex Network Structure
- Author Keywords
Contents Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Directed Acyclic Graph ,
- Service Quality ,
- Cost Function ,
- Network Topology ,
- Optimal Path ,
- Multiple Constraints ,
- Routing Problem ,
- Dijkstra’s Algorithm ,
- Routing Algorithm ,
- Running Time ,
- Shortest Path ,
- Neighboring Nodes ,
- Weight Coefficient ,
- Mathematical Description ,
- Source Node ,
- Constraint Conditions ,
- Wrong Direction ,
- Current Node ,
- Destination Node ,
- Original Topology ,
- Typical Topology ,
- Quality Of Service Constraints ,
- Packet Loss Rate ,
- Reverse Search ,
- Forward Search ,
- Path Values ,
- Single Constraint ,
- Complex Network Structure
- Author Keywords
