• Journal of the Korea Computer Industry Society
• /
• v.2 no.7
• /
• pp.975-982
• /
• 2001

In this study, a solid-state laser system adopting a new real time multi-discharge (RTMD) method in which three flashlamps are turned on consecutively was designed and fabricated to examine the pulse width and the pulse shape of the laser beams depending upon the changes in the lamp rum-on time. That is, this study shows a technology that makes it possible to make various pulse shapes by turning on three flashlamps consecutively on a real-time basis with the aid of a PIC one-chip microprocessor. With this technique, the lamp turn-on delay time can be varied more diversely from 0 to 10 ms and the real-time control is possible with an external keyboard, enabling various pulse shapes. In addition, longer pulses can be more widely used for industrial processing and lots of medical purposes

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.423-432
• /
• 2011

Recently, OpenFlow has been paid attention to as a fundamental technology which provides a function of virtualization and programmability in network. In Korea, deployment of OpenFlow networks in campuses and the interconnection between them through tunneling in layer 3 has been performed. However, the performance of the interconnected networks is decreased due to delay in IP layer. In this paper, we design and deploy nation-wide, not local, OpenFlow networks in a pure layer 2 environment over KREONET. After that, we do end-to-end Round-trip Time measurements and TCP/UDP performance tests in OpenFlow and normal networks, and do comparison and analysis on the test results. The results show that the nation-wide OpenFlow networks provide equal performance to normal networks except for the initial packet loss for UDP streaming. In regards to the performance decrease due to early UDP packet loss, we can mitigate it by implementing exceptional procedures in a controller which deal with the same continuous "Packet_in" events.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2179-2187
• /
• 2008

The P2P technology has been widely used to distribute files efficiently, and its use in streaming is rapidly increasing. P2P streaming has issues about startup-delay, scalability, and real-time playback, however, what affects these factors has not been researched sufficiently. This paper suggests a buffering model for progressive download within mesh-based P2P system, which corresponds to downloading and playing the content at the same time. It is used to analyze PDF(Playback Deadline First), Rarest algorithms which are block-selection strategies of P2P streaming and proposes a mixed selection of them. The mixed block selection strategy dynamically performs different strategies based on whether the blocks to be played are received or not. In consequence, it enhances the QoS of streaming in a single peer point of view, as well as improving block distributions in an overlay network.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.53-64
• /
• 2013

The existing research on the QoS of the Streaming video system(SVS) adjust the video stream being sent from the network perspective, the focus is to prevent data loss and delay. The other hand, changing the quality of the video stream will not receive the guaranteed QoS from the perspective of the users who want uniform quality. In order to solve these problems, this paper applied to ensure that the benefits in the amount of bits per frame occurs Encoder CBR streaming video is kept constant and uniform picture quality advantages of VBR streaming video VBR to CBR Encoder and CBR to VBR Decoder, Video was designed to control the playback stream for And to ensure a uniform quality of the user based on the design and implementation of uniform quality guaranteed SVS. PSNR evaluated for several characteristics of the sample video to demonstrate the superiority of the SVS ensure uniform quality, the proposed Performance evaluation of the SVS ensure uniform quality CBW the ABR from 100% to ensure uniform image quality from 85% to environmental excellence is proved.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.11
• /
• pp.269-274
• /
• 2018

MMORPG is a role-playing game that tens of thousands of people access it online at the same time. Users connect to the server through the game client and play with their own characters. If the user moves to a management area of another server beyond the area managed by the server, the user information must be transmitted to the server to be moved. In an actual game, the user is required to synchronize the established and the transferred information. In this paper, we propose a migration agent server in the virtual systems. We implement a seamless virtual server using the grid method to experiment with seamless server architecture for virtual systems. We propose a method to minimize the delay and equalize the load when the user moves to another server region in the virtual environment. Migration Agent acts as a cache server to reduce response time, the response time was reduced by 50% in the case of 70,000 people.

• Journal of Broadcast Engineering
• /
• v.23 no.6
• /
• pp.813-823
• /
• 2018

