• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.442-460
• /
• 2001

In video-on-demand(VOD) systems it is important to minimize initial latency and memory requirements. The minimization of initial latency enables the system to provide services with short response time, and the minimization of memory requirements enables the system to service more concurrent user requests with the same amount of memory. In VOD systems, since initial latency and memory requirement increase according to the increment of buffer size allocated to user requests, the buffer size allocated to user requests must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that thy system is in fully loaded state. Thus, when the system is in partially loaded state, the scheme allocates user requests unnecessarily large buffers. This paper proposes a dynamics buffer allocation scheme that allocates user requests the minimum buffer size in fully loaded state as well as a partially loaded state. This scheme dynamically determines the buffer size based on the number of user requests in service and the number of user requests arriving while servicing current requests. In addition, through analyses and simulations, this paper validates that the dynamics buffer allocation outperforms the statics buffer allocation in initial latency and the number of concurrent user requests that can be supported. Our simulation results show that, in proportion to the static buffer allocation scheme, the dynamic buffer allocation scheme reduces the average initial latency by 29%~65%, and in a systems having several disks. increases the average number of concurrent user requests by 48%~68%. Our results show that the dynamic buffer allocation scheme significantly improves the performance and reduce the capacity requirements of VOD systems.

• Journal of IKEEE
• /
• v.22 no.2
• /
• pp.402-407
• /
• 2018

Link selection strategy has been an important technical issues of relay network. In this paper, we introduce a link selection scheme in the bidirectional, buffer-aided relay network. Three kinds of information such as the states of the queue at the relay buffer, the qualities of the links, and the states of the queues at the user buffer are considered. Throughput and delay performance is evaluated under three cases with different available information.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.7
• /
• pp.57-64
• /
• 2011

To adjust the difference of bandwidth between host interface and NAND flash memory, DRAM is adopted as the buffer management in SSD (Solid-state Disk). In this paper, we propose cost-effective techniques to enhance SSD performance instead of using expensive high bandwidth DRAM. The SSD data can be classified into three groups such as user data, meta data for handling user data, and FEC(Forward Error Correction) parity/ CRC(Cyclic Redundancy Check) for error control. In order to improve the performance by considering the features of each data, we devise a flexible burst control method through monitoring system and a page based FEC parity/CRC application. Experimental results show that proposed methods enhance the SSD performance up to 25.9% with a negligible 0.07% increase in chip size.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.317-326
• /
• 2002

The mobile telecommunication system has been growing exponentially after 1990s due to the high population in a city and the growth of mobile user. In this time, the current mobile system mainly concentrates on the voice communication. However, in the next generation, mobile users want to get very diverse services via mobile terminal such as the Internet access, web access, multimedia communication, and etc. For this reason, the next generation system, such as the UMTS system, has to support the packet data service and it will play the major role in the system. In different from the voice service, the packet data service should store packet data in a buffer at base station before it forwards. Consequently, the performance closely related to the buffer management and its operation. However, until now, there are rare study on the buffer behavior and management. In this paper, we will observe the buffer behavior in the UMTS systems by using simulation and analyze the results. For this research, we generate packet data traffics and model the UMTS system for a simulation. Then we analyze the buffer state by a simulation and calculate the buffer overflow probability by mathematical methods.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.284-286
• /
• 2009

In this paper, we consider a cognitive radio system operating as secondary user. It uses an empty channel that is not currently used by primary users having the license to the channel. In the previous works, secondary user looks for an empty channel by choosing any channel in order or randomly and by sensing the channel to distinguish whether primary users are using. But if primary user is fixed type, we will find an empty channel faster than the mentioned channel selecting methods by using a method considering prior information about cases that primary user used the channel, since it is possible to analogize the channel access possibility of primary user according to regular time and position. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving throughput of secondary users. Firstly, we determine a weighting value of each channel based on the history of channel activities of primary users. This value is added to current channel state buffer and we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of the average channel searching time and the average number of transmissions of secondary user.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2490-2506
• /
• 2022

