• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.400-404
• /
• 2009

Native Command Queueing is a technology to maximize throughput of disk system by reordering requests in its command queue. Recent S-ATA 2 standard specifies a protocol for the purpose of dealing with NCQ feature, making most vendors implementing it in their disk devices. However, the new feature, NCQ, may lead to information gap between OS and disk drive. 05 considers that disk will service I/O requests in the order as OS has dispatched. Unfortunately, it isn't true any more since NCQ would simply ignore the policy of OS and reorder the sequence OS has expected. Let us define the term as expectation-discord. Due to the discord, serious performance anomalies or starvation of requests may occur in I/O subsystem. In this paper, we confirm that the expectation-discord actually brings about starvation of requests. We propose a solution to settle it. Our solution is very simple, effective, cheap(not requiring any hardware modification) and portable across various OS. Experimental results show that our solution can balance throughput and response time very well.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.4
• /
• pp.35-44
• /
• 2004

Recently announced TCP Vegas predicts the degree of congestion in the network and then control the congestion window size. Thus it shows better performance than TCP Reno. however, TCP vegas does not assume any network model, its congestion window control is very limited. Because or this limitation, TCP vegas still can not adapt to fast changing available bandwidth. In this paper, we introduce a new TCP algorithm which adapts to fast changing available bandwidth well. To devise such a TCP, we model the end to end network of TCP connection as a queueing system and finds congestion window size which can utilize the available bandwidth sufficiently but not make the network congested. The simulation results show that our algorithm adapts to the avaliable bandwidth faster than TCP vegas and as a results, when the available bandwidth is changing rapidly, our algorithm not only operates more stably than TCP Vegas, but also it shows higher thruput than TCP Vegas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.876-884
• /
• 2012

This paper introduces two multi-hop delay factors which can be caused by conventional TDMA scheduling; queueing delay and delay by random link scheduling, and proposes a new sequential scheduling scheme to resolve these two factors. We also simulate the TDMA network with the proposed link scheduling scheme and compare it with conventional(random) link scheduling scheme in terms of end-to-end packet transmission delay. From the simulation results, the more the average hop distance increases, the more the difference of the delay performance of both scheduling schemes increases. When the average number of hops is 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 22%, 36%, 48%, and 55% respectively when compared to the random scheduling scheme.

• The Journal of the Korea Contents Association
• /
• v.14 no.9
• /
• pp.589-597
• /
• 2014

The increasing demand for various mobile telecommunication services calls for more spectrum resource. Considering the scarcity of spectrum resource and the difficulties of development of higher frequency band, the unique way to meet the increasing demand is to maximize the utilization efficiency of the current spectrum resource. Under the circumstances, various spectrum sharing plans have been in recent studies to dissolve the excess spectrum demand. In addition, spectrum efficiency measurement methods become more important to verify the effectiveness of spectrum sharing and estimate the performance of various wireless systems. Our research addresses measurement methods to estimate spectrum utilization efficiency in a rational manner. Based on ITU-R recommendations, various measuring methods for spectrum utilization efficiency are reviewed. Then a queueing based approach is newly presented as alternatives to the current models. By using the proposed model, the spectrum efficiency increment with the adoption of spectrum sharing plans can be estimated more properly.

• The Journal of the Korea Contents Association
• /
• v.19 no.4
• /
• pp.79-90
• /
• 2019

As an increasing number of cloud service providers begin to provide cloud computing services, they form a competitive market to compete for users. Due to different resource configurations and service workloads, users may observe different response times for their service requests and experience different levels of service quality. To compete for cloud users, it is crucial for each cloud service provider to determine an optimal price that best corresponds to their service qualities while also guaranteeing maximum profit. To achieve this goal, the underlying rationale and characteristics in this competitive market must be clarified. In this paper, we analyze price competition in the multimedia cloud service market with two service providers. We characterize the nature of non-cooperative games in a duopoly multimedia cloud service market with the goal of capturing how each cloud service provider determines its optimal price to compete with the other and maximize its own profit. To do this, we introduce a queueing model to characterize the service process in a multimedia cloud data center. Based on performance measures of the proposed queueing model, we suggest a price competition problem in a duopoly multimedia cloud service market. By solving this problem, we can obtain the optimal equilibrium prices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2450-2469
• /
• 2018

