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

Studies in Small Scale Data: Three Case Studies on Describing Individuals’ Spatial Behaviour in Cities

Big Data has been effectively mined to understand behavioural patterns in cities and to map large-scale trends predicated upon the repeated actions of many aggregated individuals. While acknowledging the vital role that...

Managing HeterogeneousWSNs in Smart Cities: Challenges and Requirements

The dramatic advances in wireless communications and electronics have enabled the development of Wireless Sensor Networks (WSNs). WSNs consist of many a ordable and portable sensor nodes for collecting data from the envi...

Transition into Internet of Things in Resource Constrained Settings: A Case Study from Malawi

Information Communication Technology (ICT) has in so many ways proved to be the drive of economy and a game changer to many disciplines. However digital divide has been of concern as developed countries have been benefit...

FREACSIM - A Framework for Creating and Simulating Real-Time Capable Network on Chip Systems and Applications

This paper presents the new Framework for Real-time capable Embedded system and ArChitecture SIMulation (FREACSIM), a highly configurable full-system simulation environment enabling and easing the modeling, simulation an...

State-of-the-Art Congestion Control Protocols in WSN: A Survey

Wireless Sensor Networks (WSNs) inherently are resource-constrained in terms of available energy, bandwidth, processing power and memory space. In these networks, congestion occurs when the incoming traffic load surpasse...

Download PDF file
  • EP ID EP46459
  • DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258192
  • Views 482
  • 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