Delivery of time-critical messages using a multiple copy approach
ACM Transactions on Computer Systems (TOCS)
Internetworking with TCP/IP (2nd ed.), vol. I
Internetworking with TCP/IP (2nd ed.), vol. I
A router architecture for real-time point-to-point networks
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Simulation study of the capacity effects of dispersity routing for fault tolerant realtime channels
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
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
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Aggressive Transmissions of Short Messages Over Redundant Paths
IEEE Transactions on Parallel and Distributed Systems
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant real-time communication in FDDI-based networks
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Survivable virtual network embedding
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
| Hi-index | 0.00 |
The delivery delay in a point-to-point packet switching network is difficult to control due to the contention among randomly-arriving packets at each node and multihops a packet must travel between its source and destination. Despite this difficulty, there are an increasing number of applications that require packets to be delivered reliably within prespecified delay bounds. This paper shows how this can be achieved by using real-time channels which make "soft" reservation of network resources to ensure the timely delivery of real-time packets. We first present theoretical results and detailed procedures for the establishment of real-time channels and then show how the basic real-time channels can be enhanced to be fault-tolerant using the multiple disjoint paths between a pair of communicating nodes. The contribution of the former is a tighter schedulability condition which makes more efficient use of network resources than any other existing approaches, and that of the latter is a significant improvement in fault tolerance over the basic real-time channel, which is inherently susceptible to component failures.