• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• Annual Conference of KIPS
• /
• 2013.11a
• /
• pp.1483-1486
• /
• 2013

최근 무선통신의 급격한 발전과 스마트 기기의 확산으로 인해 Tving, pooq 등 다양한 모바일 방송 서비스가 급속도로 증가하고 있다. 또한 다양한 영상처리 기법 등이 등장함에 따라 4K, 8K급의 UHD 동영상들이 속속들이 등장하고 있다. 이로 인해 트랜스코딩을 통해 가공되는 동영상의 포맷 및 해상도 또한 매우 다양해질 것으로 전망된다. 현재까지의 트랜스코딩 연구사례는 사용자의 이동환경을 고려한 안정적 QoS 보장 또는 서버의 부하를 줄이기 위한 분산처리 기법 등의 연구 위주로 진행되어 온 것이 현실이다. 하지만 상기 조건(adaptive streaming 및 서버부하 처리)들을 충족시키긴 위해선 보다 효율적인 트랜스코딩 시스템의 제공이 선행 되어야 할 것이다. 이에 따라 본 논문에서는 사용자 관점에서 보다 빨리 스트리밍 서비스를 제공 받기 위하여 우선순위 큐 알고리즘을 적용한 시스템을 설계 및 구현하였다. 검증을 위하여 4가지 콘테이너(.MOV, .FLV, .MKV, .AVI)를 실험대상으로 하였고, 비교 대상 트랜스코딩 시스템은 상용 스트리밍 서비스인 YouTube를 활용하였다. 성능 측정결과, 총 트랜스코딩 완료시간은 YouTube에 비해 41.61%로 시간이 단축되었다. 또한 모바일 TV시청자가 55%를 차지한다는 점을 고려하여 컨트롤 서버에서는 최단시간 서비스 제공을 위하여 저해상도부터 추출하여 스트리밍 서버를 통해 송출하도록 구현하였다. 본 연구결과는 트랜스코딩 성능개선 뿐만 아니라 모바일 대상자를 위한 맞춤형 서비스를 보다 빨리 제공할 수 있을 것이며, 그 수요는 점차 증대될 것으로 예상된다.

• Journal of Korea Spatial Information System Society
• /
• v.4 no.1 s.7
• /
• pp.39-46
• /
• 2002

In distributed spatial database systems, users nay issue a query that joins two relations stored at different sites. The sheer volume and complexity of spatial data bring out expensive CPU and I/O costs during the spatial join processing. This paper shows a new spatial join method which joins two spatial relation in a parallel way. Firstly, the initial join operation is divided into two distinct ones by partitioning one of two participating relations based on the region. This two join operations are assigned to each sites and executed simultaneously. Finally, each intermediate result sets from the two join operations are merged to an ultimate result set. This method reduces the number of spatial objects participating in the spatial operations. It also reduces the scope and the number of scanning spatial indices. And it does not materialize the temporary results by implementing the join algebra operators using the iterator. The performance test shows that this join method can lead to efficient use in terms of buffer and disk by narrowing down the joining region and decreasing the number of spatial objects.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.340-342
• /
• 2002

결함허용은 어떠한 시스템 요소에 결함이나 오류가 발생하더라도 시스템이 정상적으로 동작하게 하는 방안으로써 실시간 분산 시스템에서 피 효용성이 극대화된다. 본 연추는 실시간 분산 시스템의 결함 허용 기법 중 시간 제약성 측면에서 강한 여분기반 결함허용 기법을 수용한다. 이 기법의 구성 요소인 어플리케이션 서버는 그 상태가 결정적(deterministic)이냐 비결정적(nondeterministic)이냐에 따라 그 처리 기법을 달리하고 있다. 그 중 SAR(Semi-Active Replication)이 자원 활용도 측면에서 그 효율성 증명된바 있다. 본 논문에서는 SAR의 단점인 응답시간 지연문제와 클라이언트 측면에서의 결함 마스킹(fault-masking) 문제를 해결한 구조를 제안한다.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.534-542
• /
• 2001

