• International Journal of Contents
• /
• v.4 no.1
• /
• pp.16-19
• /
• 2008

In this paper, we propose to new dispatcher method, which doesn't depend on an operating system of the server, and the direct routing method, by which a server answers a client's request at first hand. And, propose new web clustering scheme based on the contents on the web where web servers composed of cluster, with each different contents, answer client's request. The other purposes are to reduce overhead of the dispatcher through load balance, and to minimize the time to take in responding to a client's request. The performance of new web cluster scheme was improved by about 39% than that of the existing RR method. It was identified that the performance of the proposed web cluster method was extraordinary improved comparing with that of the existing RR method as a whole.

• International Journal of Contents
• /
• v.2 no.1
• /
• pp.39-44
• /
• 2006

Load sharing is a critical resource in computer system. In sender-initiated load sharing algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver initiated load sharing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated and receiver-initiated load sharing in distributed systems. And we expand this algorithm to an adaptive load sharing algorithm. Compared with the conventional sender-initiated and receiver-initiated algorithms, the proposed algorithm decreases the response time and task processing time.

• Journal of Information Technology Services
• /
• v.6 no.3
• /
• pp.87-110
• /
• 2007

Recently, researches on IT Service Management (ITSM) for improving information system operation service and information system outsourcing cost estimation model are proliferating. This study suggests a new cost model of IT operation service and optimizing method based upon the characteristics of operation service as a long-term and continuous business service for both user's and service provider's point of view. This study explains the cost optimization model of IT operation service by improving service request management process, such as adequate reception and control, proper valuation, process management using project management methodology, effective organization and time management of service personnel. Especially in this study, service ability improvement effect and fixed operation cost reduction effect are defined to prove the proposed new cost model.

• Korean Journal of Digital Imaging in Medicine
• /
• v.17 no.1
• /
• pp.1-7
• /
• 2015

Recently, dental PACS construction in dental hospital is fairly general. For this reason, inspection request works of dental PACS fee with Health Insurance Review & Assessment Service are more important for the financial stability in hospital and from now on status. But several departments in dental hospital, enforce a incoherent order system so inspection request situation is full of mistakes and omissions. As a result, financial stability in hospital rapidly change for the worse, as the case stands establishment of proper order system and match system is essential to resolve the issue. Consequently, we plan to establish the proposed idealized scheme.

• IE interfaces
• /
• v.9 no.3
• /
• pp.168-179
• /
• 1996

Automatic repeated recalling from individual computing equipments such as PC and workstations, to access ATM networks may result in call overload to networks. Call overload causes to waste network resources and fail to meet user call processing QoS requirements. We evaluate two call connection request methods: the back-off recall method(BRM) which makes recall with random waiting time after rejection, and the direct recall method(DRM) which repeats call connection request whenever call request is rejected. We evaluate their performances by simulation and it shows that as the total number of attached terminals to each access node increases, BRM performs better than DRM in terms of the call acceptance level and effective network bandwidth utilization.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.267-269
• /
• 2016

정보 보안 기법 중 접근 제어 기법(Access Control)은 네트워크 기반 어플리케이션에 기본적인 정보 보안 틀을 제공한다. 아울러 권한 기반 접근 제어 기법(RBAC)으로 다양한 권한 요구 사항을 충족하는 네트워크 기반 어플리케이션의 운용이 가능하다. 그러나 Session Scope의 권한 기반 제어 기법으로 동적 페이지들에 대한 접근 제어를 설계 배포 하기는 어렵다. 관점 지향 프로그래밍(AOP)를 이용한 동적 권한 생성으로 Session Scope의 권한과 결합, Request Scope의 권한을 생성해 디자인 레벨에서의 유연한 접근 권한 설계 방법에 대해 제안하며, 구현 후 확인했다.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.197-198
• /
• 2007

For provisioning the best effort service, the IEEE 802.16 Wireless MAN standard employs a MAC scheme based on reservation ALOHA. In the MAC scheme, a subscriber station, after attempting a resource request, waits for a resource grant during a prescribed period rather than an explicit acknowledgement. In this paper, we propose a MAC scheme for improving delay performance, where we control the lifetime of a request to prevent excessive grants and distribute residual resource according to a round robin. Simulation results show that the proposed scheme significantly improves the mean delay performance.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.215-219
• /
• 2007

For Web server implementations, there are 4 main schemes: process-per-request (PPR), thread-per-request (TPR), worker thread pool (WTP), and worker thread pool with buffers (WTPB). This paper compares performance of the schemes in response time point of view. WTPB shows the best performance. The appropriate number of worker threads for WTPB depends on the request service time. For short requests, the number can be very small. But for longer requests, it is about 1/6 of the number of simultaneous connections.

• The KIPS Transactions:PartA
• /
• v.19A no.4
• /
• pp.181-186
• /
• 2012

The distributed measurement and control system require technology to solve complex synchronization problem among distributed devices. It can be solved by using IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems to synchronize real-time clocks incorporated within each component of the system. In this paper, we implemented the IEEE 1588v2 PTP emulator on BlueScope BL6000A using a delay request-response mechanism to measure clock synchronization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1167-1175
• /
• 2016

This paper proposes an efficient page-level mapping algorithm that reduces the erase count in the FTL for flash memory systems. By maintaining the weight for each write request in the request buffer, the proposed algorithm estimates the degree of temporal locality for each incoming write request. To exploit temporal locality deliberately for determination of hot request, the degree of temporal locality should be much higher than the reference point determined experimentally. While previous LRU algorithm treats a new write request to have high temporal locality, the proposed algorithm allows write requests that are estimated to have high temporal locality to access hot blocks to store hot data intensively. The pages are more frequently updated in hot blocks than warm blocks. A hot block that has most of invalid pages is always selected as victim block at Garbage Collection, which results in delayed erase operation and in reduced erase count. Experimental results show that erase count is reduced by 9.3% for real I/O workloads, when compared to the previous LRU algorithm.