Optimal multichannel data transmission in computer networks

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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 languageEnglish (US)
Pages (from-to)759-765
Number of pages7
JournalComputer Communications
Issue number7
StatePublished - May 1 2003


  • Communication systems
  • Computer communications
  • End-to-end delay
  • Multichannel routing
  • Polynomial time algorithms
  • Quality of service

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'Optimal multichannel data transmission in computer networks'. Together they form a unique fingerprint.

Cite this