Nonidentifiability of the Two-State BMAP Articles uri icon

publication date

  • March 2016

start page

  • 81

end page

  • 106

issue

  • 1

volume

  • 18

international standard serial number (ISSN)

  • 1387-5841

electronic international standard serial number (EISSN)

  • 1573-7713

abstract

  • The capability of modeling non-exponentially distributed and dependent inter-arrival times as well as correlated batches makes the Batch Markovian Arrival Processes (BMAP) suitable in different real-life settings as teletraffic, queueing theory or actuarial contexts. An issue to be taken into account for estimation purposes is the identifiability of the process. This paper explores the identifiability of the stationary two-state BMAP noted as BMAP(2)(k), where k is the maximum batch arrival size, under the assumptions that both the interarrival times and batches sizes are observed. It is proven that for k >= 2 the process cannot be identified. The proof is based on the construction of an equivalent BMAP(2)(k) to a given one, and on the decomposition of a BMAP(2)(k) into k BMAP(2)(2)s.

keywords

  • batch markovian arrival process (bmap); identifiability problems; hidden markov models; redundant representations; phase type distributions; coxian representations; identifiability; chains; time