• 한국농촌건축학회논문집
• /
• 제13권1호
• /
• pp.71-78
• /
• 2011

The present conditions of Sanyangri village at Samcheok are stagnated and spiritless because there is only old men without young men. The purpose of this study is to make the basic plans of this rural and mountainous village to learn by personal experience. Therefore this study has been focused on its programs, land uses, roads and facilities how to activate it. The plan orientation of it is to make and become active by tourists to visit this village to experience the rural and mountainous living culture. So the general plan is divided into two zone which are the rural experience zone and the mountainous experience zone. Also the plan is to be considered to increase its amenities through the connection of surrounding villages and their resources. And it is necessary for the conversion as a tour place of sojourn and experience by supplying with various shows through connections with surrounding tour resources worthy of providing the various excitement through the visiting.

• 한국경영과학회지
• /
• 제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.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.103-114
• /
• 2008

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.

• 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.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.97-109
• /
• 1998

In this paper, we propose a new approach to solve stochastic fluid flow models applied to the analysis of ceil loss of an ATM multiplexer. Existing stochastic fluid flow models have been analyzed by using linear differential equations. In case of large state space, however. analyzing stochastic fluid flow model without numerical errors is not easy. To avoid this numerical errors and to analyze stochastic fluid flow model with large state space. we develope a new computational algorithm. Instead of solving differential equations directly, this approach uses iterative and numerical method without calculating eigenvalues. eigenvectors and boundary coefficients. As a result, approximate solutions and upper and lower bounds are obtained. This approach can be applied to stochastic fluid flow model having general Markov chain structure as well as to the superposition of heterogeneous ON-OFF sources it can be extended to Markov process having non-exponential sojourn times.

• 한국경영과학회지
• /
• 제28권4호
• /
• pp.145-153
• /
• 2003

In this Paper, we examine the limiting distributional behaviour of extreme values of mixed Erlang random variables. We show that, in the finite mixture of Erlang distributions, the component distribution with an asymptotically dominant tail has a critical effect on the asymptotic extreme behavior of the mixture distribution and it converges to the Gumbel extreme-value distribution. Normalizing constants are also established. We apply this result to characterize the asymptotic distribution of maxima of sojourn times in M/M/s queuing system. We also show that Erlang mixtures with continuous mixing may converge to the Gumbel or Type II extreme-value distribution depending on their mixing distributions, considering two special cases of uniform mixing and exponential mixing.

• 대한수학회지
• /
• 제38권4호
• /
• pp.807-842
• /
• 2001

This paper summarizes recent development of analytical and algorithmical results for stationary FIFO queues with multiple Markovian arrival streams, where service time distributions are general and they may differ for different arrival streams. While this kind of queues naturally arises in considering queues with a superposition of independent phase-type arrivals, the conventional approach based on the queue length dynamics (i.e., M/G/1 pradigm) is not applicable to this kind of queues. On the contrary, the workload process has a Markovian property, so that it is analytically tractable. This paper first reviews the results for the stationary distributions of the amount of work-in-system, actual waiting time and sojourn time, all of which were obtained in the last six years by the author. Further this paper shows an alternative approach, recently developed by the author, to analyze the joint queue length distribution based on the waiting time distribution. An emphasis is placed on how to construct a numerically feasible recursion to compute the stationary queue length mass function.

• 산업경영시스템학회지
• /
• 제26권2호
• /
• pp.62-67
• /
• 2003

This paper deals with a First-Come, First-Served queueing model to analyze the behavior of heterogeneous finite source system with a single server Each sources and the processor are assumed to operate in independently Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment, that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as, utilizations, mean number of requests staying at the server, mean queue lengths, average waiting and sojourn times. In the case of fast arrivals or fast service asymptotic methods can be applied. In the intermediate situations stochastic simulation Is used. As applications of this model some problems in the field of telecommunications are treated.

• 한국IT서비스학회지
• /
• 제13권3호
• /
• pp.201-219
• /
• 2014

This paper considers service deployment and priority optimization for multiple service-oriented applications sharing reusable services, which are deployed as multiple instances in the cloud. In order to handle variations in the workloads of the multiple applications, service instances of the individual reusable services are dynamically provisioned in the cloud. Also service priorities for each application in a particular reusable service are dynamically adjusted. In this paper, we propose an analytic performance model, based on a queueing network model, to predict the expected sojourn times of multiple service-oriented applications, given the number of service instances and priority disciplines in individual reusable services. We also propose a simple heuristic algorithm to search an optimal number of service instances in the cloud and service priority disciplines for each application in individual reusable services. A numerical example is also presented to demonstrate the applicability of the proposed performance model and algorithm to the proposed optimal decision problem.