Abstract
An effective failure-detection scheme is essential for reliable communication services. Most computer network rely on behavior-based detection schemes: each node uses heartbeats to detect the failure of its neighbor nodes, and the transport protocol (like TCP) achieves reliable communication by acknowledgment/retransmission. In this paper, we experimentally evaluate the effectiveness of such behavior-based detection schemes in real-time communication. Specifically, we measure and analyze the coverage and latency of two failure-detection schemes-neighbor detection and end-to-end detection-through fault-injection experiments. The experimental results have shown that a significant portion of failures can be detected very quickly by the neighbor detection scheme, while the end-to-end detection scheme uncovers the remaining failures with larger detection latencies.
| Original language | English |
|---|---|
| Title of host publication | Digest of Papers - 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 122-131 |
| Number of pages | 10 |
| ISBN (Electronic) | 0818678313, 9780818678318 |
| DOIs | |
| Publication status | Published - 1997 Jan 1 |
| Event | 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997 - Seattle, United States Duration: 1997 Jun 24 → 1997 Jun 27 |
Publication series
| Name | Digest of Papers - 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997 |
|---|
Other
| Other | 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997 |
|---|---|
| Country | United States |
| City | Seattle |
| Period | 97/6/24 → 97/6/27 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Hardware and Architecture
- Software
- Safety, Risk, Reliability and Quality
Cite this
}
Experimental evaluation of failure-detection schemes in real-time communication networks. / Han, Seungjae; Shin, Kang G.
Digest of Papers - 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997. Institute of Electrical and Electronics Engineers Inc., 1997. p. 122-131 614085 (Digest of Papers - 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Experimental evaluation of failure-detection schemes in real-time communication networks
AU - Han, Seungjae
AU - Shin, Kang G.
PY - 1997/1/1
Y1 - 1997/1/1
N2 - An effective failure-detection scheme is essential for reliable communication services. Most computer network rely on behavior-based detection schemes: each node uses heartbeats to detect the failure of its neighbor nodes, and the transport protocol (like TCP) achieves reliable communication by acknowledgment/retransmission. In this paper, we experimentally evaluate the effectiveness of such behavior-based detection schemes in real-time communication. Specifically, we measure and analyze the coverage and latency of two failure-detection schemes-neighbor detection and end-to-end detection-through fault-injection experiments. The experimental results have shown that a significant portion of failures can be detected very quickly by the neighbor detection scheme, while the end-to-end detection scheme uncovers the remaining failures with larger detection latencies.
AB - An effective failure-detection scheme is essential for reliable communication services. Most computer network rely on behavior-based detection schemes: each node uses heartbeats to detect the failure of its neighbor nodes, and the transport protocol (like TCP) achieves reliable communication by acknowledgment/retransmission. In this paper, we experimentally evaluate the effectiveness of such behavior-based detection schemes in real-time communication. Specifically, we measure and analyze the coverage and latency of two failure-detection schemes-neighbor detection and end-to-end detection-through fault-injection experiments. The experimental results have shown that a significant portion of failures can be detected very quickly by the neighbor detection scheme, while the end-to-end detection scheme uncovers the remaining failures with larger detection latencies.
UR - http://www.scopus.com/inward/record.url?scp=85015234855&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015234855&partnerID=8YFLogxK
U2 - 10.1109/FTCS.1997.614085
DO - 10.1109/FTCS.1997.614085
M3 - Conference contribution
T3 - Digest of Papers - 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997
SP - 122
EP - 131
BT - Digest of Papers - 27th Annual International Symposium on Fault-Tolerant Computing, FTCS 1997
PB - Institute of Electrical and Electronics Engineers Inc.
ER -