• Title/Summary/Keyword: Server Replication

Search Result 49, Processing Time 0.029 seconds

The Remote Access Algorithm by Object Replication (객체 복제 기법에 의한 원격 접근 알고리즘)

  • Yun, Dong-Sik;Lee, Byeong-Gwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.3
    • /
    • pp.799-807
    • /
    • 2000
  • In this paper, object replication Client/server under distributed computing system is design and implementation. Today many end-users have a computer communication by using internet in the distributed system of client/server. If many users request services to a specific remote server, the server should have got a overhead for hat service processing, delayed the speed for replay, and bring a bottleneck in communication network. Therefore object replication method was proposed to solve this problems. The growth of internet works and distributed applications has increased the need for large scale replicated systems. However, existing replication protocols do not address scale and autonomy issues adequately. Further, current application protocol require consistency of different levels, and therefore should be the selection function of consistency in them, in order to have particular semantics of each level. In this paper, server overhead and bottleneck happening in remote procedure call be using server object replication. Therefore access transparency can be improved by sharing object duplicately. So it will Keep up with the consistency within the replicated objects.

  • 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

Server Replication Degree Reducing Location Management Cost in Cellular Networks (셀룰라 네트워크에서 위치 정보 관리 비용을 최소화하는 서버의 중복도)

  • Kim, Jai-Hoon;Lim, Sung-Hwa
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.265-275
    • /
    • 2002
  • A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.

분산 환경을 위한 중복데이타 서버(replication server) 구조에 관한 연구

  • 이종호;이우기;박주석;강석호
    • Proceedings of the Korea Database Society Conference
    • /
    • 1994.09a
    • /
    • pp.71-103
    • /
    • 1994
  • 중복데이타 서버(replication server) 는 자주 사용되는 데이타의 부분 또는 전부를 뷰 형태로 여러 지역에 중복하여 저장함으로써 최종 사용자가 원하는 데이터에 빨리 접근할 수 있도록 해준다. 또한 기본 테이블의 변화된 내용을 주기적으로 뷰에 반영함으로써 데이타 동시성의 문제를 완화하며 통신량을 감소시킬 수 있다. 본 연구에서는 기본 테이블에 일어난 변화를 저장뷰(materialized view)에 반영시켜주기 위해 테이블 전체를 읽는 방식을 피하고 일정기간 동안 테이블에 일어난 변화가 기록된 로그(log)를 이용하는 디프런셜 갱신(differential update) 방법을 사용한다. 이 방법은 테이블의 잠금(locking) 을 피함으로 시스템의 성능을 향상시 킬 수 있다. 또한 갱신에 관련된 통신량을 최소화하기 위한 기법들을 제안한다. 위의 방법을 이용하여 분산 상황에서 조인 저장뷰(join materialized view)의 갱신을 효과적으로 지원해 주는 중복데이타 서버(replication server)의 구조에 관해 연구한다.

  • PDF

An Efficient Peer-to-Peer Based Replication Strategy for Data Grid (데이터 그리드를 위한 효율적인 Peer-to-Peer 기반 복제 정책)

  • Oh, Sang-Won;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.2
    • /
    • pp.10-17
    • /
    • 2008
  • In this paper, we propose an efficient data replication strategy based on Peer-to-Peer which improves the performance of Data Grid system. The key idea of this replication strategy is to add the Peer-to-Peer concept for reducing data transmission restriction caused by hierarchical topology. And, it makes the nodes can store data replica to set a critical section at the storage of client level nodes. Therefore, it is possible to transmit the data replica between client level nodes and from client level nodes to upper data replication server. It is more effective to transmit data replica between client level nodes than transmitting data replica 1mm data server or data replication server with respect to minimize the transmission time. This results in improving the performance of Data Grid system. Through simulation, we show that the proposed data replication strategy based on Peer-to-Peer improves the performance of entire Data Grid environment compared to previous strategies.

An ORB Extension for support of Fault-Tolerant CORBA (고장감내 CORBA를 지원하기 위한 객체중개자의 확장)

  • Shin, Bum-Joo;Son, Duk-Joo;Kim, Myung-Joon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.2
    • /
    • pp.121-131
    • /
    • 2001
  • The failure of network and/or node on which server object is executed is a single point of system failure in the CORBA application. One of the possible ways to overcome such problem is to replicate server objects to several independent nodes. The replicated objects executing same tasks are called object group. In order to provide fault tolerance of server object, this paper proposes and implements new CORBA model that supports the object group based on active replication. The proposed model not only provides interoperability with existing CORBA application but also minimizes additional application interface required to support object group because it uses nop to exchange messages between client and server. And this paper extends IDL structure. Depending to application logic, it makes possible to prevent performance degradation caused by consistency maintenance. At present, this paper supports only active replication. But it can be easily extended to provide warm ancVor cold passive replication without modification of architecture required for active replication.

  • PDF

