Extension of some MAP results to transient MAPs and Markovian binary trees

Sophie Hautphenne, M. Telek

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this work we extend previous results on moment-based characterization and minimal representation of stationary Markovian arrival processes (MAPs) and rational arrival processes (RAPs) to transient Markovian arrival processes (TMAPs) and Markovian binary trees (MBTs). We show that the number of moments that characterize a TMAP of size n with full rank marginal is n2 + 2n - 1, and an MBT of size n with full rank marginal is n3 + 2n - 1. We provide a non-Markovian representation for both processes based on these moments. Finally, we discuss the minimal representation of TMAPs and MBTs. In both cases, the minimal representation, which is not necessarily Markovian, can be found using different adaptations of the STAIRCASE algorithm presented in an earlier work by Buchholz and Telek (2011) [9]. Crown

Original languageEnglish
Pages (from-to)607-622
Number of pages16
JournalPerformance Evaluation
Volume70
Issue number9
DOIs
Publication statusPublished - 2013

Fingerprint

Markovian Arrival Process
Binary trees
Binary Tree
Moment

Keywords

  • Markovian binary tree
  • Minimal representation
  • Moments of inter-arrival time distribution
  • Parameter fitting
  • Transient Markovian arrival process

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Modelling and Simulation

Cite this

Extension of some MAP results to transient MAPs and Markovian binary trees. / Hautphenne, Sophie; Telek, M.

In: Performance Evaluation, Vol. 70, No. 9, 2013, p. 607-622.

Research output: Contribution to journalArticle

@article{f997a382319e4f15882cecc8cc207b22,
title = "Extension of some MAP results to transient MAPs and Markovian binary trees",
abstract = "In this work we extend previous results on moment-based characterization and minimal representation of stationary Markovian arrival processes (MAPs) and rational arrival processes (RAPs) to transient Markovian arrival processes (TMAPs) and Markovian binary trees (MBTs). We show that the number of moments that characterize a TMAP of size n with full rank marginal is n2 + 2n - 1, and an MBT of size n with full rank marginal is n3 + 2n - 1. We provide a non-Markovian representation for both processes based on these moments. Finally, we discuss the minimal representation of TMAPs and MBTs. In both cases, the minimal representation, which is not necessarily Markovian, can be found using different adaptations of the STAIRCASE algorithm presented in an earlier work by Buchholz and Telek (2011) [9]. Crown",
keywords = "Markovian binary tree, Minimal representation, Moments of inter-arrival time distribution, Parameter fitting, Transient Markovian arrival process",
author = "Sophie Hautphenne and M. Telek",
year = "2013",
doi = "10.1016/j.peva.2013.05.003",
language = "English",
volume = "70",
pages = "607--622",
journal = "Performance Evaluation",
issn = "0166-5316",
publisher = "Elsevier",
number = "9",

}

TY - JOUR

T1 - Extension of some MAP results to transient MAPs and Markovian binary trees

AU - Hautphenne, Sophie

AU - Telek, M.

PY - 2013

Y1 - 2013

N2 - In this work we extend previous results on moment-based characterization and minimal representation of stationary Markovian arrival processes (MAPs) and rational arrival processes (RAPs) to transient Markovian arrival processes (TMAPs) and Markovian binary trees (MBTs). We show that the number of moments that characterize a TMAP of size n with full rank marginal is n2 + 2n - 1, and an MBT of size n with full rank marginal is n3 + 2n - 1. We provide a non-Markovian representation for both processes based on these moments. Finally, we discuss the minimal representation of TMAPs and MBTs. In both cases, the minimal representation, which is not necessarily Markovian, can be found using different adaptations of the STAIRCASE algorithm presented in an earlier work by Buchholz and Telek (2011) [9]. Crown

AB - In this work we extend previous results on moment-based characterization and minimal representation of stationary Markovian arrival processes (MAPs) and rational arrival processes (RAPs) to transient Markovian arrival processes (TMAPs) and Markovian binary trees (MBTs). We show that the number of moments that characterize a TMAP of size n with full rank marginal is n2 + 2n - 1, and an MBT of size n with full rank marginal is n3 + 2n - 1. We provide a non-Markovian representation for both processes based on these moments. Finally, we discuss the minimal representation of TMAPs and MBTs. In both cases, the minimal representation, which is not necessarily Markovian, can be found using different adaptations of the STAIRCASE algorithm presented in an earlier work by Buchholz and Telek (2011) [9]. Crown

KW - Markovian binary tree

KW - Minimal representation

KW - Moments of inter-arrival time distribution

KW - Parameter fitting

KW - Transient Markovian arrival process

UR - http://www.scopus.com/inward/record.url?scp=84883655758&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883655758&partnerID=8YFLogxK

U2 - 10.1016/j.peva.2013.05.003

DO - 10.1016/j.peva.2013.05.003

M3 - Article

VL - 70

SP - 607

EP - 622

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

IS - 9

ER -