A dynamic multiple copy approach for message passing in a virtual cut-through environment

The paper proposes a scheme where nodes adaptively send multiple copies of time-critical messages to increase the probability of their timely delivery. A message is replicated only when the time remaining to its deadline is below a pre-computed threshold. An off-line algorithm for computing the number of copies and the deadline thresholds is presented. Simulation results indicate that the reductions in the expected cost due to missed deadlines are substantial as a result of using the proposed scheme.<<ETX>>

[1]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[2]  Ariel Orda,et al.  Routing with packet duplication and elimination in computer networks , 1988, IEEE Trans. Commun..

[3]  Hector Garcia-Molina,et al.  Aggressive transmissions over redundant paths , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[4]  Kang G. Shin,et al.  A multiple copy approach for delivering messages under deadline constraints , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.

[5]  Parameswaran Ramanathan,et al.  Delivery of time-critical messages using a multiple copy approach , 1992, TOCS.

[6]  Kang G. Shin.  HARTS: A Distributed Real-Time Architecture , 1991, Computer.

[7]  Ming-Syan Chen,et al.  Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors , 1990, IEEE Trans. Computers.