STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (Q2746221): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tree algorithms for packet broadcast channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a stack algorithm for random multiple-access communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the multiplicities of conflicts to speed their resolution in multiple access channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quasi-birth-death type markov chain with a tree structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix product-form solutions for Markov chains with a tree structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical multiplexing of VBR sources: A matrix-analytic approach / rank
 
Normal rank

Latest revision as of 20:20, 3 June 2024

scientific article
Language Label Description Also known as
English
STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
scientific article

    Statements

    STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    binary stack algorithm
    0 references
    random multiple access communication
    0 references
    Markov chains
    0 references