#### Transient diffusion approximation for the G/G/m queueing systems = G/G/m 대기체계의 확산확률과정에 의한 근사법에 관한 연구

Cited 0 time in Cited 0 time in
• Hit : 480
DC FieldValueLanguage
dc.contributor.authorShin, Yang-Woo-
dc.contributor.author신양우-
dc.date.accessioned2011-12-14T04:38:05Z-
dc.date.available2011-12-14T04:38:05Z-
dc.date.issued1990-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61627&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/41760-
dc.description학위논문(박사) - 한국과학기술원 : 수학과, 1990, [ [iii], 133 p. ]-
dc.description.abstractThe main purpose of wokr is to present a general approach by which fairly complicated multiserver queueing system in transient state could be simply approximated by diffusion processes. In order to approximate the transient behavior of multiserver queueing system we construct diffusion processes with suitable boundary conditions and difusion parameters which are determined by the parameters of queueing system. Using the transition density function of the diffusion process, we derive the apporximate forms of the system size distribution. To find the transition density function of the difusion process, we solve a partial differential equation so called Kolmogorov forward equation or Fokker-Planck equation. The solution of Kolmogorov forward equation is given in the form of Laplac transform with respect to the variable t. We also obtain the stationary distribution of queue size for G/G/m (G/G/m/N) system by letting t $\rightarrow$ $\infty$ in transient solution. We derive the distribution of the first passage time of diffusion process from the transition density function of the diffusion process. Using the first passage time of diffusion process, we obtain the approximations for the distributions of the first overflow time in G/G/m/N-1 system, maximun queue length up to time t and k-busty period in G/G/m system. The transient approximation for the distribution of the number of customers at each stages in the two stages cyclic system is also abtained. For the lack of exact transient solution of queueing stsyem with multiple server, we check the accuracy of approximation by comparing approximation results with simulation experiments. The numerical results show that the diffusion approximation is very accuate for all traffic cases.eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.titleTransient diffusion approximation for the G/G/m queueing systems = G/G/m 대기체계의 확산확률과정에 의한 근사법에 관한 연구-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN61627/325007-
dc.description.department한국과학기술원 : 수학과, -
dc.identifier.uid000845177-
dc.contributor.localauthorChoi, Bong-Dae-
dc.contributor.localauthor최봉대-
Appears in Collection
MA-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.