• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.65-68
• /
• 2007

DOCSIS 3.0 MAC protocol regulate CM and CMTS Channel transfer times through MAP message. Standards does not include the details of MAP Inter-arrival Time affecting the performance of MAC protocols for DOCSIS 3.0. In this paper, we evaluationed the performance of protocol follow in MAP Inter-arrival Time on DOCSIS 3.0. Based on the evaluation results, we propose the optimal MAP Inter-arrival Time. We found that the protocol shows best performance when the MAP Inter-arrival Time is 0.05sec. The research results can apply to performance element which important for the construction of DOCSIS 3.0 base cable networks.

• Journal of Software Engineering Society
• /
• v.25 no.4
• /
• pp.63-67
• /
• 2012

According to the growth of data being generated in man fields, a distributed programming model MapReduce has been introduced to handle it. In this paper, we build two cluster system with Solaris and Linux environment on SUN Blade150 respectively and then to evaluate the performance of a MapReduce application running on MapReduce middleware Hadoop in terms of its average elapse time and standard deviation. As a result of this experiment, we show that the overall performance of the MapReduce application based on Hadoop is affected by the configuration of the cluster system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1069-1076
• /
• 2007

DOCSIS 3.0 protocol are proposed to support high-speed cable network DOCSIS 3.0 MAC protocol regulates CM and CMTS channel transfer times through MAP message. So MAP Inter-arrival time is primary factor of network performance. However, standards does not include the details of MAP Inter-arrival Time affecting the performance of MAC protocols for DOCSIS 3.0. In this paper, we evaluated the performance of DOCSIS 3.0 protocol follow in MAP Inter-arrival Time. Based on the evaluation results, we propose the optimal MAP Inter-arrival Time. We found that the protocol shows best performance when the MAP Inter-arrival Time is 0.05sec. The research results can apply to performance element which important for the construction of DOCSIS 3.0 base cable networks.

• Journal of Cadastre & Land InformatiX
• /
• v.47 no.2
• /
• pp.49-60
• /
• 2017

Recently, the use of mashup that integrates real-time data with spatial data such as tiled map and satellite imagery has been increased significantly. As the use of mashup has been extended to various fields of O2O, LBS, Smart City, and Autonomous Driving, the performance of mashup has become more important. Therefore, this study aims to compare and analyze the performance of various map platforms, when large amounts of real-time data are integrated with spatial data. Specifically, we compare the performance of most popular map platforms available in Korea, such as Google Maps, OpenStreetMap, Daum Map, Naver Map, olleh Map, and VWorld. We also compare the performance using most common web browsers of Chrome, Firefox and Internet Explorer. In the performance analysis, we measured and compared the initialization time of basic map and the mashup time of real-time data for the above map platforms. From analysis results, we could find that Google Maps, OpenStreetMap, VWorld, and olleh Map platforms showed a better performance than the others.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.9 no.4
• /
• pp.81-88
• /
• 2005

In order to estimate the gas turbine engine performance precisely, the component maps containing their own performance characteristics should be needed. In this study a component map generation method which may identify compressor map conversely from a performance deck provided by engine manufacturer using genetic algorithms was newly proposed. As a demonstration example for this study, the PW 206C turbo shaft engine for the tilt rotor type Smart UAV(Unmanned Aerial Vehicle). In order to verify the proposed method, steady-state performance analysis results using the newly generated compressor map was compared with them performed by EEPP(Estimated Engine Performance Program) deck provided by engine manufacturer. And also the performance results using the identified maps were compared with them using the traditional scaling method. When the performance analysis is performed at far away operation conditions from the design point, in case of use of e component map by the traditional scaling method, the error of the performance analysis results is greatly increasing. In the other hand, if in case of use of the compressor map generated by the proposed GAs scheme, the performance analysis results are closely met with those by the performance deck, EEPP.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.5
• /
• pp.511-518
• /
• 2015

As the cost-per-byte of SSDs dramatically decreases, the introduction of SSDs to Hadoop becomes an attractive choice for high performance data processing. In this paper the cost-per-performance of SSD-based Hadoop cluster (SSD-Hadoop) and HDD-based Hadoop cluster (HDD-Hadoop) are evaluated. For this, we propose a MapReduce performance model using queuing network to simulate the execution time of MapReduce job with varying cluster size. To achieve an accurate model, the execution time distribution of MapReduce job is carefully profiled. The developed model can precisely predict the execution time of MapReduce jobs with less than 7% difference for most cases. It is also found that SSD-Hadoop is 20% more cost efficient than HDD-Hadoop because SSD-Hadoop needs a smaller number of nodes than HDD-Hadoop to achieve a comparable performance, according to the results of simulation with varying the number of cluster nodes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.44-50
• /
• 2014

Chaos communication system is one of the security algorithms that is applied to improve the security. Chaos signal is non-linear, and it is generated randomly according to the initial conditions. Also, chaos communication system has characteristics such as non-periodic, wide-band, non-predictability of signals and easy implementation. So, security of chaos communication system is superior, and it has low interception probability and good anti-jamming characteristic. However, BER performance is worse than digital communication system, because it has many self interference signal in case of CDSK system. To improve these disadvantages, we analyze the PDF trend which can improve the BER performance in existing study, and we proposed a chaos map. And, proposed chaos map was defined as the 'Boss map'. Generally, BER performance is changed according to initial values, parameters and spreading factors. Therefore, in this paper, we will introduce PDF trends which can improve the BER performance, and will describe about Boss map. Also, characteristics of Boss map is analyzed by evaluating the BER performance of Boss map according to initial values, parameters and spreading factors. As a result, while maintaining the similar BER performance, initial value of Boss map can be selected from 0 to 1.2, and BER performance is best when parameter alpha is 2.5. Also, BER performance is best when spreading factor is 50.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.2
• /
• pp.109-115
• /
• 2014

Analyzing large scale data has become an important activity for many organizations. Since MapReduce is a promising tool for processing the massive data sets, there are increasing studies to evaluate the performance of various algorithms related to MapReduce. In this paper, we first develop a simulation framework that includes MapReduce workload model, data center model, and the model of data access pattern. Then we propose two algorithms that can reduce the energy consumption of MapReduce systems. Using the simulation framework, we evaluate the performance of the proposed algorithms under different application characteristics and configurations of data centers.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.221-225
• /
• 1987

In this paper, the performance of Mini MAP architecture in realtime application is analyzed by analytic methods. The approximate equations for token rotation time and waiting time are obtained and using these equations network. performance is evaluated. According to the results obtained, Mini MAP architecture has good realtime performance and can be used to many real time applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.629-637
• /
• 2013

Chaos communication systems have the characteristics such as non-periodic, wide-band, non-predictability of signals and easy implementation. There have been many studies about chaos communication systems because of these advantages. But, chaos communication systems have low BER(Bit Error Rate) compare to general digital communication system. Existing researches on chaos communication systems only analyze BER performance according to various chaos maps. There are no studies on analysis of BER performance according to PDF(Probability Density Function) of chaos maps. In this paper, we analyze the BER performance according to changing parameter, equation, and initial values of chaos map's PDF. In addition, we propose new chaos map to improve BER performance. Simulation results show that BER performance of CDSK(Correlation Delay Shift Keying) is changed when PDF of chaos map changed. And the proposed chaos map has a better BER performance compare to previous chaos maps such as Tent map, Logistic map, and Henon map.