Aggressive transmissions over redundant paths for time critical messages:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1431 |
| Schlagwörter: | |
| 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." |
| Umfang: | XI, 43 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008874 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1992 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)38963545 | ||
| 035 | |a (DE-599)BVBBV009008874 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 050 | 0 | |a TK5105.3 | |
| 082 | 0 | |a 004.6/6 |2 21 | |
| 100 | 1 | |a Kao, Ben |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Aggressive transmissions over redundant paths for time critical messages |c by B. Kao ; H. Garcia-Molina ; D. Barbara |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a XI, 43 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1431 | |
| 520 | 3 | |a 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." | |
| 650 | 4 | |a Local area networks (Computer networks) | |
| 650 | 4 | |a Packet switching (Data transmission) | |
| 700 | 1 | |a Garcia-Molina, Hector |e Verfasser |4 aut | |
| 700 | 1 | |a Barbará, Daniel |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1431 |w (DE-604)BV008928280 |9 1431 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005955340 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6115-1431 |
|---|---|
| DE-BY-TUM_katkey | 1691588 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010283384 |
| _version_ | 1821933667043246080 |
| any_adam_object | |
| author | Kao, Ben Garcia-Molina, Hector Barbará, Daniel |
| author_facet | Kao, Ben Garcia-Molina, Hector Barbará, Daniel |
| author_role | aut aut aut |
| author_sort | Kao, Ben |
| author_variant | b k bk h g m hgm d b db |
| building | Verbundindex |
| bvnumber | BV009008874 |
| callnumber-first | T - Technology |
| callnumber-label | TK5105 |
| callnumber-raw | TK5105.3 |
| callnumber-search | TK5105.3 |
| callnumber-sort | TK 45105.3 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| ctrlnum | (OCoLC)38963545 (DE-599)BVBBV009008874 |
| dewey-full | 004.6/6 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6/6 |
| dewey-search | 004.6/6 |
| dewey-sort | 14.6 16 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01766nam a2200349 cb4500</leader><controlfield tag="001">BV009008874</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1992 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38963545</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008874</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5105.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6/6</subfield><subfield code="2">21</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kao, Ben</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Aggressive transmissions over redundant paths for time critical messages</subfield><subfield code="c">by B. Kao ; H. Garcia-Molina ; D. Barbara</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 43 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1431</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Local area networks (Computer networks)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packet switching (Data transmission)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Garcia-Molina, Hector</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Barbará, Daniel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1431</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1431</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955340</subfield></datafield></record></collection> |
| id | DE-604.BV009008874 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:30:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955340 |
| oclc_num | 38963545 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | XI, 43 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spellingShingle | Kao, Ben Garcia-Molina, Hector Barbará, Daniel Aggressive transmissions over redundant paths for time critical messages Local area networks (Computer networks) Packet switching (Data transmission) |
| title | Aggressive transmissions over redundant paths for time critical messages |
| title_auth | Aggressive transmissions over redundant paths for time critical messages |
| title_exact_search | Aggressive transmissions over redundant paths for time critical messages |
| title_full | Aggressive transmissions over redundant paths for time critical messages by B. Kao ; H. Garcia-Molina ; D. Barbara |
| title_fullStr | Aggressive transmissions over redundant paths for time critical messages by B. Kao ; H. Garcia-Molina ; D. Barbara |
| title_full_unstemmed | Aggressive transmissions over redundant paths for time critical messages by B. Kao ; H. Garcia-Molina ; D. Barbara |
| title_short | Aggressive transmissions over redundant paths for time critical messages |
| title_sort | aggressive transmissions over redundant paths for time critical messages |
| topic | Local area networks (Computer networks) Packet switching (Data transmission) |
| topic_facet | Local area networks (Computer networks) Packet switching (Data transmission) |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT kaoben aggressivetransmissionsoverredundantpathsfortimecriticalmessages AT garciamolinahector aggressivetransmissionsoverredundantpathsfortimecriticalmessages AT barbaradaniel aggressivetransmissionsoverredundantpathsfortimecriticalmessages |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6115-1431 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |