컨텐츠 시작
학술대회/행사
초록검색
| 제출번호(No.) | 0536 |
|---|---|
| 분류(Section) | Poster Session |
| 분과(Session) | Combinatorics / Graph Theory / Cryptography / Coding Theory (SS-05) |
| 영문제목 (Title(Eng.)) |
An application of Riordan arrays to the transient analysis of $M/M/1$ queues |
| 저자(Author(s)) |
Gi-Sang Cheon1, Bong Dae Choi1, Sung-Tae Jin1 Sungkyunkwan University1 |
| 초록본문(Abstract) | Riordan arrays are used extensively in many contexts as a combinatorial tool for solving enumeration problems such as random walks. In this talk, we first show how Riordan array method can be applied to the transient analysis of $M/M/1$ queue with zero customer at the initial point. Second, we use a generalized Riordan arrays with multiple support functions, which is a new method in order to obtain the transient probability of $M/M/1$ queue with non-zero customers at the initial point. |
| 분류기호 (MSC number(s)) |
05A15, 60K25 |
| 키워드(Keyword(s)) | Riordan array, lattice path, transient analysis, Markovian queue |
| 강연 형태 (Language of Session (Talk)) |
English |