• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.93-100
• /
• 2010

In this paper, we propose a technique which makes it faster to delete prefixes in an IP address lookup architecture based on parallel TCAMs. In previous deletion schemes, more than one memory movement is needed for the prefix ordering and keeping the available memory space consecutive. For deletion, our scheme stores the address of the deleted prefix in a stack implemented by SRAM instead of actual movement in TCAM. Since SRAM has very short latency compared to TCAM, the proposed scheme can accomplish fast updating. From the experiment with the real forwarding table and update trace, we evaluate the performance of our scheme in terms of the memory access time for the prefix insertion and deletion. The experiment result also shows good performance with considerably small size of stack.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.1-10
• /
• 2009

In a network-based approach such as Proxy Mobile IPv6 (PMIPv6), the serving network controls the mobility management on behalf of a Mobile Node (MN), thereby eliminating a MN from any mobility-related signaling. Although PMIPv6 is being standardized by the IETF NetLMM WG, PMIPv6 still suffers from a lengthy handover latency and the on-the-fly packet loss during a handover. Therefore, this paper presents an enhanced fast handover scheme for PMIPv6. The proposed handover scheme uses the Neighbor Discovery message of IPv6 to reduce the handover latency and packet buffering at the Mobile Access Gateway (MAG) to avoid the on-the-fly packet loss during a handover. In addition, it uses an additional packet buffering at the Local Mobility Anchor (LMA) to solve the packet ordering problem. We evaluate the performance of the proposed handover scheme using both analytical model and simulation. The numerical analysis shows that the proposed scheme has a relatively shorter handover latency. Simulation results demonstrate that the proposed scheme could avoid the on-the-fly packet loss and ensure the packet sequence.

• Journal of the Korea Convergence Society
• /
• v.11 no.4
• /
• pp.17-25
• /
• 2020

This study focuses on the analysis of the service process and interaction mode of the serving robot used in the restaurant, Through user research, shadowing research and indepth interviews with customers and catering service personnel, this paper analyzes the contact points between catering service machines, people and users, constructs user journey map to understand users' expectations. In addition to the delivery service that can be allocated to the machine and people, the blueprint construction of ordering, reception and table cleaning services can also included in the service process. The final proposal is to improve the existing machine human interface and design a new service scheme.

• Water for future
• /
• v.20 no.2
• /
• pp.117-126
• /
• 1987

A Synthetic unit hydrograph method was suggested for the representation of a direct runoff hydrograph with empirical geomorphologic laws and geomorphologic parameters by applying geomorphologic instantaneous unit hydrograph theory and Rossois results of application of GIUH theory to the Nash Model which is a linear reservoir model. The shape parameter m and scale parameter k can be derived by the Horton's empirical geomorphologic laws $R_A,R_B,R_L$ when ordered according to Strahler's ordering Scheme, main stream length and using the maximum velocity for the dynamic characteristics of a river basin, The derived response function was tested on some observed flood datas and showed promising. For the determination of the shape parameter m, eq. (16) was showed applying and m showed a good regression with the size of basin area.

• Water for future
• /
• v.18 no.2
• /
• pp.143-152
• /
• 1985

A method is suggested for the reappearance of a surface runoff hudorgraph of a river basin by linking the hydrologic response of a catchment represented by the instantaneous unit hydrograph(IUH) with the Horton's empirical gemorphologic laws. The geomorphologic theory of the IUH developed by G. Itrube et al. and the geomorphoclimatic theory of the IUH developed by Bras et al. are used to derive the new hydrologic response function in consideration of geomorphologic parameters and climatic characteristics by applying to Sukekawa's rainfall-runoff model. The derived response function was tested for on some observed hydrographs in a natural watershed and showed promising, and by considering a drainage basin as m(1∼4) identical linear reservoir in series, it was founded that the model(m=2) is most applicable to predict hydrologic response regardless of the size of basins. A modelization algorithm of a basin using Sthahler's ordering scheme of drainage network will give good result in analysis of the surface runoff huydrograph by the method of this study.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.288-300
• /
• 2006

In this paper, we consider a channel ordering problem that seeks to minimize the total interference in mobile radio networks. If a base station receives connection request from a mobile user, one of the empty channels that are fixed to the base station is assigned to the mobile user. Among several channels available, we can choose one that seems to make least interference with other channels assigned to adjacent base stations. However, a pair of channels that are not separated enough do not generate interference if both of them are not simultaneously used by mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference costs are properly generated.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.7
• /
• pp.74-80
• /
• 2002

VLSI intergrated circuits like SOC(system on chip) often require a multi-clock design style for functional or performance reasons. The problems of the clock domain transition due to clock skew and clock ordering within a test cycle may result in wrong results. This paper describes a new BIST(Built-in Self Test) architecture for multi-clock systems. In the new scheme, a clock skew is eliminated by a multi-capture. Therfore, it is possible to perform at-speed test for both clock inter-domain and clock intra-domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.180-187
• /
• 2014

In this paper, a extension of a fixed-complexity sphere decoder (FSD) to perform interference signal detection and cancelling is proposed for downlink multiuser multiple input-multiple output (MIMO) communication system. It is based on the application of channel matrix expansion on generalized sphere decoder (GSD), and modification of the channel matrix ordering scheme to a FSD algorithm for interference detection. A Monte Carlo simulation shows that the proposed algorithm improves the receiver performance by 3 dB as compared to maximum likelihood detection without interference cancelling at 10% packet error rate in configuration of 702 Mbit/s datarate for four users respectively on IEEE802.11ac.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.200-203
• /
• 2003

By minimizing the burst error of data and correcting the error, we can define the convolution coding and interleaving in IEEE 802.11a wireless tan system. Two step block interleaver was decided by coded bits per OFDM symbol and due to this it comes to the delay time in IEEE 802.11a. This is the point of the question which we must consider. We try to decrease the delay time by all 48-clock from interleavings, and we have proposed a way carried out the interleaving outputs per symbol. So in comparison with the existing interleaver, we can decrease the delay time in reading and writing data, as well as reduce the delay time of bit re-ordering per symbol. Also this scheme is apply in all x-QAM cases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.986-993
• /
• 2000

In this paper, we analyze transmission characteristics of ultrashort laser pulses using the properties of high-order pulses which are systematically obtained following their orders. The high-order pulses are easily derived from a modified PRS system model. But we make clear they are very useful to cover wider area and to show more accurate transmission characteristics of ultrashort pulses than Gaussian or Sech pulse approximations used conventionally. These are based on the fact that the spectra and bandwidths of the high-order pulses are geautifully related to their orders. First modifying the generalized PRS system model, we propose a new model for deriving any type of high-order pulse. And we offer a novel analysis method of ultrashort pulse transmission varying the order of the pulse from n=1 to n=100, we obtain spectra of ultrashort pulses with 1(ps)∼150(fs) FWHM's, which are widely used in optical pulse communications. One-step further, we derive PSD's of their pulse-tr ins when they are applied to Unipolar signaling scheme. These PSD's are decided in the range of possible pulse intervals. All of these results are not only coincided with some conventional experimental works but will be applied to any pioneering ultrashort pulse in the future.