• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.6
• /
• pp.522-528
• /
• 2014

A UHF/VHF full-duplex communication using monopole and dipole antenna has been widely used for cube satellite applications. This kind of communication system requires a dedicated structure panel for antenna integration, which is the one of the disadvantages of the conventional communication system from the accommodation point of view considering the extremely limited volume of the cube satellite. In this study, to maximize the accommodation efficiency of the cube satellite, the commercial UHF half-duplex antenna combined with buck converter for communication modes transition has been considered in the communication system design. Its effectiveness has been verified through link budget analysis based on the antenna specifications and satellite's operation conditions. In addition, the antenna deployment mechanism for the synchronous release of multi-antennas has also been introduced.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.5 no.6
• /
• pp.584-591
• /
• 2000

Power Quality Compensator(PQC) has been installed to protect the sensitive loads against the voltage disturbances, such as voltage sag and interruption. In general, static switch is used for the purpose of link between utility and PQC. So transfer operation of the static switch play a important part in the PQC. Many studies on the structure and control of PQC have been progressed in active, but these researches have been rarely mentioned about any voltage-disturbances-detection method to start the PQC operation. In this paper, a new voltage-disturbances-detection algorithm for computer application loads using the CBEMA/ITIC curve is proposed for transfer operation of the static switch. The proposed detection algorithm is implemented to get fast detecting time through the comparison of instantaneous 3-phase voltage values transferred to DC values in the synchronous reference frame with the operating reference values. To get the robust characteristics against the noise, a first order digital filter is designed. The magnitude falling and phase delay caused by the filter are compensated through the error normalizing and numerical analysis using transfer function, respectively. Finally, the validity of the proposed algorithm is proved by ACSL simulation and experimental results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.608-618
• /
• 2000

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of required resource copies, irrespective of node or link failures. To meet the requirements for high performance and high availability, minimum number of resource copies should be placed in such a way that each node has at least two copies on the node or its neighbor nodes. This is called the fault-tolerant resource placement problem in this paper. The structure of a parallel or a distributed computing system is represented by a graph. The fault-tolerant placement problem is first transformed into the problem of finding the smallest fault-tolerant dominating set in a graph. The dominating set problem is known to be NP-complete. In this paper, searching for the smallest fault-tolerant dominating set is formulated as a state-space search problem, which is then solved optimally with the well-known A* algorithm. To speed up the search, we derive heuristic information by analyzing the properties of fault-tolerant dominating sets. Some experimental results on various regular and random graphs show that the search time can be reduced dramatically using the heuristic information.

• Journal of Korea Water Resources Association
• /
• v.34 no.5
• /
• pp.473-486
• /
• 2001

The WGR model was developed to represent meso-scale precipitation. As a conceptual model, this model shows a good link between atmospheric dynamics and statistical description of meso-scale precipitation(Waymire et al., 1984). However, as it has maximum 18 parameters along with its non-linear structure, its parameter estimation has been remained a difficult problem. There have been several cases of its parameter estimation for different fields using non-linear programming techniques(NLP), which were also difficult tasks to hamper its wide applications. In this study, we estimated the WGR model parameters of the Han river basin using the genetic algorithm(GA) and compared them to the NLP results(Yoo and Kwon, 2000). As a result of the study, we can find that the sum of square error from the GA provide more consistent parameters to the seasonal variation of rainfall. Also, we can find that the higher rainfall amount during summer season is closely related with the arrival rate of rain bands, not the rain cell intensity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1303-1315
• /
• 2012

In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.427-432
• /
• 2005

Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.

• Applied Microscopy
• /
• v.28 no.1
• /
• pp.73-82
• /
• 1998

To elucidate how microfilaments and vesicles participate in bile formation, the pericanalicular cytoplasms were observed in the liver of rats treated with taurocholic acid by deep etching with rapid freezing, and copmpared them with the findings on convensional thin sections. The microfilaments were identified around the bile canaliculi in the forms of core filaments of microvilli, filaments of pericanalicular web running in parallel to the border of bile canaliculi, and filaments on the junctional complex. In taurocholic acid-treated rats, microfilaments could be visualized around the bile canaliculi and along their borders. The microfilaments appeared to be installed to link to both the canalicular membrane and vesicles. Such specialized microfilaments are considered to participate in the translocation of vesicles in the pericanalicular cytoplasm. From the evidence, it is assumed that the microfilament induces the vesicles to transport and fuse to bile canalicull into which bile acids is secreted by exocytosis.

• Journal of the Korean Society for Railway
• /
• v.18 no.3
• /
• pp.223-231
• /
• 2015

This paper proposes a new wireless backhaul technology based on MHN(Mobile Hotspot Network) which uses a wide frequency band of millimeter wave to provide wideband Wi-Fi services for subway passengers. Performance analysis of MHN up and down links, based on data: up and down links structure analysis of physical layer and simulation study of the MHN wireless backhaul link model, show that the proposed MHN-based wireless backhaul network can transmit data at a 1.2Gbps data rate and provide Internet service 100 times faster than that of conventional WiBro-based wireless backhaul networks. These results indicate that the proposed MHN technology is appropriate for subway mobile networks.

• Journal of the Korean Geophysical Society
• /
• v.8 no.2
• /
• pp.89-92
• /
• 2005

For the understanding the locus of the Quinling-Dabie-Sulu continental collision’s boundary and the underground structure of the sedimentray basin in the Yellow Sea, three dimensional density modelling is carrid out by using gravity dataset (Free Air Anomaly), which is measured by Tamhae 2, GIGAM in a period 2000-2002. The measured gravity anomaly in the investigations area is mainly responsed by depth distribution of the sedimentary basin. After comparing the sea-measured gravity data to CHAMP-GRACE satellite gravity data, I suggested that the high density model bodies extend mainly from the southern part of China to the middle-western part of the Korean Peninsula, which might be emplaced along the continental collision’s boundary. The total volume of very low density bodies modified by modelling might be about 20 000 km3.