On the relevance of using gene expression programming in destination-based traffic engineering
Date
2005
Authors
Bagula A.B.
Wang H.F.
Journal Title
Journal ISSN
Volume Title
Publisher
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. © Springer-Verlag Berlin Heidelberg 2005.
Description
Keywords
Algorithms, Computer simulation, Parameter estimation, Routers, Telecommunication traffic, Fine-tuning parameters, Gene Expression Programming (GEP), Routing paths, Traffic Engineering (TE), Computer programming
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3801 LNAI
3801 LNAI