文档介绍：Split Multipath Routing with Maximally Disjoint Paths in Ad works
Sung-Ju Lee Mario Gerla
& Mobile Systems puter Science Department
Hewlett-Packard Laboratories University of California
Palo Alto, CA 94304-1126 Los Angeles, CA 90095-1596
******@hpl. ******@
Abstract – In recent years, routing has been the most focused area in ad width munication pairs, responding to congestion and
works research. On-demand routing in particular, is widely devel- bursty traffic, and increasing delivery reliability. In QoS rout-
oped in bandwidth constrained mobile wireless ad works because of
its effectiveness and efficiency. Most proposed on-demand routing protocols ing in works, multipath routing has been widely de-
however, build and rely on single route for each data session. Whenever there veloped [2], [3], [10], [12], [17], [18], [20], [21]. These pro-
is a link disconnection on the active route, the routing protocol must per- tocols use table-driven algorithms (link state or distance vector)
form a route recovery process. In QoS routing for works, multiple pute multiple routes. Studies show however, that proac-
path routing is popularly used. Multiple routes are however, constructed us-
ing link-state or distance vector algorithms which are not well-suited for ad tive protocols perform poorly in works because of ex-
works. We propose an on-demand routing sche