On the Relevance of Using Gene Expression Programming in Destination-Based Traffic Engineering
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.
KeywordsGene Expression Programming Memetic Algorithm Link Weight Open Short Path First Maximum Link Utilisation
Unable to display preview. Download preview PDF.
- 1.Moy, J.: OSPF Version 2, Request For Comments (March 1994), http://www.ietf.org/rfc/rfc1583.txt
- 2.Fortz, B., Thorup, M.: Internet Traffic Engineering by Optimizing OSPF Weights. In: Proceedings of IEEE INFOCOM (March 2000)Google Scholar
- 3.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)Google Scholar
- 5.Network Simulator, http://www.isi.edu/nsnam/ns/