Recovering guaranteed performance service connections from single and multiple faults

Banerjea, Anindo; Parris, Colin; Ferrari, Domenico

doi:10.1109/glocom.1994.513400

Cited by 33 publications

(15 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Banerjea [3,4] explored use of the reactive scheme to provide dependable communication service. The reactive scheme deals with failures only after their occurrence.…”

Section: Introductionmentioning

confidence: 99%

Improving Dependability of Real-Time Communication with Preplanned Backup Routes and Spare Resource Pool

Kim¹,

Shin²

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Timely recovery from network component failures is essential to the applications that require guaranteed-performance communication services. To achieve dependable communication, there have been several proposals that can be classified into two categories: reactive and proactive. The reactive approach tries to reroute traffic upon detection of a network link/node failure. This approach may suffer from contention and resource shortage when multiple connections need to be rerouted at the same time. The proactive approach, on the other hand, prepares a backup channel in advance that will be activated upon failure of the corresponding primary channel due to a broken link or node. The proactive approach, although it offers higher dependability, incurs higher routing overhead than the reactive approach. We propose a hybrid approach that reduces signaling overhead by decoupling backup routing from resource provisioning. We also propose an efficient backup routing algorithm for the hybrid approach. Our in-depth simulation results show that the proposed approach can achieve the ability of failure recovery comparable to the proactive scheme without the need for broadcasting the routing information.

show abstract

“…Banerjea [3,4] explored use of the reactive scheme to provide dependable communication service. The reactive scheme deals with failures only after their occurrence.…”

Section: Introductionmentioning

confidence: 99%

Improving Dependability of Real-Time Communication with Preplanned Backup Routes and Spare Resource Pool

Kim¹,

Shin²

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Most protocols used for data networking (as opposed to telephony), for example, include some redun- Prompted by the increasing reliance on high-speed communications and the requirement that these communications be robust to failures, backbone networks have generally adopted self-healing strategies to automatically restore functionality. The study of self-healing networks is often classified according to the following three criteria (see [BPF94a,Dov91], for instance) the use of link For path recovery, when a failure leaves a node disconnected from the primary route, a back-up route, which may or may not share nodes and links with the primary route, is used. Link rerouting usually refers to the replacement of a link by links connecting the two end nodes of the failed link.…”

mentioning

confidence: 99%

Network Reliability and Fault Tolerance

Médard

Lumetta

2003

Wiley Encyclopedia of Telecommunications

View full text Add to dashboard Cite

This article introduces fundamental concepts in fault tolerance and reliability as applied to networks, with a focus on high‐speed backbone networks. We first introduce basic terminology and elements necessary to fault tolerance, then describe the basic strategies for detecting and handling failures in networks. The discussion then builds on these basics to illustrate recovery schemes for high‐speed backbone networks. An examination of the relationship between network topologies and recovery strategies follows, beginning with rings and then covering more general mesh networks. We cover some basic techniques used in packet‐switched networks, and conclude with a discussion of local‐area network approaches to fault tolerance.

show abstract

“…Any opinions, findings, and recommendations expressed in this publication are those of the authors, and do not necessarily reflect the views of the funding agencies. A portion of this paper was presented at the 22nd International Symposium on Fault Tolerant Computing, Boston, Massachusetts, July [8][9][10] 1992.…”

Section: Acknowledgmentmentioning

confidence: 99%

Fault-tolerant real-time communication in distributed computing systems

Qin

Shin

[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing

View full text Add to dashboard Cite

Abstract-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.Index Terms-Real-time fault-tolerant communications, point-to-point packet switching networks, deadline scheduling, singlefailure-immune (SFI) networks.

show abstract

Recovering guaranteed performance service connections from single and multiple faults

Cited by 33 publications

References 13 publications

Improving Dependability of Real-Time Communication with Preplanned Backup Routes and Spare Resource Pool

Improving Dependability of Real-Time Communication with Preplanned Backup Routes and Spare Resource Pool

Network Reliability and Fault Tolerance

Fault-tolerant real-time communication in distributed computing systems

Contact Info

Product

Resources

About