Anycast Routing Problem on WDM Ring Network

2005 ◽  
Vol E88-B (4) ◽  
pp. 1347-1354 ◽  
Author(s):  
D.-R. DIN
2012 ◽  
Vol 239-240 ◽  
pp. 1324-1330 ◽  
Author(s):  
Tao Shen Li ◽  
Zhang Cai Li

To solve anycast routing problem with multiple QoS constraints, a improved hybrid algorithm which combines genetic algorithm and ant colony algorithm is proposed. In the initial period of hybrid algorithm, genetic algorithm was used to distribute pheromones in links and code and optimize control parameters of ant colony algorithm. Through judgment function, this algorithm can judge the time to combine the genetic algorithm with ant colony algorithm, and initialize the pheromones and start the ant colony algorithm at the last period of hybrid algorithm. To avoid hybrid algorithm falling into local optimal solution, a mutation operator was introduced in algorithm hybrid to update local pheromones of new path produced by mutation operation and reduced pheromones concentration on optimal path in time. The NS2 simulation results show that this algorithm can commendably solve the anycast routing problem with multiple QoS constraints, and its performance is better than other two algorithms.


Network ◽  
2021 ◽  
Vol 1 (2) ◽  
pp. 116-131
Author(s):  
Ricardo Lent

A cognitive networking approach to the anycast routing problem for delay-tolerant networking (DTN) is proposed. The method is suitable for the space–ground and other domains where communications are recurrently challenged by diverse link impairments, including long propagation delays, communication asymmetry, and lengthy disruptions. The proposed method delivers data bundles achieving low delays by avoiding, whenever possible, link congestion and long wait times for contacts to become active, and without the need of duplicating data bundles. Network gateways use a spiking neural network (SNN) to decide the optimal outbound link for each bundle. The SNN is regularly updated to reflect the expected cost of the routing decisions, which helps to fine-tune future decisions. The method is decentralized and selects both the anycast group member to be used as the sink and the path to reach that node. A series of experiments were carried out on a network testbed to evaluate the method. The results demonstrate its performance advantage over unicast routing, as anycast routing is not yet supported by the current DTN standard (Contact Graph Routing). The proposed approach yields improved performance for space applications that require as-fast-as-possible data returns.


Optik ◽  
2013 ◽  
Vol 124 (20) ◽  
pp. 4315-4318
Author(s):  
Xuegong Tan ◽  
Shunzheng Yu ◽  
Hongbin Zhang ◽  
Li Jun

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.


Sign in / Sign up

Export Citation Format

Share Document