Distributed algorithms for the constrained routing problem in computer networks

Authors:
Yung-Chen Hung
Affiliations:
Department of Computer and Information Science, Soochow University, Taipei, Taiwan, ROC
Venue:
Computer Communications
Year:
1998

Citing 11
Cited 0

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
A new distributed algorithm to find breadth first search trees

IEEE Transactions on Information Theory
Minimum cost-reliability ratio path problem

Computers and Operations Research
Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
The quickest path problem

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

Computers and Operations Research
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Algorithms for the constrained quickest path problem and the enumeration of quickest paths

Computers and Operations Research
On the Quickest Path Problem

ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Research note: Delay constrained distributed multicast routing algorithm

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

The quickest path problem is possibly the most important problem for data routing in computer networks. The quickest path problem is to find quickest paths in a computer network to transmit a given amount of data with minimal transmission time. The selection of quickest paths depends on both the characteristics of the computer network and the amount of data to be transmitted. In addition, if the quickest paths are required to go through a specified path, then the restricted problem is called the constrained quickest path problem. In this study, some new distributed routing algorithms are developed for multimedia data transfer in an asynchronous computer network. For all pairs of nodes in a network, an O(mn) messages and O(m) time distributed algorithm is first presented to find constrained quickest paths, and then an O(mn) messages and O(m) time distributed algorithm is present to enumerate the first k quickest paths.