• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2249-2261
• /
• 1999

In this paper, we describe the design and implementation of the Label Distribution Protocol (LDP) for Multiprotocol Label Switching System. We review the implementation issues of LDP that is required to make a gigabit switched router, and propose a detail design of it. We present the data structures and procedures for the LDP as a result, which are based on IETF standard. We present design issues for applying this to carrier class products. The implemented protocol could afford 40,000 entries of the IP routing table that is required for deploying this system to commercialized data network. Furthermore this system implemented using the standard API of Unix, as a result, it has portability. By implementing LDP based on the international standard and these implementation issues, we expect that the implemented LDP will be interoperable with other commercialized products. We prove the validity of the design of the LDP through prototyping, and also verify the prototype with the specification using the process algebra and the performance analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.359-369
• /
• 2003

We present efficient generalized algorithms for all-to-all personalized communication operations in a 2D torus. All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, Fast Fourier Transform(FFT), and distributed table lookup. Some algorithms have been Presented when the number of nodes is power-of-2 or multiple-of-four form, but there has been no result for general cases yet. We first present complete exchange algorithm called multiple-Hop-2D when the number of nodes is in the form of multiple-of-two. Then by extending this algorithm, we present two algorithms for an arbitrary number of nodes. Split-and-Merge algorithm first splits the whole network into zones. After each zone performs complete exchange, merge is applied to finish the desired complete exchange. By handling extra steps in Double-Hop-2D algorithm, Modified Double-Hop-2D algorithm performs complete exchange operation for general cases. Finally, we compare the required start-up time for these algorithms.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.3
• /
• pp.73-78
• /
• 2019

Due to frequent topology changes in wireless networks, inter-node link disconnection and path re-establishment occur, causing problems such as overloading control messages in the network. In this paper, to solve the problems such as link disconnection and control message overload, we perform path setup in three steps of the neighbor node discovery process, the route discovery process, and the route management process in the wireless network environment. The link stability value is calculated using the information of the routing table. Then, when the zone master monitors the calculated link value and becomes less than the threshold value, it predicts the link disconnection and performs the path reset to the corresponding transmitting and receiving node. The proposed scheme shows a performance improvement over the existing OLSR protocol in terms of data throughput, average path setup time, and data throughput depending on the speed of the mobile node as the number of mobile nodes changes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.624-632
• /
• 2022

Relationship networks such as an interpersonal relationship network or navigation route search can be expressed in graph form. However, as the amount of data increase, there is a problem that it is difficult to search for the desired data when it is displayed on one screen. In this paper, we propose a visualization method for searching for people, searching for the shortest path between people, and using graphs to express an interpersonal relationship network with many nodes. Unlike the search for the shortest path in the routing table, the shortest path in the interpersonal relationship network should be changeable according to the intension or importance of the researcher or user who is analyzing it. To this end, the BFS algorithm was modified to apply the characteristics of the interpersonal relationship network. For the verification of the results, the data in the character relationship information of the Korean Classics DB in the Korean Classics Translation Institute was used.

• Journal of Soil and Groundwater Environment
• /
• v.12 no.5
• /
• pp.19-32
• /
• 2007

In Korea, there have been various methods of estimating groundwater recharge which generally can be subdivided into three types: baseflow separation method by means of groundwater recession curve, water budget analysis based on lumped conceptual model in watershed, and water table fluctuation method (WTF) by using the data from groundwater monitoring wells. However, groundwater recharge rate shows the spatial-temporal variability due to climatic condition, land use and hydrogeological heterogeneity, so these methods have various limits to deal with these characteristics. To overcome these limitations, we present a new method of estimating recharge based on water balance components from the SWAT-MODFLOW which is an integrated surface-ground water model. Groundwater levels in the interest area close to the stream have dynamics similar to stream flow, whereas levels further upslope respond to precipitation with a delay. As these behaviours are related to the physical process of recharge, it is needed to account for the time delay in aquifer recharge once the water exits the soil profile to represent these features. In SWAT, a single linear reservoir storage module with an exponential decay weighting function is used to compute the recharge from soil to aquifer on a given day. However, this module has some limitations expressing recharge variation when the delay time is too long and transient recharge trend does not match to the groundwater table time series, the multi-reservoir storage routing module which represents more realistic time delay through vadose zone is newly suggested in this study. In this module, the parameter related to the delay time should be optimized by checking the correlation between simulated recharge and observed groundwater levels. The final step of this procedure is to compare simulated groundwater table with observed one as well as to compare simulated watershed runoff with observed one. This method is applied to Mihocheon watershed in Korea for the purpose of testing the procedure of proper estimation of spatio-temporal groundwater recharge distribution. As the newly suggested method of estimating recharge has the advantages of effectiveness of watershed model as well as the accuracy of WTF method, the estimated daily recharge rate would be an advanced quantity reflecting the heterogeneity of hydrogeology, climatic condition, land use as well as physical behaviour of water in soil layers and aquifers.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.8 no.1
• /
• pp.46-52
• /
• 2005

