{"title":"M/G/1队列特殊情况下繁忙时段服务人数分布的解析显式结果","authors":"M. Chaudhry, V. Goswami","doi":"10.1155/2019/7398658","DOIUrl":null,"url":null,"abstract":"This paper presents analytically explicit results for the distribution of the number of customers served during a busy period for special cases of the M/G/1 queues when initiated with m customers. The functional equation for the Laplace transform of the number of customers served during a busy period is widely known, but several researchers state that, in general, it is not easy to invert it except for some simple cases such as M/M/1 and M/D/1 queues. Using the Lagrange inversion theorem, we give an elegant solution to this equation. We obtain the distribution of the number of customers served during a busy period for various service-time distributions such as exponential, deterministic, Erlang-k, gamma, chi-square, inverse Gaussian, generalized Erlang, matrix exponential, hyperexponential, uniform, Coxian, phase-type, Markov-modulated Poisson process, and interrupted Poisson process. Further, we also provide computational results using our method. The derivations are very fast and robust due to the lucidity of the expressions.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2019-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2019/7398658","citationCount":"2","resultStr":"{\"title\":\"Analytically Explicit Results for the Distribution of the Number of Customers Served during a Busy Period for Special Cases of the M/G/1 Queue\",\"authors\":\"M. Chaudhry, V. Goswami\",\"doi\":\"10.1155/2019/7398658\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents analytically explicit results for the distribution of the number of customers served during a busy period for special cases of the M/G/1 queues when initiated with m customers. The functional equation for the Laplace transform of the number of customers served during a busy period is widely known, but several researchers state that, in general, it is not easy to invert it except for some simple cases such as M/M/1 and M/D/1 queues. Using the Lagrange inversion theorem, we give an elegant solution to this equation. We obtain the distribution of the number of customers served during a busy period for various service-time distributions such as exponential, deterministic, Erlang-k, gamma, chi-square, inverse Gaussian, generalized Erlang, matrix exponential, hyperexponential, uniform, Coxian, phase-type, Markov-modulated Poisson process, and interrupted Poisson process. Further, we also provide computational results using our method. The derivations are very fast and robust due to the lucidity of the expressions.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2019-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1155/2019/7398658\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2019/7398658\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2019/7398658","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
Analytically Explicit Results for the Distribution of the Number of Customers Served during a Busy Period for Special Cases of the M/G/1 Queue
This paper presents analytically explicit results for the distribution of the number of customers served during a busy period for special cases of the M/G/1 queues when initiated with m customers. The functional equation for the Laplace transform of the number of customers served during a busy period is widely known, but several researchers state that, in general, it is not easy to invert it except for some simple cases such as M/M/1 and M/D/1 queues. Using the Lagrange inversion theorem, we give an elegant solution to this equation. We obtain the distribution of the number of customers served during a busy period for various service-time distributions such as exponential, deterministic, Erlang-k, gamma, chi-square, inverse Gaussian, generalized Erlang, matrix exponential, hyperexponential, uniform, Coxian, phase-type, Markov-modulated Poisson process, and interrupted Poisson process. Further, we also provide computational results using our method. The derivations are very fast and robust due to the lucidity of the expressions.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.