Abstract
We study end-to-end routing in a communication system where there is a link bandwidth and a link propagation delay associated with each link, as well as a queuing delay associate with each intermediate node. We present a polynomial time algorithm for computing an optimal multi-path end-to-end routing to transmit a given message. Examples are also given to show that a previously published path-based algorithm for this problem is suboptimal.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE Symposium on Computers and Communications - Proceedings |
| Pages | 581-586 |
| Number of pages | 6 |
| State | Published - 2000 |
| Externally published | Yes |
| Event | ISCC 2000 - 5th IEEE Symposium on Computers and Communications - Duration: Jul 3 2000 → Jul 6 2000 |
Other
| Other | ISCC 2000 - 5th IEEE Symposium on Computers and Communications |
|---|---|
| Period | 7/3/00 → 7/6/00 |
ASJC Scopus subject areas
- General Computer Science
- General Engineering