• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.511-520
• /
• 2009

Grid technology enables high performance computation and mass data processing by connecting geographically distributed computing resources to high-speed network. To carry on grid tasks requiring guaranteed quality of service, we need to build converged infrastructure which controls and manages network resources as well as computing resources. In this paper, we defined grid network service interface and information model to support grid network path, resource creation and reservation. In addition to resource creation and reservation messages of the existing GLIF, grid network path and notification messages were defined in the grid network service interface. We also defined related statuses and messages for two-phase resource reservation mechanism. We designed and implemented network resource management system based on the grid network information model and service interface. We experimented in resource reservation, allocation and release of network resources in grid environment with GMPLS control and transport network.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.79-87
• /
• 2005

In e-commerce applications, a public key cryptosystem is an important and indispensible element for the basic security operations such as authentication, digital signaturing, and key distribution. In wired network environments, the public key infrastructure certificate, which is based on X.509 specification, has been widely used. On the other hand, it still remains difficult to use the certificate information in wireless network environments due to the inherent limitations of the hand-held devices such as low computational power and short battery life. In this paper, we facilitate a codesign approach by implementing a software public-key cryptosystem and classifying its internal computation overheads quantitatively using a software profiling technique. Moreover, we propose a method to analyze the profiled data and apply it to the problem of software/hardware partitioning in a codesign approach. As an illustrative example, we analyze the computational overheads of an EC-Elfagamal application and examine a critical computational path.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.24 no.5
• /
• pp.569-576
• /
• 2011

In this paper a new analysis procedure for evaluation of progressive collapse resisting capacity of a structure was proposed based on the nonlinear static analysis procedure. The proposed procedure produces analysis results identical to those obtained by the linear static analysis procedure specified in the GSA guidelines without iteration, therefore saving a lot of computation time and excluding the possibility of human errors during the procedure. To verify the validity of the proposed procedure, the two methods were applied to the analysis of a reinforced concrete moment frame and a steel braced frame subjected to loss of a first story column and the results were compared. According to the analysis results, the two methods produce identical results in the prediction of progressive collapse and the hinge formation. As iterative analysis is not required in the proposed method, significant amount of analysis time is saved in the proposed analysis procedure.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.815-820
• /
• 2004

