애스크로AIPublic Preview
← 학술논문 검색
학술논문Communications for Statistical Applications and Methods2018.07 발행

Conditional sojourn time distributions in M/G/1 and G/M/1 queues under P^M_λ -service policy

Conditional sojourn time distributions in M/G/1 and G/M/1 queues under P^M_λ -service policy

김성곤(서울시립대학교)

25권 4호, 443~451쪽

초록

P^M_λ-service policy is a workload dependent hysteretic policy. The policy has two service states comprised of the ordinary stage and the fast stage. An ordinary service stage is initiated by the arrival of a customer in an idle state. When the workload of the server surpasses threshold λ, the ordinary service stage changes to the fast service state, and it continues until the system is empty. These service stages alternate in this manner. When the cost of changing service stages is high, the hysteretic policy is more efficient than the threshold policy, where a service stage changes immediately into the other service stage at either case of the workload's surpassing or crossing down a threshold. P^M_λ-service policy is a modification of P^M_λ-policy proposed to control finite dams, and also an extension of the well-known D-policy. The distributions of the stationary workload of P^M_λ-service policy and its variants are studied well. However, there is no known result on the sojourn time distribution. We prove that there is a relation between the sojourn time of a customer and the first up-crossing time of the workload process over the threshold λ after the arrival of the customer. Using the relation and the duality of M/G/1 and G/M/1 queues, we obtain conditional sojourn time distributions in M/G/1 and G/M/1 queues under the policy.

Abstract

P^M_λ-service policy is a workload dependent hysteretic policy. The policy has two service states comprised of the ordinary stage and the fast stage. An ordinary service stage is initiated by the arrival of a customer in an idle state. When the workload of the server surpasses threshold λ, the ordinary service stage changes to the fast service state, and it continues until the system is empty. These service stages alternate in this manner. When the cost of changing service stages is high, the hysteretic policy is more efficient than the threshold policy, where a service stage changes immediately into the other service stage at either case of the workload's surpassing or crossing down a threshold. P^M_λ-service policy is a modification of P^M_λ-policy proposed to control finite dams, and also an extension of the well-known D-policy. The distributions of the stationary workload of P^M_λ-service policy and its variants are studied well. However, there is no known result on the sojourn time distribution. We prove that there is a relation between the sojourn time of a customer and the first up-crossing time of the workload process over the threshold λ after the arrival of the customer. Using the relation and the duality of M/G/1 and G/M/1 queues, we obtain conditional sojourn time distributions in M/G/1 and G/M/1 queues under the policy.

발행기관:
한국통계학회
분류:
통계학

AI 법률 상담

이 논문의 주제에 대해 더 알고 싶으신가요?

460만+ 법률 자료에서 관련 판례·법령·해석례를 찾아 답변합니다

AI 상담 시작
Conditional sojourn time distributions in M/G/1 and G/M/1 queues under P^M_λ -service policy | Communications for Statistical Applications and Methods 2018 | AskLaw | 애스크로 AI