Abstract
This paper revisits the problem of Traffic Engineering (TE) to assess the relevance of using Gene Expression Programming (GEP) as a new fine-tuning algorithm in destination-based TE. We present a new TE scheme where link weights are computed using GEP and used as fine-tuning parameters in destination-based path selection. We apply the newly proposed TE scheme to compute the routing paths for the traffic offered to a 23- and 30-node test networks under different traffic conditions and differentiated services situations. We evaluate the performance achieved by the GEP algorithm compared to a memetic and the Open Shortest Path First (OSPF) algorithms in a simulated routing environment using the NS packet level simulator. Preliminary results reveal the relative efficiency of GEP compared to the memetic algorithm and OSPF routing.
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
Moy, J.: OSPF Version 2, Request For Comments (March 1994), http://www.ietf.org/rfc/rfc1583.txt
Fortz, B., Thorup, M.: Internet Traffic Engineering by Optimizing OSPF Weights. In: Proceedings of IEEE INFOCOM (March 2000)
Riedl, A.: A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utlizing Bandwidth and Delay Metrics. In: Proceedings of the IPOM 2002 Conference (October 2002)
Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for solving problems. Complex Systems 13(2), 87–129 (2001)
Network Simulator, http://www.isi.edu/nsnam/ns/
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
Bagula, A.B., Wang, H.F. (2005). On the Relevance of Using Gene Expression Programming in Destination-Based Traffic Engineering. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_32
Download citation
DOI: https://doi.org/10.1007/11596448_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)