Case study of a gearbox-like routing algorithm selection in runtime

2011 ◽  
Author(s):  
Andrei B. Rus ◽  
Virgil Dobrota
Keyword(s):  
Routing Algorithm ◽  
Algorithm Selection

Engineering Rules-Based Orthogonal and Variable-Steps Pipe Routing Algorithm for Aero-Engines

2012 ◽  
Vol 442 ◽  
pp. 104-108
Author(s):  
Xiao Lan Bai ◽  
Yu Zhang
Keyword(s):  
Routing Algorithm ◽  
Specific Flow ◽  
Memory Space ◽  
Fast Search ◽  
3D Space ◽  
Cylindrical Coordinate ◽  
Pipe Routing ◽  
Search Speed ◽  
Aero Engines

Pipe routing is to design the routes for pipes in 3D space, meeting various constraints and engineering rules. This paper proposes the engineering rules-based orthogonal and variable-steps pipe routing algorithm. Firstly, the cylindrical coordinate system was adopted to describe the layout space and obstacles. In view of two endpoints of the pipe and obstacles in between, the local searching space was built. Then, the searching algorithm was given according to engineering rules, which was involved with the orthogonal searching directions and their order, the searching variable-steps. Moreover, the specific flow of this algorithm was described. The algorithm requires less memory space and has a fast search speed. The case study shows it is feasible and effective.

scholarly journals REDO: A Reinforcement Learning-based Dynamic Routing Algorithm Selection Method for SDN

2021 ◽  
Author(s):  
Ahmed Al-Jawad ◽  
Ioan-Sorin Comsa ◽  
Purav Shah ◽  
Orhan Gemikonakli ◽  
Ramona Trestian
Keyword(s):  
Reinforcement Learning ◽  
Routing Algorithm ◽  
Dynamic Routing ◽  
Selection Method ◽  
Algorithm Selection

scholarly journals A case study of algorithm selection for the traveling thief problem

2017 ◽  
Vol 24 (3) ◽  
pp. 295-320 ◽  
Author(s):  
Markus Wagner ◽  
Marius Lindauer ◽  
Mustafa Mısır ◽  
Samadhi Nallaperuma ◽  
Frank Hutter
Keyword(s):  
Algorithm Selection ◽  
Selection For

scholarly journals QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission

2019 ◽  
Vol 19 (4) ◽  
pp. 61-72
Author(s):  
Xiaoling Li ◽  
Hai Hu
Keyword(s):  
Shortest Path ◽  
Rapid Development ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Adaptive Genetic Algorithm ◽  
Service Capacity ◽  
Network Resources ◽  
Qos Routing Algorithm

Abstract With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of routing algorithms for network load balancing resources, routing algorithms based on link traffic distributing weights, link weight optimization based on adaptive genetic algorithm and computational intelligence based on entropy granularity theory. This research proposes a method to apply entropy granularity to Open Shortest Path First (OSPF) routing, including the implementation of the method. After that, a case study is presented by using some examples.

Sign in / Sign up

Export Citation Format

Share Document