This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Conflict Resolution and Fault-Free Path Selection in Multicast-Connected Cube-Based Networks
March 1994 (vol. 43 no. 3)
pp. 374-380

Presents an algorithm that solves the conflict resolution problem in fault-tolerant multicast-connected MINs. Without loss of generality, the authors apply the algorithm to reconfigure a four-path cube-based network. An intensive simulation study is conducted to reveal the performance improvement gained by the conflict resolution and fault-free path selection algorithm on the network under study. The simulation results indicate that the probability of failure to provide multicast connections using two paths is comparable to that of using three and four paths under various fault scenarios. The results also indicate that an effective reconfiguration algorithm based on two alternate paths has a great impact on the network performance in the presence of faults and conflicts.

[1] C.L. Wu, and T.Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.
[2] G. B. Adams, D. P. Agrawal, and H. J. Siegel, "A survey and comparison of fault-tolerant multistage interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 14-27, June 1987.
[3] H. J. Siegel,Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[4] F. N. Sibai, and A. Abonamah, "C2SC: A four-path fault-tolerant interconnection network," inProc. 20th Conf. Parallel Processing, St. Charles, Illinois, Aug. 1991, vol. 1, pp. 698-699.
[5] T.-D. Han, D. A. Carlson, and S. P. Levitan, "A fault-tolerant design of the generalized cube network," inProc. ISMM Int'l Conf. on Parllel and Distrib. Computing and Syst., NY, Oct. 1990, pp. 160-165.
[6] V.P. Kumar and S. M. Reddy, "Fault-tolerant multistage interconnection networks for multiprocessor systems," inConcurrent Computations: Algorithms, Architecture, and Technology. S. Tewksbury, B. Dickleson, and S. Schwartz, Eds. New York: Plenum Press, 1988, pp. 495-523.
[7] A. Abonamah, F.N. Sibai, and N. K. Sharma, "Conflict resolution in the C2SC multistage interconnection networks," inProc. 6th Int. Conf. on Parallel Distrib. Computing Syst., Louisville, KY, 1993, pp. 31-37.
[8] N.K. Sharma, F.N. Sibai, and A. Abonamah, "A simulation analysis of faults and conflicts in a multicast-connected four-path cube-based network," inProc. IEEE 12th Int. Conf. Distrib. Computing Syst., Yokohoma, Japan, June 1992, pp. 226-233.
[9] N.K. Sharma, F.N. Sibai, and A. Abonamah, "An efficient reconfiguration algorithm for one-to-one connection of the C2SC network," inProc. 4th ISMM Int. Conf. Parallel&Distributed Computing, and Systems, Washington, DC, Oct. 1991, pp. 1-5.
[10] F.N. Sibai, N. K. Sharma, and A. Abonamah, "Comparison of reconfiguration schemes for the C2SC MIN operating in the broadcast mode," to be published inIEEE Trans. Comput.
[11] F.N. Sibai and A. A. Abonamah, "Parallel path assignment of multicast connections in multi-path networks," to be published.

Index Terms:
multiprocessor interconnection networks; fault tolerant computing; conflict resolution; multicast-connected; cube-based; MINs; fault-free path selection; performance improvement; simulation results; probability of failure; multicast connections; reconfiguration algorithm; network performance; faults; conflicts.
Citation:
A.A. Abonamah, F.N. Sibai, N.K. Sharma, "Conflict Resolution and Fault-Free Path Selection in Multicast-Connected Cube-Based Networks," IEEE Transactions on Computers, vol. 43, no. 3, pp. 374-380, March 1994, doi:10.1109/12.272439
Usage of this product signifies your acceptance of the Terms of Use.