• 전자공학회논문지CI
• /
• 제39권1호
• /
• pp.14-22
• /
• 2002

분산처리시스템에서 작업의 도착률과 서비스요구, 그리고 서버의 서비스률 등이 네트워크환경에 따라 모호성을 갖는 경우, 시스템의 성능을 평가할 수 있는 퍼지 BCMP 큐잉네트워크모델을 제안하였다. 이 모델은 시스템외부로부터 작업의 진입여부에 따라 개방형 및 폐쇄형으로 분류하고, 퍼지요소들을 처리할 수 있는 퍼지평균값 분석방법을 사용하여 작업평균소요시간, 시스템내 작업수 및 서버 활용률 등의 시스템성능을 평가할 수 있는 측도를 각각 유도하였다. 이들의 유효함을 검증하기 위하여 퍼지 BCMP 큐잉네트워크모델에 작업의 퍼지도착률. 클라이언트 수 및 퍼지서비스 요구에 따른 시스템의 성능분석을 개방형과 폐쇄형으로 각각 시뮬레이션하였다. 그 결과 예측된 시스템의 성능평가와 일치함을 보였다.

• Communications for Statistical Applications and Methods
• /
• 제18권4호
• /
• pp.433-443
• /
• 2011

잉여금의 수준에 따라 이단계의 보험요율이 적용되는 복합 포아송 위험 모형을 고려한다. 먼저 이 위험 모형에 대응되는 이단계 서비스율의 M/G/1 대기행렬 모형을 설정하고, M/G/1 대기행렬 모형에서 작업량이 0에 도달하기 전에 과부하가 발생하는 확률을 유도한다. 이과부하 확률을 이용하여 위험모형에서 잉여금이 목표값에 도달하기 전에 파산하는 확률을 구하고, 보험 청구액이 지수분포를 따르는 경우의 파산 확률을 계산한다.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.67-73
• /
• 2011

Using the known result of the expected busy period for a controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) and simple N, T and D operating policies. All three input variables N, T and D are equally contributed to construct such bounds for better estimation.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.27-44
• /
• 2000

In this study we consider a spares provisioning problem for repairable items in which a parts inventory system is incorporated. If a machine fails, a replacement part must be obtained at the parts inventory system before the failed machine enters the repair center. The inventory policy adopted at the parts inventory system is the (S, Q) policy. Operating times of the machine before failure, ordering lead times and repair times are assumed to follow a two-stage Coxian distribution. For this system, we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of machines at each station and the probability that a part will wait at the parts inventory system. For the analysis of the proposed system, we model the system as a closed queueing network and analyze it using a product-form approximation method. A recursive technique as well as an iterative procedure is used to analyze the sub-network. Numerical tests show that the approximation method provides fairly good estimation of the performance measures of interest.

• 한국컴퓨터산업학회논문지
• /
• 제6권2호
• /
• pp.305-316
• /
• 2005

A heterogeneous webserver such as an HTTP server should be able to currently deal with numerous users. To the end, it is inevitable to formally analyze web traffics as well as a webserver itself. In particular, as most systems adopt HTTP 1.1 protocol instead of HTTP 1.0 protocol, it is more difficult to represent the system as a simple analytic mode. In addition, since most of previous models missed the detailed processes of the server, it is unsuitable for the current server based on HTTP 1.1 to tune itself with its own system parameters. On the basis of HTTP 1.1 Protocol supporting persistent connections, we thus present an analytical end-to-end tandem queueing model considering specific hardware configurations inside the webserver, which ultimately covers from accepting the customer requests to completing the services.

• 대한산업공학회지
• /
• 제25권1호
• /
• pp.130-140
• /
• 1999

This paper deals with a priority queueing model in an ATM system. Two types of customers are considered. Type-1 customers have push-put priority over type-2 customers. Type-1 customers can enter the service only when the number of type-2 customers is less than a threshold T. We derive the joint probability of the number of customers in the buffer, the mean waiting time, and the loss probabilities of each type. We also propose an optimal control policy that satisfies a given quality of service.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.71-77
• /
• 2009

Using the results of the expected busy periods for the dyadic Min(N, D) and Max(N, D) operating policies in a controllable M/G/1 queueing model, an important relation between them is derived. The derived relation represents the complementary property between two operating policies. This implies that it could be possible to obtained desired system characteristics for one of the two operating policies from the corresponding known system characteristics for the other policy. Then, upper and lower bounds of expected busy periods for both dyadic operating policies are also derived.

• 산업경영시스템학회지
• /
• 제33권3호
• /
• pp.63-70
• /
• 2010

Based on the known results of the expected busy periods for the triadic Min (N, T, D) and Max (N, T, D) operating policies applied to a controllable M/G/1 queueing model, a relation between them is constructed. Such relation is represented in terms of the expected busy periods for the simple N, T and D, and the dyadic Min (N, T), Min (T, D) and Min (N, D) operating policies. Hence, if any system characteristics for one of the two triadic operating policies are known, unknown corresponding system characteristics for the other triadic operating policy could be obtained easily from the constructed relation.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2000년도 추계학술발표논문집
• /
• pp.561-566
• /
• 2000

컴퓨터 통신 시스템은 단말기와 C.P.U와의 접속 방법에 따라 시분할 시스템과 분산 시스템으로 나누어지는데 이들 두 가지 시스템에서 버퍼에서의 큐잉 형태는 각기 다르다. 본고에서 시분할 시스템의 역 다중화기의 큐잉 형태에 대해서 분석하였고 그것은 결국 M/G/1모델로 나타낼 수 있음을 보여주고 있다.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.395-408
• /
• 2003

Common Channel Signaling(CCS) networks need special controls to avoid overload of signaling networks and degradation of call process-ing rate, since they play an important role of controlling communication transfer networks. Congestion control and flow control mechanisms are well described in ITU-T recommendation on Signaling System No.7(SS7). For the practical provisions, however, we need an analysis on the relation among service objects, system requirements and implementation of congestion control algorithms. SS7 provides several options for controlling link congestion in CCS networks. In this paper we give a general queueing model of congestion control algorithm which covers both the international and national options. From the queuing model, we obtain the performance parameters such as throughput, message loss rate and mean delay for the international option. To show the performance of the algorithm, some numerical results are also given.