Multipath routing is a trivial way to exploit the path diversity to leverage the network throughput. Technologies such as OSPF ECMP use all the available paths in the network to forward traffic, however, we argue that is not necessary to do so to load balance the network. In this paper, we consider multipath routing with only a limited number of end-to-end paths for each source and destination, and found that this can still load balance the traffic. We devised an algorithm to select a few paths for each source-destination pair so that when all traffic are forwarded over these paths, we can achieve a balanced load in the sense that the maximum link utilization is comparable to that of ECMP forwarding. When the constraint of only shortest paths (i.e. equal paths) are relaxed, we can even outperform ECMP in certain cases. As a result, we can use a few end-to-end tunnels between each source and destination nodes to achieve the load balancing of traffic.
Multipath routing have been discussed since the early years of networking. A large body of literature is available addressing different issues of multipath routing. For example, @cite_15 @cite_19 @cite_24 @cite_0 describe the way to deduce loop-free multipath routes in a hop-by-hop basis. Some other, such as @cite_13 @cite_25 , transform the multipath routing problem into constrained optimization to find the optimal way to forward traffic for highest throughput and lowest congestion. QoS routing is addressed in @cite_10 @cite_20 @cite_3 @cite_12 @cite_14 , which is to perform multipath routing to satisfy QoS guarantees.
@cite_14 @cite_10 @cite_3 @cite_24 @cite_19 @cite_0 @cite_12 @cite_15 @cite_13 @cite_25 @cite_20
1970554468 2140000065 1481933765 1898772099
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels can reduce interference influence. In this paper, we study interference-aware topology control and QoS routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. Channel assignment and routing are two basic issues in such networks. Different channel assignments can lead to different network topologies. We present a novel definition of co-channel interference. Based on this concept, we formally define and present an effective heuristic for the minimum INterference Survivable Topology Control (INSTC) problem which seeks a channel assignment for the given network such that the induced network topology is interference-minimum among all K-connected topologies. We then formulate the Bandwidth-Aware Routing (BAR) problem for a given network topology, which seeks routes for QoS connection requests with bandwidth requirements. We present a polynomial time optimal algorithm to solve the BAR problem under the assumption that traffic demands are splittable. For the non-splittable case, we present a maximum bottleneck capacity path routing heuristic. Simulation results show that compared with the simple common channel assignment and shortest path routing approach, our scheme improves the system performance by 57 on average in terms of connection blocking ratio. Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently attracted attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called dynamic source routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Results show that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. Internet service provider faces a daunting challenge in provisioning network efficiently. We introduce a proactive multipath routing scheme that tries to route traffic according to its built-in properties. Based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. Long-lived flows are detected and migrated to the shortest path if their QoS could be guaranteed there. Suggesting nondisjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated. Simulation experiments show that our approach outperforms traditional single path routing significantly. In this paper, we investigate TCP performance over a multipath routing protocol. Multipath routing can improve the path availability in mobile environment. Thus, it has a great potential to improve TCP performance in ad hoc networks under mobility. Previous research on multipath routing mostly used UDP traffic for performance evaluation. When TCP is used, we find that most times, using multiple paths simultaneously may actually degrade TCP performance. This is partly due to frequent out-of-order packet delivery via different paths. We then test another multipath routing strategy called backup path routing. Under the backup path routing scheme, TCP is able to gain improvements against mobility. We then further study related issues to backup path routing, which can affect TCP performance. Some important discoveries are reported in the paper and simulation results show that by careful selection of the multipath routing strategies, we can improve TCP performance by more than 30 even under very high mobility.