A simple approach to the map/d/s queue

DOI10.1080/15326340008807603MaRDI QIDQ4526208zbMATH OpenOpenAlexFDO

Authors Tetsuya Takine

Publication date 8 July 2001

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326340008807603

zbMATH Keywords

FCFS disciplinequeue length distributionsojourn time distributionstationary queue length mass function

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Queue Length Analysis of MAP/G/1 Queue UnderD-Policy
• Analysis of the MAP/G\(^{a,b}\)/1/N queue
• scientific article; zbMATH DE number 2064354
• A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
• A simple and complete computational analysis of MAP/R/1 queue using roots

Cited in

(8)

• Waiting-time analysis of D-BMAP/G/1 queueing system
• A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues
• MAP/G/1/K queue with multiple thresholds on buffer
• Algorithmic analysis of the BMAP/D/k system in discrete time
• Equivalences of Batch-Service Queues and Multi-Server Queues and Their Complete Simple Solutions in Terms of Roots
• Computational procedures for a class of GI/D/\(k\) systems in discrete time
• Analysis of system length and waiting time distributions in BMAP /G/1 queue using characteristic roots
• Computational procedure for system length and waiting-time distribution in an m^x/D/c/N queue

This page was built for publication: A simple approach to the map/d/s queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526208)