• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.613-619
• /
• 2001

The IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.978-990
• /
• 2021

This article presents techniques for improved estimation of symbol timing offset (STO) and carrier frequency offset (CFO) for dual-polarization (DP) orthogonal frequency division multiplex (DP-OFDM) systems. Recently, quaternion multiple-input multiple-output OFDM has been proposed for high spectral efficiency communication systems, which can flexibly explore different types of diversities such as space, time, frequency, and polarization. This article focuses on synchronization techniques for DP-OFDM systems using a cyclic prefix, where the application of quaternion algebra leads to new improved estimators. Simulations performed for DP system methods show faster reduction of STO estimator variance with a double-slope line in the logvariance line versus signal-to-noise ratio (SNR) plot compared with singlepolarization (SP) counterparts, and simulations for CFO estimates show a 3-dB gain of DP over SP estimates for same SNR values defined, respectively, for quaternion-valued or complex-valued signals. Cramer-Rao bounds for STO and CFO are derived for the synchronization methods, correlating with the observed gains of DP over SP OFDM systems.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.184-196
• /
• 2019

Wavelet packet modulation (WPM) is a multicarrier modulation (MCM) technique that has emerged as a potential alternative to the widely used orthogonal frequency-division multiplexing (OFDM) method. Because WPM has overlapped symbols, equalization cannot rely on the use of the cyclic prefix (CP), which is used in OFDM. This study applies linear minimum mean-square error (MMSE) equalization in the time domain instead of in the frequency domain to achieve low computational complexity. With a modest equalizer filter length, the imperfection of MMSE equalization results in subcarrier attenuation and noise amplification, which are considered in the development of a bit-loading algorithm. Analytical expressions for the bit error rate (BER) performance are derived and validated using simulation results. A performance evaluation is carried out in different test scenarios as per Recommendation ITU-R M.1225. Numerical results show that WPM with equalization-aware bit loading outperforms OFDM with bit loading. Because previous comparisons between WPM and OFDM did not include bit loading, the results obtained provide additional evidence of the benefits of WPM over OFDM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.4099-4113
• /
• 2022

In this paper, we propose improved maximum access delay time, noise variance, and power delay profile (PDP) estimation schemes for orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. To this end, we adopt the approximate maximum likelihood (ML) estimation strategy. For the first step, the log-likelihood function (LLF) of the received OFDM symbols is derived by utilizing only the cyclic redundancy induced by cyclic prefix (CP) without additional information. Then, the set of the initial path powers is sub-optimally obtained to maximize the derived LLF. In the second step, we can select a subset of the initial path power set, i.e. the maximum access delay time, so as to maximize the modified LLF. Through numerical simulations, the benefit of the proposed method is verified by comparison with the existing methods in terms of normalized mean square error, erroneous detection, and good detection probabilities.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.537-538
• /
• 2009

IPv6 is newly introduced to solve limitations and problems of IPv4 and in IPv6 network, nodes use Neighbor Discovery protocol to discover the subnet prefix and configure its own address. However, Neighbor Discovery is vulnerable to various attacks as it does not have secure mechanism to protect itself. Thus, the Secure Neighbor Discovery has introduced and the main mechanism used in Secure Neighbor Discovery is Cryptographically Generated Address. In this paper, we provide a brief of Cryptographically Generated Address and its limitation in a case where a mobile node moves from one network to another frequently. The proposed scheme resolves this limitation by using the fixed interface identifier.

• ETRI Journal
• /
• v.45 no.2
• /
• pp.226-239
• /
• 2023

Challenges in cognitive radio and tactical communications include recognizing anonymously received signals and estimating parameters in a blind or semi-blind manner. In this paper, we examine this issue for orthogonal frequency division multiplexing (OFDM) signaling. There are several parameters in OFDM signaling, and the blind receiver must extract and consider the synchronization issue. We assume that the blind receiver is aware of modulation type, OFDM, and not aware of chip duration and the length of cyclic prefix. First, we present new criteria based on kurtosis to estimate these parameters and compare their performance at different levels of additive white Gaussian noise with methods based on correlation, kurtosis, maximum likelihood, and matched filter. Then, we perform synchronization and estimate the start time based on these criteria and several new criteria in two steps: fine and coarse synchronization. Finally, in a more practical setup, we present the idea of jointly estimating the mentioned parameters and the signal start time as coarse synchronization. We compare different criteria and show that one of the proposed criteria has the highest efficiency.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.591-594
• /
• 2011

