• Title/Summary/Keyword: Service Replication

Search Result 78, Processing Time 0.024 seconds

FPGA-based Hardware Implementation of Cryptography Algorithm ARIA (암호화 알고리즘 ARIA의 FPGA기반 하드웨어 구현)

  • Kim Young-Soo;Cho Sun-Gu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1229-1236
    • /
    • 2006
  • Group oriented multicast service is a prerequisite for the current application system for remote lecture and customer service. IP multicast is used to be generally accepted as an internet standard. IP multicast which is designed to support network based replication model can efficiently use host and network resource, however it has some weak points that it has to support IP multicast in the internet by adding multicast-capable internet infrastructure such as router and is vulnerable to security by using public IP address for group identifier. Therefore we propose the trigger based application level multicast model that can enhance both scalability and security by separating the functions, which send and receive message to solve these problems. Our suggested model is expected to ensure the promotion of quality of service and reliability.

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.

Pathogenesis and Host Interaction of Foot-and-mouth Disease (구제역의 병인론과 숙주와의 상호작용)

  • Park, Jong-Hyeon;Lee, Kwang-Nyeong;Kim, Su-Mi;Ko, Young-Joon;Lee, Hyang-Sim;Cho, In-Soo
    • Journal of Veterinary Clinics
    • /
    • v.28 no.1
    • /
    • pp.113-121
    • /
    • 2011
  • Foot-and-mouth disease (FMD) is a severe vesicular disease of cloven-hoofed animals including domesticated ruminants and pigs. Acute clinical signs may be mild in sheep and goats but are associated with lameness in pigs and mouth lesions with vesicles in cattle. The required condition for a successful pathogen appears to be the ability to counteract both the host innate and adaptive immune response. FMD virus (FMDV) inhibits the induction of antiviral molecules and interferes with the secretory pathway in the infected cell. The surface expression of Major Histocompatibility Complex (MHC) class I molecules is reduced in infected cells. Thus, the ability of the host to recognize and eliminate virus infected cells is decreased. Furthermore, FMDV infection results in a rapid, but transient lymphopenia, reducing the number of T and B cells, and affecting T cell function. The virus appears to premature apoptosis-mediated cell death because it has a very short replication cycle and is able to rapidly produce large amounts of virus. FMDV engages the host protective response at multiple steps to ensure its effective replication and pathogenesis. This review describes the recent pathological and immunological studies to overcome the powerful abilities of FMDV to counteract defense mechanism of host.

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.

A Scheme of Resource Reallocation and Server Replication against DoS Attacks (서비스 거부 공격에 대비한 자원 재할당 및 서버 중복 방안)

  • Min, Byoung-Joon;Kim, Sung-Ki;Na, Yong-Hi;Lee, Ho-Jae;Choi, Joong-Sup;Kim, Hong-Geun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.1
    • /
    • pp.7-14
    • /
    • 2003
  • In order to cope with DoS (Denial of Service) attacks disturbing delivery of intended services by exhausting resources of computing nodes, we need a solution to recognize important resources for the essential services which have to be maintained under any circumstances and to adapt the system to the urgent situation and reconfigure itself properly. In this paper, we present a two-phase scheme to handle the problem. In the first phase, by means of dynamic resource reallocation within a computing node, we try to make the selected essential services survive even after the occurrence of an attack. For the second phase when it becomes impossible to continue the service in spite of the actions taken in the first phase, we apply server replication in order to continue the transparent provision of the essential services with the end users by utilizing redundant computing nodes previously arranged. Experimental result obtained on a testbed reveals the validity of the proposed scheme. A comparison with other proposed schemes has been conducted by analyzing the performance and the cost.

Sterol regulatory element-binding proteins involved in reprogramming of lipid droplet formation after rotavirus infection

  • Naveed, Ahsan;Baek, Yeong-Bin;Soliman, Mahmoud;Sharif, Muhammad;Park, Sang-Ik;Kang, Mun-Il
    • Korean Journal of Veterinary Service
    • /
    • v.44 no.4
    • /
    • pp.195-207
    • /
    • 2021
  • Species A rotaviruses (RVAs) replicate and assemble their immature particles within electron dense compartments known as viroplasms, where lipid droplets (LDs) interact with the viroplasm and facilitate viral replication. Despite the importance of LD formation in the life cycle of RVAs, the upstream molecules modulating LD formation remain unclear. This study aimed to find out the role of sterol regulatory element-binding proteins (SREBPs) in reprogramming of LD formation after RVA infection. Here, we demonstrate that RVA infection reprograms the sterol regulatory element-binding proteins (SREBPs)-dependent lipogenic pathways in virus-infected cells, and that both SREBP-1 and -2 transactivated genes, which are involved in fatty acid and cholesterol biosynthesis, are essential for LD formation. Our results showed that pharmacological inhibition of SREBPs using AM580 and betulin and inhibition of their downstream cholesterol biosynthesis (simvastatin for HMG-CoA reductase) and fatty acid enzymes (TOFA) negatively modulated the intracellular triacylglycerides and cholesterol levels and their resulting LD and viroplasm formations. Interestingly, pharmacological inhibition of SREBPs significantly reduced RVA protein synthesis, genome replication and progeny production. This study identified SREBPs-mediated lipogenic reprogramming in RVA-infected host cells, which facilitates virus replication through LD formation and its interaction with viroplasms, suggesting that SREBPs can be a potential target for the development of efficient and affordable therapeutics against RVA infection.

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.

Performance Analysis of the Composite Distributed Directories for High Performance Grid Information Services (고성능 자원정보서비스 구축을 위한 복합 모델 기반 분산 디렉토리의 성능 분석)

  • 권성호;김희철
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.3-6
    • /
    • 2003
  • In this paper, we conduct a performance analysis for the composite scheme that is obtained by combining the data distribution and the data replication schemes usually used for the implementation of distributed directory service systems. The analysis results reveal that the composite model is a viable option to overcome the performance trade-off between the data distribution and the data replication model. In this paper, we present the performance model developed for the composite model by appling queuing modelling. Using the performance model, performance values for a variety of system execution environments are suggested which enable us to bring an efficient design for high performance distributed directories.

  • PDF

File Replication and Workload Allocation for a Locally Distributed Database

  • Gil sang Jang
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.24 no.64
    • /
    • pp.1-20
    • /
    • 2001
  • In distributed databases, file replication and workload allocation are important design issues. This paper solves these two issues simultaneously, The primary objective is to minimize the system response time that consists of local processing and communication overhead on a local area network. Workload (query transactions) is assigned among any sites in proportion to the remaining file request service rate of the each server The problem is presented in the form of a nonlinear integer programming model. The problem is proved to be NP-complete and thus an efficient heuristic is developed by employing its special structure. To illustrate its effectiveness, it is shown that the proposed heuristic is based on the heuristic of a non-redundant allocation that was provided to be effective. The model and heuristics are likely to provide more effective distributed database designs.

  • PDF