G/M/1 queue with server hyperexponential vacation = Hyper-exponential 휴가시간을 갖는 G/M/1 대기체계

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 337
  • Download : 0
In this paper, we consider the G/M/1 queue with multiple vacation and exhaustive service discipline where the vacation time has n stages hyperexponential distribution. For this model, By using the methods of the shift operater and supplementary variable, we obtain the queue length probabilities at arrival time points and arbitrary time points simultaneously. In addition, we show that our results for n=1 reduce to the corresponding known results obtained by imbedded Markob chain approach.
Advisors
Choi, Bong-Daeresearcher최봉대researcher
Description
한국과학기술원 : 수학과,
Publisher
한국과학기술원
Issue Date
1991
Identifier
67670/325007 / 000891500
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 수학과, 1991.2, [ [ii], 25 p. ; ]

URI
http://hdl.handle.net/10203/42349
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67670&flag=dissertation
Appears in Collection
MA-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0