| 書目名稱 | The M/M/∞Service System with Ranked Servers in Heavy Traffic | | 編輯 | G. F. Newell | | 視頻video | http://file.papertrans.cn/914/913362/913362.mp4 | | 叢書名稱 | Lecture Notes in Economics and Mathematical Systems | | 圖書封面 |  | | 描述 | We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an orde | | 出版日期 | Book 1984 | | 關(guān)鍵詞 | System; boundary element method; equilibrium; poisson process; research | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-45576-6 | | isbn_softcover | 978-3-540-13377-3 | | isbn_ebook | 978-3-642-45576-6Series ISSN 0075-8442 Series E-ISSN 2196-9957 | | issn_series | 0075-8442 | | copyright | Springer-Verlag Berlin Heidelberg 1984 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-9 10:07
發(fā)表于 2025-3-21 16:13:14
