We present a routing scheme for MPLS networks with probabilistic failures. Our routing scheme simultaneously maximizes the expected satisfied demand and minimizes the maximum link utilization of the network. Our approach is novel in that it is the first to jointly address the traffic engineering and the routing through reliable paths problems. In addition to the optimal routing algorithm, we present a lower complexity heuristic algorithm based on Linear Programming and Yen's algorithm. Finally, numerical results are presented to demonstrate the effectiveness of both our optimal and heuristic algorithms.
Abstract-The routing problem in Wireless Mesh Networks is concerned with finding "good" source-destination paths. It generally faces multiple objectives to be optimized, such as i) path capacity, which accounts for the bits per second that can be sent along the path connecting the source to the destination node, and ii) end-to-end delay. This paper presents the Mesh Routing Algorithm (MRA), a dynamic programming approach to compute high-capacity paths while simultaneously bounding the end-to-end delay. The proposed algorithm also provides the option of routing through multiple link-disjoint paths, such that the amount of traffic through each path is proportional to its capacity. Simulation results show that MRA outperforms other common techniques in terms of path capacity, while at the same time bounding the end-to-end delay to a desired value.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.