Abstract
Relay nodes in an ad hoc network can be modelled as fluid queues, in which the available service capacity is shared by the input and output. In this paper such a relay node is considered; jobs arrive according to a Poisson process and bring along a random amount of work. The total transmission capacity is fairly shared, meaning that, when n jobs are present, each job transmits traffic into the queue at rate 1/(n + 1) while the queue is drained at the same rate of 1/(n + 1). Where previous studies mainly concentrated on the case of exponentially distributed job sizes, the present paper addresses regularly varying jobs. The focus lies on the tail asymptotics of the sojourn time S. Using sample-path arguments, it is proven that \({\mathbb{P}\left\{ S > x \right\}}\) behaves roughly as the residual job size, i.e., if the job sizes are regularly varying of index − ν, the tail of S is regularly varying of index 1 − ν In addition, we address the tail asymptotics of other performance metrics, such as the workload in the queue, the flow transfer time and the queueing delay.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bekker R, Borst SC, Núñez-Queija R (2005) Performance of TCP-friendly streaming sessions in the presence of heavy-tailed elastic flows. Perf Eval 61: 143–162
Bingham NH, Goldie CM, Teugels JL (1987) Regular variation. Cambridge University Press, Cambridge
Boxma OJ, Foss SG, Lasgouttes J-M, Núñez-Queija R (2003) Waiting time asymptotics in the single server queue with service in random order. Queueing Systems 46: 35–73
Cohen JW (1973) Some results on regular variation for distributions in queueing and fluctuation theory. J Appl Probab 10: 343–353
Crovella M, Bestavros A (1996) Self-similarity in world wide web traffic: evidence and possible causes. In: Proceedings of the ACM Sigmetrics ’96, pp 160–169
Guillemin F, Robert Ph, Zwart AP (2003) Tail asymptotics for processor sharing queues. Adv Appl Probab 36: 525–543
Mandjes MRH, Roijers F (2007) A fluid system with coupled input and output, and its application to bottlenecks in ad hoc networks. Queueing Systems 56: 79–92
Pakes AG (1975) On the tails of waiting-time distributions. J Appl Probab 12: 555–564
Reddy TB, Karthigeyan I, Manoj BS, Murthy CSR (2006) Quality-of-service provisioning in ad hoc wireless networks: a survey of issues and solutions. Ad Hoc Networks 4: 83–124
Reich E (1958) On the integrodifferential equation of Takács. I. Ann Math Stat 29: 563–570
Roijers F, Van den Berg JL, Mandjes MRH (2008) Performance analysis of differentiated resource-sharing in a wireless ad hoc network. Report PNA-E0807, CWI, The Netherlands
Van den Berg JL, Mandjes MRH, Roijers F (2006) Performance modeling of a bottleneck node in an IEEE 802.11 ad hoc network. In: Kunz T, Ravi SS (eds) Ad hoc now 2006. In: Fifth international conference on ad hoc networks and wireless “ad hoc now”, Ottawa. Lecture Notes in Computer Science (LNCS) Series, vol 4104, pp 321–336
Zwart AP, Borst SC, Mandjes MRH (2004) Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows. Ann Appl Probab 14: 903–957
Zwart AP, Boxma OJ (2000) Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Systems 35: 141–166
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
Part of the research was conducted while R. Bekker was affiliated to CWI. Hans van den Berg (Telecom ICT) is acknowledged for bringing this model under our attention.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bekker, R., Mandjes, M. A fluid model for a relay node in an ad hoc network: the case of heavy-tailed input. Math Meth Oper Res 70, 357–384 (2009). https://doi.org/10.1007/s00186-008-0272-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-008-0272-3