Survivability of the MAP/PH/N queue with propagated failures

Khalid Al-Begain, Alexander Dudin, Valentina Klimenok

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the MAP/PH/N queueing system with propagated breakdowns. Breakdowns arrive in bunches (we call them attacks) according to the MAP. The process of further arrival of different types of server failures within an attack is governed by phase type Markov process. Recovering of the server takes an exponentially distributed time with intensity depending on the type of the occurred failure. We describe behavior of the system by the multi-dimensional continuous time Markov chain and analyze survivability of the system.
Original languageEnglish
Title of host publicationN/A
Number of pages7
DOIs
Publication statusPublished - 18 Oct 2010
Event 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) - Location unknown - please update
Duration: 18 Oct 201018 Oct 2010

Conference

Conference 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)
Period18/10/1018/10/10

Keywords

  • survivability modelling
  • markov modelling
  • queueing networks

Fingerprint

Dive into the research topics of 'Survivability of the MAP/PH/N queue with propagated failures'. Together they form a unique fingerprint.

Cite this