File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Aggressive transmissions of short messages over redundant paths

TitleAggressive transmissions of short messages over redundant paths
Authors
KeywordsDeadlines
fault-tolerant computing
packets
real-time communications
replicated transmissions
Issue Date1994
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 1994, v. 5 n. 1, p. 102-109 How to Cite?
AbstractFault-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.
Persistent Identifierhttp://hdl.handle.net/10722/89074
ISSN
2021 Impact Factor: 3.757
2020 SCImago Journal Rankings: 0.760
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorKao, Benen_HK
dc.contributor.authorGarciaMolina, Hectoren_HK
dc.contributor.authorBarbara, Danielen_HK
dc.date.accessioned2010-09-06T09:52:04Z-
dc.date.available2010-09-06T09:52:04Z-
dc.date.issued1994en_HK
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 1994, v. 5 n. 1, p. 102-109en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89074-
dc.description.abstractFault-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.en_HK
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_HK
dc.rights©1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectDeadlines-
dc.subjectfault-tolerant computing-
dc.subjectpackets-
dc.subjectreal-time communications-
dc.subjectreplicated transmissions-
dc.titleAggressive transmissions of short messages over redundant pathsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1045-9219&volume=5 No 1&spage=&epage=&date=1994&atitle=Aggressive+Transmissions+of+Short+Messages+over+Redundant+Pathsen_HK
dc.identifier.emailKao, Ben:kao@cs.hku.hken_HK
dc.identifier.authorityKao, Ben=rp00123en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/71.262594en_HK
dc.identifier.scopuseid_2-s2.0-0028196266en_HK
dc.identifier.hkuros31108en_HK
dc.identifier.volume5en_HK
dc.identifier.issue1en_HK
dc.identifier.spage102en_HK
dc.identifier.epage109en_HK
dc.identifier.isiWOS:A1994MW89100011-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridKao, Ben=35221592600en_HK
dc.identifier.scopusauthoridGarciaMolina, Hector=7005594983en_HK
dc.identifier.scopusauthoridBarbara, Daniel=7004629198en_HK
dc.identifier.issnl1045-9219-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats