Search

Archiving and systematic backup of large digital data generates a quick demand for multi-petabyte scale storage systems. As drive capacities continue to grow beyond the few terabytes range to address the demands of today's cloud, the likelihood of having multiple/simultaneous disk failures became a reality. Among the main factors causing catastrophic system failures, correlated disk failures and the network bandwidth are reported to be the two common source of performance degradation. The emerging trend is to use efficient/sophisticated erasure codes (EC) equipped with multiple parities and efficient repairs in order to meet the reliability/bandwidth requirements. It is known that mean time to failure and repair rates reported by the disk manufacturers cannot capture life-cycle patterns of distributed storage systems. In this study, we develop failure models based on generalized Markov chains that can accurately capture correlated performance degradations with multiparity protection schemes based on modern maximum distance separable EC. Furthermore, we use the proposed model in a distributed storage scenario to quantify two example use cases: Primarily, the common sense that adding more parity disks are only meaningful if we have a decent decorrelation between the failure domains of storage systems and the reliability of generic multiple single-dimensional EC protected storage systems. [ABSTRACT FROM AUTHOR]

Abstract: We establish that the logarithm of the number of latin d‐cubes of order n is Θ ( n d ln n ) and the logarithm of the number of sets of t ( t ≥ 2 is fixed) orthogonal latin squares of order n is Θ ( n 2 ln n ). Similar estimations are obtained for systems of mutually strongly orthogonal latin d‐cubes. As a consequence, we construct a set of Steiner quadruple systems of order n such that the logarithm of its cardinality is Θ ( n 3 ln n ) as n → ∞ and n mod 6 = 2 or 4. [ABSTRACT FROM AUTHOR]

Let p be a prime, and \lambda be a nonzero element of the finite field \mathbb Fp^{m} . The \lambda -constacyclic codes of length p^s over \mathbb Fp^{m} are linearly ordered under set-theoretic inclusion, i.e., they are the ideals \langle (x-\lambda 0)^{i} \rangle , 0 \leq i \leq p^s of the chain ring [(\mathbb Fp^{m[x]})/({\langle x^{p^{s}}-\lambda \rangle })] . This structure is used to establish the symbol-pair distances of all such $\lambda$ -constacyclic codes. Among others, all maximum distance separable symbol-pair constacyclic codes of length p^s are obtained. [ABSTRACT FROM AUTHOR]

As reliability requirements are increasingly important in both clusters and data centers, RAID-6, which can tolerate any two concurrent disk failures, has been widely used in modern storage systems. However, most existing RAID-6 codes cannot provide satisfied performance on both degraded reads and partial stripe writes, which are important performance metrics in storage systems. To address these problems, in this paper we propose a new RAID-6 MDS erasure code called Short Code, in order to optimize the degraded reads and partial stripe writes. In Short Code, we propose a novel short horizontal parity chain, which assures that all disks contribute to degraded reads while the continuous data elements are more likely to share the same horizontal chain for optimizing degraded reads. On the other hand, Short Code distributes all diagonal parities among disks for optimizing partial stripe writes. The proposed Short Code not only owns the optimal storage efficiency, but also keeps the optimal complexity for both encoding/decoding computations and update operations. The experiments show that Short Code achieves much higher speed on degraded reads and partial stripe writes than other popular RAID-6 codes, and provide acceptable performance on single disk failure recoveries and normal reads. Specifically, compared to RDP code, Short Code provides 6.1 to 26.3 percent higher speed on degraded reads and 36.2 to 80.3 percent higher speed on partial stripe writes with the same number of disks. [ABSTRACT FROM PUBLISHER]

In wireless communication, wormhole attack is a crucial threat that deteriorates the normal functionality of the network. Invasion of wormholes destroys the network topology completely. However, most of the existing solutions require special hardware or synchronized clock or long processing time to defend against long path wormhole attacks. In this work, we propose a wormhole detection method using range-based topology comparison that exploits the local neighbourhood subgraph. The Round Trip Time (RTT) for each node pair is gathered to generate neighbour information. Then, the network is reconstructed by ordinal Multidimensional Scaling (MDS) followed by a suspicion phase that enlists the suspected wormholes based on the spatial reconstruction. Iterative computation of MDS helps to visualize the topology changes and can localize the potential wormholes. Finally, a verification phase is used to remove falsely accused nodes and identify real adversaries. The novelty of our algorithm is that it can detect both short path and long path wormhole links. Extensive simulations are executed to demonstrate the efficacy of our approach compared to existing ones. [ABSTRACT FROM AUTHOR]

The article reviews the correspondence analysis featured in personal computer software programs including "PC-MDS," "STRATMAP," "PASS," and "DUAL."

Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. In this paper, we develop a new localization protocol based on approximate convex decomposition (ACDL), with reliance on network connectivity information only. ACDL can calculate the node virtual locations for a large-scale sensor network with a complex shape. We first examine one representative localization algorithm and study the influential factors on the localization accuracy, including the sharpness of the angle at the concave point and the depth of the concave valley. We show that after decomposition, the depth of the concave valley becomes irrelevant. We thus define the concavity according to the angle at a concave point, which reflects the localization error. We then propose ACDL protocol for network localization. It consists of four main steps. First, convex and concave nodes are recognized and network boundaries are segmented. As the sensor network is discrete, we show that it is acceptable to approximately identify the concave nodes to control the localization error. Second, an approximate convex decomposition is conducted. Our convex decomposition requires only local information and we show that it has low message overhead. Third, for each convex section of the network, an improved MDS algorithm is proposed to compute a relative location map. Fourth, a fast and low complexity merging algorithm is developed to construct the global location map. Besides, by slight modification on the third step, we propose a variant of ACDL, denoted by ACDL-Tri, which is fully distributed and scalable while the localization accuracy is still comparable. We finally show the efficiency of ACDL by extensive simulations. [ABSTRACT FROM AUTHOR]

