Internet failure protection using Hamiltonian p-cycles found by ant-like agents

Proceedings - 2005 DRCN: 5th International Workshop on Design of Reliable Communication Networks - "Reliable Networks for Reliable Services"

Volumn 2005, Issue , 2005, Pages 437-444

  Wittner, Otto ^a   Helvik, Bjarne E ^a   Nicola, Victor ^b  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

CE ants; Dependability; p cycles; Protection in internet; Swarm intelligence

Indexed keywords

AUTONOMOUS AGENTS; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; INTERNET; REDUNDANCY; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC;

CE-ANTS; DEPENDABILITY; HAMILTONIAN PROTECTION CYCLES; PROTECTION IN INTERNET; SWARM INTELLIGENCE;

COMPUTER SYSTEM RECOVERY;

EID: 33846301083     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DRCN.2005.1563904     Document Type: Conference Paper

References (18)

1. V. Sharma and F. Hellstrand, "Framework for multi-protocol label switching (MPLS)-based recovery," standard IETF RFC 3469, February 2003.
2. O. Wittner and B. E. Helvik, "Distributed soft policy enforcement by swarm intelligence; application to loadsharing and protection," Annals of Telecommunications, vol. 59, Jan-Feb 2004.
3. W. Grover and D. Stamatelakis, "Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration," in Proceedings of IEEE International Conference on Communications, vol. 1, pp. 537 -543, 7-11 June 1998.
4. D. Schupke, C. Gruber, and A. Autenrieth, "Optimal configuration of p-cycles in wdm networks," in Proceedings of the IEEE International Conference on Communications, ICC 2002, vol. 5, pp, 2761-2765, IEEE, April-May 2002.
5. H. Zhang and O. Yang, "Finding protection cycles in dwdm networks," in Proceedings of IEEE International Conference on Communications (ICC) 2002, (New York City, USA), pp. 2756-2760, IEEE, 28 Apr - 2 May 2002.
6. G. Xue and R. Gottapu, "Efficient construction of virtual p-cycles protecting all cycle-protectible working links," in Proceedings of Workshop of High Performance Switching and Routing (HPSR), (Torino, Italy), pp. 305 - 309, 24-27 June 2003.
7. G. D. Caro and M. Dorigo, "AntNet: Distributed Stigmergetic Control for Communications Networks," Journal of Artificial Intelligence Research, vol. 9, pp. 317-365, Dec 1998.
8. E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm Intelligence: From Natural to Artifical Systems. Oxford University Press, 1999.
9. O. Wittner, Emergent Behavior Based Implements for Distributed Network Management. PhD thesis, Norwegian University of Science and Technology, NTNU, Department of Telematics, November 2003.
10. D. Stamatelakis and W. Grover, "Theoretical Underpinnings for the Efficiency of Restorable Networks Using {"reconfigured Cycles ("p-cycles")," IEEE Transactions on Communications, vol. 48, pp. 1262-1265, August 2000.
11. A. Sack and W. D. Grover, "Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks," IEEE Network, vol. 18, pp. 49-56, Mar-Apr 2004.
12. H. Huang and J. A. Copeland, "A series of hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience," IEEE Communications Magazine, vol. 40, pp. 46-51, November 2002.
13. A. Bieszczad, B. Pagurek, and T. White, "Mobile Agents for Network Management," IEEE Communications Surveys, vol. 1, pp. 2-9, Fourth Quarter 1998.
14. A. Mykkeltveit, P. E. Heegaard, and O. Winner, "Realization of a distributed route management system on software routers," in Proceedings of Norsk Informatikkonferanse, (Stavanger, Norway), Nov/Dec 2004.
15. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz, "Antbased Load Balancing in Telecommunications Networks," Adaptive Behavior, vol. 5, no. 2, pp. 169-207, 1997.
16. R. Y. Rubinstein, "The Cross-Entropy Method for Combinatorial and Continuous Optimization," Methodology and Computing in Applied Probability, pp. 127-190, 1999.
17. P. E. Heegaard, O. Wittner, V. F. Nicola, and B. Helvik, "Distributed asynchronous algorithm for cross-entropy-based combinatorial optimization," in Proceedings of the Workshop on Rare Event Simulation and Combinatorial Optimization (RESIM 2004), (Budapest, Hungary), September 2004.
18. P. E. Heegaard, O. Wittner, and B. E. Helvik, "Self-managed virtual path management in dynamic networks," Lecture Notes in Computer Science, Hot Topics, vol. 3460, 2005.