Virtual Time CSMA Protocols for Hard Real-Time Communication
IEEE Transactions on Software Engineering
Topological Properties of Hypercubes
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
A Window Protocol for Transmission of Time-Constrained Messages
IEEE Transactions on Computers
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Fast restoration of real-time communication service from component failures in multi-hop networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Fault recovery for guaranteed performance communications connections
IEEE/ACM Transactions on Networking (TON)
A new distributed route selection approach for channel establishment in real-time networks
IEEE/ACM Transactions on Networking (TON)
Fault-Tolerant Real-Time Communication in Distributed Computing Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
Achieving Fault-Tolerant Ordered Broadcasts in CAN
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Providing Differentiated Reliable Connections for Real Time Communication in Multihop Networks
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
A Segmented Backup Scheme for Dependable Real Time Communication in Multihop Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
INTERWORKING '00 Proceedings of the 5th IFIP TC6 International Symposium on Next Generation Networks, Networks and Services for the Information Society
Design and Evaluation of Routing Schemes for Dependable Real-Time Connections
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Performance Evaluation of Dependable Real-Time Communication with Elastic QoS
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Bandwidth Reallocation Techniques for Admitting High Priority Real-Time Calls in ATM Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Controlled shared backup strategy based on channel availability
International Journal of Computer Applications in Technology
Research note: A proactive backup scheme for reliable real-time transmission
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Reliable and timely delivery of messages between processing nodes is essential in distributed real-time systems. Failure to deliver a message within its deadline usually forces the system to undertake a recovery action, which introduces some cost (or overhead) to the system. This recovery cost can be very high, especially when the recovery action fails due to lack of time or resources.Proposed in this paper is a scheme to minimize the expected cost incurred as a result of messages failing to meet their deadlines. The scheme is intended for distributed real-time systems, especially with a point-to-point interconnection topology. The goal of minimizing the expected cost is achieved by sending multiple copies of a message through disjoint routes and thus increasing the probability of successful message delivery within the deadline. However, as the number of copies increases, the message traffic on the network increases, thereby increasing the delivery time for each of the copies. There is therefore a tradeoff between the number of copies of each message and the expected cost incurred as a result of messages missing their deadlines. The number of copies of each message to be sent is determined by optimizing this tradeoff. Simulation results for a hexagonal mesh and a hypercube topology indicate that the expected cost can be lowered substantially by the proposed scheme.