Abstract
We study end-to-end routing in a communication system where there is a bandwidth and a propagation delay associated with each link, as well as a queuing delay associated with each intermediate node. We present a polynomial time algorithm for computing an optimal multichannel routing to transmit a given message. Examples are also given to show that several previously published path-based algorithms for this problem are suboptimal. We then generalize the multichannel routing problem to delay-constrained multichannel routing problem and show that this generalized problem can also be solved in polynomial time.
Original language | English (US) |
---|---|
Pages (from-to) | 759-765 |
Number of pages | 7 |
Journal | Computer Communications |
Volume | 26 |
Issue number | 7 |
DOIs | |
State | Published - May 1 2003 |
Keywords
- Communication systems
- Computer communications
- End-to-end delay
- Multichannel routing
- Polynomial time algorithms
- Quality of service
ASJC Scopus subject areas
- Computer Networks and Communications