• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.45-58
• /
• 2020

In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1031-1040
• /
• 2010

Hash join is one of the core algorithms in databases management systems. If a hash join cannot complete in one-pass because the available memory is insufficient (i.e., hash table overflow), however, it may incur a few sequential writes and excessive random reads. With harddisk as the tempoary storage for hash joins, the I/O time would be dominated by slow random reads in its probing phase. Meanwhile, flash memory based SSDs (flash SSDs) are becoming popular, and we will witness in the foreseeable future that flash SSDs replace harddisks in enterprise databases. In contrast to harddisk, flash SSD without any mechanical component has fast latency in random reads, and thus it can boost hash join performance. In this paper, we investigate several important and practical issues when flash SSD is used as tempoary storage for hash join. First, we reveal the va patterns of hash join in detail and explain why flash SSD can outperform harddisk by more than an order of magnitude. Second, we present and analyze the impact of cluster size (i.e., va unit in hash join) on performance. Finally, we emperically demonstrate that, while a commerical query optimizer is error-prone in predicting the execution time with harddisk as temporary storage, it can precisely estimate the execution time with flash SSD. In summary, we show that, when used as temporary storage for hash join, flash SSD will provide more reliable cost estimation as well as fast performance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.3 no.1
• /
• pp.101-116
• /
• 1998

혼합·이산 비선형 최적화문제 해결을 위한 전역적 최적화 알고리즘이 개발되었으며 이 알고리즘은 확률적 최적화기법인 유전알고리즘을 사용한다. 유전알고리즘은 다양한 설계변수를 처리하는데 적합하다. 그러나 기존의 유전알고리즘이 특별히 잘 수행되지 않는 상황이 많이 존재하기 때문에 혼합화에 대한 다앙한 방법이 개발되어지고 있다. 따라서 이 논문은 유전알고리즘에서 최적해 주위에 대한 국고수수렴기법과 정밀 탐색법을 구체화시킨 새로운 혼합유전알고리즘(NHGA)을 개발했다. 사례연구에서는 혼합·이산 비선형 최적화문제를 해결하는데 있어서 NHGA가 상당한 능력을 제공하며 효율적이고 우수한 해를 제공할 수 있다는 것을 보여주고 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.259-261
• /
• 2001

LIKE는 주어진 유형을 찾는 기능을 수행하는 연산자이다. LIKE 술어에 대하여 데이타베이스 관리시스템이 어떠한 탐색 방법을 선택하는가에 따라 질의의 수행 성능에 큰 차이를 가져올 수 있다. 질의 최적화기는 LIKE 연산자를 포함하는 질의를 최적화하는 과정에서 질의 유형과 색인의 존재 여부를 고려하여야한다. 본 논문은 질의 최적화 과정에서 LIKE 술어를 고려한 질의 수행 비용 모델과 이의 구현 사항을 제시한다.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.5
• /
• pp.303-313
• /
• 2010

This paper describes an acoustic communication receiver structure, which is designed for QPSK (Quadrature Phase Shift Keying) signal with 25 kHz carrier frequency and 5 kHz symbol rate, and takes samples from received signal at 100 kHz sampling rate. Based on the described receiver structure, optimum design parameters, such as number of taps of FF (Feed-Forward) and FB (Feed-Back) filters and forgetting factor of RLS (Recursive Least-Square) algorithm, of joint equalizer are determined to minimize the BER (Bit Error Rate) performance of the joint equalizer output symbols when the acquisition data in shallow water using implemented acoustic transducers is decimated at a rate of 2:1 and then enforced to the input of receiver. The transmission distances are 1.4 km, 2.9 km, and 4.7 km. Analysis results show that the optimum number of taps of FF and FB filters are different according to the distance between source and destination, but the optimum or near optimum value of forgetting factor is 0.997. Therefore, we can reach a conclusion that the proper receiver structure could change the number of taps of FF and FB filters with the fixed forgetting factor 0.997 according to the transmission distance. Another analysis result is that there are an acceptable performance degradation when the 16-tap-length simple filter is used as a low-pass filter of receiver instead of 161-tap-length matched filter.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.2
• /
• pp.129-134
• /
• 2003

In this paper, we efficiently implement the AMR speech coder by reducing the complexity of algebraic codebook search. To reduce the computational complexity of the algebraic codebook search, we propose a fast algebraic codebook search method that improves conventional depth first tree search method used in AMR speech coder algorithm. The proposed method reduces the search complexity by pruning the trees which are less possible to be selected as an optimum excitation. This method needs no additional computation for selecting the trees to be pruned and reduces the computational complexity considerably compared to the original depth first tree search method with slightly degradation or speech qualify. Applying our method to the implementation or AMR speech coder with 12.2 kbps mode by using the TeakLite DSP, we reduce the search complexity about 40% compared to the conventional method.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.6
• /
• pp.309-318
• /
• 2008

In this paper, we discuss a method for efficiently coding the high-band signal in the split-band coding approach where an input signal is divided into two bands and then each band may be encoded separately. Generally, and especially through the research on the artificial bandwidth extension (BWE), it is well known that there is a correlation between the two bands to some degree. Therefore, some coding gain could be achieved by utilizing the correlation. In the BWE-prediction-based coding approach, using a simple linear BWE function may not yield optimal results because the correlation has a non-linear characteristic. In this paper, we investigate the new coding scheme more in details. A few representative BWE functions including linear and non-linear ones are investigated and compared to find a suitable one for the coding purpose. In addition, it is also discussed whether there are some additional gains in combining the BWE coder with the predictive vector quantizer which exploits the temporal correlation.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.287-291
• /
• 2009

지구 온난화의 영향으로 최근 이상홍수에 의한 피해가 증가하고 있다. 국내 다목적댐의 경우 월별 목표수위를 기준으로 하는 저수지 운영률이 존재하지만 이것은 실제 이상홍수가 발생할 경우 저수지 운영에 도움을 주지 못하는 것이 현실이다. 본 연구에서는 자원배분문제의 최적해를 찾는데 사용되는 최적화기법의 하나인 선형계획법과 수자원 문제와 같이 불확실성이 산재해있고, 애매모호한 문제를 다루기에 적합한 퍼지제어 기법을 적용하여 이상홍수 발생 시 두 개 이상의 다목적댐 군을 연계운영하기 위한 퍼지 최적 운영 기법을 개발하는 것을 목표로 하였다. 시험유역으로는 낙동강 상류에 위치한 안동댐과 임하댐 유역을 대상으로 PMF 발생 시 댐의 안전성을 높이고 안동시 지점에서의 최대홍수량을 최소화하기 위한 퍼지최적운영기법을 개발하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.938-946
• /
• 1996

Hierarchical subband codec has been widely promoted in the field of data compression/decompression because of their simplicity and modular nature. Over the past years, the study has received great attention to the perfect reconstruction (PR)system which perfectly recovers the original input signal at the reconstructed output. However, in the actual subband codec system, the signals that passed through the analysis filter bank are quantized before transmission to the receiver side and reconstructed by the synthesis filter bank. Thus the PR system is impossible and the quantization effects must be carefully considered in the system design such that the system recovers the reconstructed output as possible to the the original input signal with minimum quantization error.In this paper, we propose an optimum hierarchical subband codec structure in the presence of quantizer. The optimality criteria of the code is given to the deign of the hierarchical analysis/synthesis subband filter bank and the quantizer that minimize then output mean square error due to the quantizer in the codec. Specific opti-mum design esamples are shown with level-1, level-2 hierarchical structure. The optimal designs are verified by computer simulation.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.578-591
• /
• 2016

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.