article

Free access

A Finite-Source Queue with Different Customers

Author:

Hisao KamedaAuthors Info & Claims

Journal of the ACM (JACM), Volume 29, Issue 2

Pages 478 - 491

https://doi.org/10.1145/322307.322320

Published: 01 April 1982 Publication History

PDF eReader

References

[1]

BASKETT, F., CHANDY, K M, MUNTZ, R R, AND PALA.CIOS, F G Open, closed, and mtxed networks of queues wtth d~fferent classes of customers J ACM 22, 2 (Aprd 1975), 248-260

Crossref

Google Scholar

[2]

BOYSE, J H, AND WARN, D R A stra{ghtforward model for computer performance predlcuon. A CM Comput Surv 7, 2 (June 1975), 73-93

Crossref

Google Scholar

[3]

CHANDY, K M, HOWARD, J H JR, AND TOWSLEY, D F Product form and local balance,n queuelng networks J ACM 24, 2 (AprlI 1977), 250-263

Crossref

Google Scholar

[4]

Cox, D R A use of complex probabditles m the theory of stochastic processes Proc. Cambridge Phil Soc 51 (1955),313-319

Google Scholar

[5]

Cox, D R, A~D SMITH, W.L Queues Methuen, London, 1961

Google Scholar

[6]

FELLER, W An Introduction to Probabihty Theory and Its Apphcattons, Vol I Wdey, New York, 1957

Google Scholar

[7]

FERDINAND, A E An analys,s of the machine interference model IBM Syst J I0, 2 (1971), 129-142

Google Scholar

[8]

GHANEM, M.Z Study of memory partmomng for muluprogrammmg systems w~th wrtual memory IBM J Res Devel 19, 5 (Sept 1975), 451-457

Google Scholar

[9]

KELLY, F P Reverstblhty and Stochastw Nel~'orks Wiley, New York, t979

Google Scholar

[10]

KLEINROCK, L Queuemg Systems, Volume II Computer Apphcatlons Wdey, New York, 1976

Google Scholar

[11]

KOBAYASHI, 1:1 Modehng and Analysis An lntroduct:on to System Peoformance Evaluation Methodolagy Addtson-Wesley, Reading, Mass, 1978

Google Scholar

[12]

NOETZEL, A.S. A generalized queueing discipline for product form network solutions. ~ A CM 26, 4 (Oct. 1979), 779-793.

Crossref

Google Scholar

[13]

RyDeR, K.D.A heunstic approach to task dispatching. IBM Sys~. Z 9, 3 (1970), 189-198.

Google Scholar

[14]

Scn~ga, A.A. An Analysis of Time-Shared Computer Systems. MIT Press, Cambridge, Mass., 1967.

Google Scholar

[15]

Spirn, J.R.Multi-queue scheduling of two tasks. Acta Inf. 7, 2 (1976), 21%226.

Google Scholar

Cited By

View all

Shastrakar DPokley SAnwar S(2022)Analysis of Various Parameters of Limited Source Queuing Model Having Single Server by Using Binomial and Uniform DistributionJournal of Dynamical Systems and Geometric Theories10.1080/1726037X.2022.207926620:1(81-90)Online publication date: 15-Jun-2022
https://doi.org/10.1080/1726037X.2022.2079266
Sharma RGupta PSingh R(2022)Hypergeometrically Represented Responsive and Reliable Cloud Service Model for Personal and Private CloudsWireless Personal Communications: An International Journal10.1007/s11277-022-09618-w125:2(1501-1521)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s11277-022-09618-w
Righter R(2016)Optimal policies for scheduling repairs and allocating heterogeneous serversJournal of Applied Probability10.2307/321507733:02(536-547)Online publication date: 14-Jul-2016
https://doi.org/10.2307/3215077
Show More Cited By

Index Terms

A Finite-Source Queue with Different Customers
1. General and reference
  1. Cross-computing tools and techniques
    1. Performance
2. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory

Recommendations

Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit

The present paper deals with a generalization of the homogeneous multi-server finite-source retrial queue with search for customers in the orbit. The novelty of the investigation is the introduction of balking and impatience for requests who arrive at ...
Single server retrial queue with group admission of customers

We consider a retrial queueing system with a single server and novel customer s admission discipline. The input flow is described by a Markov Arrival Process. If an arriving customer meets the server providing the service, it goes to the orbit and ...
Delays for Customers from Different Arrival Streams to a Queue

In a queue with several different arrival streams, in general, the expected delay for customers from one stream is not equal to the expected delay for customers from the other streams. Two approximations are presented here for the expected delay for ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of the ACM Volume 29, Issue 2

April 1982

330 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322307

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1982

Published in JACM Volume 29, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
775
Total Downloads

Downloads (Last 12 months)62
Downloads (Last 6 weeks)3

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shastrakar DPokley SAnwar S(2022)Analysis of Various Parameters of Limited Source Queuing Model Having Single Server by Using Binomial and Uniform DistributionJournal of Dynamical Systems and Geometric Theories10.1080/1726037X.2022.207926620:1(81-90)Online publication date: 15-Jun-2022
https://doi.org/10.1080/1726037X.2022.2079266
Sharma RGupta PSingh R(2022)Hypergeometrically Represented Responsive and Reliable Cloud Service Model for Personal and Private CloudsWireless Personal Communications: An International Journal10.1007/s11277-022-09618-w125:2(1501-1521)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s11277-022-09618-w
Righter R(2016)Optimal policies for scheduling repairs and allocating heterogeneous serversJournal of Applied Probability10.2307/321507733:02(536-547)Online publication date: 14-Jul-2016
https://doi.org/10.2307/3215077
Righter R(2016)Optimal policies for scheduling repairs and allocating heterogeneous serversJournal of Applied Probability10.1017/S002190020009995233:02(536-547)Online publication date: 14-Jul-2016
https://doi.org/10.1017/S0021900200099952
Ling LLiang LHu ZYang F(2011)Effect of upper and lower withdrawal limits on queue lengthApplied Mathematics and Computation10.1016/j.amc.2011.09.031218:7(3834-3846)Online publication date: Dec-2011
https://doi.org/10.1016/j.amc.2011.09.031
Jayaraman RMatis TCochran JCox LKeskinocak PKharoufeh JSmith J(2011)Finite Population Models—Single Station QueuesWiley Encyclopedia of Operations Research and Management Science10.1002/9780470400531.eorms0325Online publication date: 14-Jan-2011
https://doi.org/10.1002/9780470400531.eorms0325
Iravani SKrishnamurthy V(2007)Workforce Agility in Repair and Maintenance EnvironmentsManufacturing & Service Operations Management10.1287/msom.1060.01329:2(168-184)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1287/msom.1060.0132
BIAGINI GGOLDFEDER M(2007)A note on ‘A closed form solution for the G/M/r machine interference model’ by B. D. Bunday and E. KhorramInternational Journal of Production Research10.1080/0020754900894278628:6(1215-1217)Online publication date: 30-Mar-2007
https://doi.org/10.1080/00207549008942786
Haque LArmstrong M(2007)A survey of the machine interference problemEuropean Journal of Operational Research10.1016/j.ejor.2006.02.036179:2(469-482)Online publication date: Jun-2007
https://doi.org/10.1016/j.ejor.2006.02.036
Alazemi HMargolis AChoi JVijaykumar RRoy S(2007)Stochastic modelling and analysis of 802.11 DCF with heterogeneous non-saturated nodesComputer Communications10.1016/j.comcom.2007.07.00730:18(3652-3661)Online publication date: 1-Dec-2007
https://dl.acm.org/doi/10.1016/j.comcom.2007.07.007
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit

Single server retrial queue with group admission of customers

Delays for Customers from Different Arrival Streams to a Queue

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations