Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Seven good reasons for mobile agents
Communications of the ACM
Tabu Search
Crankback Prediction in Hierarchical ATM Networks
Journal of Network and Systems Management
Analysis of blocking probability for distributed lightpath establishment in WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Biologically inspired self-adaptive multi-path routing in overlay networks
Communications of the ACM - Self managed systems
Design patterns from biology for distributed computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Applying biological principles to designs of network services
Applied Soft Computing
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
Policy-constrained bio-inspired processes for autonomic route management
Computer Networks: The International Journal of Computer and Telecommunications Networking
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony optimization for routing and load-balancing: survey and new directions
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Mobile software agents: an overview
IEEE Communications Magazine
Self-organization in communication networks: principles and design paradigms
IEEE Communications Magazine
Availability analysis of span-restorable mesh networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
ACO-based routing and spectrum allocation in flexible bandwidth networks
Photonic Network Communications
Hi-index | 0.07 |
Crankback re-routing extensions can offer significant improvements in the successful setup of Label Switched Paths (LSPs) by allowing new retries on alternate paths that circumvent blocked links or nodes. These extensions can be incorporated into a fully-distributed algorithm based on Ant Colony Optimization metaheuristics, taking advantage of its self-adapting, emergent behavior. By comparing with traditional fixed-alternate re-routing mechanisms, simulations have demonstrated that the proposed algorithm can efficiently mitigate lightpath blocking, both during normal operation and in case of network failure, by locally repairing failed LSP setups due to blocked/failed resources.