Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A computational algorithm for the CPP/M/c retrial queue

From MaRDI portal
Publication:3580798
Jump to:navigation, search

zbMATH Open1212.60175MaRDI QIDQ3580798FDOQ3580798


Authors: Tien V. Do Edit this on Wikidata


Publication date: 13 August 2010


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




Recommendations

  • scientific article; zbMATH DE number 5989735
  • The Ca/M/s/m Retrial Queue: A Computational Approach
  • Retrial queues: an algorithmic approach
  • Algorithmic approximations for the busy period distribution of the \(M/M/c\) retrial queue
  • Algorithmic analysis of the maximum queue length in a busy period for the \(M/M/c\) retrial queue


zbMATH Keywords

retrial queuecomputational algorithm


Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Queueing theory (aspects of probability theory) (60K25)



Cited In (1)

  • Title not available (Why is that?)





This page was built for publication: A computational algorithm for the CPP/M/c retrial queue

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3580798&oldid=16988407"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 02:52. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki