| Autor: |
Muto, Kiyoshi, Miyazaki, Haruo, Seki, Yoichi, Kimura, Yoshihiro, Shibata, Yukio |
| Zdroj: |
Queueing Systems; March 1995, Vol. 19 Issue: 1-2 p193-214, 22p |
| Abstrakt: |
We apply the lattice path counting method to the analysis of the transientM/M/c queueing system. A closed-form solution is obtained for the probability of exactlyi arrivals andj departures within a time interval of lengtht in anM/M/c queueing system that is empty at the initial time. The derivation of the probability is based on the counting of paths from the origin to(i,j) on thexy-plane, that have exactly rd x-steps whose depth from the liney=x isd (d=0,1,...,c-1). The closed-form solution has an expression useful for numerical calculation. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Full text from SpringerLink