• Title/Summary/Keyword: 정보복제

Search Result 781, Processing Time 0.029 seconds

Update Method based on Dynamic Access-Frequency Tree in Grid Database System (그리드 데이터베이스 환경에서 동적 접근 빈도를 이용한 갱신 기법)

  • Shin, Soong-Sun;Back, Sung-Ha;Lee, Yeon;Lee, Dong-Wook;Kim, Gyoung-Bae;Chung, Worn-Il;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1191-1200
    • /
    • 2009
  • The replicas in the Grid database is utilized for a lot of application services. And for deferent services or for deferent information depends on location, the access frequency of each replica is dissimilar. When one replica is stored in many nodes, each replicas applies the week-consistency in the grid computing environment. Especially, when a node work load or operation capacity is varied from others, the replica management would cost expansive. Therefore, this paper proposed the Update Method based on Dynamic Access-Frequency Tree. The dynamic access-frequency tree is pre-constructed by grouping nodes based on each nodes access frequency to manage the replica efficiently and avoid unbalance replica tree. The performance evaluation shows the proposed methods support more quick update than current methods.

  • PDF

A Study on the Distribution of Overload in Academic Affairs Management System Using Replication Server (데이터 복제 서버를 이용한 학사 관리 시스템의 부하 분산에 관한 연구)

  • Han, Gwang-Rok;Lee, Seung-Won
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.605-612
    • /
    • 2001
  • In order to solve the overload of academic affairs management system, we propose a method builds a distributed Replication server and uses this server with the present centralized system. Normal query transactions which are not required for data modification are composed of almost all DML sentences. So we construct the distributed replication servers according to the data characteristics and make them perform the query transaction without modification. In this way, we can simultaneously distribute users and data, and cut down processing time for every transaction. Also Replication server has the advantages of implemental efficiency and economical because it uses resources of present centralized system without and additional configurations. Usually, to distribute the overload of server, they can use way, Client-side overload distribution that user program get present overload status then can choose a less overloaded server, and the other way, Server-side overload distribution that make use of Application Layer Scheduling Technique and IP Layer Scheduling Technique. Our Replication server can reduce the overload of centralized system by eliminating or complementing those defects of overload distribution, referred to in the forehead.

  • PDF

Consistency and Prformance Evaluation of Duplication Function for Backup Systems (백업시스템을 위한 복제기능의 정합성과 성능평가)

  • Seong, HaeKyung;Lee, Moongoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.147-153
    • /
    • 2012
  • As IT circumstance is complicated and the scale of infra increase, a recognition of security information system and data availability are raised. At this point, a value of information assets regards important, a study of high performance backup system for disaster recovery countermeasure is a field to impact on business directly. Therefore, this study executes duplication of high performance backup system and data consistency verification. And, a performance of comparison to DB table recovery process, a transaction process speed of duplication according to network bandwidth, and performance evaluation were executed.

The partial content replication method for streaming data (스트리밍 데이터를 위한 부분 컨텐츠 복제 방법)

  • Bak, Yu-Hyeon;Woo, Sang-Min;Kim, Hag-Young;Kim, Kyong-Sok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.200-205
    • /
    • 2005
  • 전통적인 컴퓨터 시스템은 클라이언트-서버 구조로 클라이언트가 데이터를 요청하면 데이터를 관리하는 서버가 이를 제공한다. 이러한 구조에서 데이터를 요청하는 사용자 수 증가하면 단일 서버(single server)만으로는 모든 사용자의 요청을 처리할 수 없기 때문에 다중 서버로 서비스를 제공하는 방법들이 제안되었다. 다중 서버를 가지는 시스템은 모든 데이터에 대해서 균등한 사용자 요청이 들어오면 최적의 성능을 내지만, VoD(Video On Demand) 서비스와 같이 인기 많은 데이터(hot data)에 대한 요구와 인기 없는 데이터(cold data)에 대한 요구가 현저하게 차이가 나면 인기 많은 데이터를 가지고 있는 서버는 사용자요청을 제대로 처리하지 못하는 반면에 인기 없는 데이터만을 가지는 서버는 시스템 자원을 낭비하는 단점을 가진다. 이 논문은 NS 카드를 장착한 시스템에서 인기 많은 비디오데이터를 QoS와 저장공간의 효율을 위해 부분 컨텐츠 복제 기법을 제안한다. 이 방법은 기존의 전체 컨텐츠를 복제하여 서비스하는 방법과는 달리 컨텐츠의 부분을 복제하고 서비스 시점에서 나머지 부분을 복제함으로써 사용자의 서비스 지연시간이 늘어나지 않으면서 저장공간의 효율성을 높일 수 있다.

  • PDF

The Analysis of the TETRA Authentication Protocol (TETRA 인증 프로토콜 분석)

  • Park Yong-Seok;Ahn Jae-Hwan;Jung Chang-Ho;Ahn Joung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.6
    • /
    • pp.1070-1075
    • /
    • 2006
  • TETRA system provides the radio authentication service which permits only authorized radio to access network. Radio authentication is the process which checks the sameness of authentication-key(K) shared between radio and authentication center by challenge-response protocol. TETRA standard authentication protocol can prevent the clone radio to copy ISSI from accessing network, but can't prevent the clone radio to copy ISSI & authentication-key. This paper analyzes authentication-key generation/delivery/infection model in TETRA authentication system and analyzes the threat of clone radio caused by authentication-key exposure. Finally we propose the new authentication protocol which prevent the clone radio to copy ISSI & authentication-key from accessing network.

