Abstract
The transient queueing delay distribution in the GI/M/1/K-type model with the N-policy is investigated. After finishing each busy period the service is being initialized simultaneously with the Nth packet arrival occurrence. Using the approach based on the idea of embedded Markov chain, the formula of total probability, renewal theory and linear algebra, the compact-form representation for the Laplace transform of the tail of delay distribution is obtained. The results can be useful in modeling the operation of wireless sensor networks (WSNs) with energy saving mechanism based on “queued” waking up of nodes. A network-motivated numerical example is attached.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abate, J., Choudhury, G.L., Whitt, W.: An introduction to numerical transform inversion and its application to probability models. In: Grassmann, W. (ed.) Computational Probability, pp. 257–323. Kluwer, Boston (2000)
Cohen, J.W.: The single server queue. Amsterdam-New York-Oxford, North-Holland (1982)
Jiang, F.-C., Huang, D.-C., Wang, K.-H.: Design approaches for optimizing power consumption of sensor node with N-policy M/G/1. In: Proceedings of QTNA 2009, Singapore, July 29–31 (2009)
Jiang, F.-C., Huang, D.-C., Tang, C., Wang, K.-H.: Mitigation techniques for the energy hole problem in sensor networks using N-policy M/G/1 queueing models. In: Proceedings of the IET International Conference: Frontier Computinging Theory, Technologies and Applications 2010, Taichung, pp. 4–6 (August 2010)
Jiang, F.-C., Huang, D.-C., Tang, C.-T., Leu, F.Y.: Lifetime elongation for wireless sensor network using queue-based approaches. The Journal of Supercomputing 59, 1312–1335 (2012)
Kempa, W.M.: The virtual waiting time for the batch arrival queueing systems. Stochastic Analysis and Applications 22(5), 1235–1255 (2004)
Kempa, W.M.: The transient analysis of the queue-length distribution in the batch arrival system with N-policy, multiple vacations and setup times. In: AIP Conference Proceedings, vol. 1293, pp. 235–242 (2010)
Kempa, W.M.: Departure process in finite-buffer queue with batch arrivals. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds.) ASMTA 2011. LNCS, vol. 6751, pp. 1–13. Springer, Heidelberg (2011)
Kempa, W.M.: On transient queue-size distribution in the batch arrival system with the N-policy and setup times. Mathematical Communications 17, 285–302 (2012)
Kempa, W.M.: The virtual waiting time in a finite-buffer queue with a single vacation policy. In: Al-Begain, K., Fiems, D., Vincent, J.-M. (eds.) ASMTA 2012. LNCS, vol. 7314, pp. 47–60. Springer, Heidelberg (2012)
Korolyuk, V.S.: Boundary-value problems for compound Poisson processes. Naukova Dumka, Kiev (1975) (in Russian)
Korolyuk, V.S., Bratiichuk, N.S., Pirdzhanov, B.: Boundary-value problems for random walks. Ylym, Ashkhabad (1987) (in Russian)
Lee, H.W., Lee, S.S., Park, J.O., Chae, K.-C.: Analysis of the M X/G/1 queue with N-policy and multiple vacations. Journal of Applied Probability 31(2), 476–496 (1994)
Mancuso, V., Alouf, S.: Analysis of power saving with continuous connectivity. Computer Networks 56, 2481–2493 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kempa, W.M. (2014). Time-Dependent Behavior of Queueing Delay in GI/M/1/K-type Model with N-policy: Analytical Study with Applications to WSNs. In: Sericola, B., Telek, M., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2014. Lecture Notes in Computer Science, vol 8499. Springer, Cham. https://doi.org/10.1007/978-3-319-08219-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-08219-6_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08218-9
Online ISBN: 978-3-319-08219-6
eBook Packages: Computer ScienceComputer Science (R0)