Download Now Free registration required
Unlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more efficient than the traditional approach of routing along single paths. Yet, in contrast to the singlepath routing approach, most studies in the context of multipath routing focused on heuristic methods. The authors formalize problem (K-Path Routing) that incorporate major requirements of multipath routing. Then, they establish the intractability of these problems a max flow multipath routing algorithm that is designed to reduce latency, provide high throughput and balance traffic load.
- Format: PDF
- Size: 380.67 KB