Jump to ContentJump to Main Navigation
Numerical Methods for Structured Markov Chains$
Users without a subscription are not able to see the full content.

Dario A. Bini, Guy Latouche, and Beatrice Meini

Print publication date: 2005

Print ISBN-13: 9780198527688

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198527688.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 18 November 2018

PHASE-TYPE QUEUES

PHASE-TYPE QUEUES

Chapter:
(p.109) 5 PHASE-TYPE QUEUES
Source:
Numerical Methods for Structured Markov Chains
Author(s):

D. A. Bini

G. Latouche

B. Meini

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198527688.003.0005

In this chapter a series of processes with a variety of transition structures are considered and their analysis is presented in a unifying manner. These processes are grouped under the generic name of Phase-type queues, they include G/M/1-type Markov chains, QBD processes, Markov chains with Toeplitz-like transitions and limited displacements (non-skip-free), and tree-like processes. A duality property between M/G/1 and G/M/1 Markov chains is described and a reduction of M/G/1 and G/M/1 Markov chains to QBD is analysed.

Keywords:   G/M/1-type Markov chains, QBD processes, tree-like processes, limited displacement, non-skip-free processes, duality property

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .