scholarly journals Impairment Aware Routing Algorithm for All-Optical Networks Based on Power Series and Particle Swarm Optimization

2008 ◽  
Author(s):  
Daniel Chaves ◽  
Douglas Aguiar ◽  
Carmelo Bastos-Filho ◽  
Joaquim Martins-Filho
2009 ◽  
Author(s):  
Carmelo J. A. Bastos-Filho ◽  
Renato M. Fernandes ◽  
Danilo F. Carvalho ◽  
George M. Cavalcanti Junior ◽  
Daniel A. R. Chaves ◽  
...  

2005 ◽  
Vol 10 (1) ◽  
pp. 23-37 ◽  
Author(s):  
Choon Fang Teo ◽  
Yun Cie Foo ◽  
Su Fong Chien ◽  
Andy L.Y. Low ◽  
A.H. You ◽  
...  

Author(s):  
Sunil Kumar K N ◽  
Shiva Shankar

Objective: The conventional Ad Hoc On-Demand Distance Vector (AODV) routing algorithm, route discovery methods pose route failure resulting in data loss and routing overhead. In the proposed method, needs significant low energy consumption while routing from one node to another node by considering the status of node forwards the packet. So that while routing it avoids unnecessary control overhead and improves the network performance. Methods: Particle Swarm Optimization (PSO) algorithm is a nature- inspired, population-based algorithm. Particle Swarm Optimization (PSO) is a Computational Intelligence technique which optimizes the objective function. It works by considering that every member of the swarm contributes in finding the ideal solution by keeping a track of their own best known location and the best-known location of the group and keeps updating them whenever there is a change and hence minimizes the objective fitness function. The fitness function which we considered here is the Node lifetime, Link Lifetime and available Bandwidth. If these parameters are with good then status of node will be strong and hence routing of packet over those nodes will reduce delay and improves network performance. Result: To verify the feasibility and effectiveness of our proposal, the routing performance of AODV and PSO-AODV is compared with respect to various network metrics like Network Lifetime, packet delivery ratio and routing overhead and validated the result by comparing both routing algorithm using Network Simulator 2. The results of the PSO-AODV has outperformed the AODV in terms of low energy, less end to end delay and high packet delivery ratio and less control overhead. Conclusion: Here we proposed to use Particle Swarm Optimization in order to obtain the more suitable parameters for the decision making. The existing AODV protocol was modified to make a decision to recover from route failure; at the link failure predecessor node implementing PSO based energy prediction concept and using weights for each argument considered in the decision function. The fitness values for each weight were found through PSO basic form. We observed that the PSO showed satisfactory behaviour improvement than the performance of AODV for all metrics on the investigated scenarios.


2016 ◽  
Vol 33 (2) ◽  
Author(s):  
YEISON JULIAN CAMARGO ◽  
Leonardo Juan Ramirez ◽  
Ana Karina Martinez

Purpose The current work shows an approach to solve the QoS multicast routing problem by using Particle Swarm Optimization (PSO). The problem of finding a route from a source node to multiple destination nodes (multicast) at a minimum cost is an NP-Complete problem (Steiner tree problem) and is even greater if Quality of Service -QoS- constraints are taken into account. Thus, approximation algorithms are necessary to solve this problem. This work presents a routing algorithm with two QoS constraints (delay and delay variation) for solving the routing problem based on a modified version of particle swarm optimization. Design/methodology/approach This work involved the following methodology: 1. Literature Review 2. Routing algorithm design 3. Implementation of the designed routing algorithm by java programming. 4. Simulations and results. Findings In this work we compared our routing algorithm against the exhaustive search approach. The results showed that our algorithm improves the execution times in about 40% with different topologies. Research limitations/implications The algorithm was tested in three different topologies with 30, 40 and 50 nodes with and a dense graph topology. Originality/value Our algorithm implements a novel technique for fine tuning the parameters of the implemented bio-inspired model (Particles Swarm Optimization) by using a Genetic Meta-Optimizer. We also present a simple and multi implementation approach by using an encoding system that fits multiple bio-inspired models.


Author(s):  
Taoshen Li ◽  
Ming Yang ◽  
Songqiao Chen ◽  
Zhigang Zhao ◽  
Zhihui Ge

Sign in / Sign up

Export Citation Format

Share Document