• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.965-974
• /
• 2003

Today's network consists of a large number of routers and servers running a variety of applications. In this paper, we have designed and constructed the general simulation environment of network security model composed of multiple IDSs agent and a firewall agent which coordinate by CNP (Contract Net Protocol). The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls the execution of agents or a contractee, who performs intrusion detection. In the knowledge-based network security model, each model of simulation environment is hierarchically designed by DEVS (Discrete Event system Specification) formalism. The purpose of this simulation is the application of rete pattern-matching algorithm speeding up the inference cycle phases of the intrusion detection expert system. we evaluate the characteristics and performance of CNP architecture with rete pattern-matching algorithm.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.455-464
• /
• 2008

To provide network services consistently under various network failures, enterprise networks increasingly utilize path diversity through multi-homing. As a result, multi-homed non-transit autonomous systems become to surpass single-homed networks in number. In this paper, we address an inevitable problem that occurs when networks with multiple entry points deploy firewalls in their borders. The majority of today's firewalls use stateful inspection that exploits connection state for fine-grained control. However, stateful inspection has a topological restriction such that outgoing and incoming traffic of a connection should pass through a single firewall to execute desired packet filtering operation. Multi-homed networking environments suffer from this restriction and BGP policies provide only coarse control over communication paths. Due to these features and the characteristics of datagram routing, there exists a real possibility of asymmetric routing. This mismatch between the exit and entry firewalls for a connection causes connection establishment failures. In this paper, we formulate this phenomenon into a state-sharing problem among multiple fire walls under asymmetric routing condition. To solve this problem, we propose a stateful inspection protocol that requires very low processing and messaging overhead. Our protocol consists of the following two phases: 1) Generation of a TCP SYN cookie marked with the firewall identification number upon a SYN packet arrival, and 2) state sharing triggered by a SYN/ACK packet arrival in the absence of the trail of its initial SYN packet. We demonstrate that our protocol is scalable, robust, and simple enough to be deployed for high speed networks. It also transparently works under any client-server configurations. Last but not least, we present experimental results through a prototype implementation.

• Journal of Navigation and Port Research
• /
• v.27 no.4
• /
• pp.479-484
• /
• 2003

In the case of the feeder bus route choice, it is more desirable to choose the route by treating as a single route linked from origin to destination than the whole network. This study is to establish a concept that frames the feeder bus route choice technique for the change of the existing single bus route or the creation of the new feeder bus route. The concept of the feeder bus route choice technique in this study is not to frame the whole bus network but to frame a single route to a unit O-D pair. So, this study has the assumption that does not consider the waiting and transfer time at the bus stop. This system technique consists of the following phases: I) limitation of the road network examined for the study, ii) enumeration of the appropriate candidate routes by the permissive route length, and iii) determination of the optimum bus route by the route evaluation value.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• Journal of KIISE:Software and Applications
• /
• v.34 no.10
• /
• pp.910-917
• /
• 2007

Of the possible interactions between human and robot, touch is an important means of providing human beings with emotional relief. However, most previous studies have focused on interactions based on voice and images. In this paper. a method of recognizing human touching behaviors is proposed for developing a robot that can naturally interact with humans through touch. In this method, the recognition process is divided into pre-process and recognition Phases. In the Pre-Process Phase, recognizable characteristics are calculated from the data generated by the touch detector which was fabricated using force sensors. The force sensor used an FSR (force sensing register). The recognition phase classifies human touching behaviors using a multi-layer perceptron which is a neural network model. Experimental data was generated by six men employing three types of human touching behaviors including 'hitting', 'stroking' and 'tickling'. As the experimental result of a recognizer being generated for each user and being evaluated as cross-validation, the average recognition rate was 82.9% while the result of a single recognizer for all users showed a 74.5% average recognition rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.865-875
• /
• 2008

In this paper, we propose a reliable multicast scheme for the tactical wireless ad hoc network where the members share the situation and operation data. Our scheme consists of two phases to guarantee the reliability. During the dissemination phase, we utilizes an epidemic approach similar to gossip-based ad hoc routing. Then the group members interchange the message reception state information periodically so that they are able to recover missing packets from the other members. We evaluate the performance of our scheme through extensive simulations using the network simulator in comparison with other existing reliable multicast schemes in mobile ad hoc network. Our scheme shows higher packet delivery ratio regardless of the mobility and imposes much lower control overhead to the non-group members compared with the existing schemes.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.979-989
• /
• 2015

