No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Abstract
Using P2P network as the distributed data storage network for VoIP system is an Internet hotpot research. How to realize a data backup strategy to reply to data disaster in a VoIP system based P2P network under the premise of carrier-grade demands has not been mentioned in previous researches. This paper analyzed the characteristics of VoIP system. A suitable data backup strategy reply to data disaster is designed and the design proposal for data disaster recovery backup system is described in detail. Finally, the experiments were given to assess the performance of this strategy.
... Hayashibara proposed a failure detector that assumes that heartbeat arrival time meets the normal distribution [11]. A suitable data backup strategy and data update mechanism is suggested within P2P-based VoIP application in [28] to ensure reliable data storage and rapid effective recovery. It used parallel recovery mechanism to achieve fast and reliable data recovery. ...
... This section compares the mean time to recovery (MTTR) between our checkpointing system and failure detection methods and other method proposed in [28]. Considering that a number of dependencies exist in the experimental conditions, our implementation and conditions are brought into line with that work for fair comparison. ...
... Table 10 below show that MTTR wp is the lowest MTTR for a realistic application in this scenario when WP acts as failure detector possibly because the checkpointing data needed to be occasionally loaded into new WP in other two algorithms. Based on VoIP business P2P network, [28] suggests the rapid recovery for VoIP users' data with parallel recovery mechanism to ensure high availability. In their work, multiple backup nodes store the data chunks for primary node for rapid recovery. ...
Peer-to-peer (P2P)-Grid systems are being investigated as a platform for converging the Grid and P2P network in the construction of large-scale distributed applications. The highly dynamic nature of P2P-Grid systems greatly affects the execution of the distributed program. Uncertainty caused by arbitrary node failure and departure significantly affects the availability of computing resources and system performance. Checkpoint-and-restart is the most common scheme for fault tolerance because it periodically saves the execution progress onto stable storage. In this paper, we suggest a checkpoint-and-restart mechanism as a fault-tolerant method for applications on P2P-Grid systems. Failure detection mechanism is a necessary prerequisite to fault tolerance and fault recovery in general. Given the highly dynamic nature of nodes within P2P-Grid systems, any failure should be detected to ensure effective task execution. Therefore, failure detection mechanism as an integral part of P2P-Grid systems was studied. We discussed how the design of various failure detection algorithms affects their performance in average failure detection time of nodes. Numerical analysis results and implementation evaluation are also provided to show different average failure detection times in real systems for various failure detection algorithms. The comparison shows the shortest average failure detection time by 8.8s on basis of the WP failure detector. Our lowest mean time to recovery (MTTR) is also proven to have a distinct advantage with a time consumption reduction of about 5.5s over its counterparts. © Copyright 2015 The Institute of Electronics, Information and Communication Engineers.
... The common methods include three kinds of data backup: LAN backup, LAN Free backup and SAN Server-Free backup [7,8]. LAN-based backup method requires installation on each host. ...
Recently, distributed data storage has gained increasing popularity for reliable access to data through redundancy spread over unreliable nodes in wireless sensor networks (WSNs). However, without any protection to guarantee the data integrity and availability, the reliable data storage cannot be achieved since sensor nodes are prone to various failures, and attackers may compromise sensor nodes to pollute or destroy the stored data. Therefore, how to design a robust sensor data storage scheme to efficiently guarantee the data integrity and availability becomes a critical issue for distributed sensor storage networks. In this paper, we propose a distributed fault/intrusion-tolerant data storage scheme based on network coding and homomorphic fingerprinting in volatile WSNs environments. For high data availability, the proposed scheme uses network coding to encode the source data and distribute encoded fragments with original data pieces. With secure, compact, and efficient homomorphic fingerprinting, our scheme can fast locate incorrect fragments and then initialize data maintenance. Extensive theoretical analysis and simulative results demonstrate the efficacy and efficiency of the proposed scheme.
In this paper, we report the design and implementation of the storage layer of BitVault: a content-addressable retention platform for large volume of reference data – seldom-changing information that needs to be retained for a long period of time. BitVault uses "smart brick" as the building block to lower the hardware cost. However, the challenges are to maintain low management cost in a system that needs to scale all the way from one brick to tens of thousands of bricks, to ensure reliability and to deliver with a simple enough design. Our design incorporates P2P technologies for its self-managing and self-healing capabilities and uses massively parallel repair to reduce vulnerability window of data loss. The simplicity of the architecture relies on an eventu-ally reliable membership service provided by a perfect one-hop DHT (distributed hash table), and its object-driven repair model yields last-copy recall guarantee: independent of how many other failures that may occur and their sequences, as long as the last copy of a data object still remains in the system, the data can be retrieved and its replication degree fully restored. A proto-type has been implemented. Theoretical analysis, simulations and experiments are conducted to validate the design of BitVault.
This paper analyses the Characteristics of Data in e-Commerce and e-Government and the problems of network backup for bulk data. A model of network multi-point disaster backup is designed for bulk data in e-Commerce and e-Government. The model provides some ways to ensure reliability and efficiency in transmission, storage and replica updating of disaster backup. Linear error correction code is used to solve the problems of slowness and low reliability on network disaster backup transmission of big data, Multi-Source Backup and Recovery quick Transmission Algorithm is used to backup several replicas simultaneity, Efficient Remote Data Synchronization Algorithm is used to compare the remote replica and the crucial data, then update the remote replica using the bit difference. The experimental results of the model emluator show that it can protect the crucial data and maintain the continuity of service in e-Commerce and e-Government.
The routing scalability of Overlay network has become a research focus. The network delay is one important branch of the scalability field as a key parameter. This paper gives a description of Overlay routing and its scalability problem, on the basis of which the mathematical modeling are established. An improved one-hop path routing algorithm based on ant colony optimization (ACOHPR) is employed to solve the problem of maintaining neighborhood set in allusion to delay optimization. The neighborhood set is formed in the progress of ant crawl, which is pruned according to the quality evaluating function in order to control the size of neighborhood set in every node. By simulation the performance of Overlay routing is analyzed and its feasibility in delay optimization is validated. The simulation results also show that ACOHPR can effectively reduce the size of neighborhood set with little influence in average delay.
Peer-to-peer (P2P) systems have drawn a lot of attention from telecom research communities, due to their advantages such as high scalability and cost-effectiveness. Many P2P inspired architectures have been proposed to implement the traditional telecom functionalities such as rendezvous service and even wireless networking. Although DHT is always adopted as the major element of such architectures, it's seldom discussed how to make DHT to meet the telecom infra-structure performance requirements, so-called the ¿Carrier Grade¿. In this paper, we discuss the main design aspects and benchmark measurements of Sand-Stone, a DHT based key-value storage system with traffic localization, strong consistency, high availability and scalability, so as to fill the performance gap between telecom infrastructure and general DHT.