{"title":"Exact and asymptotic analysis of infinite server batch service queues with random batch sizes","authors":"Ayane Nakamura, Tuan Phung-Duc","doi":"10.1007/s11134-023-09898-4","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"135 11‐12","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Queueing Systems","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s11134-023-09898-4","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
期刊介绍:
Queueing Systems: Theory and Applications (QUESTA) is a well-established journal focusing on the theory of resource sharing in a wide sense, particularly within a network context. The journal is primarily interested in probabilistic and statistical problems in this setting.
QUESTA welcomes both papers addressing these issues in the context of some application and papers developing mathematical methods for their analysis. Among the latter, one would particularly quote Markov chains and processes, stationary processes, random graphs, point processes, stochastic geometry, and related fields.
The prospective areas of application include, but are not restricted to production, storage and logistics, traffic and transportation, computer and communication systems.