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 single-path routing approach, most studies in the context of multipath routing focused on heuristic methods. We demonstrate the significant advantage of optimal solutions. Hence, we investigate multipath routing adopting a rigorous (theoretical) approach. We formalize problems that incorporate two major requirements of multipath routing. Then, we establish the intractability of these problems in terms of computational complexity. Accordingly, we establish efficient solutions with proven performance guarantees. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Banner, R., & Orda, A. (2005). Multipath routing algorithms for congestion minimization. In Lecture Notes in Computer Science (Vol. 3462, pp. 536–548). Springer Verlag. https://doi.org/10.1007/11422778_43
Mendeley helps you to discover research relevant for your work.