Cross-entropy guided ant-like agents finding cyclic paths in scarcely meshed networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2463, Issue , 2002, Pages 123-134

  Wittner, Otto ^a   Helvik, Bjarne E ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS;

DYNAMIC COMMUNICATION NETWORKS; MESHED NETWORKS; NETWORK ENVIRONMENTS; NETWORK TOPOLOGY; PROTECTION SWITCHING; ROUTING TECHNIQUES; THEORY AND PRACTICE; TRAFFIC PATTERN;

MONTE CARLO METHODS;

EID: 84974697644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45724-0_11     Document Type: Conference Paper

References (22)

1. S. Aidarous and T. Plevyak, ed., Telecommunications Network Management into the 21st Century. IEEE Press, 1994.
2. Otto Wittner and Bjarne E. Helvik, “Cross Entropy Guided Ant-like Agents Finding Dependable Primary/Backup Path Patterns in Networks,” in Proceedings of Congress on Evolutionary Computation (CEC2002), (Honolulu, Hawaii), IEEE, May 12-17th 2002.
3. W.D. 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. Stamatelakis and W.D. Grover, “Rapid Span or Node Restoration in IP Networks using Virtual Protection Cycles,” in Proceedings of 3rd Canadian Conferance on Broadband Research (CCBR’99), (Ottawa), 7 November 1999.
5. M. Decina and T. Plevyak (editors), “Special Issue: Self-Healing Networks for SDH and ATM,” IEEE Communications Magazine, vol. 33, September 1995.
6. Bjarne E. Helvik and Otto Wittner, “Using the Cross Entropy Method to Guide/Govern Mobile Agent’s Path Finding in Networks,” in Proceedings of 3rd International Workshop on Mobile Agents for Telecommunication Applications, Springer Verlag, August 14-16 2001.
7. Vu Anh Pham and A. Karmouch, “Mobile Software Agents: An Overview,” IEEE Communications Magazine, vol. 36, pp. 26-37, July 1998.
8. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz, “Ant-based Load Balancing in Telecommunications Networks,” Adaptive Behavior, vol. 5, no. 2, pp. 169-207, 1997.
9. 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.
10. T. W. B. P. F. Oppacher, “Connection Management using Adaptive Mobile Agents,” in Proceedings of 1998 International Conference on Parallel and Distributed Processing Techniques and Applications (PDAPTA’98), 1998.
11. J. Schuringa, “Packet Routing with Genetically Programmed Mobile Agents,” in Proceedings of SmartNet 2000, (Wienna), September 2000.
12. Marco Dorigo and Gianni Di Caro, “Ant Algorithms for Discrete Optimization,” Artificial Life, vol. 5, no. 3, pp. 137-172, 1999.
13. Reuven Y. Rubinstein, “The Cross-Entropy Method for Combinatorial and Continuous Optimization,” Methodology and Computing in Applied Probability, pp. 127-190, 1999.
14. M. Zlochin, M. Birattari, N. Meuleau, and M. Dorigo, “Model-based Search for Combinatorial Optimization,” IRIDIA IRIDIA/2001-15, Universite Libre de Bruxelles, Belgium, 2000.
15. Reuven Y. Rubinstein, “The Cross-Entropy and Rare Events for Maximum Cut and Bipartition Problems-Section 4.4,” Transactions on Modeling and Computer Simulation, To appear.
16. D. Stamatelakis and W.D. Grover, “Theoretical Underpinnings for the Efficiency of Restorable Networks Using Preconfigured Cycles ("p-cycles"),” IEEE Transactions on Communications, vol. 48, pp. 1262-1265, August 2000.
17. Kenneth A. Ross and Charles R.B. Wright, Discrete Mathematics. Prentice Hall, 2nd ed., 1988.
18. V. Maniezzo, “Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem,” INFORMS Journal on Computing, vol. 11, no. 4, pp. 358-369, 1999.
19. DARPA: VINT project, “UCB/LBNL/VINT Network Simulator-ns (version 2).” http://www.isi.edu/nsnam/ns/.
20. Calvert, K.I. and Doar, M.B. and Zegura, E.W., “Modeling Internet Topology,” IEEE Communications Magazine, vol. 35, pp. 160-163, June 1997.
21. Goldberg, D., Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, 1998.
22. Z. Michalewicz, Genetic algorithms+Data Stuctures=Evolution Programs. Springer Verlag, second ed., 1996.