{"title":"Stability and average delay in delay tolerant networks with Poisson packet arrivals and buffered relay nodes","authors":"Vineeth B.S. , 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":"157 ","pages":"Article 102319"},"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.
期刊介绍:
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