In a remote backup system, transaction processing takes place at the primary and the log records generated at the primary are propagated to the remote backup which uses them to reconstruct a recent state of the database at the primary. In the event of a primary failure, the backup system takes over transaction processing without causing users to observe a breach in service. Existing remote back...

Given a vector space V and a non-singular quadratic form Q on V , the orthogonal group O(Q) is the subgroup of GL(V ) that preserves Q. The special orthogonal group SO(Q) is given by O(Q) ∩ SL(V ). If Q is the standard inner product on R then SO(Q) is denoted SO(n). This is a connected, compact Lie group. For n > 2, the group is semi-simple. In the case that n is odd, SO(n) corresponds to the D...

In MPLS networks, failure resilience of a Label Switched Path (LSP) is essential in guaranteeing the QoS of the path. This can be achieved by allocating backup LSPs through which packets can be routed in case of primary LSP failiures. bandwidth efficiency and expeditious path restoration are two desirable features for the design of backup LSPs. This paper tackles the bandwidth efficiency with a...

We consider a network of computers consisting of file servers and a Database Management System (DBMS) where a linkage is maintained, with referential integrity, between data in the DBMS and files in the file servers which are external to the DBMS. We present algorithms for performing backup and recovery of the DBMS data in a coordinated fashion with the files on the file servers. When a file is...

One of the most fundamental elements of any disaster recovery plan is data backup and recovery. If an IT staff lacks the ability to recover lost data following an incident or disaster, redundant hardware or hot sites are of only limited value. Relatively few years ago, planning a backup strategy was reasonably straightforward for the small-office-home-office (SOHO) and small-tomedium-sized-busi...

Resource redundancy is a primary way to improve availability for applications in computational grid. How to select backup resources for an application during the resource allocation phase and how to make advanced reservation for backup resources are challenging issues for grid environment to provide high availability service. In this paper, we proposed a backup resources selection algorithm bas...

This paper considers the following backup scheme for a database system: a database is updated at a nonhomogeneous Poisson process and an amount of updated files accumulates additively. To ensure the safety of data, full backup are performed at time NT=L or when the database fails, whichever occurs first, and between them, incremental backups are made at periodic times iT (i=1, 2, ..., N-1) so a...

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location-allocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. In thi...