• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.149-159
• /
• 2000

In mobile computing environments, invalidation and propagation method based on broadcasting is used to transmit the information for cache maintenance of mobile hosts. Previous researches generally adopted invalidation method that easily adapts to the limited network bandwidth and the frequent disconnection. But the invalidation of frequently accessed data causes the contention on the wireless network with the increasing cache requests. Although the propagation method can reduce the cache requests, the high probability of broken message or loss of message is the main factor that degrades the system performance. To resolve these problems, we propose adaptive cache maintenance scheme that dynamically adjusts the broadcasting ratio of invalidation and propagation, according to the wireless network connection states. The proposed scheme broadcasts the propagation message in stable connection state, so it can reduce the cache requests and server response time. With the decreasing available network bandwidth by the frequent partial disconnection and disconnection, the proposed scheme dynamically increases the broadcasting ratio of the invalidation messages to minimize the broken message or the loss of message probability. Consequently, the proposed scheme resolves the problems which arise in the invalidation or propagation method in mobile computing environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1073-1081
• /
• 2011

An URL parameter can hold some information that is confidential or vulnerable to illegitimate tampering. We propose Link-E-Param(Link with Encrypted Parameters) to protect the whole URL parameter names as well as their values. Unlike other techniques concealing only some of the URL parameters, it will successfully discourage attacks based on URL analysis to steal secret information on the Web sites. We implement Link-E-Param in the form of a servlet filter to be deployed on any Java Web server by simply copying a jar file and setting a few configuration values. Thus it can be used for any existing Web application without modifying the application. It also supports numerous encryption algorithms to choose from. Experiments show that our implementation induces only 2~3% increase in user response time due to encryption and decryption, which is deemed acceptable.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.12
• /
• pp.976-983
• /
• 2013

The targets for the traditional IT management solutions has been mostly systems (server) and networks. Such that management system for system and network, SMS and NMS respectively, used be the IT management solutions. Now the speed of hardware improvement is faster than ever, the performance improvement scope is shifting from hardware towards software. Therefore, it is not arguable that the business success depends on the efficient and optimized application performance management. There are many different approaches are developed in the application performance management, but in this study, API-based logging system that most efficiently visualizes the correlation of call and response between Components and enables active performance management for monitoring real-time applications operation status and resolving the problems and failures quickly.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.951-958
• /
• 2004

Nowadays NGN is developed for supporting the e-Commerce, Internet trading, e-Government, e-mail, virtual-life and multimedia. Internet gives us the benefit of remote access to the information but causes the attacks that can break server and modify information. Since 2000 Nimda, Code Red Virus and DSoS attacks are spreaded in Internet. This attack programs make tremendous traffic packets on the Internet. In this paper, we designed and developed the Bandwidth Controller in the gateway systems against the bandwidth saturation attacks. This Bandwidth con-troller is implemented in hardware chipset(FPGA) Virtex II Pro which is produced by Xilinx and acts as a policing function. We reference the TBF(Token Bucket Filter) in Linux Kernel 2.4 and implemented this function in HDL(Hardware Description Language) Verilog. This HDL code is synthesized in hardware chipset and performs the gigabit traffic in real time. This policing function can throttle the traffic at the rate of band width controlling policy in bps speed.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.237-242
• /
• 2014

Current digital door lock systems are mainly designed for users' convenience, so they have weakness in security. Thus, this paper suggests a video digital doorlock system grouped with a relay device, a server, and a digital doorlock with a camera, sensors, and communication modules, which is detecting or recognizing objects approaching to the front of the door lock system and sending images and door-opening information to users' smart devices. Experiments showed that the suggested system has 96~98% recognition rate of approaching objects and requires 17.1~23.9 seconds for transmission on average, depending on network systems. Therefore, the system is thought to have enough capability for real time security response by monitoring the front area of the doorlock system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9B
• /
• pp.947-954
• /
• 2009

In mobile ad hoc networks, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery protocol that is combined a dht-based service discovery scheme and a P2P caching-based information spreading scheme. Proposed scheme store key information in hashed zone and search services using it's information. To search quickly a service, it use its physical neighbors information which collected by 1-hop hello message between a node and its physical neighbors. We do not use a central look up server and do not rely on flooding. Hence, it uniquely balanced all node's load in mobile ad hoc networks and reduced the number of messages exchanged, network load and response time. The simulation results show that our protocol outperforms DHT-based and flooding protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.25-31
• /
• 2008

The web has been evolving as an indispensable part of our lives since Berners Lee introduced the first web sever and browser in 1990. From the web end user's point of view, the response time is a matter of concern. Moreover the throughput is an important factor to consider for the system manager's point as well. It's not easy to estimate the performance of a web application because it depends on various elements comprising the whole operational environment of the Internet from networking, client and server computing powers, DBMS and OS capabilities, to application itself. This paper suggests a coarse grained simulation model for web application performance estimation based on the data measured by Buch and Pentkowski [1] and the analytical model proposed by Gunther [2]. The result of the simulation model almost coincides with the measured data and estimates the performance of a new environment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.25-30
• /
• 2015

One of the hottest issues of security is information leakage of financial institution. Financial institutions including commercial banks are frequently threatened by attempts of leakage through hacking and vulnerability, and this information is centered on personal information of their clients. Through this study, I found out that security managers of financial institutions are trying to prevent the leaking of private information, but in fact most of them barely know where their personal information is. Even if they know where it is and trace the data, it is often found in unexpected places. Because there is a lot of waste in time and human resources as search is done manually, we have understood that responding to IT Compliance requires a lot of effort. This study is to improve IT Compliance response and protect information leakage through monitoring PC and servers, the main storage of personal information by automated system, periodically.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.40-47
• /
• 2009

Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.