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 language | English |
---|---|
Title of host publication | Proceedings - IEEE INFOCOM |
Publisher | IEEE |
Pages | 11-18 |
Number of pages | 8 |
Volume | 1 |
ISBN (Print) | 0780343832 |
DOIs | |
State | Published - 1998 |
Event | Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA Duration: Mar 29 1998 → Apr 2 1998 |
Conference
Conference | Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) |
---|---|
City | San Francisco, CA, USA |
Period | 03/29/98 → 04/2/98 |