• The Journal of the Korea Contents Association
• /
• v.16 no.8
• /
• pp.706-716
• /
• 2016

Because of efficient space utilization and fast key search times, B-trees have been widely accepted for the use of indexes in HDD-based DBMSs. However, when the B-ree is stored in flash memory, its costly operations of node updates may impair the performance of a DBMS. This is because the random updates in B-tree's leaf nodes could tremendously enlarge I/O costs for the garbage collecting actions of flash storage. To solve the problem, we make all the parents of leaf nodes the virtual nodes, which are not stored physically. Rather than, those nodes are dynamically generated and buffered by referring to their child nodes, at their access times during key searching. By performing node updates and tree reconstruction within a single flash block, our proposed B-tree can reduce the I/O costs for garbage collection and update operations in flash. Moreover, our scheme provides the better performance of key searches, compared with earlier flash-based B-trees. Through a mathematical performance model, we verify the performance advantages of the proposed flash B-tree.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.1
• /
• pp.66-76
• /
• 2017

As the IoT communication environment has been established, communications that utilize not only high-spec machines but also low-spec machines are increasing, but security threats are increasing, too. In recent times, a lot of papers have attempted to reduce the weight of IP layer security techniques such as IPsec and IKEv2 for low-spec machines. Typically, Smyslov proposed Lightweight IKEv2 protocol which is used in IoT environment. However, This proposed protocol had compatibility problem with IKEv2 protocol, So, It is hard to be expected to be used in IoT communication environment. Unlike the Smyslov's protocol, this paper proposed Lightweight IKEv2 protocol which can be compatible of IKEv2 protocol and applied lossless compression algorithm to payload. To suggest lightweight IKEv2 protocol, this paper analyzed IKEv2 protocol and existed lightweight IKEv2 protocol. Furthermore, This paper proved that proposed protocol is more efficient than existed lightweight IKEv2 protocol through performance evaluation as a method.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.11
• /
• pp.883-890
• /
• 2013

Aircraft combat survivability analysis is essential process for the development of combat aircraft. M&S methodology is the typical procedure for the aircraft combat survivability analysis, and the last step is the expensive Live Fire Test if it is necessary. This study introduced cost and time effective survivability analysis methodology based on the random variable weighted score algorithm in conceptual design phase. For this study, essential element and event analysis (E3A) is used to define the random variables and Monte-Carlo simulation is implemented to estimate weighted score and the final value of survivability.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.231-242
• /
• 1999

Generally, either caption-based search method or content-based search methods is used to retrieve video information. However, each search method has its limitations. Caption-based search is apt to lose consistency as for user's subjects, and content-based search is hard to extract general means. To enhance efficiency and correctness as for complementing each other, we propose the Integrated Video Data Model(IVDM) which integrates the two search methods, to device the model, we analyze video data and construct the structure of video information hierarchically. IVDM supports caption-based search as assigning meta-data by analyzing thematic-unit in the higher level, and also supports content-based search as extracting feature data by analyzing the content of video data in the lower level. We design Object-Oriented database schema of news video, based-on the IVDM. And we provide 4-type of queries and query processing algorithm to retrieve news video information.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.4697-4706
• /
• 2010

This paper suggested the optimal operating design method using simulation and ANP(Analytic Network Process) for mass-customization in the automotive component manufacturing industry. For this, first of all, we built the simulation model including various and complex factors in the field, and estimated the meta-model by RSM(Response Surface Method). Secondly using ANP, we calculated the weight of relative importance of evaluation factors gathered from decision makers. And then, we proposed the optimal operation designs by MOGA(Multi-Objective Genetic Algorithm), analyzed results of them. Moreover, by comparing the results with the consequences using AHP(Analytic Hierarchy Process), we showed its superiority of suggested method to the manner using AHP, because it reflects inner, outer dependency, and inter-relation among judgement factors. In conclusion, through this process, we can present the better way to serve mover effective, precise, and accurate information to decision makers when they build operation design for mass-customization system as automotive parts production system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.19-31
• /
• 2003

For the implementation of large scale GRID systems, the performance scalability in resource scheduling is clearly to be addressed. In this research, we analyzed existing scheduling frameworks from the viewpoint of the performance and propose a novel resource scheduling framework called resource parameter based scheduling. Proposed scheduling framework consists of three components. The first is the resource parameter graph that expresses resource information via inter-resource relation and the composition base on the hierarchical structure. The second component is the resource parameter tree to be used for the implementation of the memory-based index of resource information. The third component is the resource information repository which mostly consists of static data to be used for the general resource information services. This paper presents the details of the framework.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.1-10
• /
• 2004

This study discusses Application-layer FEC using erasure codes. Because of the simple decoding process, erasure codes are used effectively in Application-layer FEC to deal with Packet-level errors. The large number of parity packets makes the loss rate to be small, but causes the network congestion to be worse. Thus, a redundancy control algorithm that can adjust the number of parity packets depending on network conditions is necessary. In addition, it is natural that high-priority frames such as I frames should produce more parity packets than low-priority frames such as P and B frames. In this paper, we propose a redundancy control algorithm that can adjust the amount of redundancy depending on the network conditions and depending on data priority, and test the performance in simple links and congestion links.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.51-58
• /
• 2011

One of the objectives of research on routing methods in wireless sensor networks is maximizing the energy life of sensor nodes that have limited energy. In this study, we tried to even energy use in a wireless sensor network by giving a weight to the transition probability of ACS(Ant Colony System), which is commonly used to find the optimal path, based on the amount of energy in a sensor and the distance of the sensor from the sink. The proposed method showed improvement by 46.80% on the average in energy utility in comparison with representative routing method GPSR (Greedy Perimeter Stateless Routing), and its residual energy after operation for a specific length of time was 6.7% more on the average than that in ACS.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.388-398
• /
• 2004

This paper focuses on the reduction method of message traffic occurred when multiple participants collaborate in the distributed virtual environment. It is referred to as filtering method of update message to minimize data traffic exchanged in the virtual environment, and it is the essential process to improve the scalability of the virtual environment. Spatial partitioning method, a popular filtering technique, divides the whole environment into smaller sub-parts in order to make it small the regions to be maintained consistently. However, it is less flexible and adaptable because the information of area of interest must be configured before simulation. In this paper, the concept of dynamic area of interest is proposed, which is highly adaptable by applying dynamic environmental elements to AOI management. It uses multiple layering and multiple consistency algorithms for dynamic management, and makes it possible to consume system resource efficiently. For performance evaluation, experiments are performed with virtual avatars, measuring message traffic. Finally, the proposed model could be applied to the AOI management systems which accommodate massive users like MMORPG, or virtual communities.