Distributed algorithms for the constrained routing problem in computer networks

Computer Communications

Volumn 21, Issue 16, 1998, Pages 1476-1485

  Hung, Yung Chen ^a  

^a SOOCHOW UNIVERSITY   (Taiwan)

Author keywords

Computer networks; Distributed algorithms; Quickest path problem; Routing algorithms

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS;

DISTRIBUTED ALGORITHMS; ROUTING ALGORITHMS;

COMPUTER NETWORKS;

EID: 0032183215     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(98)00193-5     Document Type: Article

References (16)

1. N. Deo, C.Y. Pang, Shortest-path algorithms: taxonomy and annotation, Networks 14 (1984) 275-323.
2. A.R. Pierce, Biolography on algorithms for shortest path, shortest spanning tree, and related circuit routing problems, Networks 5 (1975) 129-149.
3. R.K. Ahuja, Minimum cost-reliability ratio problem, Computers Ops Res. 16 (1988) 83-89.
4. L.D. Bodin, B.L. Golden, A.A. Assad, M.O. Ball, Routing and scheduling of vehicles and crews. The state of the art, Computer Ops Res. 10 (1982) 63-211.
5. M.L. Fredman, R.E. Tarjan, Fibronacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (1987) 596-615.
6. B.L. Golden, T.L. Magnanti, Deterministic network optimization: a bibliography, Networks 7 (1977) 149-183.
7. Y. Im, Y. Lee, S. Wi, Y. Choi, Delay constrained distributed multicast routing algorithm, Computer Communication 20 (1997) 60-66.
8. V. Kompella, J. Pasquale, G. Polyzos, Multicast routing for multimedia communications, IEEE/ACM Trans. Networking 1 (3) (1993) 286-292.
9. S. Deering, Multicast routing in datagram internet works and extended LANs, ACM Trans. Computer Systems 8 (2) (1990) 85-110.
10. B. Awerbuch, R. Gallager, A new distributed algorithm to find breadth first search trees, IEEE Trans. Inform. Theory 33 (3) (1987) 315-322.
11. Y.L. Chen, Y.H. Chin, The quickest path problem, Computer Ops Res. 17 (1989) 153-161.
12. J.B. Rosen, S.Z. Sun, G.L. Xue, Algorithm for the quickest path problem and the enumeration of quickest paths, Computer Ops Res. 18 (1991) 579-584.
13. Y.C. Hung, G.H. Chen, Distributed algorithms for the quickest path problem, Parallel Computing 18 (1992) 823-834.
14. Y.C. Hung, G.H. Chen, On the quickest path problem, Lecture Notes in Computer Science, Springer, New York, 1991, pp. 44-66.
15. Y.C. Hung, G.H. Chen, Algorithms for the constrained quickest path problem and the enumeration of quickest paths, Computer Ops Res. 21 (1994) 113-118.
16. B. Awerbuch, Optimal distributed algorithm for minimum weight spanning tree, counting, leader election and related problems, Proc. 19th Annual ACM Symp. on Theory of Computing, 1987, pp. 230-240.