In this paper, we develop a spatiotemporal model to analysis of cellular user in underlay D2D communication by using stochastic geometry and queuing theory. Firstly, by exploring stochastic geometry to model the user locations, we derive the probability that the SINR of cellular user in a predefined interval, which constrains the corresponding transmission rate of cellular user. Secondly, in contrast to the previous studies with full traffic models, we employ queueing theory to evaluate the performance parameters of dynamic traffic model and formulate the cellular user transmission mechanism as a M/G/1 queuing model. In the derivation, Embedded Markov chain is introduced to depict the stationary distribution of cellular user queue status. Thirdly, the expressions of performance metrics in terms of mean queue length, mean throughput, mean delay and mean dropping probability are obtained, respectively. Simulation results show the validity and rationality of the theoretical analysis under different channel conditions.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1805-1813
• /
• 2010

In this paper, we address the issue of how to improve performance of integrated optical path and optical packet. For supporting ultra-high-speed traffic, integration of optical paths and packets in a switch is one of key techniques in New Generation Networks. However, the wavelength allocation for optical packets and optical paths has not been efficiently resolved yet because there lacks of a systematic model for evaluating performance of the integrated switch. This paper models the operation of the integrated switch as a system of two servers, one for optical paths and the other for optical packets. From the model, we utilize Newton method to find an optimal policy for sharing of wavelength resources. Afterwards, we propose an algorithm to dynamically allocate wavelength resources in an integrated switch. Finally, we evaluate performance of that algorithm.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.147-155
• /
• 2005

In this paper, communication channels for the transmission of multimedia packets are modeled and evaluated. The multimedia packet traffic characterized by on-off and MMPP process for voice and data, respectively, dynamic channel allocation, queueing of data packets due to unavailability of channels and dropping of queued data packets over timeout, and guard channel for voice packets are modeled. The performance indices adopted in the evaluation of SRN model includes blocking and dropping probabilities. The SRN uses rewards concepts instead of the complicate numerical analysis required for the Markov chain. It is shown that our SRN modeling techniques provide an easier way to carry out performance analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.813-821
• /
• 2008

In recent year, several types of PON(Passive Optical Networks) have been adopted into the subscriber loops for the high speed subscriber lines to meet the needs of some applications based on the Internet and the rapid increase of the Internet users. GPON(Gigabit PON) is a typical access network technology of these PONs which adopt the DBA(Dynamic bandwidth Allocation) scheme in order to transmit upstream traffic efficiently. In this paper, we introduce the gated polling system with a two-stage queue in order to analyze the delay performance of the DBA scheme in a GPON. We use a continuous time queueing model for deriving the mean cycle time and for obtaining the mean packet delay. We give some numerical results to investigate the delay performance for the symmetric polling system with statistically identical stations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.41-65
• /
• 2002

We study a multi-component production/inventory system in which individual components are made to meet various demand types. We assume that the demands arrive according to a Poisson process, but there is a fixed probability that a demand requests a particular kit of different components. Each component is produced by a flow line with several stations in which the processing times of each station follow a two-stage Coxian distribution. The production of each component is operated by an independent base-stock policy with blocking. We assume that the time needed to assemble final products follows a general distribution and the capacity of an assembling facility is sufficiently large. The objective of this study is to obtain key performance measures such as the distribution of the number of each orders for each final product and the mean time of fulfilling a customer order. The basic principle of the proposed approximation method is to decompose the original system into a set of subsystems, each subsystem being associated with a flow line. Each subsystem is analyzed in isolation using a Marie's method. An iterative procedure is then used to determine the unknown parameters of each subsystem. Numerical results show that the accuracy of the approximation method is acceptable.