• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1093-1102
• /
• 2003

As the use of internet is growing, the amount of information is increasing rapidly and XML that is a standard of the web data has the property of flexibility of data representation. Therefore electronic document systems based on web, such as EDMS (Electronic Document Management System), ebXML (e-business extensible Markup Language), have been adopting XML as the method for exchange and standard of documents. So research on the method which can manage and search structural XML documents in an effective wav is required. In this paper we propose the clustering method based on structural similarity among the many XML documents, using typical structures extracted from each document by sequential pattern mining in pre-clustering process. The proposed algorithm improves the accuracy of clustering by computing cost considering cluster cohesion and inter-cluster similarity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.82-84
• /
• 2000

하드웨어 기술의 발전으로 서버 시스템의 연산능력은 발전을 거듭하고 있다. 또한 인터넷 사용의 광범위한 발전으로 인한 웹에 대한 폭발적인 사용 증가는 네트워크 서버의 연산 능력에 대한 요구와 더불어 향상된 네트워크 대역폭을 요구하게 되었다. 네트워크 장비의 발전도 진일보하고 있지만, 10Mbps, 100Mbps, 기가비트 이더넷등을 거치는 표준의 변화와 함께 기존의 장비에 대한 전면적인 교체 등으로 성능향상을 위해 많은 비용의 소요를 감수할 수밖에 없는 상황에 처해 있다. 클러스터의 한 예인 Beowulf 프로젝트와 같은 경우에, 기존의 네트워크 인터페이스를 병렬적으로 사용함으로써 큰비용 없이 더 큰 네트워크 대역폭을 얻기 위한 목적으로 이더채널(Channel-bonding)과 같은 기술이 개발되어 사용되기도 하였으나, 어디까지나 클러스터링을 위한 부수적인 기술로써 다소의 성능 향상에 만족하였고 심도있는 연구와 개발은 이루어지지 못하였다. 본 논문에서는 강력한 컴퓨팅 파워를 요구하는 특별한 서버 시스템이 아닌, 일반적으로 큰 네트워크 대역폭만을 요구하는 네트워크 서버에서 기존의 네트워크 인터페이스를 병렬적으로 이용하고, 채널-본딩에 비해 개선된 data distribution algorithm을 제안함으로써 성능의 향상을 꾀하고, 더불어 이러한 기술을 IEEE에서 제정중에 있는 802.3ad Link Aggregation 표준에 적용시키기 위한 기초를 마련하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.112-114
• /
• 2003

긴박한 임무 상황(mission critical)의 시스템 뿐만 아니라, 웹 서버등의 고가용성, 고신뢰성을 위한 가상 서버의 구축도 관심이 되고 있다. 본 연구에서는 가상서버의 고가용성 , 고신뢰성을 보다 향상시키기 위해 가상서버 클러스터의 각 구성 노드들을 이중의 네트웍 채널로 중복 시켜 네트웍 고장에 대한 신뢰성을 향상시켰다. 관리자 노드와 작업노드 풀로 구성되는 시스템의 각 노드와 이중 채널로 구성된 네트웍에 대한 결함검출과 결함복구를 위한 분산 결함 허용 미들웨어를 구현하였고, 적응형 고장 감내 (Adaptive Fault Tolerance) 기법을 사용하여 다양한 임무 상황에서의 자원 효율성을 향상시켰다.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.547-550
• /
• 2008

Recently, changes in the environment of user-centric internet service such as blog, UCC and IPTV and ubiquitous computing based on web service are needed to high availability system platform. High availability system is to provide safe service continuously even if system failure occurs in clustering system at the network. And it is necessary to synchronize data for reliable service in high availability system. In this paper, I implement DRBD(Disk Replicated Block Device) which is synchronization technique for data of local disks in high availability system.

• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.730-739
• /
• 2010

One of core technology in Web 2.0 is tagging, which is applied to multimedia data such as web document of blog, image and video etc widely. But unlike expectation that the tags will be reused in information retrieval and then maximize the retrieval efficiency, unacceptable retrieval results appear owing to toot limitation of tag. In this paper, in the base of preceding research about image retrieval through tag clustering, we design and implement a topic map generation system which is a semantic knowledge system. Finally, tag information in cluster were generated automatically with topics of topic map. The generated topics of topic map are endowed with mean relationship by use of WordNet. Also the topics are endowed with occurrence information suitable for topic pair, and then a topic map with semantic knowledge system can be generated. As the result, the topic map preposed in this paper can be used in not only user's information retrieval demand with semantic navigation but alse convenient and abundant information service.

• The KIPS Transactions:PartD
• /
• v.16D no.6
• /
• pp.845-850
• /
• 2009

Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.79-85
• /
• 2005

In order to handle client's requests while multiple servers seamlessly work in the web server cluster environment, it is vital to implement a router that execute a routing using TCP information and requested target content. The implemented package software measured packet volume that was generated from data generator, virtual server, and server 1, 2, 3, and could find out traffic distribution toward Server 1, 2, 3. As the result of the study shows, Round Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some partial cases, they were eventually alleviated by repeated tests for a longer time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1910-1917
• /
• 2011

In this paper, a cloud computing platform is designed and implemented based on an open source cloud platform, OpenNebula, and Xen hypervisor on each node for efficient computer lab system. For the purpose of convenient management, a web-based user interface has been developed for the cloud virtualization system. Once individual virtual machine is allocated to a user based upon class schedule, each user can access the virtual machine remotely and use appropriate operating system and application programs. The developed system can reduce computer lab upgrade cost, management cost, and administration time considerably.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.26-35
• /
• 2011

In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.