Abstract
Performance evaluation of routing protocols is an important area of research that deals with the analysis and investigation of such protocols. A performance evaluation framework unveils different facets of a protocol and explores its behavior under diversified network operations. The nature inspired routing community, at the moment, lacks such a framework. Therefore, in this paper we propose a comprehensive performance evaluation framework that will empower the routing protocol designers to design state-of-the-art algorithms and extensively evaluate their performance. Using our framework, we exhaustively evaluated three state-of-the-art nature inspired routing algorithms. The results show some undiscovered aspects of the algorithms and provide valuable understanding about their merits and demerits. We believe that this will be the first major step in designing, standardizing and developing a performance evaluation library that will facilitate an extensive and unbiased evaluation of nature inspired routing algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Higginbottom, G.N.: Performance evaluation of communication networks. Artech house Inc., Norwood (1989)
Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communication networks. Journal of Artificial Intelligence 9, 317–365 (1998)
Barán, B., Sosa, R.: A new approach for antnet routing. In: Proceedings of the Ninth International Conference on Computer, Communications and Networks (2000)
Liang, S., Zincir-Heywood, A.N., Heywood, M.I.: The effect of routing under local information using a social insect metaphor. In: Proceedings of IEEE Congress on Evolutionary Computing (May 2002)
Liang, S., Zincir-Heywood, A.N., Heywood, M.I.: Intelligent packets for dynamic network routing using distributed genetic algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO (July 2002)
Wedde, H.F., Farooq, M., Zhang, Y.: Beehive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 83–94. Springer, Heidelberg (2004)
Santivanez, C., McDonald, B., Stavrakakis, I., Ramanathan, R.: On the scalability of ad hoc routing protocols. In: Proceedings of IEEE INFOCOM 2002. IEEE, Los Alamitos (2002)
Varga, A.: OMNeT++: Discrete event simulation system: User manual, http://www.omnetpp.org
Dijkstra, E.W.: A note on two problems in connection with graphs. Numerical Mathematics 1, 269–271 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wedde, H.F., Farooq, M. (2005). A Performance Evaluation Framework for Nature Inspired Routing Algorithms. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2005. Lecture Notes in Computer Science, vol 3449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32003-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-32003-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25396-9
Online ISBN: 978-3-540-32003-6
eBook Packages: Computer ScienceComputer Science (R0)