Machine to Machine (M2M) technology has gained attention due to the fast diffusion of Internet of Things (IoT) technologies and smart devices. Most wireless network experts believe that Bluetooth Low Energy (BLE) Communications technology in an iBeacon network has amazing advantages in terms of providing communication services at a low cost in smartphone applications. Specifically, BLE does not require any pairing process during its communication phases, so it is possible to send a message to any node without incurring additional transmissions costs if they are within the BLE communication range. However, BLE does not require any security verification during communication, so it has weak security. Therefore, a security authorization process would be necessary to obtain customer confidence. To provide security functions for iBeacon, we think that the iBeacon Message Encryption process and a Decryption (Authorization) process should be designed and implemented. We therefore propose the BLE message Authorization Mechanism based on a One Time Password Algorithm (BLE-OTP). The effectiveness of our mechanism is evaluated by conducting a performance test on an attendance system based on BLE-OTP.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.63-76
• /
• 2012

We propose a Korean compound noun semantic tagging system using statistical compound noun decomposition and semantic relation information extracted from a lexical semantic network(U-WIN) and dictionary definitions. The system consists of three phases including compound noun decomposition, semantic constraint, and semantic tagging. In compound noun decomposition, best candidates are selected using noun location frequencies extracted from a Sejong corpus, and re-decomposes noun for semantic constraint and restores foreign nouns. The semantic constraints phase finds possible semantic combinations by using origin information in dictionary and Naive Bayes Classifier, in order to decrease the computation time and increase the accuracy of semantic tagging. The semantic tagging phase calculates the semantic similarity between decomposed nouns and decides the semantic tags. We have constructed 40,717 experimental compound nouns data set from Standard Korean Language Dictionary, which consists of more than 3 characters and is semantically tagged. From the experiments, the accuracy of compound noun decomposition is 99.26%, and the accuracy of semantic tagging is 95.38% respectively.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.360-369
• /
• 2007

Since wireless sensor networks consist of nodes with the constrained battery, it is important to construct the topology performing energy-efficient routing while maximizing the whole network lifetime. Previous works related to this do not take into consideration the specific communication pattern in wireless sensor networks. In this paper, we propose a novel routing algorithm, called Up-Down Tree(UDT), which first constructs the tree topology based on distance and then adjusts the transmission range determined by the two different phases, tree setup and data gathering, to adapt the specific communication pattern in wireless sensor networks. Therefore, the UDT can improve energy efficiency, maximize the network lifetime, and block network partition Simulation results show that the UDT has the improved energy efficiency by constructing the optimal topology.

• Geophysics and Geophysical Exploration
• /
• v.12 no.1
• /
• pp.105-113
• /
• 2009

The interpretation of observed waveform characteristics identified in refraction and wide-angle reflection data increases confidence in the crustal structure model obtained. When calculating traveltimes and raypaths, wavefront methods on a regular grid based on graph theory are robust even with complicated structures, but basically compute only first arrivals. In this paper, we develop new algorithms to compute traveltimes and raypaths not only for first arrivals, but also for fast and later reflection arrivals, later refraction arrivals, and converted waves between P and S, using the modified wavefront method based on slowness network nodes mapped on a multi-layer model. Using the new algorithm, we can interpret reflected arrivals, Pg-later arrivals, strong arrivals appearing behind Pn, triplicated Moho reflected arrivals (PmP) to obtain the shape of the Moho, and phases involving conversion between P and S. Using two models of an ocean-continent transition zone and an oceanic ridge or seamount, we show the usefulness of this algorithm, which is confirmed by synthetic seismograms using the 2D Finite Difference Method (2D-FDM). Characteristics of arrivals and raypaths of the two models differ from each other in that using only first-arrival traveltime data for crustal structure analysis involves risk of erroneous interpretation in the ocean-continent transition zone, or the region around a ridge or seamount.