• 한국통신학회논문지
• /
• 제25권4B호
• /
• pp.692-699
• /
• 2000

We build and analyze some types of queueing model to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Internet backbone network. We assume that the IWU has a FIFO buffer to transmit IP packets to the Internet through the backbone. In order to analyze the system, we use a Poisson process and an MMPP process as input traffic models of IP packets and we use a general service time distribution as a service time model. But we use both an exponential service time and a deterministic service time in numerical examples for simple and efficient performance comparisons. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effect of arrival rate, buffer size and link capacity on packet loss and mean delay.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.73-80
• /
• 2005

In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.881-889
• /
• 2005

In this study, we consider characteristics of waiting times in single-server 3-node tandem queues with a Poisson arrival process, finite buffers and deterministic or non-overlapping service times at each queue. There are three buffers: one at the first node is infinite and the others are finite. The explicit expressions of waiting times in all areas of the systems, which are driven as functions of finite buffer capacities, show that the sojourn time does not depend on the finite buffer capacities and also allow one to compute and compare characteristics of waiting times at all areas of the system under two blocking policies: communication and manufacturing blocking. As an application of these results, moreover, an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on waiting times is considered. Some numerical examples are also provided.

• 대한산업공학회지
• /
• 제27권1호
• /
• pp.89-94
• /
• 2001

There are many queueing systems where customers wait for service up to a certain amount of time and leave the system if they are not served during that time. This paper considers a finite capacity multi-server queueing system with Poisson input and Erlang service time, where a customer becomes a lost customer when his service has not begun within an exponential patient time after his arrival. Performance measures such as average queue length, the average number of customers in service, and the proportion of lost customers can be obtained exactly through the proposed numerical solution procedure.

• 대한산업공학회지
• /
• 제5권1호
• /
• pp.59-66
• /
• 1979

The objective of this paper is to develop a stochastic inventory system model under the so-called continuous-review policy with a Poisson one-at-a-time demand process, iid customer inter-arrival times {Xi}, backorders allowed, and constant procurement lead time $\gamma$. The distributions of the so-called inventory position process {$IP_{(t-r)}$} and lead time demand process {$D_{(t-r,t)}$} are formulated in terms of cumulative demand by time t, {$N_t$}. Then, for the long-run expected average annual inventory cost expression, the "ensemble" average is estimated, where the cost variations for stock ordering, holding and backorders are considered stationary.

• Management Science and Financial Engineering
• /
• 제2권1호
• /
• pp.123-145
• /
• 1996

We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

• 한국경영과학회지
• /
• 제29권4호
• /
• pp.1-10
• /
• 2004

In this paper we study bounds for characteristics of stationary waiting times in (max, +)-linear systems with a Poisson arrival process. which are prevalent in manufacturing systems, kanban systems, cyclic and acyclic fork-and-join type systems, finite or infinite capacity tandem queues with various kinds of blocking, transportation systems, and telecommunication networks, and so on. Recently, some results on series expansion for characteristics, such as higher moments, Laplace transform, and tail probability, of transient and stationary waiting times in a class of (max, +)-linear systems via Taylor series expansions have been studied. In order to overcome the computational complexity in those results, we consider bounds for characteristics of stationary waiting times using valuable stochastic ordering results. Some numerical examples are also provided.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 추계종합학술대회
• /
• pp.267-271
• /
• 2000

최근 인터넷 사용의 급증은 전체적인 망 이용율의 증가를 야기시켜 트래픽의 증가 원인이 된다. 이러한 트래픽 분석을 통해 통계적인 특성을 갖는 장치의 설계와 배치가 요구된다. 따라서, 이러한 인터넷 트래픽의 자기유사성을 분석하고, Simulation 과정을 통해 최적화된 설계요소를 찾아서 실제 네트워크의 성능향상을 연구하고자 한다.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2017년도 추계학술대회
• /
• pp.27-29
• /
• 2017

Container terminals in Northern Vietnam have recorded an impressive development in recent years. This development, however, also raises a fierce competition among local container terminals to attract customers. Beside the handling charges, the vessels' waiting cost is also an important factor that drive the opinion of users in choosing appropriate terminal. This research plans to estimate the waiting cost in different container terminals in Northern Vietnam by building regression equation that describe the relationship between the rate of throughput/capacity and waiting cost/TEU. Queuing theory with the application of Poisson distibution is used to estimate the waiting time of arrival vessels and uncertainty theory is applied to estimate the vessel's daily expenses. Previous studies suggested two different formation of the equation and according to the research results, cubic equation is more suitable in the given case. The research results are also useful for further research which require calculation of waiting cost per TEU in each container terminal in Northern Vietnam.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 춘계종합학술대회
• /
• pp.263-267
• /
• 2000

기존의 트래픽 분석은 포아손 분포나 마르코프 모델로 트래픽을 모델링하고, 패킷의 큐 도착을 지수분포로 가정하였으나, 지난 몇 년간의 연간결과 네트워크 트래픽은 비주기성 및 버스트 특성을 가심을 알게 되었다 이러한 트래픽의 특성은 자기유사 특성을 가진 새로운 트래픽 모델로 분석 하므로써, 네트워크의 확장성, QoS, 그리고 최적화된 설계를 가능하게 한다. 본 논문에서는 시뮬레이션 망을 통한 small-scale 에서의 혼재된 트래픽 특성과 실제 WAN의 도착 지연시간, 그리고 전체망의 이용률에 대한 각각의 자기유사특성을 분석 한다.