Stability and average delay in delay tolerant networks with Poisson packet arrivals and buffered relay nodes

IF 1 4区 计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Vineeth B.S. , Chandramani Singh
{"title":"Stability and average delay in delay tolerant networks with Poisson packet arrivals and buffered relay nodes","authors":"Vineeth B.S. ,&nbsp;Chandramani Singh","doi":"10.1016/j.peva.2022.102319","DOIUrl":null,"url":null,"abstract":"<div><p><span><span>We consider a single-source single-destination delay tolerant network (DTN) with Poisson </span>packet arrivals. The source uses a store and forward protocol which makes multiple copies of a packet to relays which buffer them until delivery to the destination. We characterize the stability threshold, defined as the maximum value of </span>arrival rate<span><span><span> for which the source has finite average queue length, as a function of number of relays, relay contact rate, relay packet buffer capacity, and number of packet copies. We analyse DTNs without </span>packet delivery feedback and with instantaneous feedback. For DTNs without packet delivery feedback, we obtain a non-asymptotic analytical stability threshold and show that it only doubles as the relay-buffer capacity increases from one to infinity. For DTNs with instantaneous packet delivery feedback, we characterize the stability threshold using simulations. We also present an analytical </span>approximation<span> for the stability threshold in the case of unit relay-buffer capacity, and show that it is approximately double of that without feedback for large number of packet copies and relays. For DTNs with and without feedback, we also study the average delay performance through simulations. We obtain analytical approximations for the average delays of the packets for DTNs without feedback. We observe that the last-in-first-out relay to destination packet transmission policy has the minimum delay.</span></span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance Evaluation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S016653162200027X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a single-source single-destination delay tolerant network (DTN) with Poisson packet arrivals. The source uses a store and forward protocol which makes multiple copies of a packet to relays which buffer them until delivery to the destination. We characterize the stability threshold, defined as the maximum value of arrival rate for which the source has finite average queue length, as a function of number of relays, relay contact rate, relay packet buffer capacity, and number of packet copies. We analyse DTNs without packet delivery feedback and with instantaneous feedback. For DTNs without packet delivery feedback, we obtain a non-asymptotic analytical stability threshold and show that it only doubles as the relay-buffer capacity increases from one to infinity. For DTNs with instantaneous packet delivery feedback, we characterize the stability threshold using simulations. We also present an analytical approximation for the stability threshold in the case of unit relay-buffer capacity, and show that it is approximately double of that without feedback for large number of packet copies and relays. For DTNs with and without feedback, we also study the average delay performance through simulations. We obtain analytical approximations for the average delays of the packets for DTNs without feedback. We observe that the last-in-first-out relay to destination packet transmission policy has the minimum delay.

具有泊松包到达和缓冲中继节点的时延容忍网络的稳定性和平均时延
考虑一个具有泊松包到达的单源单目的容错延迟网络(DTN)。源使用存储和转发协议,该协议将数据包的多个副本发送给中继器,中继器缓冲它们,直到发送到目的地。我们将稳定性阈值定义为源具有有限平均队列长度时到达率的最大值,作为中继数量、中继接触率、中继数据包缓冲容量和数据包副本数量的函数。我们分析了没有分组传递反馈和有瞬时反馈的dtn。对于没有分组传递反馈的ddn,我们得到了一个非渐近的解析稳定性阈值,并且表明它只在中继缓冲容量从1增加到无穷大时加倍。对于具有瞬时数据包传递反馈的dtn,我们使用仿真来表征稳定性阈值。我们还给出了单位中继缓冲容量情况下的稳定性阈值的解析近似,并表明对于大量数据包副本和中继,其稳定性阈值大约是无反馈情况下的两倍。对于有反馈和无反馈的ddn,我们还通过仿真研究了平均延迟性能。我们得到了无反馈ddn的分组平均延迟的解析近似。我们观察到后进先出中继到目的数据包传输策略具有最小的延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Performance Evaluation
Performance Evaluation 工程技术-计算机:理论方法
CiteScore
3.10
自引率
0.00%
发文量
20
审稿时长
24 days
期刊介绍: Performance Evaluation functions as a leading journal in the area of modeling, measurement, and evaluation of performance aspects of computing and communication systems. As such, it aims to present a balanced and complete view of the entire Performance Evaluation profession. Hence, the journal is interested in papers that focus on one or more of the following dimensions: -Define new performance evaluation tools, including measurement and monitoring tools as well as modeling and analytic techniques -Provide new insights into the performance of computing and communication systems -Introduce new application areas where performance evaluation tools can play an important role and creative new uses for performance evaluation tools. More specifically, common application areas of interest include the performance of: -Resource allocation and control methods and algorithms (e.g. routing and flow control in networks, bandwidth allocation, processor scheduling, memory management) -System architecture, design and implementation -Cognitive radio -VANETs -Social networks and media -Energy efficient ICT -Energy harvesting -Data centers -Data centric networks -System reliability -System tuning and capacity planning -Wireless and sensor networks -Autonomic and self-organizing systems -Embedded systems -Network science
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信