By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Khalid Al-Begain ; University of Glamorgan, Pontypridd, Wales, UK ; Alexander Dudin ; Valentina Klimenok

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.

Published in:

Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2010 International Congress on

Date of Conference:

18-20 Oct. 2010