By Topic

A multiple copy approach for delivering messages under deadline constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ramanathan, P. ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA ; Shin, K.G.

A scheme to minimize the expected recovery cost incurred by a distributed real-time system as a result of messages failing to meet their deadline is proposed. The scheme is intended for distributed systems with point-to-point interconnection topology. The goal of minimizing the expected cost is achieved by sending multiple copies of a message through disjoint routes, thus increasing the probability of successful message delivery within the deadline. The number of copies of each message to be sent is determined by optimizing the tradeoff between the increase in the message traffic due to additional copies and the decrease in the probability of a message missing its deadline. The objective used to determine the optimal number of copies is formalized, and a numerical example is presented, showing that reductions of more than 70% can be achieved at low to moderate loads. At high loads the reductions are in the range of 10-40%.<>

Published in:

Fault-Tolerant Computing, 1991. FTCS-21. Digest of Papers., Twenty-First International Symposium

Date of Conference:

25-27 June 1991