• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.149-159
• /
• 2005

In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

• International Journal of Reliability and Applications
• /
• v.8 no.1
• /
• pp.67-82
• /
• 2007

This paper deals with the effectiveness analysis of an engineering system, which has two units of different strengths in parallel and one unit as a cold standby unit. Failure times for all the units have negative exponential distribution whereas their repair times have general distribution. Single server caters the need for the system. The effectiveness analysis of the system is done by using regenerative point technique. The different measures of effectiveness such as mean sojourn time, mean time to system failure, availability, busy period, etc, are derived. Cost factors also taken into consideration.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.107-118
• /
• 2007

A single-server queueing model with infinite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of an accepted batch arrive one-by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. Analysis of the joint distribution of the number batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. Effect of control on the main performance measures of the system is demonstrated numerically.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.841-844
• /
• 2002

Recently there has been an increasing interest in queueing models with disasters. Upon arrival of a disaster, all the customers present are noshed out. Queueing models with disasters have been applied to the problems of failure recovery in many computer networks systems, database systems and telecommunication networks in this paper, we suffest the steady state and sojourn time distributions of the M/G/l model with disaster and mass alway when the system is empty.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.923-929
• /
• 2002

We discuss scheduling analysis for a discrete event system with time windows of which firing or holding time delays are subject to random variation within some finite range. To do this, we propose a modified p-lime Petri net, named p+-time Petri net. We develop a condition for which a synchronized transition does not have a dead token, that is, the firing epochs do not violate the time window constraints. We propose a method of computing the feasible range of the token sojourn time at each place based on a time difference graph. We also discuss an application for analyzing wafer residency times within the process chambers for a dual-armed cluster tool for chemical vapor deposition.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.18-26
• /
• 2006

여러 형태의 고객이 외부로부터 포아송과정에 따라 각 대기행렬에 도착하고 정해진 서비스규칙에 따라 해당 서비스를 받은 후 마코비안 확률분포에 따라 시스템을 떠나거나 다른 형태의 고객으로 시스템을 다시 돌아 올 수도 있는 M/G/1 대기행렬시스템을 고려한다. 본 연구에서는 기존의 연구 모형을 확장하여 계층적 서비스 규칙을 갖는 우선순위 대기행렬모형을 제시하고 이에 대한 시스템 성능척도를 보다 체계적으로 구할 수 있는 방법을 소개한다. 이를 위하여 먼저 대기행렬시스템의 거동을 나타내는 시스템 상태를 정의하고, 바쁜기간과 서비스기간 분석을 통하여 시스템 상태의 선형 함수로 평균체제시간을 구할 수 있음을 보인다.

• Journal of the Korean association of regional geographers
• /
• v.16 no.3
• /
• pp.275-294
• /
• 2010

In recent years, international migration of professional workers is significantly increasing as globalization has been deepened more and more. South Korea is not an exception for this case. Immigration of professional workers have steadily increased since 2000 in Korea, and the number reached approximately to 50,000 in 2009. In addition, it is a major trend that immigrants of short-sojourn are decreasing and ones of long-sojourn increasing. Our research shows that foreign language instructor has the greatest number of foreign professional immigrants. The next is professional immigrants related to business-activities. There are considerably entertainers, but they have greatly decreased since 2003. Majority of foreign professional immigrants settle down in a few metropolises. Especially, they reside in Seoul Metropolitan Area and Southeast coastal region. Professional immigrants trend to do with Korean on the base of their offices rather than residental communities in terms of adaptation, and they do not have strong will to reside permanently in Korea. Moreover, they are located at a blind spot of Korean government's foreign immigrant policy, comparing to foreign workers and female marriage immigrants.

• Journal of Preventive Medicine and Public Health
• /
• v.39 no.4
• /
• pp.346-352
• /
• 2006

Objectives: The purposes of this study were to propose a screening schedule for the early detection of breast cancer among Korean women, as based on the statistical model, and to compare the efficacy of the proposed screening schedule with the current recommendations. Methods: The development of the screening schedule for breast cancer closely followed the work of Lee and Zelen (1998). We calculated the age-specific breast cancer incidence rate from the Korea Central Cancer Registry (2003), and then we estimated the scheduling of periodic examinations for the early detection of breast cancer, using mammography, and based on the threshold method. The efficacy of the derived screening schedule was evaluated by the schedule sensitivity. Results: For estimating the screening schedule threshold method, we set the threshold value as the probability of being in the preclinical stage at age 35, the sensitivity of mammography as 0.9 and the mean sojourn time in the preclinical stage as 4 years. This method generated 14 examinations within the age interval [40, 69] of 40.0, 41.3, 42.7, 44.1, 45.4, 46.7, 48.0, 49.3, 51.0, 53.2, 55.3, 57.1, 59.0 and 63.6 years, and the schedule sensitivity was 75.4%. The proposed screening schedule detected 85.2% (74.5/87.4) of the cases that could have been detected by annual screening, but it required only about 48.7% (14.0/30.0) of the total number of examinations. We also examined the threshold screening schedules for a range of sensitivities of mammography and the mean sojourn time in the preclinical stage. Conclusions: The proposed screening schedule for breast cancer with using the threshold method will be helpful to provide guidelines for a public health program for choosing an effective screening schedule for breast cancer among Korean women.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.355-366
• /
• 2008

This paper proposes a mobile SCTP (mSCTP) handover scheme for vertical handover between 3G wireless and WiBro networks. To evaluate the proposed mSCTP vertical handover scheme, we implement the mSCTP handover supporting system over Linux platform in which the movement of a mobile node is automatically detected and the mSCTP vertical handover is performed by the mobile node. We analyze and compare the performance of mSCTP handover and Mobile IP handover over the preconfigured testbed. From the numerical results, we can see that the handover latency of mSCTP could be much more reduced, compared to the Mobile IP handover, if the mobile node would sojourn long enough in the overlapping region between the two heterogeneous networks.