STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN

DOI10.1081/STM-100002273zbMath1017.90009MaRDI QIDQ2746221

Benny Van Houdt, Chris Blondia

Publication date: 10 October 2001

Published in: Stochastic Models (Search for Journal in Brave)

zbMATH Keywords

Markov chains; binary stack algorithm; random multiple access communication

Mathematics Subject Classification ID

90B18: Communication networks in operations research

60C05: Combinatorial probability

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Related Items

Tree Structured QBD Markov Chains and Tree‐Like QBD Processes, A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure, The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing, On the link between Markovian trees and tree-structured Markov chains, Solving nonlinear matrix equations arising in tree-like stochastic processes., Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue]

Cites Work

• Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
• Tree algorithms for packet broadcast channels
• Analysis of a stack algorithm for random multiple-access communication
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• Statistical multiplexing of VBR sources: A matrix-analytic approach
• The quasi-birth-death type markov chain with a tree structure
• Matrix product-form solutions for Markov chains with a tree structure
• Classification of Markov Processes of Matrix M/G/l type with a Tree Structure and its Applications to the MMAP[K/G[K]/1 Queues]
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure