This Article 
 Bibliographic References 
 Add to: 
A Conflict Sense Routing Protocol and Its Performance for Hypercubes
June 1996 (vol. 45 no. 6)
pp. 693-703

Abstract—We propose a new switching format for multiprocessor networks, which we call Conflict Sense Routing Protocol. This switching format is a hybrid of packet and circuit switching, and combines advantages of both. We initially present the protocol in a way applicable to a general topology. We then present an implementation of this protocol for a hypercube computer and a particular routing algorithm. We also analyze the steady-state throughput of the hypercube implementation for random node-to-node communications.

[1] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[2] J.T. Brassil, "Deflection Routing in Certain Regular Networks," PhD thesis, Univ. of California, San Diego, 1991.
[3] W. Dally,"Network and processor architecture for message-driven computer," R. Suaya and G. Birtwistle, eds., VLSI and Parallel Computation.San Mateo, Calif.: Morgan Kaufmann, pp. 140-218, 1990.
[4] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[5] A.G. Greenberg and J. Goodman, "Sharp Approximate Models of Adaptive Routing in Mesh Networks," Teletraffic Analysis and Computer Performance Evaluation, J.W. Cohen, O.J. Boxma, and H.C. Tijms, eds., pp. 255-270.Amsterdam: Elsevier, 1988.
[6] A.G. Greenberg and B. Hajek, "Deflection Routing in Hypercube Networks," IEEE Trans. Comm., vol. 35, no. 6, pp. 1,070-1,081, June 1992.
[7] P. Kermani and L. Kleinrock, "Virtual Cut-Through: A New Computer Communicating Switching Technique," Computer Networks, vol. 3, pp. 267-286, 1979.
[8] N.F. Maxemchuk, "Comparison of Deflection and Store-and-Forward Techniques in the Manhattan Street and Shuffle-Exchange Networks," Proc. INFORCOM '89, vol. 3, pp. 800-809, Apr. 1989.
[9] N.F. Maxemchuk, "Problems Arising from Deflection Routing: Livelock, Lock-Out, Congestion and Message Reassembly," Proc. NATO Workshop Architecture and High Performance Issues of High Capacity Local and Metropolitan Area Networks,France, June 1990.
[10] E.A. Varvarigos, "Static and Dynamic Communication in Parallel Computing," PhD thesis, Dept. of EECS, Massachusetts Inst. of Tech nology, Aug. 1992.

Index Terms:
Packet and circuit switching, hypercubes, random one-to-one communications, throughput.
Emmanouel A. Varvarigos, Dimitri P. Bertsekas, "A Conflict Sense Routing Protocol and Its Performance for Hypercubes," IEEE Transactions on Computers, vol. 45, no. 6, pp. 693-703, June 1996, doi:10.1109/12.506425
Usage of this product signifies your acceptance of the Terms of Use.