• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.385-395
• /
• 1999

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

• Journal of the Korea Society for Simulation
• /
• v.8 no.2
• /
• pp.1-11
• /
• 1999

Advanced information communication processing system mainly consists of network access subsystems and a switching system. This paper provides performance analysis of a typical network access subsystem. The network access subsystem is modeled as a queueing network including a server providing polling services. The arrival process of messages to an input buffer is regarded as a Poisson process. Performance measures such as mean input buffer length and mean waiting time of meassages are obtained through simulation, for it is impossible to calculate the performance measures using an analytical method. Hybrid simulation is used to reduce the variance of estimators. The variance reduction effect on the mean waiting time is reported.

• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.2
• /
• pp.107-115
• /
• 1992

Many manufacturing processes involved in the fabrication and assembly of hightech components have highly variable yields that tend to complicate the production control. Under this random yield situation we develop a model to determine optimal input quantity, mean waiting time in the system and variance of waiting time in the system. An example which considers beta distribution as a yield distribution is given.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.264-264
• /
• 1992

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.306-316
• /
• 2004

We present a closed form approximate analytical model to estimate the expected waiting times for the storage and retrieval requests of an automated storage/retrieval (AS/R) system, assuming that the storage/retrieval (S/R) machine idles either at the rack or at the input/output point. The expected waiting times (and the associated mean queue lengths) can play an important role to decide whether the performance of a stable AS/R system is actually acceptable, to determine buffer size (or length) of the input conveyor, and to compute the number of the rack openings which is required to hold the loads which are requested by processing machines but waiting in the rack to be retrieved by the SIR machine. This model can be effectively used in the early design stage of an AS/R system.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.4
• /
• pp.112-120
• /
• 2001

In this paper, the development of a new group controller for high-speed elevator is carried out utilizing the approach of an adaptive dual fuzzy logic. Some goals of control are the minimization of waiting time, mean-waiting time and long-waiting time in a high building, when a new hall call is generated, adaptive dual fuzzy controller evaluate traffic pattern and change appropriately the membership function of a fuzzy rule base. Controls for co-operation among elevators in a group control algorithm arte essential, and the most critical control function in the group controller is an effective and proper hall call assignment of elevators. The group elevator system utilizing adaptive dual fuzzy control reveals a great deal of improvement on its performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.578-581
• /
• 2001

In this paper, the development of a new group controller for high-speed elevator is carried out utilizing approach of an adaptive dual fuzzy logic. A goals of control are the minimization of waiting time, mean-waiting time and long-waiting time in a building. when a new hall call is generated, adaptive dual fuzzy controller evaluate traffic pattern and change appropriately the membership function of fuzzy rule base. Control for co-operation among elevators in group control algorithm are essential, and the most critical control function in group controller is a effective and proper hall call assignment of elevators. Thy group elevator system utilizing adaptive dual fuzzy control reveals a great deal of improvement on its performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.157-160
• /
• 2000

In this paper, the development of a new group controller for high-speed elevator is carried out utilizing approach of an adaptive dual fuzzy logic. A goals of control are the minimization of waiting time, mean-waiting time and long-waiting time in a high building, when a new hall call is generated, adaptive dual fuzzy controller evaluate traffic pattern and change appropriately the membership function of fuzzy rule, base. Control for co-operation among elevators in group control algorithm are essential , and the most critical control function in group controller is a effective and proper hall call assignment of elevators. The group elevator system utilizing adaptive dual fuzzy control reveals a great deal of improvement on its performance.

• Journal of Mechanical Science and Technology
• /
• v.15 no.12
• /
• pp.1664-1675
• /
• 2001

In this paper, the development of a new group controller for high-speed elevators is described utilizing the approach of adaptive dual fuzzy logic. Some goals of the control are to minimize the waiting time, mean-waiting time and long-waiting time in a building. When a new hall call is generated, all adaptive dual fuzzy controller evaluates the traffic patterns and changes the membership function of a fuzzy rule base appropriately. A control algorithm is essential to control the cooperation of multiple elevators in a group and the most critical control function in the group controller is an effective and proper hall call assignment of the elevators. The group elevator system utilizing adaptive dual fuzzy control clearly performs more effectively than previous group controllers.