QoS routing via multiple paths using bandwidth reservation

Nageswara S.V. Rao, Stephen G. Batsell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

61 Scopus citations

Abstract

We consider two generic routing problems via multiple paths in a computer network wherein bandwidth can be reserved, and guaranteed, once reserved, on the links. The first problem requires that a message of finite length be transmitted from s to d within τ units of time. The second problem requires that a sequential message of r units be transmitted at a rate of η such that maximum time difference between two units received out of order is no more than q. We propose a polynomial-time algorithm to the first problem, and present simulation results to illustrate its applicability. We show the second problem to be NP-complete, and propose a polynomial-time approximate solution.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages11-18
Number of pages8
Volume1
ISBN (Print)0780343832
DOIs
StatePublished - 1998
EventProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA
Duration: Mar 29 1998Apr 2 1998

Conference

ConferenceProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3)
CitySan Francisco, CA, USA
Period03/29/9804/2/98

Fingerprint

Dive into the research topics of 'QoS routing via multiple paths using bandwidth reservation'. Together they form a unique fingerprint.

Cite this