QoS routing via multiple paths using bandwidth reservation
The authors address the problem of computing a multipath, consisting of possibly overlapping paths, to transmit data from the source node s to the destination node d over a computer network while ensuring deterministic bounds on end-to-end delay or delivery rate. They consider two generic routing problems within the framework wherein bandwidth can be reserved, and guaranteed, once reserved, on various links of the communication network. The first problem requires that a message of finite length be transmitted from s to d within {tau} units of time. The second problem requires that a sequential message of r units be transmitted at a rate of {eta} such that maximum time difference between two units that are received out of order is no more than q. They propose a polynomial-time algorithm to the first problem based on an adaptation of the classical Ford-Fulkerson`s method. They present simulation results to illustrate the applicability of the proposed algorithm. They show the second problem to be NP-complete and propose a polynomial-time approximate solution.
- Research Organization:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC05-96OR22464
- OSTI ID:
- 642703
- Report Number(s):
- ORNL/CP-95289; CONF-9703134-; ON: DE98001424; TRN: AHC2DT02%%29
- Resource Relation:
- Conference: IEEE INFOCOM `98: conference on computer communications, San Francisco, CA (United States), 29 Mar 1997 - 2 Apr 1998; Other Information: PBD: Nov 1997
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computing Path Tables for Quickest Multipaths In Computer Networks
A framework for adaptive routing in multicomputer networks