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
- EP ID EP46459
- DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258192
- Views 479
- Downloads 0
A Practical Group Authentication Scheme for Smart Devices in IoT
Internet of things (IoT) is used to provide real-time data collection and analysis of the target area by the cooperation of low-cost devices. The authentication towards multiple devices has become the research hot-spot c...
Crowdsensing Solutions in Smart Cities towards a Networked Society
The goal of the paper is to give an overview of the most relevant aspects of mobile crowdsensing that are already utilized by the society. The paper focuses on best practices applied in smart cities today, how these appl...
An automated testbed for profiling the packet send-time accuracy of embedded devices
Embedded devices, such as home routers or single-board computers, are becoming more powerful and affordable. Many of the existing Linux-based network measurement tools can also be run on these devices through cross-compi...
On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/...
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...