Stochastic models of space priority mechanisms with Markovian arrival processes (Q1197763): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5619190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The n/g/l finite capacity queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite capacity vacation models with non-renewal input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the single server queue with a batch markovian arrival process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-server queue with server vacations and a class of non-renewal arrival processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opsearch / rank
 
Normal rank
Property / cites work
 
Property / cites work: A versatile Markovian point process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms / rank
 
Normal rank

Latest revision as of 15:30, 16 May 2024

scientific article
Language Label Description Also known as
English
Stochastic models of space priority mechanisms with Markovian arrival processes
scientific article

    Statements

    Stochastic models of space priority mechanisms with Markovian arrival processes (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    single-server queue
    0 references
    communication applications
    0 references
    performance parameters
    0 references
    Markov-modulated Poisson process
    0 references
    buffer mechanisms
    0 references