Optimal multichannel data transmission in computer networks

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.