• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.119-128
• /
• 2010

Let ${X_n,\;n\geq1}$ be a sequence of independent identically distributed (i.i.d.) random variables (r.vs.), defined on a probability space ($\Omega$,A,P), and let ${N_n,\;n\geq1}$ be a sequence of positive integer-valued r.vs., defined on the same probability space ($\Omega$,A,P). Furthermore, we assume that the r.vs. $N_n$, $n\geq1$ are independent of all r.vs. $X_n$, $n\geq1$. In present paper we are interested in asymptotic behaviors of the random sum $S_{N_n}=X_1+X_2+\cdots+X_{N_n}$, $S_0=0$, where the r.vs. $N_n$, $n\geq1$ obey some defined probability laws. Since the appearance of the Robbins's results in 1948 ([8]), the random sums $S_{N_n}$ have been investigated in the theory probability and stochastic processes for quite some time (see [1], [4], [2], [3], [5]). Recently, the random sum approach is used in some applied problems of stochastic processes, stochastic modeling, random walk, queue theory, theory of network or theory of estimation (see [10], [12]). The main aim of this paper is to establish some results related to the asymptotic behaviors of the random sum $S_{N_n}$, in cases when the $N_n$, $n\geq1$ are assumed to follow concrete probability laws as Poisson, Bernoulli, binomial or geometry.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.11
• /
• pp.517-526
• /
• 2008

As the functionality of portable devices arc being enhanced and the performance is being greatly improved, power dissipations of battery driven portable devices are being increased. So, an efficient power management for reducing their power consumption is needed. In this paper, we propose a window-based DVS algorithm for MPEG Player. The proposed algorithm maintains the recently frame information and execution time received from MPEG player in window queue and dynamically adjusts (frequency, voltage) level based on window queue information. Our algorithm can be implemented in the common multimedia player as a module. We employed well-known MPlayer for the measurement of performance. The experimental result shows that the proposed algorithm reduces energy consumption by 56% on maximal performance.

• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.58-68
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.203-213
• /
• 2008

U-Turn offers convenience to drivers. U-Turn increases efficiency of traffic flow. But Standard of U-Turn is not clear. It caused many problems of traffic flow and traffic safety. This study estimate length between U-Turn location with front intersection based on stopping sight distance and left-turn vehicle's queue length. Variables are used traffic volume and operation speed. This study Analysis of U-Turn vehicle's behaviors and classification of conflict form by investigation. U-Turn length estimating based on relationship analysis between conflict with U-Turn length. Variables are used lane changing angles and operation speed. This study estimates length between U-Turn location with back intersection based on gap acceptance theory. Variables are used traffic volume, operation speed and lane changing angles. So, U-Turn location and length estimated considering traffic flow and traffic safety.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.29-34
• /
• 2017

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.128-131
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assigns the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. In result, the proposed algorithm enhances the packet discard rate at the EF class than WRR scheduling method and the AF4 class than PQ scheduling method.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2019.11a
• /
• pp.141-143
• /
• 2019

Vessel Traffic Service (VTS) increases the efficiency of maritime traffic in terms of reducing marine accidents and the efficient use of port facilities. This means that ports and waterways have their own capacities and can be safely adapted to their capacity through proper traffic management of the VTS. Proper traffic management can reduce the number of vessels and unnecessary waiting in ports, which can lead to economic benefits of ups and port terminals. On the other hand, Korean ports and waterways have restrictions on the maximum speed for safety, but there is no restriction on the minimum speed. However, ships that operate at low speeds in ports and waterways may be able to occupy long periods of operational routes, which may impede efficient port operation. Therefore, the purpose of this study is to propose the minimum speed of ship for efficient port and waterway use. To this end, we reviewed the current laws and systems and proposed the appropriate minimum speed in the waterway using the theory of queue.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.394-400
• /
• 2000

The main goal of synchronization is to guarantee exclusive access to shared data and critical sections, and then it makes parallel programs work correctly and reliably. Exclusive access restricts parallelism of parallel programs, therefor efficient synchronization is essential to achieve high performance in shared-memory parallel programs. Many techniques are devised for efficient synchronization, which utilize features of systems and applications. This paper shows the simulation results that existing synchronization methods have inefficiency under CC-NUMA(Cache Coherent Non-Uniform Memory Access) system, and then compares the performance of Freeze&Melt synchronization that can remove the inefficiency. The simulation results present that Test-and-Test&Set synchronization has inefficiency caused by broadcast operation and the pre-defined order of Queue-On-Lock-Bit (QOLB) synchronization to execute a critical section causes inefficiency. Freeze&Melt synchronization, which removes these inefficiencies, has performance gain by decreasing the waiting time to execute a critical section and the execution time of a critical section, and by reducing the traffic between clusters.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.1
• /
• pp.41-49
• /
• 2001

This study developed signal optimization algorithm by analyzing vehicle arrival patterns. The major principle of signal optimization is dissipate all queueing vehicle in 1cycle and assign delay time uniformly for all approaches. For this, this study used optimal green time and surplus green time. Optimal green time calculated by estimated traffic volume from vehicle arrival model. Surplus green time defined as the gap of optimal green time and queue dissipated time. And alternative cycle has minimum surplus green time was selected as the optimal cycle. Finally, total delay and average delay per vehicle can be calculated by using queueing theory.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.26-30
• /
• 2004

We consider an AS/RS(Automated Storage/ Retrieval System) which performs both of single and dual commands. The service times of single and dual commands are assumed to be differently distributed. Steady-state probabilities at the service completion epochs are calculated. Then, we transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of an AS/RS, and obtain approximated means of queue lengths and waiting times.