Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Global likelihood optimization via the cross-entropy method with an application to mixture models
WSC '04 Proceedings of the 36th conference on Winter simulation
Application of the cross entropy method to the GLVQ algorithm
Pattern Recognition
A stochastic clustering algorithm for swarm compact routing
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Application of global optimization methods to model and feature selection
Pattern Recognition
| Hi-index | 0.00 |
Telecommunication network owners and operators have for half a century been well aware of the potential loss of revenue if a major trunk is damaged, thus dependability at high cost has been implemented. A simple, effective and common dependability scheme is 1:1 protection with 100% capacity redundancy in the network. A growing number of applications in need of dependable connections with specific requirements to bandwidth and delay have started using the internet (which only provides best effort transport) as their base communication service. In this paper we adopt the 1:1 protection scheme and incorporate it as part of a routing system applicable for internet infrastructures. 100% capacity redundancy is no longer required. A distributed stochastic path finding (routing) algorithm based on Rubinstein's Cross Entropy method for combinatorial optimisation is presented. Early results from Monte Carlo simulations indeed indicate that the algorithm is capable of finding pairs of independent primary and backup paths satisfying specific bandwidth constraints.