A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue

Journals Menu

Follow SCIRP

ISSN Print: 2152-7385
ISSN Online: 2152-7393
www.scirp.org/journal/am
E-mail: am@scirp.org

"A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue"
written by Nam K. Kim, Mohan L. Chaudhry, Bong K. Yoon, Kilhwan Kim,
published by Applied Mathematics, Vol.3 No.12A, 2012

has been cited by the following article(s):

[1]	Communication Patterns for Randomized Algorithms
	2018

[2]	Analysis of a discrete-time single-server queue with an occasional extra server
	Performance Evaluation, 2017

[3]	FINITE CAPACITY M/M/r/N QUEUEING MODEL WITH ADDITIONAL SERVERS
	2017

[4]	Self-Stabilizing Balls and Bins in Batches
	Algorithmica, 2016

[5]	Self-stabilizing balls & bins in batches: The power of leaky bins
	Proceedings of the …, 2016

[1]	Self-Stabilizing Balls and Bins in Batches Algorithmica, 2018 DOI:10.1007/s00453-018-0411-z

[2]	Analysis of a discrete-time single-server queue with an occasional extra server Performance Evaluation, 2017 DOI:10.1016/j.peva.2017.08.009

[3]	Self-stabilizing Balls & Bins in Batches Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, 2016 DOI:10.1145/2933057.2933092

Follow SCIRP