Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks
End-to-end communication over the network layer (or data link in overlay networks) is one of the most important communication tasks in every communication network, including legacy communication networks as well as mobile ad hoc networks, peer-to-peer networks, and mesh networks. Reliable end-to-end...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Dolev, Shlomi Hanemann, Ariel Schiller, Elad Micahel Sharma, Shantanu |
| description | End-to-end communication over the network layer (or data link in overlay
networks) is one of the most important communication tasks in every
communication network, including legacy communication networks as well as
mobile ad hoc networks, peer-to-peer networks, and mesh networks. Reliable
end-to-end communications are based on Automatic Repeat reQuest (ARQ)
algorithms for dealing with packet failures, such as packet drops. We study ARQ
algorithms that exchange packets to deliver (high level) messages in
first-in-first-out (FIFO) order without omissions or duplications. We present a
self-stabilizing ARQ algorithm that can be applied to networks of bounded
capacity that are prone to packet loss, duplication, and reordering. Our
analysis considers Lamport's happened-before relation when demonstrating
stabilization without assuming the presence of a fair scheduler. It shows that
the length of the longest chain of Lamport's happened-before relation is 8 for
any system run. |
| doi_str_mv | 10.48550/arxiv.2006.05901 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2006_05901</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2006_05901</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-77123bc3efe757f6eb1d136cc3b72a9ff4904b10166a6ecbddcab1685cb0004a3</originalsourceid><addsrcrecordid>eNotkDtPwzAYALMwoMIPYMIjSE2w87CbMQRSKlVEot2jz69ikcTBcYCy8c9pC9PplhsuCK4IjtJFluE7cF_mI4oxphHOckzOg5-NanW48cBNa75Nv0PF5G0H3gj0ogYF_oD3SY0eFe3OOuNfuxFp69DNvZ16qSQqYQBh_H6O6s54f2jM0cM0tEbAURD0EvW2D6tVVd-i0nbD5JVDz8p_Wvc2XgRnGtpRXf5zFmyrx235FK7r5aos1iFQRkLGSJxwkSitWMY0VZxIklAhEs5iyLVOc5xyggmlQJXgUgrghC4ywTHGKSSz4Pove3rQDM504PbN8UVzepH8AmvsW5U</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks</title><source>arXiv.org</source><creator>Dolev, Shlomi ; Hanemann, Ariel ; Schiller, Elad Micahel ; Sharma, Shantanu</creator><creatorcontrib>Dolev, Shlomi ; Hanemann, Ariel ; Schiller, Elad Micahel ; Sharma, Shantanu</creatorcontrib><description>End-to-end communication over the network layer (or data link in overlay
networks) is one of the most important communication tasks in every
communication network, including legacy communication networks as well as
mobile ad hoc networks, peer-to-peer networks, and mesh networks. Reliable
end-to-end communications are based on Automatic Repeat reQuest (ARQ)
algorithms for dealing with packet failures, such as packet drops. We study ARQ
algorithms that exchange packets to deliver (high level) messages in
first-in-first-out (FIFO) order without omissions or duplications. We present a
self-stabilizing ARQ algorithm that can be applied to networks of bounded
capacity that are prone to packet loss, duplication, and reordering. Our
analysis considers Lamport's happened-before relation when demonstrating
stabilization without assuming the presence of a fair scheduler. It shows that
the length of the longest chain of Lamport's happened-before relation is 8 for
any system run.</description><identifier>DOI: 10.48550/arxiv.2006.05901</identifier><language>eng</language><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><creationdate>2020-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2006.05901$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2006.05901$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Dolev, Shlomi</creatorcontrib><creatorcontrib>Hanemann, Ariel</creatorcontrib><creatorcontrib>Schiller, Elad Micahel</creatorcontrib><creatorcontrib>Sharma, Shantanu</creatorcontrib><title>Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks</title><description>End-to-end communication over the network layer (or data link in overlay
networks) is one of the most important communication tasks in every
communication network, including legacy communication networks as well as
mobile ad hoc networks, peer-to-peer networks, and mesh networks. Reliable
end-to-end communications are based on Automatic Repeat reQuest (ARQ)
algorithms for dealing with packet failures, such as packet drops. We study ARQ
algorithms that exchange packets to deliver (high level) messages in
first-in-first-out (FIFO) order without omissions or duplications. We present a
self-stabilizing ARQ algorithm that can be applied to networks of bounded
capacity that are prone to packet loss, duplication, and reordering. Our
analysis considers Lamport's happened-before relation when demonstrating
stabilization without assuming the presence of a fair scheduler. It shows that
the length of the longest chain of Lamport's happened-before relation is 8 for
any system run.</description><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotkDtPwzAYALMwoMIPYMIjSE2w87CbMQRSKlVEot2jz69ikcTBcYCy8c9pC9PplhsuCK4IjtJFluE7cF_mI4oxphHOckzOg5-NanW48cBNa75Nv0PF5G0H3gj0ogYF_oD3SY0eFe3OOuNfuxFp69DNvZ16qSQqYQBh_H6O6s54f2jM0cM0tEbAURD0EvW2D6tVVd-i0nbD5JVDz8p_Wvc2XgRnGtpRXf5zFmyrx235FK7r5aos1iFQRkLGSJxwkSitWMY0VZxIklAhEs5iyLVOc5xyggmlQJXgUgrghC4ywTHGKSSz4Pove3rQDM504PbN8UVzepH8AmvsW5U</recordid><startdate>20200610</startdate><enddate>20200610</enddate><creator>Dolev, Shlomi</creator><creator>Hanemann, Ariel</creator><creator>Schiller, Elad Micahel</creator><creator>Sharma, Shantanu</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20200610</creationdate><title>Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks</title><author>Dolev, Shlomi ; Hanemann, Ariel ; Schiller, Elad Micahel ; Sharma, Shantanu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-77123bc3efe757f6eb1d136cc3b72a9ff4904b10166a6ecbddcab1685cb0004a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Distributed, Parallel, and Cluster Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Dolev, Shlomi</creatorcontrib><creatorcontrib>Hanemann, Ariel</creatorcontrib><creatorcontrib>Schiller, Elad Micahel</creatorcontrib><creatorcontrib>Sharma, Shantanu</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dolev, Shlomi</au><au>Hanemann, Ariel</au><au>Schiller, Elad Micahel</au><au>Sharma, Shantanu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks</atitle><date>2020-06-10</date><risdate>2020</risdate><abstract>End-to-end communication over the network layer (or data link in overlay
networks) is one of the most important communication tasks in every
communication network, including legacy communication networks as well as
mobile ad hoc networks, peer-to-peer networks, and mesh networks. Reliable
end-to-end communications are based on Automatic Repeat reQuest (ARQ)
algorithms for dealing with packet failures, such as packet drops. We study ARQ
algorithms that exchange packets to deliver (high level) messages in
first-in-first-out (FIFO) order without omissions or duplications. We present a
self-stabilizing ARQ algorithm that can be applied to networks of bounded
capacity that are prone to packet loss, duplication, and reordering. Our
analysis considers Lamport's happened-before relation when demonstrating
stabilization without assuming the presence of a fair scheduler. It shows that
the length of the longest chain of Lamport's happened-before relation is 8 for
any system run.</abstract><doi>10.48550/arxiv.2006.05901</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2006.05901 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2006_05901 |
| source | arXiv.org |
| subjects | Computer Science - Distributed, Parallel, and Cluster Computing |
| title | Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T20%3A46%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Self-Stabilizing%20Automatic%20Repeat%20Request%20Algorithms%20for%20(Bounded%20Capacity,%20Omitting,%20Duplicating%20and%20non-FIFO)%20Computer%20Networks&rft.au=Dolev,%20Shlomi&rft.date=2020-06-10&rft_id=info:doi/10.48550/arxiv.2006.05901&rft_dat=%3Carxiv_GOX%3E2006_05901%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |