Evolutionary computation for quality of service internet routing optimization

2Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, the main goal is to develop and evaluate a number of optimization algorithms in the task of improving Quality of Service levels in TCP/IP based networks, by configuring the routing weights of link-state protocols such as OSPF. Since this is a complex problem, some meta-heuristics from the Evolutionary Computation arena were considered, working over a mathematical model that allows for flexible cost functions, taking into account several measures of the network behavior such as network congestion and end-to-end delays. A number of experiments were performed, resorting to a large set of network topologies, where Evolutionary Algorithms (EAs), Differential Evolution and some common heuristic methods including local search were compared. EAs make the most promising alternative leading to solutions with an effective network performance even under unfavorable scenarios. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Rocha, M., Sousa, P., Cortez, P., & Rio, M. (2007). Evolutionary computation for quality of service internet routing optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4448 LNCS, pp. 71–80). Springer Verlag. https://doi.org/10.1007/978-3-540-71805-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free