Approximate Transient Analysis of Queuing Networks by Decomposition based on Time-Inhomogeneous Markov Arrival Processes

Journal Title: EAI Endorsed Transactions on Internet of Things - Year 2015, Vol 1, Issue 2

Abstract

We address the transient analysis of networks of queues with exponential service times. Such networks can easily have such a huge state space that their exact transient analysis is unfeasible. In this paper we propose an approximate transient analysis technique based on decomposing the queues of the network using a compact and approximate representation of the departure process of each queue. Namely, we apply time-inhomogeneous Markov arrival processes (IMAP) to describe the stream of clients leaving the queues. By doing so, the overall approximate model of the network is a time-inhomogeneous continuous time Markov chain (ICTMC) with significantly less number of states than there are in the original Markov chain. The proposed construction of the output IMAP of a queue is based on its transient state probabilities. We illustrate the approach first on a single M/M/1 queue and analyze the goodness of fitting of the departure process by numerical examples. Then we extend the approach to networks of queues and evaluate the precision of the resulting technique on several simple numerical examples by comparing the exact and the approximate transient probabilities of the queues.

Authors and Affiliations

Andras Horvath, Alessio Angius

Keywords

Related Articles

A Partial-differential Approximation for Spatial Stochastic Process Algebra

We study a spatial framework for process algebra with ordinary differential equation (ODE) semantics. We consider an explicit mobility model over a 2D lattice where processes may walk to neighbouring regions independentl...

Analysis of fibre-loop optical buffers with a void-avoiding schedule

In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to...

TagFall: Towards Unobstructive Fine-Grained Fall Detection based on UHF Passive RFID Tags

Falls are among the leading causes of hospitalization for the elderly and illness individuals. Considering that the elderly often live alone and receive only irregular visits, it is essential to develop such a system tha...

Securing the Timestamping of Sensor Data from Wearable Healthcare Devices

An ageing population, coupled with increasing prevalence of chronic diseases, is placing unsustainable demands on current healthcare systems. Home-based medical monitoring, supported by wearable sensors for heart-rate, E...

Cooperative Awareness in the Internet of Vehicles for Safety Enhancement

Connected vehicles will improve safety and enable new services to drivers and passengers. One of the main enabled services will be the cooperative awareness, that is the broadcast transmission of periodic messages contai...

Download PDF file
  • EP ID EP46459
  • DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258192
  • Views 432
  • Downloads 0

How To Cite

Andras Horvath, Alessio Angius (2015). Approximate Transient Analysis of Queuing Networks by Decomposition based on Time-Inhomogeneous Markov Arrival Processes. EAI Endorsed Transactions on Internet of Things, 1(2), -. https://europub.co.uk/articles/-A-46459