For providing high quality-guaranteed service over Internet, traffic engineering based on an MPLS technology is being introduced. MPLS traffic engineering performs the computation on the path guaranteeing service`s quality and the reservation on network resources by an MPLS signaling protocol. As one of MPLS signaling protocol, RSVP-TE protocol transmits and receives periodic refresh messages for maintaining the path of a traffic flow. Such characteristic gives a heavy processing overhead to routers for maintaining states of large number of paths. In this paper, we propose a scalable implementation approach for RSVP-TE without dramatically increasing processing overhead. And we eval-uate the processing overhead on periodic messages by implementing the RSVP-TE protocol and the reduction mechanism of periodic messages.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.15-21
• /
• 2011

In the range-based localization, the localization accuracy will be high dependent on the accuracy of distance measurement between two nodes. The received signal strength(RSS) is one of the simplest methods of distance measurement, and can be easily implemented in a ranging-based method. However, a RSS-based localization scheme has few problems. One problem is that the signal in the communication channel is affected by many factors such as fading, shadowing, obstacle, and etc, which makes the error of distance measurement occur and the localization accuracy of sensor node be low. The other problem is that the sensor node estimates its location for itself in most cases of the RSS-based localization schemes, which makes the sensor network life time be reduced due to the battery limit of sensor nodes. Since beacon nodes usually have more resources than sensor nodes in terms of computation ability and battery, the beacon node based localization scheme can expand the life time of the sensor network. In this paper, therefore we propose a beacon node based localization algorithm using received signal strength(RSS) and path loss calibration in order to overcome the aforementioned problems. Through simulations, we prove the efficiency of the proposed scheme.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2009.10a
• /
• pp.357-363
• /
• 2009

This paper deals with the Filtered-x Least Mean Square algorithm for a active vibration control in vehicle vibration reduction. Before applying the proposed FxLMS algorithm to automobile, the performance of the FxLMS algorithm is simulated using sensor data of a vehicle. The FxLMS algorithm requires that reference signal be a representation of disturbance signal and the plant model be incorporated into the computation path. To this end, The system identification is carried out to obtain the plant model based on the measurement results. A tachometer signal is used as reference signal. The FxLMS control algorithm is first tested using simulation and applied to a vehicle. Experimental results show that the proposed control algorithm can reduce vibration level in a short period of time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3701-3727
• /
• 2016

Recently Service Function Chaining (SFC) is promising to innovate the network service mode in modern networks. However, a feasible implementation of SFC is still difficult due to the need to achieve functional equivalence with traditional modes without sacrificing performance or increasing network complexity. In this paper, we present a configurable network service chaining (CNSC) mechanism to provide services for network traffics in a flexible and optimal way. Firstly, we formulate the problem of network service chaining and design an effective service chain construction framework based on integrating software-defined networking (SDN) with network functions virtualization (NFV). Then, we model the service path computation problem as an integer liner optimization problem and propose an algorithm named SPCM to cooperatively combine service function instances with a network utility maximum policy. In the procedure of SPCM, we achieve the service node mapping by defining a service capacity matrix for substrate nodes, and work out the optimal link mapping policies with segment routing. Finally, the simulation results indicate that the average request acceptance ratio and resources utilization ratio can reach above 85% and 75% by our SPCM algorithm, respectively. Upon the prototype system, it is demonstrated that CNSC outperforms other approaches and can provide flexible and scalable network services.

• The Journal of Information Systems
• /
• v.26 no.1
• /
• pp.93-123
• /
• 2017

Purpose The purpose of this study is to deduct the factors for explaining the economic behavior of an Internet user who provides personal information notwithstanding the concern about an invasion of privacy based on the Information Privacy Calculus Theory and Communication Privacy Management Theory. Design/methodology/approach This study made a design of the research model by integrating the factors deducted from the computation theory of information privacy with the factors deducted from the management theory of communication privacy on the basis of the Dual-Process Theory. In addition, this study, did empirical analysis of the path difference between groups by dividing Internet users into a group having experience in personal information spill and another group having no experience. Findings According to the empirical analysis result, this study confirmed that the Privacy Concern about forms through the Perceived Privacy Risk derived from the Disposition to value Privacy. In addition, this study confirmed that the behavior of an Internet user involved in personal information offering occurs due to the Perceived Benefits contradicting the Privacy Concern.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.163-165
• /
• 2014

In this paper, we propose a world's first programmable video processing platform for video quality enhancement of 8K ($7680{\times}4320$) UHD (Ultra High Definition) TV at 60 frames per second. To support huge computation and memory bandwidth of video quality enhancement for 8K resolution, the proposed platform has unique features like symmetric multi-cluster architecture for data partitioning, ring data-path between clusters to support data pipelining, on-the-fly processing architecture to reduce DDR bandwidth, flexible hardware to accelerating common kernel in video enhancement algorithms. In addition to those features, general programmability of SRP (Samsung reconfigurable processor) as main core of the proposed platform makes it possible to upgrade continuously video enhancement algorithm even after the platform is fixed. This ability is very important because algorithms for 8K DTV is under development. The proposed sub-system has been embedded into SoC (System on Chip) and new 8K UHD TV using the programmable SoC is expected at CES2015 for the first time in the world.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.116-121
• /
• 2014

This paper discusses computer-generated heuristics for motion planning. Planning with many degrees of freedom is a challenging task, because the complexity of most planning algorithms grows exponentially with the number of dimensions of the problem. A well-designed heuristic may greatly improve the performance of a planning algorithm in terms of the computation time. However, in recent years, with increasingly challenging high-dimensional planning problems, the design of good heuristics has itself become a complicated task. In this paper, we present an approach to algorithmically develop a heuristic for motion planning, which increases the efficiency of a planner in similar environments. To implement the idea, we generalize modern motion planning algorithms to an extent, where a heuristic is represented as a set of random variables. Distributions of the variables are then analyzed with computer learning methods. The analysis results are then utilized to generate a heuristic. During the experiments, the proposed approach is applied to several planning tasks with different algorithms and is shown to improve performance.