A heuristic procedure for compact Markov representation of PH distributions
Journal Title: EAI Endorsed Transactions on Internet of Things - Year 2015, Vol 1, Issue 4
Abstract
The minimal Markovian representation of PH distributions is an open research problem, which was actively investigated during the last two decades. We present a numerical method for finding small Markovian representation of PH distributions and investigate the general quality of the method by comparing the size of the obtained representation with the size of the representation obtained by alternative methods. Our numerical method intends to find a small Markovian representation. We report examples when the obtained representation is larger than the minimal Markovian representation.
Authors and Affiliations
Illes Horvath, Miklos Telek
Keywords
Related Articles
- EP ID EP46467
- DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258174
- Views 291
- Downloads 0
End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations
A fundamental contribution of network calculus is the convolution-form representation of networks which enables tight end-to-end delay bounds. Recently, this has been extended to the case where the data flow is subject t...
Dedicated networks for IoT: PHY / MAC state of the art and challenges
This paper focuses on the the emerging transmission technologies dedicated to IoT networks.We first analyze the classical cellular network technologies when taking into account the IoT requirements, and point out the nee...
Wireless Enabled Voice over Internet Protocol (VoIP) Network Application Using Asterisk PBX
This paper reechoes the need to use VOIP-based communication channels in order to reduce the heavy cost burden of communication in Sub Saharan Africa and other developing countries. We focus specifically on the context o...
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...
Flow coupling and stochastic ordering of throughputs in linear networks
Robust estimates for the performance of complicated queueing networks can be obtained by showing that the number of jobs in the network is stochastically comparable to a simpler, analytically tractable reference network....