P.: Load balancing by distributed optimisation in ad hoc networks

Abstract. We approach the problem of load balancing for wireless multi-hop networks by distributed optimisation. We implement an approximation algorithm for minimising the maximum network congestion as a modification to the DSR routing protocol. The algorithm is based on shortest-path computations that are integrated into the DSR route discovery and maintenance process. The resulting Balanced Multipath Source Routing (BMSR) protocol does not need to disseminate global information throughout the network. Our simulations with the ns2 simulator show a gain of 14 % to 69 % in the throughput, depending on the setup, compared to DSR for a high network load.

Improvement of performance in MPLS domains by using Caching and Aggregation of CR-LSP

Constraint-based routing (CR-LDP) extends the features of MPLS Label Distribution Protocol (LDP) working in conjunction with a wide variety of QoS scenarios and services including IP differentiated services, integrated services, traffic engineering, Asynchronous Transfer Mode (ATM) service classes and frame relay. When a number of CR-LSPs are required a lot of CR- LDP signalling is needed: this paper proposes then two techniques - caching and aggregation - to reduce the number of CR-LDP messages by dynamically increasing the number of flows served by each single CR-LSP. A simulation is also used to discuss the performance of such mechanisms