Abstract

International audience; Hybrid networks take data forwarding decisions at multiple network levels. In order to make an efficient use of hybrid networks, traffic engineering solutions (e.g., routing and data grooming techniques) are commonly employed. Within the specific context of a self-managed hybrid optical and packet switching network, one important aspect to be considered is how to efficiently and autonomically move IP flows from the IP level over lightpaths at the optical level. The more IP traffic is moved (offloaded), leaving the least amount of traffic on the IP level, the better. Based on that, we investigate in this paper different strategies to move IP flows onto lightpaths while observing the percentage of offloaded IP traffic per strategy. Document type: Part of book or chapter of book

Abstract

The performance and reliability of the Internet depend, in large part, on the operation of the underlying routing protocols. Today’s IP routing protocols compute paths based on the network topology and configuration parameters, without regard to the current traffic load on the routers and links. The responsibility for adapting the paths to the prevailing traffic falls to the network operators and management systems. This chapter discusses the modeling and computational challenges of optimizing the tunable parameters, starting with conventional intradomain routing protocols that compute shortest paths as the sum of configurable link weights. Then, we consider the problem of optimizing the interdomain routing policies that control the flow of traffic from one network to another. Optimization based on local search has proven quite effective in grappling with the complexity of the routing protocols and the diversity of the performance objectives, and tools based on local search are in wide use in today’s large IP networks. Document type: Part of book or chapter of book

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. Document type: Part of book or chapter of book