Busy period distribution in state-dependent queues (Q1113219): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Charles Knessl / rank
 
Normal rank
Property / author
 
Property / author: Bernard J. Matkowsky / rank
 
Normal rank
Property / author
 
Property / author: Zeev Schuss / rank
 
Normal rank
Property / author
 
Property / author: Charles Tier / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Analysis of a State-Dependent $M/G/1$ Queueing System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Markov-modulated M/G/1 queue. I: Stationary distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Markov-modulated M/G/1 queue. II: Busy period and time for buffer overflow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank

Revision as of 11:23, 19 June 2024

scientific article
Language Label Description Also known as
English
Busy period distribution in state-dependent queues
scientific article

    Statements

    Busy period distribution in state-dependent queues (English)
    0 references
    1987
    0 references
    A state-dependent M/M/1 queueing system is considered. It is assumed that the arrival rate \(\lambda =\lambda (v(t))\) depends on the current work v(t) in the system and that the mean service time of a job arriving at time moment \(t^*\) is \(1/\mu (v(t^*))\). The arrival rate is fast while the mean service requests are supposed to be small. The density function \(p(x,t)=(\partial /\partial t)P_ r\{T<t| v(0)=x\}\) of residual length of a busy period is studied using singular perturbation techniques (here \(T=\inf \{t:v(t)=0\})\). Approximations to p(x,t) for two different cases are constructed: the first case has \(r(x)=\lambda (x)/\mu (x)<1\), \(x\in [0,\infty)\); the second case has \(r(x)<1\), \(x\in (0,\infty)\) and \(r(0)=1\).
    0 references
    state-dependent
    0 references
    residual length of a busy period
    0 references
    singular perturbation techniques
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers