AGGRESSIVE TRANSMISSIONS OF SHORT MESSAGES OVER REDUNDANT PATHS

被引：21

作者：

KAO, B ^{[1
]}

GARCIAMOLINA, H ^{[1
]}

BARBARA, D ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1994年 / 5卷 / 01期

关键词：

DEADLINES; FAULT-TOLERANT COMPUTING; PACKETS; REAL-TIME COMMUNICATIONS; REPLICATED TRANSMISSIONS;

D O I：

10.1109/71.262594

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Fault-tolerant computer systems have redundant paths connecting their components. Given these paths, it is possible to use aggressive techniques to reduce the average value and variability of the response time for short, critical messages. One technique is to send a copy of a packet over an alternate path before it is known whether the first copy failed or was delayed. A second technique is to split a single stream of packets over multiple paths. We analyze both approaches and show that they can provide significant improvements over conventional, conservative mechanisms.

引用

页码：102 / 109

页数：8

共 19 条

[11]

KUROSE JF, 1984, COMPUT SURV, V16, P43, DOI 10.1145/861.870

[12] THE MUTUAL EXCLUSION PROBLEM .2. STATEMENT AND SOLUTIONS [J].