skip to content
Aggressive transmissions over redundant paths for time critical messages Preview this item
ClosePreview this item
Checking...

Aggressive transmissions over redundant paths for time critical messages

Author: Benjamin Chi-Ming Kao; Hector Garcia-Molina; Daniel Barbara; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Dept. of Computer Science, Stanford University, ©1992.
Series: Report (Stanford University. Department of Computer Science), no. STAN-CS-92-1431.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "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 critical messages. One technique is to send a copy of a packet over an alternate path before it is know if the first copy failed or was delayed. A second technique is to split a single stream of  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Benjamin Chi-Ming Kao; Hector Garcia-Molina; Daniel Barbara; Stanford University. Computer Science Department.
OCLC Number: 38963545
Notes: "May 1992."
Description: 43 pages : illustrations ; 28 cm.
Series Title: Report (Stanford University. Department of Computer Science), no. STAN-CS-92-1431.
Responsibility: by B. Kao, H. Garcia-Molina, D. Barbara.

Abstract:

Abstract: "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 critical messages. One technique is to send a copy of a packet over an alternate path before it is know if 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."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/38963545>
library:oclcnum"38963545"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/38963545>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:contributor
schema:copyrightYear"1992"
schema:creator
schema:datePublished"1992"
schema:description"Abstract: "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 critical messages. One technique is to send a copy of a packet over an alternate path before it is know if 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.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/41708882>
schema:inLanguage"en"
schema:name"Aggressive transmissions over redundant paths for time critical messages"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.