A Practical Framework for Minimum-Delay Routing in Computer Networks

Abstract

The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, single-path routing exhibits oscillatory behavior and becomes unstable as traffic loads increase. On the other hand, minimum-delay routing approaches can minimize delays only when traffic is stationary or very slowly changing.We present a "near-optimal" routing framework that offers delays comparable to those of optimal routing and that is as flexible and responsive as single-path routing protocols proposed to date. First, an approximation to the Gallager's minimum-delay routing problem is derived, and then algorithms that implement the approximation scheme are presented and verified. We describe the first routing algorithm based on link-state information that provides multiple paths of unequal cost to each destination that are loop-free at every instant. We show through simulations that the delays obtained in our framework for minimum-delay routing are comparable to those obtained using Gallager's algorithm for minimum-delay routing. Also, we show that our framework renders far smaller delays and makes better use of resources than traditional single-path routing. Report Documentation PageForm Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

Multipath routing and rate-controlled video encoding in wireless video surveillance networks

“…According to this algorithm each node, thanks to a distance-vector algorithm, knows the distance from the Internet through each path in the Mesh network, and forwards packets, in a round-robin fashion, through all the paths having the same minimum cost to reach the Internet, whatever the destination Gateway node. The distance-vector multipath network-balancing routing algorithm is used for two reasons: first it is able to reduce delay [25,35,36]; secondly, thanks to its multipath peculiarity, it increases the robustness of the architecture to external attacks and interceptions. In fact, if a path is shielded (maliciously or not), or its quality is temporally degraded, all the packets flowing through it are lost; however, the application of the multipath network-balancing routing algorithm guarantees that a high percentage of packets are able to reach the Video Decoder block, and therefore frames can be decoded, by applying an error concealment video decoding algorithm [37][38][39].…”

A graph theoretic approach to bounding delay in proxy-assisted, end-system multicast

“…There, the general optimization problems are variants of NP-complete Steiner-Tree problems and are also NP-complete. Several works have developed heuristic approximations [15], [16], [24], [19], [18] or ratio-bounded approximations [5] to these optimization problems. However, these heuristics are inapplicable to the problems addressed in this paper since there is no straightforward way to account for degree constraints of nodes in a tree that are less its degree in the underlying connectivity graph.…”