Buffer Occupancy and Delivery Reliability Tradeoffs for Epidemic Routing

To achieve end-to-end delivery in intermittently connected networks, epidemic routing is proposed for data delivery at the price of excessive buffer occupancy due to its store-and-forward nature. The ultimate goal of epidemic routing protocol design is to reduce system resource usage (e.g., buffer o...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-01
Main Authors: Pin-Yu, Chen, Meng-Hsuan Sung, Shin-Ming, Cheng
Format: Article
Language:English
Subjects:
Buffers
Epidemics
Occupancy
Reliability
Service introduction
Tradeoffs
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Pin-Yu, Chen
Meng-Hsuan Sung
Shin-Ming, Cheng
description To achieve end-to-end delivery in intermittently connected networks, epidemic routing is proposed for data delivery at the price of excessive buffer occupancy due to its store-and-forward nature. The ultimate goal of epidemic routing protocol design is to reduce system resource usage (e.g., buffer occupancy) while simultaneously providing data delivery with statistical guarantee. Therefore the tradeoffs between buffer occupancy and data delivery reliability are of utmost importance. In this paper we investigate the tradeoffs for two representative schemes: the global timeout scheme and the antipacket dissemination scheme that are proposed for lossy and lossless data delivery, respectively. For lossy data delivery, we show that with the suggested global timeout value, the per-node buffer occupancy only depends on the maximum tolerable packet loss rate and pairwise meeting rate. For lossless data delivery, we show that the buffer occupancy can be significantly reduced via fully antipacket dissemination. The developed tools therefore offer new insights for epidemic routing protocol designs and performance evaluations.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2077067061</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2077067061</sourcerecordid><originalsourceid>FETCH-proquest_journals_20770670613</originalsourceid><addsrcrecordid>eNqNitEKgjAYRkcQJOU7_NC1MLfUrivDu0C8lzn_xcQ221zg2-dFDxB8cA6cb0MixnmanE-M7Ujs_UApZXnBsoxHpLoEpdDBQ8owCSMXEKaHG476g26BehXR6VHPCzRO9GiV8qCsg3LSPb60hNqGWZvngWyVGD3GP-7J8V421yqZnH0H9HM72ODMmlpGi4Lm61L-3-sLOJI78g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2077067061</pqid></control><display><type>article</type><title>Buffer Occupancy and Delivery Reliability Tradeoffs for Epidemic Routing</title><source>Publicly Available Content Database</source><creator>Pin-Yu, Chen ; Meng-Hsuan Sung ; Shin-Ming, Cheng</creator><creatorcontrib>Pin-Yu, Chen ; Meng-Hsuan Sung ; Shin-Ming, Cheng</creatorcontrib><description>To achieve end-to-end delivery in intermittently connected networks, epidemic routing is proposed for data delivery at the price of excessive buffer occupancy due to its store-and-forward nature. The ultimate goal of epidemic routing protocol design is to reduce system resource usage (e.g., buffer occupancy) while simultaneously providing data delivery with statistical guarantee. Therefore the tradeoffs between buffer occupancy and data delivery reliability are of utmost importance. In this paper we investigate the tradeoffs for two representative schemes: the global timeout scheme and the antipacket dissemination scheme that are proposed for lossy and lossless data delivery, respectively. For lossy data delivery, we show that with the suggested global timeout value, the per-node buffer occupancy only depends on the maximum tolerable packet loss rate and pairwise meeting rate. For lossless data delivery, we show that the buffer occupancy can be significantly reduced via fully antipacket dissemination. The developed tools therefore offer new insights for epidemic routing protocol designs and performance evaluations.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Buffers ; Epidemics ; Occupancy ; Reliability ; Service introduction ; Tradeoffs</subject><ispartof>arXiv.org, 2016-01</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2077067061?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25732,36991,44569</link.rule.ids></links><search><creatorcontrib>Pin-Yu, Chen</creatorcontrib><creatorcontrib>Meng-Hsuan Sung</creatorcontrib><creatorcontrib>Shin-Ming, Cheng</creatorcontrib><title>Buffer Occupancy and Delivery Reliability Tradeoffs for Epidemic Routing</title><title>arXiv.org</title><description>To achieve end-to-end delivery in intermittently connected networks, epidemic routing is proposed for data delivery at the price of excessive buffer occupancy due to its store-and-forward nature. The ultimate goal of epidemic routing protocol design is to reduce system resource usage (e.g., buffer occupancy) while simultaneously providing data delivery with statistical guarantee. Therefore the tradeoffs between buffer occupancy and data delivery reliability are of utmost importance. In this paper we investigate the tradeoffs for two representative schemes: the global timeout scheme and the antipacket dissemination scheme that are proposed for lossy and lossless data delivery, respectively. For lossy data delivery, we show that with the suggested global timeout value, the per-node buffer occupancy only depends on the maximum tolerable packet loss rate and pairwise meeting rate. For lossless data delivery, we show that the buffer occupancy can be significantly reduced via fully antipacket dissemination. The developed tools therefore offer new insights for epidemic routing protocol designs and performance evaluations.</description><subject>Buffers</subject><subject>Epidemics</subject><subject>Occupancy</subject><subject>Reliability</subject><subject>Service introduction</subject><subject>Tradeoffs</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNitEKgjAYRkcQJOU7_NC1MLfUrivDu0C8lzn_xcQ221zg2-dFDxB8cA6cb0MixnmanE-M7Ujs_UApZXnBsoxHpLoEpdDBQ8owCSMXEKaHG476g26BehXR6VHPCzRO9GiV8qCsg3LSPb60hNqGWZvngWyVGD3GP-7J8V421yqZnH0H9HM72ODMmlpGi4Lm61L-3-sLOJI78g</recordid><startdate>20160124</startdate><enddate>20160124</enddate><creator>Pin-Yu, Chen</creator><creator>Meng-Hsuan Sung</creator><creator>Shin-Ming, Cheng</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160124</creationdate><title>Buffer Occupancy and Delivery Reliability Tradeoffs for Epidemic Routing</title><author>Pin-Yu, Chen ; Meng-Hsuan Sung ; Shin-Ming, Cheng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20770670613</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Buffers</topic><topic>Epidemics</topic><topic>Occupancy</topic><topic>Reliability</topic><topic>Service introduction</topic><topic>Tradeoffs</topic><toplevel>online_resources</toplevel><creatorcontrib>Pin-Yu, Chen</creatorcontrib><creatorcontrib>Meng-Hsuan Sung</creatorcontrib><creatorcontrib>Shin-Ming, Cheng</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pin-Yu, Chen</au><au>Meng-Hsuan Sung</au><au>Shin-Ming, Cheng</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Buffer Occupancy and Delivery Reliability Tradeoffs for Epidemic Routing</atitle><jtitle>arXiv.org</jtitle><date>2016-01-24</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>To achieve end-to-end delivery in intermittently connected networks, epidemic routing is proposed for data delivery at the price of excessive buffer occupancy due to its store-and-forward nature. The ultimate goal of epidemic routing protocol design is to reduce system resource usage (e.g., buffer occupancy) while simultaneously providing data delivery with statistical guarantee. Therefore the tradeoffs between buffer occupancy and data delivery reliability are of utmost importance. In this paper we investigate the tradeoffs for two representative schemes: the global timeout scheme and the antipacket dissemination scheme that are proposed for lossy and lossless data delivery, respectively. For lossy data delivery, we show that with the suggested global timeout value, the per-node buffer occupancy only depends on the maximum tolerable packet loss rate and pairwise meeting rate. For lossless data delivery, we show that the buffer occupancy can be significantly reduced via fully antipacket dissemination. The developed tools therefore offer new insights for epidemic routing protocol designs and performance evaluations.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2016-01
issn 2331-8422
language eng
recordid cdi_proquest_journals_2077067061
source Publicly Available Content Database
subjects Buffers
Epidemics
Occupancy
Reliability
Service introduction
Tradeoffs
title Buffer Occupancy and Delivery Reliability Tradeoffs for Epidemic Routing
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T22%3A57%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Buffer%20Occupancy%20and%20Delivery%20Reliability%20Tradeoffs%20for%20Epidemic%20Routing&rft.jtitle=arXiv.org&rft.au=Pin-Yu,%20Chen&rft.date=2016-01-24&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2077067061%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20770670613%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2077067061&rft_id=info:pmid/&rfr_iscdi=true