Analytically Modeling a Fault-Tolerant Messaging Protocol

Authors:
J. P. Grossman
Affiliations:
Configuresoft Inc., Woodland Park, CO, USA
Venue:
IEEE Transactions on Computers
Year:
2004

Citing 11
Cited 0

Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
The efficiency of greedy routing in hypercubes and butterflies

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A comprehensive analytical model for wormhole routing in multicomputer systems

Journal of Parallel and Distributed Computing
Universal continuous routing strategies

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On the communication throughput of buffered multistage interconnection networks

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The performance of simple routing algorithms that drop packets

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
A lightweight idempotent messaging protocol for faulty networks

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees

ICPP '97 Proceedings of the international Conference on Parallel Processing
An Analytical Model of Duato's Fully-Adaptive Routing Algorithm in k-Ary n-Cubes

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
An Analytical Model of Fully-Adaptive Wormhole-Routed k-Ary n-Cubes in the Presence of Hot Spot Traffic

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Blue Gene: a vision for protein science using a petaflop supercomputer

IBM Systems Journal - Deep computing for the life sciences

Quantified Score

Hi-index	14.99

Visualization

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.