In pertinence to the application of multidimensional scaling (MDS) methods in ranging-based positioning systems, an analysis is firstly conducted by the classical MDS algorithm. Modified MDS algorithm and subspace method are presented in localization application. We also depicted the unified framework and general solutions of MDS methods. However, the least square solutions under this framework are not optimal. Their performance is still related to selection of coordinate reference points. To address this problem, a minimum residual MDS algorithm based on particle swarm optimization (PSO) is proposed to derive a new solution for indoor robot localization under the unified framework. The result of analysis indicates that the performance of minimum residual MDS method is immune to selection of reference points. Furthermore, the localization accuracy for indoor robot has been enhanced by 41% as compared with the classical MDS algorithm. [ABSTRACT FROM AUTHOR]

The utmost security standards over Wireless Local Area Network (WLAN) are still an unsolved answer in research community as well as among the commercial users. There are various prior attempts in proposing security of WLAN that lacks focus on access point and is found to be quite complex implementation of cryptography. The proposed paper presents a novel, simple, and yet robust technique called as MDS-WLAN i.e. maximal data security in WLAN. The system is evaluated over laboratory prototype and mitigation measures are drawn for resisting wormhole attack, Sybil attack, and rogue access point issue in WLAN. The outcome of the MDS is compared with conventional AES and SHA that shows optimal communication performance and highest data security. [ABSTRACT FROM AUTHOR]

This paper proposes a distributed localization algorithm which can be applied to an irregular three-dimensional wireless sensor network, considering the algorithm accuracy and complexity. The algorithm uses clusters to eliminate the multihop distance errors. An anchor node position optimization scheme is proposed to maximize the uniformity of each subnetwork. The proposed algorithm also employs a new three-dimensional coordinate transformation algorithm, which helps to reduce the errors introduced by coordinate integration between clusters and improves the localization precision. The simulation and performance analysis results show that the localization accuracy of the D3D-MDS algorithm increases by 49.1% compared with 3D-DV-HOP and 38.6% compared with 3D-MDS-MAP. This distributed localization scheme also demonstrates a low computational complexity compared with other centralized localization algorithms. [ABSTRACT FROM AUTHOR]

Highlights: [•] The paper describes a new web-based data visualization tool for MDSplus. [•] It describes the experience gained with the previous data visualization tools. [•] It describes the used technologies for web data access and visualization. [•] It describes the current architecture of the tool and the new foreseen features. [ABSTRACT FROM AUTHOR]

Highlights: [•] This paper describes the directions in the evolution of the MDSplus data system. [•] It describes three Use Cases in data streaming. [•] It shows the performance of MDSplus in local and remote data streaming. [•] It describes the main concepts in decoupling data access. [•] It presents the last features and tools. [ABSTRACT FROM AUTHOR]

Highlights: [•] The load balancing concept is introduced into the MDSplus data service. [•] The new data service system based on the LVS framework and heartbeat technologies are described. [•] The scheduling algorithm “WLC” is used, and a software system is developed for optimizing the weight of node server. [ABSTRACT FROM AUTHOR]

A multilevel structure, an application concept and a system integration problem solution strategy have been proposed for creating computer systems using a multiagent design technology. [ABSTRACT FROM AUTHOR]

Abstract: The first version of MDSplus was released in 1991 for VAX/VMS. Since that time the underlying file formats have remained constant. The software however has evolved, it was ported to unix, linux, Windows, and Macintosh. In 1997 a TCP based protocol, mdsip, was added to provide network access to MDSplus data. In 2011 a mechanism was added to allow protocol plugins to permit the use of other transport mechanisms such as ssh to access data users. This paper describes a similar design which permits the insertion of plugins to handle the reading and writing of MDSplus data at the data storage level. Tree paths become URIs which specify the protocol, host, and protocol specific information. The protocol is provided by a dynamically activated shared library that can provide any consistent subset of the data store access API, treeshr. The existing low level network protocol called mdsip, is activated by defining tree paths like “host::/directory”. Using the new plugin mechanism this is re-implemented as an instance of the general plugin that replaces the low level treeshr input/output routines. It is specified by using a path like “mdsip://host/directory”. This architecture will make it possible to adapt the MDSplus data organization and analysis tools to other underlying data storage. The first new application of this, after the existing network protocol is implemented, will be a plugin based on a key value store. Key value stores, can provide inexpensive scalable, redundant data storage. An example of this might be an Amazon G3 plugin which would let you specify a tree path such as “AG3://container” to access MDSplus data stored in the cloud. [Copyright &y& Elsevier]

Construction of good quantum codes via classical codes is an important task for quantum information and quantum computing. In this work, by virtue of a decomposition of the defining set of constacyclic codes we have constructed eight new classes of entanglement-assisted quantum maximum-distance-separable codes. [ABSTRACT FROM AUTHOR]