Buffer overflow period in a MAP queue

DOI10.1155/2007/34631zbMath1161.68359OpenAlexW2092758656MaRDI QIDQ936183

Andrzej Chydzinski

Publication date: 13 August 2008

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55393

zbMATH Keywords

service time distributionMarkovian Arrival Process

Mathematics Subject Classification ID

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

Related Items (1)

Takács' asymptotic theorem and its applications: a survey

Cites Work

• Exact buffer overflow calculations for queues via martingales
• Practical time-scale fitting of self-similar traffic with Markov-modulated Poisson process
• MMPP models for multimedia traffic
• On the remaining service time upon reaching a given level in \(M/G/1\) queues
• New results on the single server queue with a batch markovian arrival process
• The n/g/l finite capacity queue
• The N/G/1 queue and its detailed analysis
• Equilibrium properties of the M/G/1 queue
• Technical Note—The Expected Remaining Service Time in a Single Server Queue
• The Markov-modulated Poisson process (MMPP) cookbook
• Steady-state analysis of the MMPP/G/1/K queue
• The transient BMAP/G/l queue
• Further transient analysis of theBMAP/G/1 Queue
• Calculating the loss probability in aBMAP/G/l/N+1 queue
• Time to Reach Buffer Capacity in aBMAPQueue
• The remaining service time upon reaching a high level in \(M/G/1\) queues

This page was built for publication: Buffer overflow period in a MAP queue