Abstract

We consider the problem of allocating bandwidth to competing flows in an MPLS network, subject to constraints on fairness, efficiency, and administrative complexity. The aggregate traffic between a source and a destination, called a flow, is mapped to label switched paths (LSPs) across the network. Each flow is assigned a preferred ('primary') LSP, but traffic may be sent to other ('secondary') LSPs. Within this context, we define objectives for traffic engineering, such as fairness, efficiency, and preferred flow assignment to the primary LSP of a flow ('Primary Path First', PPF). We propose a distributed, feedback-based multipath routing algorithm that attempts to apply additive-increase and multiplicative-decrease (AIMD) to implement our traffic engineering objectives. The new algorithm is referred to as multipath-AIMD. We use ns-2 simulations to illustrate the fairness criteria and PPF property of our multipath-AIMD scheme in an MPLS network. Document type: Part of book or chapter of book

Abstract

In this paper, to improve the burst loss performance, we actively avoid contentions by proposing a novel congestion control scheme that operates based on the highest (called peak load) of the loads of all links over the path between each pair of ingress and egress nodes in an Optical Burst Switching (OBS) network. Document type: Part of book or chapter of book

Abstract

This paper proposes an integrated network management framework for inter-domain outbound traffic engineering. The framework consists of three functional blocks (monitoring, optimization and implementation) to make the outbound traffic engineering adaptive to network condition changes such as inter-domain traffic demand variation, inter-domain routing changes and link failures. The objective is to keep the inter-domain link utilization balanced under any of these changes while reducing service disruptions and reconfiguration overheads. Simulation results demonstrate that the proposed framework can achieve better load balancing with less service disruptions and re-configuration overheads in comparison to alternative approaches. Document type: Part of book or chapter of book

Abstract

International audience This paper develops a graph-theoretic framework for large scale bi-dimensional transport networks and provides new insight into the dynamic traffic assignment. Reactive dynamic assignment are deployed to handle the traffic contingencies, traffic uncertainties and traffic congestion. New shortest paths problem in large networks is defined and routes cost calculation is provided. Since mathematical modelling of traffic flow is a keystone in the theory of traffic flow management, and then in the traffic assignment, it is convenient to elaborate a good model of assignment for large scale networks relying on an appropriate model of flow related to very large networks. That is the zone-based optimization of traffic flow model on networks developed by [8], completed and improved by [9]. Document type: Part of book or chapter of book

Abstract

This paper addresses the issue of pricing-based distributed resource allocation via scheduling in a communication network. Introducing the temporal aspect in the resource allocation problem presents new challenges e.g. in accounting for the durations and deadlines of the resource requests. Dynamic real-time pricing concepts are discussed for the decentralized sharing of network resources. A numerical example illustrates the benefit of congestion based pricing in a dynamic communication network. The quality of service that results from decentralized resource allocation is studied from the point of view of a power-controlled wireless network. The model is based on a dynamic noncooperative game and is related to recent work on centrally optimal (Pareto-optimal) distributed dynamic resource allocation. Document type: Part of book or chapter of book

Abstract

Peer-to-peer networking enjoys euphoric support and fierce resistance simultaneously, and for the same reasons. It presents a model where decentralization and lack of structure, hierarchy and control are promoted. Although significant research is carried out to tackle individual issues arising from that paradigm, there has been no obvious approach for evening out differences on a more general basis. In this paper we introduce a framework and provide implementation techniques for such an approach. The framework aims at integrating partial techniques that solve individual problems and has been designed for flexibility. The integrated approach we are proposing includes forming and maintaining of peer-to-peer overlays, controlling the underlying topology being formed, limiting the signaling traffic being generated and optimizing the payload traffic. Document type: Part of book or chapter of book

Abstract

Admission control in wired networks has been traditionally used as a way to control traffic congestion and guarantee quality of service. Here, we propose an admission control mechanism which aims to keep the power consumption at the lowest possible level by restricting the more energy-demanding users. This work relies on the fact that power consumption of networking devices, and of the network as a whole, is not proportional to the carried traffic, as would be the ideal case [1]. As a result some operating regions may be more efficient than others and “jumps” may arise in power consumption when new traffic is added in the network. The proposed mechanism aims to keep power consumption in the lowest possible power consumption level, hopping to the next level only when necessary. Document type: Part of book or chapter of book

Abstract

International audience; This paper presents our approach integrating a high level of intelligence within telecommunication networks. Artificial intelligence has proved its efficiency in resolving complex issues in different fields like air traffic control, robotics, and medical diagnosis. However its usage in telecommunication networks is still very moderated. The main objectives of our framework is to encourage the deployment of techniques characterized by a high level of intelligence – inspired from the artificial intelligence domain in networking. For this reason, we build an extension, with intelligent capabilities, to the J-Sim simulation environment. This extension proposes an intelligent package having the essential entities required for simulating intelligent features. Using this intelligent package and the abstract node model (INET) proposed by J-Sim for network simulations, it will be possible to test the efficiency of integrating intelligent techniques in networking. Document type: Part of book or chapter of book

Abstract

The GMPLS standardization is paving the way for new configurable Traffic Engineering (TE) policies and new survivability schemes for transport networks. In this context, a centralized Path Computation System (PCS) has been implemented, suited for transport networks with a GMPLS control plane. After a brief description of the requirements for a PCS in a GMPLS network, some design issues for the proposed implementation are drawn, with particular emphasis on the centralized approach and on the strategies for achieving the connection survivability. Some results of an intensive testing campaign are shown for the validation of the design choices. Document type: Part of book or chapter of book