Home > Papers

 
 
A Multi-path Non-overlapping Routing Algorithm for Deterministic Networking
Jiwang Shao,Gengyu Wei *
School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876;School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:24 February 2022
Accepted by: none
Citation: Jiwang Shao,Gengyu Wei.A Multi-path Non-overlapping Routing Algorithm for Deterministic Networking[OL]. [24 February 2022] http://en.paper.edu.cn/en_releasepaper/content/4756297
 
 
Deterministic Networking (DetNet) is a new network architecture proposed by IETF DetNet working group for industrial Internet of Things and other application scenarios. Its communication service with high reliability and low delay needs multi-path non-overlapping routing algorithm. Because it is different from the existing routing algorithms on the Internet, it is an important subject to study the routing algorithms that meet the requirements of DetNet. Based on the routing characteristics of DetNet, we study a multi-routing algorithm -- Bhandari algorithm. Aiming at the problem that the algorithm can not calculate non-overlapping routes in some cases, we improved the algorithm, then we also make the improved algorithm more efficient by introducing Tarjan algorithm. The algorithm is verified and tested in the simulation environment and results show the effectiveness of the improved algorithm.
Keywords:Deterministic Networking; Multi-path non-overlapping routing algorithm; Bhandari algorithm; Tarjan algorithm
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers
  • Other similar papers

Statistics
PDF Downloaded 14
Bookmarked 0
Recommend 0
Comments Array
Submit your papers