This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability
October 1992 (vol. 41 no. 10)
pp. 1257-1270

The problem of selecting routes for interprocess communication in a network with virtual cut-through capability while balancing the network load and minimizing the number of times that a message gets buffered is addressed. The approach taken is to formulate the route selection problem as a minimization problem, with a link cost function that depends upon the traffic through the link. The form of this cost function is derived based on the probability of establishing a virtual cut-through route. It is shown that this route selection problem is NP-hard, and an approximate algorithm is developed which tries to incrementally reduce the cost by rerouting traffic. The performance of this algorithm is evaluated for the hypercube and the C-wrapped hexagonal mesh, example networks for which virtual cut-through switching support has been developed.

[1] J. Goldberget al., "Development and analysis of SIFT," NASA contractor rep. 172146, NASA Langley Research Center, Feb. 1984.
[2] R. M. Kieckhafer, C. J. Walter, A. M. Finn, and P. M. Thambidurai, "The MAFT architecture for distributed fault tolerance,"IEEE Trans. Comput., vol. C-37, pp. 398-405, Apr. 1988.
[3] J. Lala, "AIPS tutorial," tech. rep., The Charles Stark Draper Laboratory, Inc., Jan. 1987.
[4] "Completion of the advanced information processing system," The Charles Stark Draper Laboratory, report in response to NASA Langley Research Center CBD announcement Ref SS017, Issue PSA-9214.
[5] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[6] M.-S. Chen, K. G. Shin, and D. D. Kandlur, "Addressing, routing, and broadcasting in hexagonal mesh multiprocessors,"IEEE Trans. Comput., vol. C-39, pp. 10-18, Jan. 1990.
[7] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Networks, vol. 3, pp. 267-286, 1979.
[8] W. J. Dally and C. L. Seitz, "The torus routing chip,"J. Distributed Syst., vol. 1, no. 3, pp. 187-196, 1986.
[9] W. J. Dally and P. Song, "Design of a self-timed VLSI multicomputer communication controller," inProc. IEEE Int. Conf. Comput. Design: VLSI in Comput., 1987, pp. 230-234.
[10] J.W. Dolter, P. Ramanathan, and K.G. Shin, "A Microprogrammable VLSI Routing Controller for HARTS,"Proc. Int'l Conf. Computer Design: VLSI in Computers, Computer Society Press, Order No. 1971, Oct. 1989, pp. 160-163.
[11] D. Ferrari, "Guaranteeing performance for real-time communication in wide-area networks," Tech. Rep. UCB/CSD 89/485, U.C.B. Computer Science Division, EECS, Berkeley, CA, Jan. 1989.
[12] M. Schwartz and T. E. Stern, "Routing technique used in computer communication networks,"IEEE Trans. Commun., vol. COM-28, no. 4, pp. 539-552, Apr. 1980.
[13] R. P. Bianchini, Jr. and J. P. Shen, "Interprocessor traffic scheduling algorithm for multiple-processor networks,"IEEE Trans. Comput., vol. C-36, pp. 396-409, Apr. 1987.
[14] L. Kleinrock,Communication Nets: Stochastic Message Flow and Delay, New York: McGraw-Hill, 1964.
[15] M. Ilyas and H. T. Mouftah, "Toward performance improvement of cut-through switching in computer networks,"Perform. Eval., vol. 6, pp. 125-133, July 1986.
[16] J. R. Jackson, "Networks of waiting lines,"Oper. Res., vol. 5, pp. 518-521, Aug. 1957.
[17] S. A. Cook, "The complexity of theorem-proving procedures," inProc. 3rd Annu. ACM Symp. Theory of Comput., 1971, pp. 151-158.
[18] M. R. Garey and D. S. Johnson,Computers and Intractability, San Francisco, CA: Freeman, 1979.
[19] S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity flow problems,"SIAM J. Comput., vol. 5, pp. 691-703, Dec. 1976.
[20] J. W. Dolter, P. Ramanathan, and K. G. Shin, "Performance analysis of virtual cut-through switching in HARTS: A hexagonal mesh multicomputer,"IEEE Trans. Comput., vol. 40, pp. 669-680, June 1991.
[21] D. D. Kandlur and K. G. Shin, "A communication subsystem for HARTS: An experimental distributed real-time system," Tech. Rep., CSE-TR-109-91, CSE Div., EECS Dep., Unv. of Michigan, Ann Arbor, Oct. 1991.

Index Terms:
traffic routing; multicomputer networks; virtual cut-through capability; interprocess communication; network load; route selection problem; minimization problem; link cost function; NP-hard; performance; hypercube; C-wrapped hexagonal mesh; computational complexity; computer networks; hypercube networks; minimisation of switching nets; telecommunication network routing.
Citation:
D.D. Kandlur, K.G. Shin, "Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability," IEEE Transactions on Computers, vol. 41, no. 10, pp. 1257-1270, Oct. 1992, doi:10.1109/12.166603
Usage of this product signifies your acceptance of the Terms of Use.