An Efficient Data Nigration/Replication Scheme in a Large Scale Multimedia Server (대규모 멀티미디어 서버에서 효율적인 데이터 이동/중복 기법)

  • Kim, Eun-Sam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.37-44
    • /
    • 2009
  • Recently, as the quality of multimedia data gets higher, multimedia servers require larger storage capacity and higher I/O bandwidth. In these large scale multimedia servers, the load-unbalance problem among disks due to the difference in access frequencies to multimedia objects according to their popularities significantly affects the system performance. To address this problem, many data replication schemes have been proposed. In this paper, we propose a novel data migration/replication scheme to provide better storage efficiency and performance than the dynamic data replication scheme which is typical data replication scheme employed in multimedia servers. This scheme can reduce the additional storage space required for replication, which is a major defect of replication schemes, by decreasing the number of copies per object. The scheme can also increase the number of concurrent users by increasing the caching effect due to the reduced lengths of the intervals among requests for each object.

Supporting CORBA Object Group based on Active Replication (능동 복제 기반 CORBA 객체 그룹 지원)

  • Son, Deok-Ju;Sin, Beom-Ju;Nam, Gung-Han;Jin, Seong-Il
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11S
    • /
    • pp.3340-3349
    • /
    • 1999
  • Supporting object group on distributed object system give merits such as load balancing, fault tolerance and high availability. In this paper, we describe a CORBA ORB that has been designed to support object group based on active replication. The ORB supports the operational model in which it uses the IIOP for communication between client and server and total ordered multicast protocol for consistency control among group members. And through extension of ORB, it provides functions required for support of object group. Since it provides transparency of object replication, the ORB is interoperable with the existing CORBA products. It make possible for existing server application to be easily extended to application supporting object group as adding interface functions which should be used for building applications is minimized. A prototype is implemented, and performance of the replicated object group is tested and compared with a single object invocation.

  • PDF

An Effective Push Fault Management Algorithm for Distributed Object Replica based on Standard Middleware (표준 미들웨어 기반 분산 객체 리플리카를 위한 효과적 푸쉬 결함 관리 알고리즘)

  • Kim Boon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.37-46
    • /
    • 2005
  • In Processing many operations based on distributed environment, it is very important to support the reliability of resources. Providers of resources generally adapt the structure of server-replication to support the reliability of services. Tn server side, it maintains replicas. duplicated server objects. In the structure of this replication, service of stable replica is very important. Therefore the structure to diagnosis the fault of such replica is required. In this Paper, we suggested an effective PUSH fault management algorithm based on PUSH monitoring style of CORBAto overcome weak points of the PULL monitoring style of the replication management system in the distributed object system. Outcomes of the suggested PUSH fault monitoring style were better than other system. We confirmed valuable result in the workloads and timeout-rates.

  • PDF

Dynamic Load Balancing and Network Adaptive Virtual Storage Service for Mobile Appliances

  • Ong, Ivy;Lim, Hyo-Taek
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.53-62
    • /
    • 2011
  • With the steady growth of mobile technology and applications, demand for more storage in mobile devices has also increased. A lightweight block-level protocol, Internet Advanced Technology Attachment (iATA), has been developed to deliver a cost-effective storage network solution for mobile devices to obtain more storage. This paper seeks to contribute to designing and implementing Load Balancing (LB), Network Monitoring (NM) and Write Replication (WR) modules to improve the protocol's scalability and data availability. LB and NM modules are invoked to collect system resources states and current network status at each associate node (server machine). A dynamic weight factor is calculated based on the collected information and sent to a referral server. The referral server is responsible to analyze and allocate the most ideal node with the least weight to serve the client. With this approach, the client can avoid connecting to a heavily loaded node that may cause delays in subsequent in-band I/O operations. Write replication is applied to the remaining nodes through a WR module by utilizing the Unison file synchronization program. A client initially connected to node IP A for write operations will have no hindrances in executing the relevant read operations at node IP B in new connections. In the worst case scenario of a node crashing, data remain recoverable from other functioning nodes. We have conducted several benchmark tests and our results are evaluated and verified in a later section.