Optimal multichannel data transmission in computer networks

Research output: Contribution to journalArticle

10 Citations (Scopus)

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

Fingerprint

Computer networks
Data communication systems
Polynomials
Telecommunication links
Communication systems
Bandwidth

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
  • Electrical and Electronic Engineering

Cite this

Optimal multichannel data transmission in computer networks. / Xue, Guoliang.

In: Computer Communications, Vol. 26, No. 7, 01.05.2003, p. 759-765.

Research output: Contribution to journalArticle

@article{16e6217473124147804f2fee5be38205,
title = "Optimal multichannel data transmission in computer networks",
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.",
keywords = "Communication systems, Computer communications, End-to-end delay, Multichannel routing, Polynomial time algorithms, Quality of service",
author = "Guoliang Xue",
year = "2003",
month = "5",
day = "1",
doi = "10.1016/S0140-3664(02)00210-4",
language = "English (US)",
volume = "26",
pages = "759--765",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - Optimal multichannel data transmission in computer networks

AU - Xue, Guoliang

PY - 2003/5/1

Y1 - 2003/5/1

N2 - 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.

AB - 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.

KW - Communication systems

KW - Computer communications

KW - End-to-end delay

KW - Multichannel routing

KW - Polynomial time algorithms

KW - Quality of service

UR - http://www.scopus.com/inward/record.url?scp=0037400858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037400858&partnerID=8YFLogxK

U2 - 10.1016/S0140-3664(02)00210-4

DO - 10.1016/S0140-3664(02)00210-4

M3 - Article

AN - SCOPUS:0037400858

VL - 26

SP - 759

EP - 765

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 7

ER -