Referenced Items are not available for this document.
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
Published in:
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Date of Conference: 13-16 Apr 1993
- Page(s):
- 757 - 761
- Meeting Date :
- 13 Apr 1993-16 Apr 1993
- Print ISBN:
- 0-8186-3442-1
- INSPEC Accession Number:
- 4590301
- Conference Location :
- Newport, CA
- Digital Object Identifier :
- 10.1109/IPPS.1993.262786
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
