• Journal of Convergence for Information Technology
• /
• v.10 no.10
• /
• pp.1-8
• /
• 2020

The need for storage, management, and retrieval techniques for alternative data has emerged as technologies based on data generated from business activities conducted by enterprises have emerged as the key to business success in recent years. Existing big data platform systems must load a large amount of data generated in real time without delay to process unstructured data, which is an alternative data, and efficiently manage storage space by utilizing a deduplication system of different storages when redundant data occurs. In this paper, we propose a multi-layer distributed data deduplication process system using the similarity of the Cuckoo hashing filter technique considering the characteristics of big data. Similarity between virtual machines is applied as Cuckoo hash, individual storage nodes can improve performance with deduplication efficiency, and multi-layer Cuckoo filter is applied to reduce processing time. Experimental results show that the proposed method shortens the processing time by 8.9% and increases the deduplication rate by 10.3%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.997-1005
• /
• 2010

Recently, there has been a growing interest in the use of WLAN technology due to its easy deployment, flexibility and so on. Examples of WLAN applications range from standard internet services such as Web access to real-time services with strict latency/throughput requirements such as multimedia video and voice over IP on wireless network environments. Fair and efficient distribution of the traffic loads among APs(Access Points) has become an important issue for improved utilization of WLAN. This paper focuses on an AP selection scheme for achieving better load balance, and hence increasing network resource utilization for each user on wireless network environments. This scheme makes use of active scan patterns and the network delay as main parameters of load measurement and AP selection. This scheme attempts to estimate the AP traffic loads by observing the up/down delay and utilize the results to maximize the link resource efficiency through load balancing. We compared the proposed scheme with the original SNR(Signal to Noise Ratio)-based scheme using the NS-2(Network Simulation.2). We found that the proposed scheme improves the throughput by 12.5% and lower the network up/down link delay by 36.84% and 60.42%, respectively. All in all, the new scheme can significantly increase overall network throughput and reduce up/down delay while providing excellent quality for voice and video services.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.317-326
• /
• 2010

Nowadays, transmission bandwidth for network traffic is increasing and the type is varied such as peer-to-peer (PZP), real-time video, and so on, because distributed computing environment is spread and various network-based applications are developed. However, as PZP traffic occupies much volume among Internet backbone traffics, transmission bandwidth and quality of service(QoS) of other network applications such as web, ftp, and real-time video cannot be guaranteed. In previous research, the port-based technique which checks well-known port number and the Deep Packet Inspection(DPI) technique which checks the payload of packets were suggested for solving the problem of the P2P traffics, however there were difficulties to apply those methods to detection of P2P traffics because P2P applications are not used well-known port number and payload of packets may be encrypted. A proposed algorithm for identifying P2P heavy traffics based on flow transport parameters and behavioral characteristics can solve the problem of the port-based technique and the DPI technique. The focus of this paper is to identify P2P heavy traffic flows rather than all P2P traffics. P2P traffics are consist of two steps i)searching the opposite peer which have some contents ii) downloading the contents from one or more peers. We define P2P flow patterns on these P2P applications' features and then implement the system to classify P2P heavy traffics.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.341-348
• /
• 2008

As a high-speed growth of internet infrastructure and a fast supply of digital imaging devices, a digital image contents industrialization is growing fast. Digital image contents are represented as digitalized images for recognition by the computer. This paper proposes the customized stock image contents management system for digital image contents developers and UCC contents producers. For automatic batch management of image contents, we design the system using the techniques of stock image meta-data conversion to want, image contents format conversion to want and selective image contents uploading to want. Furthermore, constructed system can be embedded to a system easy and fast. It provides efficient work environment as appling conventional systems and contributes for user-friendly interface construction.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.372-378
• /
• 2005

When a mobile node changes a sub network using Mobile IP, it must register its current location to the home agent. If a mobile node is far from its home network, the Binding Update (BU) time delay is longer and affects its connection state. To solve such a BU delay problem, a new component in HMIPv6, called MAP, supports the mobility of mobile node to reduce the signaling delay in handover However, in hierarchical MAP architecture, the register concentration to a specific MAP may be occurred, which affects the network management wholly. In this paper, we propose a MAP selection scheme based on ioad balancing by the mobility factor and the traffic property. By the mobility factor and the traffic property, a mobile node can select a adequate MAP on its mobility factor and traffic characteristic.

• Magazine of the Korea Concrete Institute
• /
• v.6 no.1
• /
• pp.89-100
• /
• 1994

The current test procedure for transfer length, which determine transfer length by measuring concrete strain, has an actual bond stress state in the prestressed pretensioned member : however, it is difficult to determine the bond properties of maximum bond stress and bond stiffness with this method. It is also difficult for design engineer to understand and select a correct safety criterion from the widely distributed results of such a ransfer test alone. An alternative testing procedure is provided here to determine the bond properties without measuring the concrete strain. In this test the bond stress is measured directly by creating a similar boundary condition within the transfer length in a real beam during the transfer of prestressing force. The prestressing force was released step by step by step from the unloading side. The release of force induces a swelling of the strand at the unloading side of concrete block, bonding force in the block, and a bond slip of the strand toward the other side of the block. Two center-hole load cells are used to record the end loads until the point of general bond slip(maximum bond stress). It is suggested that this test procedure be performed with the ordinary transfer test when determining the transfer length in a prestressed, pretensioned concrete beam.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.55-62
• /
• 2010

While the broadband network and multimedia technologies have been developing, the commercial market of digital contents also has been widely spreading with recently starting IPTV. As the IPTV services are getting to be generalized and popularized, the contents illicit copying and distribution of copyright meterials tends to draw more attentions. So we need a right service system that can protect contents and copyright using watermark inserting. Until now, the conventional protection and authentication system is taking advantages of merits both in CAS and DRM. But this system can not protect the contents when acquiring them from TV output using A/D convertor. So we apply watermark method using HSI color space against contents illicit copying. And for distribution of copyright materials. we compound unique settop ID and copyrighter's ID to make new ID that is watermark. When inserting watermark, we use the watermark for copyright protection and authentication. So we can protect copyright and identify last settop's user in illicit distribution. we design download based IPTV contents protection and authentication system using HSI watermark method.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.613-620
• /
• 2016

This paper presents a MOHA(Many-Task Computing on Hadoop) framework which aims to effectively apply the Many-Task Computing(MTC) technologies originally developed for high-performance processing of many tasks, to the existing Big Data processing platform Hadoop. We present basic concepts, motivation, preliminary results of PoC based on distributed message queue, and future research directions of MOHA. MTC applications may have relatively low I/O requirements per task. However, a very large number of tasks should be efficiently processed with potentially heavy inter-communications based on files. Therefore, MTC applications can show another pattern of data-intensive workloads compared to existing Hadoop applications, typically based on relatively large data block sizes. Through an effective convergence of MTC and Big Data technologies, we can introduce a new MOHA framework which can support the large-scale scientific applications along with the Hadoop ecosystem, which is evolving into a multi-application platform.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.