Recent content-based image retrieval systems make use of a local single server contained a limited number of images. So these systems are not satisfactory for the Web user's needs that make request for various images on the Web. A content-based image retrieval system that has regard for a great number of Web images has to stand on the basis of real-time first of all. Therefore, to implement the above system we have to resolve a problem of large waste time to take for an image collection and feature extractions. In recent, PC clusters with a load distribution are implemented for the purpose of high-performance data processing. In this paper, we decreased the whole retrieval time by distributing the tasks of image collection and feature extraction to take much time among the slave computers of the PC cluster, and so we found the possibility of the real-time processing in the retrieval of Web images.

• Journal of KIISE:Software and Applications
• /
• v.35 no.1
• /
• pp.22-32
• /
• 2008

To overcome the weakness of the image retrieval system using the existing Ontology and the distributed image based on the database having a simple structure, HERMES was suggested to ensure the self-control of various image suppliers and support the image retrieval based on semantic, the mentioned framework could not solve the problems which are not considered the deterioration in the capacity and scalability when many users connect to broker server simultaneously. In this paper the tables are written which in the case numerous users connect at the same time to the supply analogous level of services without the deterioration in the capacity installs Broker servers and then measures the performance time of each inner Broker Component through Monitoring System and saved and decides the ranking in saved data. As many Query performances are dispersed into several Servers User inputted from the users Interface with reference to Broker Ranking Table, Load Balancing system improving reliability in capacity is proposed. Through the experiment, the scheduling technique has proved that this schedule is faster than existing techniques.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.12
• /
• pp.433-442
• /
• 2014

In this paper, we introduce the client side cache of distributed file system for enhancing read performance by eliminating the network latency and decreasing the back-end storage burden. This performance enhancement can expand the fields of distributed file system to not only cloud storage service but also high performance storage service. This paper shows that the distributed file system with client side SSD cache can satisfy the requirements of VDI(Virtual Desktop Infrastructure) storage. The experimental results show that full-clone is more than 2 times faster and boot time is more than 3 times faster than NFS.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.113-119
• /
• 2002

With development of internet technology, digital economy that advance rapidly formed much leagues of B2B, B2C, A2B etc, according to the application part. Also, electronic commerce system implementation technology is introduced by Component based on development method in object oriented technique base depending on customer's requirement, and development environment changes by 3- Tiers, Web-Based architecture etc. in existent C/S (Client/Server) environment and is introduced. Thus, In this research, I implemented seat reservation and confirmation system that can be used in electronic commerce in multi-server environment. This, for improve efficiency in distribute environment, relevant importance logic used server component model EJB, and implemented through JSP and Java that use Servlet of Resin Server environment for Main Server. Therefore, through independence component using EJB, I did so that can improved independence between electronic commerce system logic, and reduce server's overhead calling relevant method through discrete EJB server, and manage each logic resources efficiently.

• The Journal of the Korea Contents Association
• /
• v.7 no.3
• /
• pp.17-24
• /
• 2007

SIP-based tightly coupled conference, which has a centrally located conference server for controlling and management, can be classified several models according to location of focus and mixer. These are centralized server model, endpoint server model, media server component model and distributed mixing model. However each model has its strength and weakness. In this paper, we propose and implement a SIP-based effective hybrid-type conference model which decreases amount of SIP signaling messages, lowers load of server media mixer, and can be easily expandable to large scale conference. In this model, when the number of participants exceeds a pre-defined limit, the conference server selects some participants which posses specific functions and let them share functions of notifications of conference state event package and media mixing. When each participant subscribes conference state event package to the server, it can indicates its possession of such functions by a specific header message. The server stores the indication to the conference information database, and later uses it to select participants for load sharing. The performance of our proposed model is evaluated by experiments.

• Journal of Korea Multimedia Society
• /
• v.2 no.1
• /
• pp.1-8
• /
• 1999

To provide information service with time constraints, it is required to support real-time information system for retrieval and update of distributed information. In this paper, we propose an information retrieval system model for internet. We design and implement a Domain Administration-Oriented search engine for the regional information network. Accordingly, an intelligent robot gathering and updating distributed information is implemented. And, in order to improves the performance of the system, a realtime robot control policy based on the loads of network and web server is proposed.