Overhead reduction in a distributed path management system

Computer Networks

Volumn 54, Issue 6, 2010, Pages 1019-1041

  Heegaard, Poul E ^a   Wittner, Otto J ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Cross entropy; Path management; Swarm intelligence

Indexed keywords

ANT SYSTEMS; COMMUNICATION NETWORKS; CONVERGENCE RATES; CROSS ENTROPY; DATA PACKET DELAY; DETECTION TIME; END-POINTS; FAST RESTORATION; LINK FAILURES; LINK-STATE ROUTING; MANAGEMENT SYSTEMS; MEMORY STORAGE; MONITORING PARAMETERS; NETWORK EXPERIENCES; NETWORK NODE; OBJECTIVE FUNCTIONS; PACKET RATE; PATH FINDING; PATH MANAGEMENT; PROCESSING CYCLES; RATE ADAPTATION; RATE ADJUSTMENT; SELF-TUNED; SERVICE AVAILABILITY; SHARING INFORMATION; SHORT-PATH; SWARM INTELLIGENCE; VIRTUAL CONNECTIONS; VIRTUAL PATHS;

CELLULAR AUTOMATA; ENTROPY; POINT CONTACTS;

MANAGEMENT;

EID: 77949657775     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.08.005     Document Type: Article

References (42)

