• Journal of Software Engineering Society
• /
• v.26 no.1
• /
• pp.1-16
• /
• 2013

Variable length information message is a communication protocol standard in order for computer network systems to provide efficient delivery of information. The variable length information messages were developed for varying and controlling details of information in accordance with message receiver's required information level or information access level. In the previous studies, data compressing techniques have been in use for information message optimization technologies in order to reduce physical sizes of information messages. In optimization technologies for information messages, accuracy of information is considered as the most important factor; therefore, only non-loss compression techniques are applied to the optimization technologies. However, the non-loss compression based information message optimization methods are not efficient in data compression, and these are limited to efficient delivery of information in wireless network environments that have constraint bandwidth. In this paper, we attempt to optimize information in the variable length information messages at message fields in order to reduce physical sizes of messages more efficiently. To demonstrate the efficiency of our approach, we conduct optimization experiments for variable length information messages.

• Journal of Information Technology Services
• /
• v.4 no.2
• /
• pp.125-133
• /
• 2005

Because of paradigm change to web service, numerous institutes have been suggested supporting solution about web service, and actively developed system using web service but it is hard to find out a systematic study for web service performance enhancement. Generally, there are SOAP message processing improvement and configuration optimization of server viewpoint for web service performance enhancement. Web service performance enhancement through SOAP message processing improvement have been studied related research but configuration optimization of server is hard to find out a systematic tuning model and performance criteria. In this paper, I suggested performance testing based tuning model and criteria of configuration optimization of server viewpoint. We executed practical analysis using tuning model about web service in internet. This paper show that the proposed tuning model and performance criteria is applicable to web service performance enhancement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2357-2375
• /
• 2013

Message ferry is a controllable mobile node with large capacity and rechargeable energy to collect information from the sensors to the sink in wireless sensor networks. In the existing works, route of the message ferry is often designed from the solutions of the Traveling Salesman Problem (TSP) and its variants. In such solutions, the ferry route is often a simple cycle, which starts from the sink, access all the sensors exactly once and moves back to the sink. In this paper, we consider a different case, where the ferry route is a closed walk that contains more than one simple cycle. This problem is defined as the Closed Walk Ferry Route Design (CWFRD) problem in this paper, which is an optimization problem aiming to minimize the average weighted delay. The CWFRD problem is proved to be NP-hard, and the Integer Linear Programming (ILP) formulation is given. Furthermore, a heuristic scheme, namely the Initialization-Split-Optimization (ISO) scheme is proposed to construct closed walk routes for the ferry. The experimental results show that the ISO algorithm proposed in this paper can effectively reduce the average weighted delay compared to the existing simple cycle based scheme.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.59-68
• /
• 2010

In the paper, we proposed the Using Correspondent Information for Route Optimization on PMIPv6 over Inter-MAG. Proxy Mobile IPv6 has the problem that a mobile node sends data packets through inefficient routing paths when communicating other mobile node. Route optimization schemes are proposed to solve the triangle routing problem that creates the shortest routing path by leaving the inefficient routing paths. We proposed Correspondent Information Route Optimization scheme to reduce signaling cost as compared with other route optimization scheme. We can reduce signaling cost of route optimization through the Correspondent Information message on basic PMIPv6 and hand-off environment.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.3
• /
• pp.105-114
• /
• 2012

Various RFID-based smart-walk systems have been developed for guiding disabled people. The system sends appropriate message whenever the disabled people arrived at a specific point. We propose universal design concept and optimization techniques for the smart-walk systems. Universal design concept can be adopted for supporting various kinds of disabled such as a blind person, a hearing-impaired person, or a foreigner in a system. It can be supported by storing appropriate messages set in the message database table depending on the kinds of the disabled. System optimization can be done by analyzing operational log(stream) data accumulated in the system. Useful information can be extracted by analyzing or mining the accumulated operational log data. We show various analysis results from the operational log data.

• International Journal of Automotive Technology
• /
• v.8 no.1
• /
• pp.39-48
• /
• 2007

This paper addresses the problem of period and priority assignment in networked control systems (NCSs) using a fixed priority scheduler. The problem of assigning periods and priorities to tasks and messages is formulated as an optimization problem to allow for a systematic approach. The temporal characteristics of an NCS should be considered by defining an appropriate performance index (PI) which represents the temporal behavior of the NCS. In this study, the sum of the end-to-end response times required to process all I/Os with precedence relationships is defined as a PI. Constraints are derived from the task and message deadline requirements to guarantee schedulability. Genetic algorithms are used to solve this constrained optimization problem because the optimization formulation is discrete and nonlinear. By considering the effects of communication, an optimum set of periods and priorities can be holistically derived.

• Journal of Energy Engineering
• /
• v.21 no.1
• /
• pp.33-42
• /
• 2012

In this study, long-term greenhouse gas reductions expected passenger sector was used for the MESSAGE. Green Car road map proposed BAU scenario, Enhanced diffusion green car scenario, and price 1, 2 scenarios was configured with four scenarios. Enhanced diffusion green car in the scenario, in 2050 compared to BAU scenario 13% of the emissions will decrease. Price 1 and Price 2 scenario is emissions reduction of 14% compared to BAU. This study consists of six chapters. Introduction of MESSAGE, creation and RES in the year and the target year set a different base line and the passenger building materials sector activities, steps for passenger sector scenario and Based on the results of running the emissions reductions were to describe.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.197-204
• /
• 2014

This paper investigates a design of optimization database structure layout of Message Oriented Analysis and Management Tool (MOMAT) for naval combat systems (NCS). The NCS is composed of heterogeneous and large-scale component such as communication service and data distribution servcies (DDS). Each components are massively made the data as components. To manage the messages, MOMAT is developed. Typical modeling tool have problems that low performance due to duplicate database tables. An efficient design that one of the database optimization is proposed to solve the problems in this paper. It reduces the number of tables and improves application response and processing time. Experiment results shows that an availability of proposed method in MOMAT and decrease of both amount of data from client node to server and sever load.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.70-84
• /
• 2006

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.728-735
• /
• 2003

It is a mainly issue that provide mobility smoothly in Mobile IP networks. The IP mobility support being standardized in the IETF utilized tunneling of IP packets from a home agent to foreign agent and utilized reverse tunneling of IP packets from foreign agent to home agent. In this paper, We propose that solve the triangular routing problem in IP mobility and that lessen the messages about IETF routing optimization. Through the Mobile Routing Table on the edge router, agent process the message instead of a end node when handoff occur and that lessen the routing path length by sending directly from FA to to Correspond Node's router. This action lessen the message occurrence frequency and the packet drop. We compare the standard IP, Routing Optimization of Mobile IP, Wu's method and the proposed algorithm. Finally, the simulation results are presented.