Cache Management Method for Query Forwarding Optimization in the Grid Database (그리드 데이터베이스에서 질의 전달 최적화를 위한 캐쉬 관리 기법)

  • Shin, Soong-Sun;Jang, Yong-Il;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.1
    • /
    • pp.13-25
    • /
    • 2007
  • A cache is used for optimization of query forwarding in the Grid database. To decrease network transmission cost, frequently used data is cached from meta database. Existing cache management method has a unbalanced resource problem, because it doesn't manage replicated data in each node. Also, it increases network cost by cache misses. In the case of data modification, if cache is not updated, queries can be transferred to wrong nodes and it can be occurred others nodes which have same cache. Therefore, it is necessary to solve the problems of existing method that are using unbalanced resource of replica and increasing network cost by cache misses. In this paper, cache management method for query forwarding optimization is proposed. The proposed method manages caches through cache manager. To optimize query forwarding, the cache manager makes caching data from lower loaded replicated node. The query processing cost and the network cost will decrease for the reducing of wrong query forwarding. The performance evaluation shows that proposed method performs better than the existing method.

  • PDF

Class Splitting Based Watermarking for Preventing Software Theft (소프트웨어 도용 방지를 위한 클래스 분할 기반 워터마킹)

  • Kang, Byengseup;Go, Seokhyang;kim, Juhyung;Park, Heewan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.04a
    • /
    • pp.326-329
    • /
    • 2016
  • 최근 모바일 내비게이션 시장의 양대 강자인 'T맵'과 '김기사'가 송사에 휘말려서 사회적인 이슈가 되었다. 이 사건을 통해서 소프트웨어의 불법 복제 방지 및 개발자의 저작권을 식별하기 위한 워터마킹 기법이 부각되었다. 본 논문에서는 안드로이드 앱의 클래스를 여러개의 클래스로 분할하여 저작권 정보를 삽입하는 클래스 분할 워터마킹 기법을 제안한다. 본 논문에서 제안하는 워터마킹 기법은 소프트웨어 코드가 도용되었을 때 원저작자의 정보를 확인할 수 있도록 하여 불법 복제 시도를 사전에 예방할 수 있으며, 불법 복제가 의심되었을 때 근거 자료로 사용될 수 있다.

Cloning of Korean Morphological Analyzers using Pre-analyzed Eojeol Dictionary and Syllable-based Probabilistic Model (기분석 어절 사전과 음절 단위의 확률 모델을 이용한 한국어 형태소 분석기 복제)

  • Shim, Kwangseob
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.3
    • /
    • pp.119-126
    • /
    • 2016
  • In this study, we verified the feasibility of a Korean morphological analyzer that uses a pre-analyzed Eojeol dictionary and syllable-based probabilistic model. For the verification, MACH and KLT2000, Korean morphological analyzers, were cloned with a pre-analyzed eojeol dictionary and syllable-based probabilistic model. The analysis results were compared between the cloned morphological analyzer, MACH, and KLT2000. The 10 million Eojeol Sejong corpus was segmented into 10 sets for cross-validation. The 10-fold cross-validated precision and recall for cloned MACH and KLT2000 were 97.16%, 98.31% and 96.80%, 99.03%, respectively. Analysis speed of a cloned MACH was 308,000 Eojeols per second, and the speed of a cloned KLT2000 was 436,000 Eojeols per second. The experimental results indicated that a Korean morphological analyzer that uses a pre-analyzed eojeol dictionary and syllable-based probabilistic model could be used in practical applications.

Implement of High Available Replicate Systems Based on Cloud Computing (클라우드 컴퓨팅 기반의 고가용성 복제시스템의 구현)

  • Park, Sung-Won;Lee, Moon-Goo;Lee, Nam-Yong
    • 전자공학회논문지 IE
    • /
    • v.48 no.4
    • /
    • pp.61-68
    • /
    • 2011
  • As business management has a high level of dependence on Informational Technology (IT), protecting assets of a company from disaster is one of the most important thing that IT operating managers should consider. Because data or information is a major source of operation of the company, data security is the first priority as an aspect of continuity of business management. Therefore, this paper will realize disaster recovery system, which is suspended because of disaster, based on cloud computing system. Realized High Available Replicate System applied a method of multi thread target database to improve Replicate performance, and real time synchronize technology can improve efficiency of network. From Active to Active operation, it maximizes use of backup system, and it has a effect to disperse load of source database system. Also, High Available Replicate System realized consistency verification mechanism and monitoring technique. For Performance evaluation, High Available Replicate System used multi thread method, which shows more than threefold of replicate performance than single thread method.

Symmetric Tree Replication Protocol for Efficient Distributed Storage System (효율적인 분산 저장 시스템을 위한 대칭 트리 복제 프로토콜)

  • 최성춘;윤희용;이강신;이호재
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.9
    • /
    • pp.503-513
    • /
    • 2004
  • In large distributed systems, replications of data and service are needed to decrease communication cost, increase availability, and avoid single server bottleneck. Tree Quorum protocol is a representative replication protocol, which exploits a logical structure. Tree quorum protocol is one of the replication protocols allowing low read cost only in the best case, while the number of replicas exponentially increases as the level grows. In this paper, thus, we propose a new replication protocol, called symmetric tree protocol which efficiently solves the problem. The proposed symmetric tree protocol also requires much smaller read cost than previous protocols. We conduct cost and availability analysis of the protocols, and the proposed protocol displays comparable read availability to the tree protocol using much smaller number of nodes. Also, the symmetric tree protocol has much smaller response time than the logarithmic protocol.