A scheme for reliable real-time messaging with bounded delays

• Published in: Software, practice & experience practice & experience, 2011-11, Vol.41 (12), p.1387-1407
• Main Authors: Kim, Kwang-Hae (Kane), Qian, Jing, Zhang, Zhen, Zhou, Qian, Moon, Kyung-Deok, Park, Jun-Hee, Park, Kwang-Roh, Kim, Doo-Hyun
• Format: Article
• Language: English
• Subjects: Clock synchronization; Computer programs; Delay; delay bound; detection/reaction latency; message loss; Messages; Performance measurement; Prototypes; Real time; real-time messaging; Recovery; reliable messaging
• ISSN: 0038-0644; 1097-024X; 1097-024X
• DOI: 10.1002/spe.1107

SUMMARY Network‐based real‐time computing applications that require tightly bounded end‐to‐end delays have been increasing at a steady rate in recent years. A messaging layer that yields tight bounds on the latencies in detecting message losses and enables the application layer to initiate a timely recovery action has thus become highly desirable. In this paper, we present a new reliable real‐time messaging scheme called the Delay‐Bounded Reliable Messaging Scheme (DB‐RMS) that is aimed at meeting such requirements. It is built on top of the User Datagram Protocol sub‐layer. DB‐RMS provides multiple service options, each with different fault detection/recovery capabilities and different costs in terms of the execution overhead. This feature makes DB‐RMS suitable for a variety of applications. In this paper, the DB‐RMS service options and the corresponding support protocols are presented first followed by a formal analysis on the detection and reaction latency bounds under various service options. A messaging layer prototype using DB‐RMS has been implemented. To demonstrate the practice of the DB‐RMS, we implemented a clock synchronization algorithm for 802.11 wireless local area networks on top of the DB‐RMS messaging layer. Performance measurements of the prototype implementation have been taken, and the positive results obtained are also presented. Copyright © 2011 John Wiley & Sons, Ltd.