In Mobile Edge Computing (MEC), attackers can speculate and mine sensitive user information by eavesdropping wireless channel status and offloading usage pattern, leading to user privacy leakage. To solve this problem, this paper proposes a Privacy-preserving and Energy-efficient Offloading Algorithm (PEOA) based on Lyapunov optimization. In this method, a continuous Markov process offloading model with a buffer queue strategy is built first. Then the amount of privacy of offloading usage pattern in wireless channel is defined. Finally, by introducing the Lyapunov optimization, the problem of minimum average energy consumption in continuous state transition process with privacy constraints in the infinite time domain is transformed into the minimum value problem of each timeslot, which reduces the complexity of algorithms and helps obtain the optimal solution while maintaining low energy consumption. The experimental results show that, compared with other methods, PEOA can maintain the amount of privacy accumulation in the system near zero, while sustaining low average energy consumption costs. This makes it difficult for attackers to infer sensitive user information through offloading usage patterns, thus effectively protecting user privacy and safety.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.1
• /
• pp.36-44
• /
• 2000

In this paper, we describe the developing of a tool which supports both multimedia presentation with user's participation through a high speed network and authoring of various media using a single authoring tool. To support real-time synchronous multimedia presentation, we adopt dynamic synchronization method and adaptive transmission algorithm for synchronizing data transfer rate between sender and receiver using buffer management algorithm based on QoS parameters. And we also allow user's participation in the presentation using TRSG(Temporal Relationship Specification Graph) model. Finally, the proposed tool supports the minimal level of QoS and its continuous play-out using event auditing threads which control the current state of a multimedia presentation continuously by monitoring of negative factors effecting on QoS, and synchronization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1422-1428
• /
• 2009

In this paper, we consider an independent type cognitive radio system where secondary users can utilize empty channels that are not currently used by primary users having the license to these channels. In the previous works, secondary users search channels sequently or randomly to detect activities of primary user on channels. These channel searching methods however are not suitable to the characteristics of the wireless environment. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving the throughput of secondary users. In the proposed method, we firstly determine weighting value of each channel based on the history of channel activities of primary users and add the weighing value to current channel state buffer. And then, we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of average channel searching time and average number of transmissions of secondary user.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.276-286
• /
• 2007

Existing streaming mechanisms have no consideration for the characteristics of streaming applications because they only consider network stability. In this paper, in order to overcome limitations of the previous work on video streaming, we propose a new video streaming mechanism called "HAViS(Hybrid Approach for Video Streaming)". The proposed mechanism includes more sophisticated features that consider both network and user requirements. Therefore, the HAViS mechanism improves the network stability by adjusting the sending rate of video stream based on the network state and it also provides the smooth playback by preventing the buffer underflow or overflow. Moreover, it is designed to take into consideration the streaming video content. Through the simulation, we prove that the HAViS mechanism efficiently uses the buffer resources and provides improved network stability and smooth playback.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1768-1789
• /
• 2016

In contemporary video streaming systems based on HTTP protocol, video players at the client side are responsible for adjusting video quality to network conditions and user expectations. However, when multiple video clips are streamed simultaneously, an intricate application logic implemented in the video players overlays the TCP mechanism which is responsible for a balanced access to a shared network link. As a result, some video players may not obtain a fair share of network throughput and may be vulnerable to an unstable video bit-rate. Therefore, we propose to simplify the algorithms implemented in the video players, which are responsible for the adjustment of video quality and constrain their functionality only to sending feedback to a server about a state of the player buffer. The main logic of the system is shifted to the server, which is now responsible for bit-rate selection and prioritisation of the video streams transmitted to multiple clients. To verify our proposition, we performed several experiments in a laboratory environment which show that when the server cooperates with the clients, the video players experience fewer quality switches and the system achieves better fairness when allocating network throughput among the video players. However, this comes at the cost of worse utilisation of network bandwidth.