Abstract

This paper presents the tools that have been developed in the IST-Anemone project, a large European testbed deployed for testing and validating IPv6 mobility protocols and products. The testbed is available to third parties, which may include research projects and companies seeking to validate IPv6-ready products. "br/"This tested is particularly suitable for ITS experimentation as it includes several private roads and various network access technologies, IPv6 mobility support and a set of tools for testing IPv6 and performing demonstrations. "br/"Several ITS-related experiments have been performed by Anemone partners.

Abstract

International audience; Summary form only given. New emergent distributed multimedia applications require end-to-end quality of service (QoS) guarantees and have stringent constraints on delay, jitter, cost, etc. Taking into account such needs in IP networks stands of utmost necessity. MPLS and traffic engineering provide indeed an adequate mean to establish constrained routes which satisfy application requirements especially in terms of bandwidth and delay. These routes are computed by running a QoS algorithm on the traffic engineering database maintained by an extended IGP routing protocol. In this paper, we first study and analyze three known QoS algorithms, namely SPF-TE, WSPF and DORA. This study is done through very detailed simulations using ONS, a simulator of the OSPF protocol, recently developed and integrated into the well known NS simulator. We show that while all these algorithms outperform clearly SPF, the algorithm usually used within OSPF, DORA algorithm stands slightly better than the two others. Then, we propose three different potential improvements of DORA and propose a new QoS algorithm termed WDORA that incorporates one these improvements. We show that WDORA outperforms DORA for different performance metrics.

Abstract

National audience; Multiprotocol Label Switching (MPLS) is experiencing a growing interest mainly due to the flexible support of traffic engineering and Quality of Service (QoS). The efficient routing of Label Switched Paths (LSP) is an active research field where Constraint-Based Routing (CBR) appears to be a major building block. CBR can be seen as the decision entity that calculates the explicit paths for LSPs. The path calculation process can be constrained by different criteria, such as QoS requirements and particularly bandwidth guarantees considered in this paper. Special attention has been given to on-line solutions for CBR that process LSP establishment demands on the fly without any information on future demands. Currently, many proposals are formulated for CBR algorithms for bandwidth guaranteed tunnels, often compared to prove the effectiveness of one method over another. Nevertheless, no coherent evaluation has been clearly established for the general CBR problem, pointing out the different trade-offs involved in many solutions. In this article, we investigate the different objectives of CBR algorithms. We establish clear and general criteria for these algorithms, namely: reducing blocking probability, minimizing network costs, and load balancing. An effort of classification is made in order to map existing proposals to the proposed criteria. The study, performed to evaluate the influence of these parameters with simulations, shows the drawbacks of partial considerations, and the need for a global solution. Finally, we propose an integrating solution that encompasses the different criteria presented in the paper.

Abstract

International audience; In this paper, we introduce a novel framework for the off-line flow allocation problem for traffic engineering in MPLS networks. We use a multi-stage optimization that considers minimizing successively congestion, resource consumption and operational costs. The framework is based on linear programming and presents an efficient solution for the problem both in terms of computational complexity and approximation guarantees. Preliminary simulation results prove that we can easily tune congestion and resource consumption while keeping low operational costs, expressed in the number of Label Switched Paths (LSPs) in use. Moreover, the flow allocation solution is obtained in a polynomial time and results can be further extended to larger topologies with a big number of demands.

Abstract

International audience; In this paper, we present a novel polynomial time framework for the off-line flow allocation problem in MPLSTraffic Engineering (MPLS-TE) networks. This framework, named FATE (Flow Allocation for Traffic Engineering), encompasses different objectives that illustrate the operator needs for traffic engineering and provides advanced control over the quality of the solution. Typically, we consider minimizing congestion, bandwidth consumption and operational costs. FATE is based on linear programming and presents an efficient solution for the problem both in terms of computational complexity and approximation guarantees. Simulation results show that we can get an efficient trade-off between congestion and bandwidth consumption while having a reduced number of Label Switched Paths (LSPs) for various known topologies.