An impairment-aware unicast routing algorithm based on colored graph model in multi-domain ASON

2015 ◽  
Author(s):  
Qiwu Wu
Keyword(s):  
Routing Algorithm ◽  
Graph Model ◽  
Colored Graph ◽  
Unicast Routing

A novel unicast routing algorithm for LEO satellite networks

2005 ◽  
Author(s):  
Xuegui Song ◽  
Kai Liu ◽  
Jun Zhang ◽  
Lianzhen Cheng
Keyword(s):  
Routing Algorithm ◽  
Satellite Networks ◽  
Unicast Routing ◽  
Leo Satellite Networks ◽  
Leo Satellite

A Novel Particle Swarm Algorithm to Optimize QoS Unicast Routing

2011 ◽  
Vol 230-232 ◽  
pp. 377-383 ◽  
Author(s):  
An Xin Ye ◽  
Jian Bin Wu
Keyword(s):  
Particle Swarm Optimization Algorithm ◽  
Routing Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
The Novel ◽  
Routing Problem ◽  
Unicast Routing ◽  
Np Complete ◽  
Chaotic Particle Swarm Optimization ◽  
Searching Ability

Unicast routing service is becoming a important requirement of computer networks supporting multimedia applications. And unicast routing problem has been demonstrated technically as a NP-complete. This paper proposes a novel QoS-based unicast routing algorithm using the Chaotic Particle Swarm Optimization algorithm (CPSO).The algorithm enhance the global searching ability when some particles have trapped in local minimums by chaotic series .The novel algorithm makes use of the ergodicity of chaotic search to improve the capability of precise search and keep the balance between the global search and the local search. The result of QoS shows that the CPSO algorithm has the advantage over the conventional algorithms in efficiency.

Fuzzy-Ant Colony based Routing on Road Networks

2016 ◽  
Vol 1 (1) ◽  
pp. 33-40
Author(s):  
S. Saravanan ◽  
A. Jayanthiladevi ◽  
M. Geetha
Keyword(s):  
Path Length ◽  
Routing Algorithm ◽  
Road Networks ◽  
Graph Model ◽  
Search Space ◽  
Route Selection ◽  
Selection System ◽  
Community Based ◽  
Hierarchical Routing ◽  
Efficient Route

Route selection is essential in everyday life. We have several algorithms for detecting efficient route on Large Road Networks. This paper introduces the hierarchical community, is presented. It splits large road networks into hierarchical structure. It introduces a multi parameter route selection system which employs Fuzzy Logic (FL) and ant’s behavior in nature is applied to the dynamic routing. The important rates of parameters such as path length and traffic are adjustable by the user. The purposes of the new hierarchical routing algorithm significantly reduce the search space. We develop a community-based hierarchical graph model that supports Dynamic, efficient route computation on large road networks.

Sign in / Sign up

Export Citation Format

Share Document