본 논문은 PMIPv6 도메인에 접속한 이동노드의 멀티인터페이스 환경에서 플로우 이동성을 지원하기 위해 HNP(Home Network Prefix) 변환 기법을 제안한다. 기본적으로 PMIPv6 프로토콜은 멀티인터페이스 환경에서 인터페이스 이동성을 제공한다. 하지만 이 기능은 멀티이터페이스 간의 플로우 기반 이동성을 제공하지 못한다. 따라서 본 논문에서는 플로우 이동성을 제공하기 위해 IETF NetExt WG에서 논의되고 있는 논리인터페이스 기반 HNP 변환 기법을 제안한다. 이 기법은 효율적인 플로우 이동성을 제공하기 위한 방안이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.1250-1253
• /
• 2023

최근 정보 기술의 급격한 발전으로 스마트폰이 우리의 일상 생활에 점점 더 많이 들어오고 있으며, 사용자들은 많은 서비스들을 누릴 수 있게 되었다. 위치 기반 서비스(LBS)의 경우 스마트폰에 탑재된 위치 확인 기능을 통해 음식점 추천, 길찾기 등 개인형 맞춤 서비스를 제공하며, 사용자는 간단한 동의를 통해 자신의 위치를 LBS 서버에 전송하게 된다. 이는 사용자의 개인정보 침해의 요소가 될 수 있으며, 사용자의 민감한 정보가 공개될 수 있다. 따라서 본 논문에서는 사용자의 경로 데이터의 민감 정점을 보호하고, 통계적 질의를 할 때, 절대적으로 개인정보를 보호할 수 있는 방법을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.125-128
• /
• 2007

최근 사용자의 멀티미디어 서비스 요구가 보편화되면서 네트워크에 걸리는 부하가 늘어나게 되었고, 사용자들이 미디어를 다운로드한 후 플레이하는 방법보다 스트리밍 서비스를 선호함에 따라 실시간성이 더욱 중요시되고 있다. 웹 서비스에 전통적으로 사용되는 프록시 서버는 네트워크의 가장자리에 위치하여 클라이언트와 서버 사이의 거리 때문에 발생하는 문제를 주로 해결한다. 하지만 고 대역폭과 긴 서비스 시간이라는 특징을 가지는 멀티미디어 스트리밍 서비스에서는 전통적인 웹 프록시의 장점을 제대로 활용하기 어렵다. 본 논문에서는 미디어 스트리밍 서비스에서 네트워크 트래픽을 감소시키고 서비스 지연시간을 줄이기 위한 새로운 캐슁 전략을 제안한다. 제안된 전략에서 프록시 서버는 미디어 데이터의 일부와 미디어의 프리픽스를 캐슁하여 클라이언트가 요청한 미디어를 바로 인접한 프록시에서 찾도록 하여, 고 대역폭을 사용하는 스트리밍 시스템에서 네트워크 부하와 초기 지연을 줄인다.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1023-1043
• /
• 2010

As main memory get cheaper, it becomes increasingly affordable to load entire index of DBMS and to access the index. Since speed gap between CPU and main memory is growing bigger, many researches to reduce a cost of main memory access are under the progress. As one of those, cache conscious trees can reduce the cost of main memory access. Since cache conscious trees reduce the number of cache miss by compressing data in node, cache conscious trees can reduce the cost of main memory. Existing cache conscious trees use only fixed one compression technique without consideration of properties of data in node. First, this paper proposes the DC-tree that uses various compression techniques and change data layout in a node according to properties of data in order to reduce cache miss. Second, this paper proposes the level of compression locality that describes properties of data in node by formula. Third, this paper proposes Forced Partial Decomposition (FPD) that reduces the nutter of cache miss. DC-trees outperform 1.7X than B+-tree, 1.5X than simple prefix B+-tree, and 1.3X than pkB-tree, in terms of the number of cache misses. Since proposed DC-trees can be adopted in commercial main memory database system, we believe that DC-trees are practical result.