Discrete-time retrial queueing systems = 이산시간 재시도 대기체계에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 362
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChoi, Bong-Dae-
dc.contributor.advisor최봉대-
dc.contributor.authorKim, Jeong-Woo-
dc.contributor.author김정우-
dc.date.accessioned2011-12-14T04:38:39Z-
dc.date.available2011-12-14T04:38:39Z-
dc.date.issued1997-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=128779&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/41797-
dc.description학위논문(박사) - 한국과학기술원 : 수학과, 1997.8, [ [iv], [74] p. ]-
dc.description.abstractThere have been a lot of studies on continuous-time retrial queue, but little is done on discrete-time retrial queue. We investigate $Geo_1,Geo_2/G/1$ retrial queue with priority calls which has many applications to slotted telecommunication systems. In Chapter 3, we consider a discrete-time $Geo_1,Geo_2/G/1$ retrial queue with two types of calls. When arriving calls are blocked due to the server being busy, type I calls are queued in the priority queue with infinite capacity, whereas type II calls enter the retrial group in order to try service again after random amount of time. We find the joint generating function of the number of calls in the priority queue and the number of calls in the retrial group in a closed form. It is shown that our results are consistent with those already known for special cases. We discuss the relationship between $Geo_1,Geo_2/G/1$ retrial queue with two types of calls and its continuous-time counterpart. We show that the queue size distribution of the discrete-time system approaches that of the corresponding continuous-time system. We also consider a discrete-time $Geo_1,Geo_2/G/1$ retrial queue where arriving type II call is lost with probability $1-q$ or to try again after a random period of time with probability q. Once he becomes a repeated calls, he reattempts repeatedly(i.e.without loss) until he succeeds to connect. We find the joint generating function of the numbers of calls in the priority queue and the retrial group in a closed form. In Chapter 4, we consider a discrete-time $Geo_1,Geo_2/G_1,G_2/1$ retrial queueing systems with two types of calls where different types of calls have different service time distributions. We find the joint generating function of the numbers of calls in the priority queue and the retrial group in a closed form. When two types of calls have the same service time distribution, our results are in agreement with those of Chapter 3. In Chapter 5, we consider discrete-time $Geo_1,Geo_2/G/1/K+...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subject포스터 판정법-
dc.subject이산 시간-
dc.subject마코프 연쇄-
dc.subject재시도 대기체계-
dc.subjectFoster criteria-
dc.subjectDiscrete-time-
dc.subjectMarkov chain-
dc.subjectRetrial queue-
dc.titleDiscrete-time retrial queueing systems = 이산시간 재시도 대기체계에 관한 연구-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN128779/325007-
dc.description.department한국과학기술원 : 수학과, -
dc.identifier.uid000925557-
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.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0