• Title/Summary/Keyword: Retrial systems

Search Result 16, Processing Time 0.015 seconds

AN APPROXIMATION FOR THE QUEUE LENGTH DISTRIBUTION IN A MULTI-SERVER RETRIAL QUEUE

  • Kim, Jeongsim
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.95-102
    • /
    • 2016
  • Multi-server queueing systems with retrials are widely used to model problems in a call center. We present an explicit formula for an approximation of the queue length distribution in a multi-server retrial queue, by using the Lerch transcendent. Accuracy of our approximation is shown in the numerical examples.

AN APPROXIMATION FOR THE DISTRIBUTION OF THE NUMBER OF RETRYING CUSTOMERS IN AN M/G/1 RETRIAL QUEUE

  • Kim, Jeongsim;Kim, Jerim
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.27 no.3
    • /
    • pp.405-411
    • /
    • 2014
  • Queueing systems with retrials are widely used to model many problems in call centers, telecommunication networks, and in daily life. We present a very accurate but simple approximate formula for the distribution of the number of retrying customers in the M/G/1 retrial queue.

{M_1},{M_2}/M/1$ RETRIAL QUEUEING SYSTEMS WITH TWO CLASSES OF CUSTOMERS AND SMART MACHINE

  • Han, Dong-Hwan;Park, Chul-Geun
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.2
    • /
    • pp.393-403
    • /
    • 1998
  • We consider $M_1,M_2/M/1$ retrial queues with two classes of customers in which the service rates depend on the total number or the customers served since the beginning of the current busy period. In the case that arriving customers are bloced due to the channel being busy, the class 1 customers are queued in the priority group and are served as soon as the channel is free, whereas the class 2 customers enter the retrical group in order to try service again after a random amount of time. For the first $N(N \geq 1)$ exceptional services model which is a special case of our model, we derive the joint generating function of the numbers of customers in the two groups. When N = 1 i.e., the first exceptional service model, we obtain the joint generating function explicitly and if the arrival rate of class 2 customers is 0, we show that the results for our model coincide with known results for the M/M/1 queues with smart machine.

  • PDF

BMAP/PH/N Queueing Model with Retrial and Losses (재시도와 손실을 고려한 BMAP/PH/N 대기모형 분석)

  • Kim, Che-Soong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.1
    • /
    • pp.41-46
    • /
    • 2006
  • 본 논문에서는 재시도와 완전입력 규칙을 갖는 BMAP/PH/N/0 대기시스템에 대한 주요 성능평가척도와 시스템의 정상상태 조건을 제시한다. 고려되는 시스템은 모든 서버가 서비스를 하고 있을 경우 도착이 이루어지는 배치도착은 모두 손실되며, 반대의 경우 도착하는 배치는 서비스를 받기 위해 시스템에 들어가게 된다. 만약 쉬고 있는 서버의 수가 불충분하여 배치의 일부가 즉각 서비스를 받을 수 없다면, 일단 오빗으로 이동하고 표준 재시도 대기 시스템의 규칙에 따라 후에 서비스를 받게 된다. 본 논문에서는 배치 마코프도착과정, 단계 서비스분포 및 유한버퍼를 갖는 다중서버 재시도 대기 시스템에 대한 수리모형을 제시한다. 제시된 시스템의 정상상태 분포 존재를 위한 충분조건을 유도하고, 이 분포를 계산하기 위한 알고리즘이 제시된다. 끝으로 완전입력규칙을 갖는 시스템에 대한 손실확률을 계산하기 위한 식이 유도하고, 수치 예제들을 제시한다.

Attempt and Retry Estimation for the Quality-Control of Electronic Switching System (전자교환기 품질관리를 위한 발생 호수와 재시도 호수 추정)

  • Cha, Kyoung-Cheon;Jun, Duk-Bin
    • IE interfaces
    • /
    • v.18 no.3
    • /
    • pp.327-332
    • /
    • 2005
  • The call-attempt behavior in a telecommunications service is influenced by the launch of new services and the choice of subscribers. On Feb 28, 2005, there was a disastrous shut-down of major local electronic switching systems (ESS) due to an abrupt increase of call-attempts. This incident turned out to be a strong proof that appropriate forecasting attempts are necessary not only for the capacity planning of network but also for the quality control of ESS. In this paper, forecasting models are first developed to estimate the daily ESS call-attempts and user retrial rates and then meaningful interpretations of results will follow. Finally future research topics will be presented.

Software Component Retrieval System for Version Control (버전제어를 위한 소프트웨어 구성요소의 검색 시스템)

  • O, Sang-Yeop;Kim, Heung-Jin;Jang, Deok-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1093-1102
    • /
    • 1996
  • For the reuse, configuration management, and version control of softwares, the composition of retrieval systems and library are most important matters, which makes it possible to retrieve the concerned software components. Retrieval systems, which is able to store many components, must make it possible to retrieve the concerned components with deadwoods in the fastest way. Based either on keyboards or the concept of inverted file on the part of content is usually used in the current retrieval systems. However, in this paper, new retrieval systems are suggested with using set and bag class with Smalltalk language, one of object- oriented programming language, based either on the keywords or on the part of content to find out the concerned components. This method is improved the function of user interface and its management, In this paper, library is also suggested along with the new retrieval systems, and user interface is designed and implemented for its management and control. The new retrial systems of this paper can be employed by interface in another language, and this system is to provide the concerned user with the appropriate retrieval systems and library for the version control.

  • PDF