This Article 
 Bibliographic References 
 Add to: 
Analytically Modeling a Fault-Tolerant Messaging Protocol
July 2004 (vol. 53 no. 7)
pp. 870-878

Abstract—We present a simple analytical model for communication over a discarding network using a fault-tolerant messaging protocol. Our technique is an improvement over existing methods in that it accurately models both packet retransmission and the multiple types of packets exchanged between sender and receiver in order to guarantee message delivery and idempotence. The model can be applied to any network and routing strategy; in this paper, we consider both circuit switching and wormhole routing on three different network topologies. In all cases, the model agrees closely with simulated results.

[1] F. Allen et. al., Blue Gene: A Vision for Protein Science Using a Petflop Supercomputer IBM Systems J., vol. 40, no. 2, pp. 310-327, 2001.
[2] J. Brown, J.P. Grossman, and T. Knight, A Lighweight Idempotent Messaging Protocol for Faulty Networks Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA '02), pp. 248-257, 2002.
[3] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[4] S. Datta and R. Sitaraman, The Performance of Simple Routing Algorithms that Drop Packets Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA '97), pp. 159-169, 1997.
[5] J.T. Draper and J. Ghosh, A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems J. Parallel and Distributed Computing, pp. 202-214, Nov. 1994.
[6] R.I. Greenberg and L. Guan, An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees Proc. Int'l Conf. Parallel Processing (ICPP '97), pp. 44-48, 1997.
[7] P. Kermani and L. Kleinrock, Virtual Cut-Through: A New Computer Communication Switching Technique Computer Networks 3, pp. 267-286, 1979.
[8] M. Ould-Khaoua, An Analytical Model of Duato's Fully-Adaptive Routing Algorithm ink-Aryn-Cubes Proc. Int'l Conf. Parallel Processing (ICPP '98), pp. 106-113, 1998.
[9] R. Rehrmann, B. Monien, R. Lüling, and R. Diekmann, On the Communication Throughput of Buffered Multistage Interconnection Networks Proc. ACM Symp. Parallel Algorithms and Architecture (SPAA '96), pp. 152-161, 1996.
[10] M. Saleh and M. Atiquzzaman, An Exact Model for Analysis of Shared Buffer Delta Networks with Arbitrary Output Distribution Proc. Int'l Conf. Algorithms and Architectures for Parallel Processing (ICAPP '96), pp. 147-154, 1996.
[11] H. Sarbazi-Azad, M. Ould-Khaoua, and L.M. Mackenzie, An Analytical Model of Fully-Adaptive Wormhole-Routedk-Aryn-Cubes in the Presence of Hot Spot Traffic Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2000), pp. 605-610, 2000.
[12] C. Sceideler and B. Vöcking, Universal Continuous Routing Strategies Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA '96), pp. 142-151, 1996.
[13] G.D. Stamoulis and J.N. Tsitsiklis, The Efficiency of Greedy Routing in Hypercubes and Butterflies Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA '91), pp. 248-259, 1991.
[14] J.P. Grossman, Design and Evaluation of the Hamal Parallel Computer PhD thesis, Dept. of Electrical Eng. and Computer Science, Massachusetts Inst. of Tech nology, Dec. 2002.

Index Terms:
Fault tolerance, modeling techniques, network communications.
J.P. Grossman, "Analytically Modeling a Fault-Tolerant Messaging Protocol," IEEE Transactions on Computers, vol. 53, no. 7, pp. 870-878, July 2004, doi:10.1109/TC.2004.19
Usage of this product signifies your acceptance of the Terms of Use.