Name
Abstract | ||
|---|---|---|
We consider the same closed Jackson network as in Knessl and Tier [3]. It consists of a large number of customers, a single infinite server queue and a large number of single server queues with constant service rates. Asymptotic expansions for the normalization constant (partition function) are derived by the saddle point method from its integral representation in the complex space. In contrast with [3] such an approach provides a rigorous and simple derivation for the dominant term. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0167-6377(92)90009-R | Operations Research Letters |
Keywords | Field | DocType |
single server queue,single infinite server queue,saddle point method,partition function,constant service rate,closed jackson network,asymptotic expansion,complex space,generating and partition functions,dominant term,large closed queueing network,large number,integral representation | Generating function,Discrete mathematics,Combinatorics,Saddle point,Partition function (statistical mechanics),Queue,Asymptotic expansion,Queueing theory,Normalizing constant,Mathematics,Jackson network | Journal |
Volume | Issue | ISSN |
11 | 5 | Operations Research Letters |
Citations | PageRank | References |
19 | 2.93 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaakov Kogan | 1 | 118 | 21.46 |