Routing to Multiple Destinations in Computer Networks

IEEE Transactions on Communications

Volumn 31, Issue 3, 1983, Pages 343-351

  Bharath Kumar, Kadaba ^a   Jaffe, Jeffrey M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; SYSTEMS SCIENCE AND CYBERNETICS - HEURISTIC PROGRAMMING;

HEURISTIC ALGORITHMS; NETWORK COST (NC);

COMPUTER PROGRAMMING;

EID: 0020717353     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1983.1095818     Document Type: Article

References (15)

1. J. M. McQuillan, I. Richer, and E. C. Rosen, “The new routing algorithm for the ARPANET,” IEEE Trans. Commun., vol. COM-28, May 1980.
2. L. W. Tymes, “Routing and flow control in TYMNET,” IEEE Trans. Commun., vol. COM-29, pp. 392-398, Apr. 1981.
3. Y. K. Dalal, “Broadcast protocols in packet switched computer networks,” Ph.D. dissertation, Stanford Univ., Stanford, CA, CSL Tech. Rep. 128, 1977.
4. Y. K. Dalal and R. M. Metcalfe, “Reverse path forwarding of broadcast packets,” Commun. Ass. Comput. Mach., vol. 21, no. 12, 1978.
5. J. M. McQuillan, “Enhanced message addressing capabilities for computer networks,” Proc. IEEE, vol. 66, Nov. 1978.
6. D. W. Wall, “Mechanisms for broadcast and selective broadcast,” Ph.D. dissertation, Stanford Univ., Stanford, CA, CSL Tech. Rep. 190, 1980.
7. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
8. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
9. K. Bharath-Kumar and J. M. Jaffe, “Routing to multiple destinations in computer networks,” IBM Res. Rep. RC9098, Oct. 1981.
10. E. N. Gilbert and H. O. Pollak, “Steiner minimal tree,” SIAM J. Appl. Math., vol. 16, 1968.
11. J. M. Jaffe, “Distributed multi-destination routing: The constraints of local information,” presented at the SIGACT/SIGOPS Conf. Principles Distrib. Comput., Ottawa, Ont., Canada, Aug. 1982.
12. L. Kou, G. Markowsky, and L. Berman, “A fast algorithm on Steiner trees,” Acta Inform., vol. 15, 1981.
13. D. J. Rosenkrantz, R. E. Steams, and P. M. Lewis, II, “An analysis of several heuristics for the traveling salesman problem,” SIAM J. Comput., vol. 3, no. 6, 1977.
14. N. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem,” Tech. Rep., Grad. School Ind. Admin., Carnegie-Mellon Univ., Pittsburgh, PA.
15. M. Schwartz, Computer Communication Network Design and Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1977.