On the relevance of using gene expression programming in destination-based traffic engineering
2005 (English)In: Computational Intelligence and Security, 2005, Vol. 3801, 224-229 p.Conference paper (Other academic)
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.
Place, publisher, year, edition, pages
2005. Vol. 3801, 224-229 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 3801
Computer Science, Artificial Intelligence
IdentifiersURN: urn:nbn:se:kth:diva-6526DOI: 10.1007/11596448_32OAI: oai:DiVA.org:kth-6526DiVA: diva2:11262
International Conference on Computational Intelligence and Security
QC 201006302006-12-072006-12-072010-06-30Bibliographically approved