A marine environmental information system (MEIS) useful for optimal route planning of ships running in the ocean was developed. Utilizing the simulated marine environmental data produced by the European Center for Medium-Range Weather Forecasts based on global environmental data observed by satellites, the real-time forecast and long-term statistics of marine environments around planned and probable ship routes are provided. The MEIS consists of a land-based data acquisition and analysis system(MEIS-Center) and a onboard information display system(MEIS-Ship) for graphic description of marine information and optimal route planning of ships. Also, it uses of satellite communication system for data transfer. The marine environmental components of winds, waves, air pressures and storms are provided, in which winds are described by speed and direction and waves are expressed in terms of height, direction and period for both of wind waves and swells. The real-time information is characterized by 0.5° resolution, 10 day forecast in 6 hour interval and daily update. The statistic information of monthly average and maximum value expected for a return period is featured by 1.5° resolution and based on 15 year database. The MEIS-Ship include an editing tool for route simulation and the forecasting and statistic information on planned routes can be displayed in graph or table. The MEIS enables for navigators to design an optimal navigational route that minimizes probable risk and operational cost.

• Journal of Korean Society of Transportation
• /
• v.18 no.4
• /
• pp.117-126
• /
• 2000

Conventional methods for collecting origin-destination trips have been mainly relied on the surveys of home or roadside interview. However, the methods tend to be costly, labor intensive and time disruptive to the trip makers, thus the methods are not considered suitable for Planning applications such as routing guidance, arterial management and information Provision, as the parts of deployments in Intelligent Transport Systems Motivated by the problems, more economic ways to estimate origin-destination trip tables have been studied since the late 1970s. Some of them, which have been estimating O-D table from link traffic counts are generally Entropy maximizing, Maximum likelihood, Generalized least squares(GLS), and Bayesian inference estimation etc. In the Paper, with user equilibrium constraint we formulate GLS problem for estimating O-D trips and develop a solution a1gorithm by using Genetic Algorithm, which has been known as a g1oba1 searching technique. For the purpose of evaluating the method, we apply it to Seoul inner ringroad and compare it with gradient method proposed by Spiess(1990). From the resu1ts we fond that the method developed in the Paper is superior to other.

• Journal of Internet of Things and Convergence
• /
• v.2 no.2
• /
• pp.37-49
• /
• 2016

An IP address is used as a host identifier and a locator to bind hosts and applications to their location in existing Internet. Several protocols are proposed to eliminate this binding. Most of these protocols use IPv6-based host identifiers to maintain compatibility with existing Internet, but these identifiers cannot be handled by standard IPv6 routers because such identifiers are unroutable. Therefore, host identifiers need to be usually converted to locators at hosts, and the standard IPv6 protocol should be modified to interoperate with these protocols. In this paper, we propose a network-based host identifier locator separating scheme in software-defined networking. The proposed scheme separates the underlying network into Host Identity and IP domains in order to directly forward unroutable identifiers. The Host Identity domain operates as an overlaid network over IP domain, and it makes the unroutable identifiers to be routable using distributed hash table based routing strategy. For the evaluation, we compared the proposed scheme with the previous scheme using signaling costs and packet delivery costs. The result shows that the proposed scheme is more suitable in the recent mobile-based environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.