Optimal multichannel data transmission in computer networks

Authors:
Guoliang Xue
Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406, USA
Venue:
Computer Communications
Year:
2003

Citing 12
Cited 5

The quickest path problem

Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
On the quickest path problem

Information Processing Letters
The all-pairs quickest path problem

Information Processing Letters
Finding the k quickest simple paths in a network

Information Processing Letters
Efficient solutions to multicast routing in communication networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
Fast data transmission and maximal dynamic flow

Information Processing Letters
A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

IEEE/ACM Transactions on Networking (TON)
Minimum Time Message Transmission in Networks

ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Optimal multicast multichannel routing in computer networks

Computer Communications
Traffic distribution for end-to-end QoS routing with multicast multichannel services

The Journal of Supercomputing
A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

The Journal of Supercomputing
Optimal multicast multichannel routing in computer networks

ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
A new high performance approach: merging optimal multicast sessions for supporting multisource routing

The Journal of Supercomputing

Quantified Score

Hi-index	0.24

Visualization

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.