UHD content is characterized by higher bandwidth requirements to provide seamless playback. The existing HTTP adaptive streaming scheme periodically requests video segment of lower quality than the available bandwidth in the steady state. In the steady state, the On-Off pattern is repeated due to the difference of the available bandwidth and the encoding rate of the content. And the repeated Off interval is causing the problem that can not efficiently use the available bandwidth. In the wireless environment where the delay and loss rate are higher with large bandwidth fluctuations, this problem is exacerbated because the available bandwidth is estimated inaccurately. Therefore, in this paper, we propose a segment scheduling scheme for efficient bandwidth utilization of UHD contents streaming in wireless environment. Proposed scheme is a group segment that simultaneously reqeusts multiple segments in one request message in order to reduce frequency of OFF interval. Through simulation, Our scheme improves bandwidth utilization.

• Journal of Digital Convergence
• /
• v.17 no.1
• /
• pp.195-201
• /
• 2019

This paper proposes a blockchain system to share Wireless Local Area Network (WLAN) that recently suffers from mutual interference among increasing devices using unlicensed bands. Blockchain technology can induce cooperation from users by incentivizing them with cryptocurrency like shown in Bitcoin example. In this paper, we describe Blockchain based access mechanism in WLAN instead of conventional authentication based access. Here, users can access any WLAN access point by paying through smart contract while they also receive payment from others. In order to support real-time transaction, we apply proof-of-authority that is realized by Byzantine fault tolerant protocol instead of well-known proof-of-work that requires huge computing power and delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.10
• /
• pp.1330-1336
• /
• 2021

Media sharing platform such as YouTube have grown significantly in the mobile environment. This is a platform that allows users to select and view broadcast programs that are only available on TV through network-connected PCs and mobiles, and share their media content to communicate. Currently, in the era where mobile and TV broadcasts can be viewed equally, there is a time difference between the video and real-time screen transmitted to TV and mobile, different from the actual situation.We want this time difference to be realized in the same way as the real time, and there is a need for a system that can broadcast in a free environment at any time. Therefore, in this paper, a broadcasting system was designed and implemented in a mobile environment. The result of reducing the delay time difference due to the improvement of the processing method was obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2496-2512
• /
• 2021

The requirements for powerful computing capability, high capacity, low latency and low energy consumption of emerging services, pose severe challenges to the fifth-generation (5G) network. As a promising paradigm, mobile edge networks can provide services in proximity to users by deploying computing components and cache at the edge, which can effectively decrease service delay. However, the coexistence of heterogeneous services and the sharing of limited resources lead to the competition between various services for multiple resources. This paper considers two typical heterogeneous services: computing services and content delivery services, in order to properly configure resources, it is crucial to develop an effective offloading and caching strategies. Considering the high energy consumption of 5G base stations, this paper considers the hybrid energy supply model of traditional power grid and green energy. Therefore, it is necessary to design a reasonable association mechanism which can allocate more service load to base stations rich in green energy to improve the utilization of green energy. This paper formed the joint optimization problem of computing offloading, caching and resource allocation for heterogeneous services with the objective of minimizing the on-grid power consumption under the constraints of limited resources and QoS guarantee. Since the joint optimization problem is a mixed integer nonlinear programming problem that is impossible to solve, this paper uses deep reinforcement learning method to learn the optimal strategy through a lot of training. Extensive simulation experiments show that compared with other schemes, the proposed scheme can allocate resources to heterogeneous service according to the green energy distribution which can effectively reduce the traditional energy consumption.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.163-181
• /
• 2004

Group key agreement protocols are designed to solve the fundamental problem of securely establishing a session key among a group of parties communicating over a public channel. Although a number of protocols have been proposed to solve this problem over the years, they are not well suited for a high-delay wide area network; their communication overhead is significant in terms of the number of communication rounds or the number of exchanged messages, both of which are recognized as the dominant factors that slow down group key agreement over a networking environment with high communication latency. In this paper we present a communication-efficient group key agreement protocol and prove its security in the random oracle model under the factoring assumption. The proposed protocol provides perfect forward secrecy and requires only a constant number of communication rounds for my of group rekeying operations, while achieving optimal message complexity.