1. Ball M.O. Handbooks in Operation Research and Management Science. Network Models vol. 7 (1995), North Holland
2. M. Pioro, D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann Publishers, March 2004, ISBN 0125571895.
3. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
4. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic
5. Goldberg D. Genetic Algorithms in Search Optimization and Machine Learning (1998), Addison Wesley
6. Rubinstein R.Y. The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability (1999) 127-190
7. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems Man and Cybernetics Part B: Cybernetics 26 1 (1996) 29-41
8. Schoonderwoerd R., Holland O., Bruten J., and Rothkrantz L. Ant-based load balancing in telecommunications networks. Adaptive Behavior 5 2 (1997) 69-207
9. Bonabeau E., Dorigo M., and Theraulaz G. Swarm Intelligence: From Natural to Artifical Systems (1999), Oxford University Press
10. B.E. Helvik, O. Wittner, Using the cross entropy method to guide/govern mobile agent's path finding in networks, in: Proceedings of Third International Workshop on Mobile Agents for Telecommunication Applications, Springer-Verlag, August 14-16, 2001.
11. P.E. Heegaard, O. Wittner, B.E. Helvik, Self-managed virtual path management in dynamic networks, in: O. Babaoglu, M. Jelasity, A. Montresor, A. van Moorsel, M. van Steen (Eds.), Self-* Properties in Complex Information Systems, Lecture Notes in Computer Science, LNCS 3460, Springer-Verlag GmbH, pp. 417-432, 2005, ISSN 0302-9743.
12. P.E. Heegaard, O. Wittner, V.F. Nicola, B.E. Helvik, Distributed asynchronous algorithm for cross-entropy-based combinatorial optimization, in: Rare Event Simulation and Combinatorial Optimization (RESIM/COP 2004), Budapest, Hungary, September 7-8, 2004.
13. V. Kjeldsen, O.J. Wittner, P.E. Heegaard, Distributed and scalable path management by a system of cooperating ants, in: Proceedings of the International Conference on Communications in Computing (CIC'08), CSREA Press, Las Vegas, Nevada, USA, July 2008.
14. P.E. Heegaard, O. Wittner, Restoration performance vs. overhead in a swarm intelligence path management system, in: M. Dorigo, L.M. Gambardella (Eds.), Proceedings of the Fifth International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2006), LNCS, Springer, Brussels, Belgium, September 4-7, 2006.
15. P.E. Heegaard, O.J. Wittner, Self-tuned refresh rate in a swarm intelligence path management system, in: Proceedings of the EuroNGI International Workshop on Self-Organizing Systems (IWSOS 2006), LNCS, Springer, University of Passau, Germany, September 18-20, 2006.
16. Caro G.D., and Dorigo M. Antnet: distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 9 (1998) 317-365
17. Wedde H.F., and Farooq M. A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks. Journal of Systems Architecture 52 8-9 (2006) 461-484
18. M. Roth, S. Wicker, Termite: ad-hoc networking with stigmergy, in: Proceedings of the Global Telecommunications Conferencee (GLOBECOM '03), IEEE, vol. 5, 2003. pp. 2937-2941.
19. H.F. Wedde, M. Farooq, Y. Zhang, Beehive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior, in: M. Dorigo, M. Birattari, C. Blum, L.M. Gambardella, F. Mondada, T. Stützle (Eds.), Proceedings of the Fourth International Workshop on Ant Colony, Optimization and Swarm Intelligence (ANTS 2004), LNCS, vol. 3172, Springer-Verlag, Berlin Heidelberg, pp. 83-94, 2004.
20. Zlochin M., Birattari M., Meuleau N., and Dorigo M. Model-based search for combinatorial optimization: a critical survey. Annals of Operations Research 131 (2004) October
21. Heidelberger P. Fast simulation of rare events in queueing and reliability models. ACM Transactions on modelling and Computer Simulation 5 (1995) 43-85 January
22. Juneja S., and Shahabuddin P. Rare event simulation techniques: an introduction and recent advances. In: Henderson S.G., and Nelson B.L. (Eds). Simulation Handbooks in Operations Research and Management Science (2006), Elsevier, Amsterdam, The Netherlands 291-350 (Chapter 11)
23. O. Wittner, Emergent Behavior Based Implements for Distributed Network Management, Ph.D. Thesis, Norwegian University of Science and Technology, NTNU, Department of Telematics, November 2003.
24. Stützle T., and Dorigo M. A short convergence proof for a class of ant colony optimization algorithms. IEEE Transactions on Evolutionary Computing 6 (2002) 358-365 August
25. Costaa A., Jonesb O.D., and Kroese D. Convergence properties of the cross-entropy method for discrete optimization. Operations Research Letters 35 (2007) 573-580 September
26. Stutzle T., and Hoos H. MAX-MIN ant system. Journal of Future Generation Computer Systems 16 (2000) 889-914
27. V. Kjeldsen, Cooperation Through Pheromone Sharing in Swarm Routing, Master's Thesis, Norwegian University of Science and Technology, 2007.
28. Gordon D.M., Paul R.E., and Thorpe K. What is the function of encounter patterns in ant colonies?. Animal Behaviour 45 (1993) 1083-1100 June
29. Ganguly N., Brusch L., and Deutsch A. Design and analysis of a bio-inspired search algorithm for peer-to-peer networks. In: Babaoglu O., Jelasity M., Montresor A., Fetzer C., Leonardi S., van Moorsel A., and van Steen M. (Eds). Self-Star Properties in Complex Information Systems. Lecture Notes in Computer Science vol. 3460 (2005), Springer-Verlag
30. Shannon C.E. A mathematical theory of communication. Bell System Technical Journal 27 (1948) 379-423 (623-656, July, October)
31. B. Baran, R. Sosa, A new approach for antnet routing, in: Proceedings of the Ninth International Conference on Computer Communications and Networks, IEEE Press, Las Vegas, NV, USA, October 2000, pp. 303-308.
32. L. Shao-Han, L. Jzau-Sheng, L. Zi-Sheng, A shortest-path network problem using an annealed ant system algorithm, in: Proceedings of the Fourth Annual ACIS International Conference on Computer and Information Science (ICIS 2005), IEEE Press, Jeju Island, South Korea, July, 2005, pp. 245-250.
33. H. Park, B.I. Moon, S. Kang, Ubiquitous convergence technology, vol. 4412/2007 of LNCS, Chapter, in: Improved Reinforcement Computing to Implement AntNet-Based Routing Using General NPs for Ubiquitous Environments, Springer, June, 2007, pp. 242-251.
34. P. Heegaard, I. Fuglem, Demonstrator 1: Ant-based Monitoring on Software IP Routers, Technical Report, BISON (IST-2001-38923), 2006.
35. T1A1.2 Working Group on Network Survivability Performance, Technical Report on Enhanced Network Survivability Performance, Technical Report TR No. 68, Standards Committee T1 Telecommunications, February, 2001.
36. Liu Y., and Trivedi K.S. Survivability quantification: the analytical modeling approach. International Journal of Performability Engineering 2 1 (2006) 29-44
37. P. Heegaard, Performance monitoring of routing stability in dynamic networks, Section 5 in Deliverable 05: Models for Basic Services in AHN, P2P and Grid Networks in IST-FET Project BISON (IST-2001-38923), December, 2003.
38. Callon R. Rfc 1195: use of osi is-is for routing in tcp/ip and dual environments. IETF RFC (1990) December
39. A. Basu, J. Riecke, Stability issues in ospf routing, in: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, ACM, San Diego, California, United States, pp. 225-236, 2001.
40. A. Shaikh, A. Greenberg, Experience in black-box ospf measurement, in: Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement, ACM, San Francisco, California, USA, pp. 123-125, 2001.
41. Kohler E., Morris R., Chen B., Jannotti J., and Kaashoek M.F. The click modular router. ACM Transactions on Computer Systems 18 (2000) 263-297 August
42. A. Mykkeltveit, P. Heegaard, O. Wittner, Realization of a distributed route management system on software routers, in: Proceedings of Norsk Informatikkonferanse, Stavanger, Norway, 29th November to 1st December, 2004.