An Optimal Shortest-Path Routing Policy for Network Computers with Regular Meshconnected Topologies

IEEE Transactions on Computers

Volumn 38, Issue 10, 1989, Pages 1362-1371

  Badr, Hussein G ^a   Podar, Sunil ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b US West Advanced Technologies   (United States)

Author keywords

Communication protocols; dynamic programming; mesh connected topologies; network computers; probabilistic routing; shortest path

Indexed keywords

COMPUTER NETWORKS--PROTOCOLS; ELECTRIC NETWORKS, COMMUNICATION--TOPOLOGY;

COMMUNICATION PROTOCOLS; DYNAMIC PROGRAMMING; MESH-CONNECTED TOPOLOGIES; NETWORK COMPUTERS; OPTIMAL ROUTING;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024750644     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.35831     Document Type: Article

References (22)

1. T. Agerwala and B. Lint, “Communication in parallel algorithms for Boolean matrix multiplication,” in Proc. Int. Conf. Parallel Processing, 1978.
2. M. Arango, H. Badr, and D. Gelernter, “Staged circuit switching,” IEEE Trans. Comput., vol. C-34, pp. 174–180, Feb. 1985.
3. M. Arango, D. Gelernter, H. Badr, and A. Bernstein, “Staged circuit switching for network computers,” in Proc. ACM Symp. Commun. Architecture Prot., Mar. 1983, pp. 94–100.
4. B.W. Arden and H. Lee, “Analysis of chordal ring network,” IEEE Trans. Comput., vol. C-30, pp. 291–295, Apr. 1981.
5. H.G. Badr, D. Gelernter, and S. Podar, “An adaptive communications protocol for network computers,” Perform. Eval., vol. 6, pp. 35–52, Mar. 1986.
6. L.N. Bhuyan and D.P. Agrawal, “Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Comput., vol. C-33, pp. 323–333, Apr. 1984.
7. K.W. Doty, “New designs for dense processor interconnection networks,” IEEE Trans. Comput., vol. C-33, pp. 447–450, May 1984.
8. S.E. Dreyfus and A.M. Law, The Art and Theory of Dynamic Programming. New York: Academic, 1977.
9. H. Garcia-Molina, “Using semantic knowledge for transaction processing in a distributed database,” A CM Trans. Database Syst., vol. 8, pp. 186–213, June 1983.
10. D. Hillis, Connection Machine. Cambridge, MA: MIT Press, 1985.
11. M. Ilyas and H.T. Mouftah, “Towards performance improvement of cut-through switching in computer networks,” Perform. Eval., vol. 6, pp. 125–133, July 1986.
12. K.B. Irani and K. Chen, “Minimization of interprocessor communication for parallel computation,” IEEE Trans. Comput., vol. C-31, pp. 1067–1075, Nov. 1982.
13. L. Kleinrock, Queueing Systems, Vol. 2: Applications. New York: Wiley-Interscience, 1976.
14. P. Kermani and L. Kleinrock, “Virtual cut-through: A new computer communication switching technique,” Comput. Networks, vol. 3, pp. 267–286, Sept. 1979.
15. D.K. Pradhan and S.M. Reddy, “A faulttolerant communication architecture for distributed systems,” IEEE Trans. Comput., vol. C- 31, pp. 863–870, Sept. 1982.
16. D.K. Pradhan, “Dynamically restructurable faulttolerant processor network architectures,” IEEE Trans. Comput., vol. C-34, pp. 434–447, May 1985.
17. F.P. Preparata and J. Vuillemin, “The cube-connected cycles: A versatile network for parallel computation,” Commun. ACM, vol. 24, pp. 300–309, May 1981.
18. D.A. Reed and H.D. Schwetman, “Cost-performance bounds for multimicrocomputer networks,” IEEE Trans. Comput., vol. C-32, pp. 83–95, Jan. 1983.
19. C.L. Seitz, “Concurrent VLSI architectures,” IEEE Trans. Corn-put., vol. C-33, pp. 1247–1265, Dec. 1984.
20. C.L. Seitz, “The Cosmic Cube,” Commun. ACM, pp. 22–33, Jan. 1985.
21. A.S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.
22. L.D. Wittie, “Communication structures for large networks of microcomputers,” IEEE Trans. Comput., vol. C-30, pp. 264–273, Apr. 1981.