we consider path-based protection methods for twolink failures in mesh optical networks. Two link-disjoint backup paths are pre-computed for each source and destination node pair. We identify the scenarios where the backup paths can share their wavelengths without violating 100% restoration guarantee (backup multiplexing). We use integer programming to optimize the total capacity requirement fo...

We propose a design of self-healing ATM virtual path (VP) networks based on backup VP. The backup VP is a preassigned virtual path to restore the traffic after a network failure. It is known that the self-healing scheme based on the backup VP is simple, fast and easy to implement. Given a set of bandwidth requirements and original routes for target demands, the design is to find the backup rout...

In this paper we present a comparative study of two schemes to provide survivability for guaranteed QoS connections in a possible Next Generation Internet network architecture. In the first scheme a QoS connection is provided standby backup resources on a disjoint path by reserving resources on both the working and backup path. In order to reduce the amount of backup resources required a method...

This white paper highlights integration features implemented in EMC Avamar with EMC Data Domain deduplication storage systems to allow high-speed data backup directly to Data Domain systems. The components outlined in this paper will provide IT backup administrators & consultants with a technical foundation to architecting efficient combined data deduplication backup solutions. February, 2014

Current practice of backing up data is based on using backup tapes and remote locations for storing data. Nowadays, with the advent of cloud computing a new concept of database backup emerges. The paper presents the possibility of making backup copies of data in the cloud. We are mainly focused on performance and economic issues of making backups in the cloud in comparison to traditional backup...

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long distances remains a difficult problem. Here, we consider a large network of nodes with only neighboring quantum links. We exploit properties of this cloud of...

Experiments like ATLAS at LHC involve a scale of computing and data management that greatly exceeds the capability of existing systems, making it necessary to resort to Grid-based Parallel Event Processing Systems (GEPS). Traditional Grid systems concentrate the data in central data servers which have to be accessed by many nodes each time an analysis or processing job starts. These systems req...

The pivotal quality of proximity graphs is connectivity, i.e., all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are often robust, i.e., they are able to function well even if they are subject to limited removal of elementary building blocks, as may occur for random failures or targeted attacks. Here, we study how the structure ...

We are building a system that harnesses the idle resources (cpu, storage, and bandwidth) of nodes (e.g., home desktops) distributed across the Internet to build useful distributed services like content distribution or remote backup. Users are compensated in return for contributing their nodes’ idle resources to the system. Collective managers bundle and manage the contributed resources and rese...