• 산업경영시스템학회지
• /
• 제28권1호
• /
• pp.114-120
• /
• 2005

This paper studies procedures for bottleneck detection in closed queueing networks(CQN's) with multiple job classes. Bottlenecks refer to servers operating at $100\%$ utilization. For CQN's, this can occur as the population sizes approach infinity. Bottleneck detection reduces to a non-linear complementary problem which in important special cases may be interpreted as a Kuhn-Tucker set. Efficient computational procedures are provided.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.710-715
• /
• 2004

The design problem of manufacturing system is addressed, adopting the closed queueing network model with multiple loops and re-entrant flows. The entire design problem is divided into two hierarchical sub-problems of (1) determining the station configuration and (2) optimizing the lot constitution; then they are tackled by neighbor search algorithm (NSA) and greedy mean value analysis (GMVA), respectively. Unlike the conventional MVA concerning multi-class closed queueing networks, the GMVA doesn't stick to a fixed lot proportion; rather it tries to find the optimal balance. The NSA, on the other hand, improves the object function value by altering the station configuration successively with its superior neighbor. The moderate time complexity, presented in big-${o}$ notation, enables us to apply the method even to the large-size practical cases, and the CPU time of an enlarged problem can be approximated by the same equation. The validity of our analytic approach is backed up by simulation studies with a widespread simulation package.

• Journal of Communications and Networks
• /
• 제3권4호
• /
• pp.383-395
• /
• 2001

Recent measurement and simulation studies have revealed that wide area network traffic displays complex statistical characteristics-possibly multifractal scaling-on fine timescales, in addition to the well-known properly of self-similar scaling on coarser timescales. In this paper we investigate the performance and network engineering significance of these fine timescale features using measured TCP anti MPEG2 video traces, queueing simulations and analytical arguments. We demonstrate that the fine timescale features can affect performance substantially at low and intermediate utilizations, while the longer timescale self-similarity is important at intermediate and high utilizations. We relate the fine timescale structure in the measured TCP traces to flow controls, and show that UDP traffic-which is not flow controlled-lacks such fine timescale structure. Likewise we relate the fine timescale structure in video MPEG2 traces to sub-frame encoding. We show that it is possibly to construct a relatively parsimonious multi-fractal cascade model of fine timescale features that matches the queueing performance of both the TCP and video traces. We outline an analytical method ta estimate performance for traffic that is self-similar on coarse timescales and multi-fractal on fine timescales, and show that the engineering problem of setting safe operating points for planning or admission controls can be significantly influenced by fine timescale fluctuations in network traffic. The work reported here can be used to model the relevant characteristics of wide area traffic across a full range of engineering timescales, and can be the basis of more accurate network performance analysis and engineering.

• 전자공학회논문지CI
• /
• 제38권4호
• /
• pp.1-9
• /
• 2001

본 논문에서는 한 개의 서버와 시스템용량 K를 갖는 M/M/1/K 큐잉네트워크모델에 펴지집합이론을 적용한 퍼지 M/M/1/K 큐잉네트워크모델을 제안하였다. 작업의 도착율과 서버의 서비스율의 형태가 언어적 속성으로 표현될 때， 이 모델을 사용하여 시스템의 해석이 가능해진다. 시스템의 평가를 위해서 시스템내 평균작업수， 작업 평균진입률， 그리고 작업 평균소요시간 등 시스템의 주요 평가측도를 유도하였다. 퍼지 작업 환경에서 이러한 결과식들의 유효함을 검증하기 위하여， 제안된 모델에 다양한 퍼지도착율 ${\lambda}$와 퍼지서비스율 ${\mu}$에 대하여 시스템용량 K 값의 변화에 따른 성능평가를 컴퓨터 시뮬레이션하였다. 그 결과가 제안한 퍼지 모델에서 예측한 평가와 일치함을 확인하였다.

• Industrial Engineering and Management Systems
• /
• 제15권2호
• /
• pp.131-142
• /
• 2016

We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.553-568
• /
• 1999

This paper is of concern to queueing analysis of the dynamic rate leaky bucket(LB) scheme in which the token generation interval changes according to the buffer state at a token generation epoch. Cell arrivals are assumed to follow a Markovian arrival process (MAP) which is weakly dense in the class of the stationary point processes. By using the embedded Markov chain method we obtain the probability distribution of the system state at a token generation epoch and an arbitrary time. Some simple numerical examples also are provided to show the effects of the proposed LB scheme.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.879-890
• /
• 2002

In this paper we consider open queueing system with a Poisson arrival process which have a finite upper bound on the arrival rate for which the system is stable. Interpolation approximations for quantities of interest, such as moments of the sojourn time distribution, have previously been developed for such systems, utilizing exact light and heavy traffic limits. These limits cannot always be easily computed for complex systems. Thus we consider an interpolation approximation where all of the relevant information is estimated via simulation. We show that all the relevant information can in fact be simultaneously estimated in a single regenerative simulation at any arrival rate. In addition to light and heavy traffic limits, both the quantity of interest and its derivative (with respect to the arrival rate) are estimated at the arrival rate of the simulation. All of the estimates are then combined, using a least squares procedure, to provide an interpolation approximation.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.261-264
• /
• 2000

When there ate several classes of customers demanding service times with different distributions at some stations of a queueing network, the stability problem becomes suddenly complicated compared with the single class case. Recently many researchers had tried to find some kind of stability conditions for multiclass queueing networks, but did not get significant results except in very limited 2-station cases. In this study, we try to develop some dynamic control techniques which can guarantee the stability under the nominal traffic condition. Our approach includes the randomization method and the leaky bucket control scheme. Also, we mention other possibilities such as the discrete-review approach and the generalized round-robin technique. Both theoretical and experimental results will be presented.

• 한국통신학회논문지
• /
• 제12권2호
• /
• pp.92-101
• /
• 1987

통신망에 입력하는 메시지는 그 메시지에 부과되는 우선도에 의하셔 큐잉(Queueing)되며 큐(Queue)에서의 우선도는 여러가지 방법으로 취급되어진다. 이 연구는 메시지 처리의 한 방법인 동적 우선도(dynamic priority)에 관한 것으로 메시지의 평균 대기 시간에 관한 해석이다. 큐에서의 메시지의 대기 시간에 따라 우선도가 변하는 동적 우선도의 가변성은 그 메시지가 초기 우선도(initial priority)를 가지고 입력되는 경우가 초기우선도를 가지지 않는 경우 달라지는 것으로 특히 그 차이점을 고찰하였다.

• 한국통신학회논문지
• /
• 제24권10B호
• /
• pp.1971-1978
• /
• 1999

본 논문에서는‘shifting-level (SL) process’을 기초로 한 모델을 사용하여, VBR 부호화된 영상트래픽의 long-range dependence (LRD) 특성이 대기체계에 미치는 영향에 대해서 연구하였다. 연구 내용은 제1부와 제2부로 나누어 전개된다. 제 1부에서는 실제 영상트래픽의 자기상관함수가 exponential과 hyperbolic의 복합함수로 매우 정확히 표현될 수 있음을 보이고, 이러한 조건을 만족하는 SL process with compound correlations(SLCC)를 제안한다. 대표적인 SRD 모델인 DAR(1)모델과의 대기성능 비교를 통하여 hyperbolic한 상관도가 대기체계에 끼치는 영향을 분석한다. 분석결과 영상의 LRD 특성이 대기체계에 끼치는 영향의 중요도는 단순히‘Yes/No’로 답할 수 없으며, 트래픽 부하가 높아지면 그 영향이 강하게 나타나고, 반대로 트래픽 부하가 낮은 경우에는 무시할 수 있을 정도로 약하게 나타남을 알 수 있다. 여기에 사용하는 SL/D/1/K 대기체계의 해석방법을 제2부에서 다루게 된다.