Efficient dispersal of information for security, load balancing, and fault tolerance
From MaRDI portal
Publication:3833606
DOI10.1145/62044.62050zbMath0677.68024OpenAlexW2058972589WikidataQ56271206 ScholiaQ56271206MaRDI QIDQ3833606
Publication date: 1989
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/62044.62050
algorithmsfault toleranceparallel computersverficationnonsecret encoding schemesrouting of datastorage of data
Graph theory (including graph drawing) in computer science (68R10) Information theory (general) (94A15) Data structures (68P05) Theory of operating systems (68N25) Theory of software (68N99) Algorithms in computer science (68W99)
Related Items
Methods for message routing in parallel machines, Node-to-set disjoint paths problem in star graphs, Coding techniques for handling failures in large disk arrays, Decoding interleaved Reed-Solomon codes over noisy channels, Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213], Efficient parallel computing with memory faults, Towards a better understanding of pure packet routing, High-threshold AVSS with optimal communication complexity, Data distribution in a peer to peer storage system, Node-disjoint paths in hierarchical hypercube networks, Costly circuits, submodular schedules and approximate Carathéodory theorems, Compact proofs of retrievability, Matrix structure and loss-resilient encoding/decoding, Tight bounds for FEC-based reliable multicast, Multiswapped networks and their topological and algorithmic properties, Fast deterministic simulation of computations on faulty parallel machines, Timed-release computational secret sharing and threshold encryption, On strong Menger-connectivity of star graphs, On the construction of all shortest node-disjoint paths in star networks, Sparse Semi-Oblivious Routing: Few Random Paths Suffice, Continuously non-malleable secret sharing: joint tampering, plain model and capacity, One-to-many node-disjoint paths of hyper-star networks, An efficient construction of one-to-many node-disjoint paths in folded hypercubes, Failed disk recovery in double erasure RAID arrays, Oblivious routing with limited buffer capacity, Efficient non-repudiation multicast source authentication schemes., Asymptotically optimal erasure-resilient codes for large disk arrays., On the cost of recomputing: tight bounds on pebbling with faults, On the theory of interconnection networks for parallel computers, Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing, Enhancing data security in ad hoc networks based on multipath routing, Application execution management on the integrade opportunistic grid middleware, Analysis of randomized protocols for conflict-free distributed access, Wide-diameter and minimum length of fan, The wide-diameter of \(Z_{n, k}\), A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square, Survey on Oblivious Routing Strategies, One-to-many node-disjoint paths in \((n,k)\)-star graphs, Complexity of pairwise shortest path routing in the grid, Cheating in visual cryptography, Efficient automatic simulation of parallel computation on networks of workstations, Distributed downloads of bulk, replicated grid data, Internet Voting Protocol Based on Improved Implicit Security, Fast algorithms for bit-serial routing on a hypercube, Tight bounds for oblivious routing in the hypercube, Routing multiple paths in hypercubes, Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal, A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square, On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups, Wide diameter and minimum length of disjoint Menger path systems, Cache me if you can: capacitated selfish replication games in networks, Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme, Deterministic P-RAM simulation with constant redundancy, A lower bound on the encoding length in lossy transmission, General information dispersal algorithms, Short containers in Cayley graphs, Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements, Two conditions for reducing the maximal length of node-disjoint paths in hypercubes, From Hall's matching theorem to optimal routing on hypercubes, Optimal Broadcast with Partial Knowledge, Secure distributed storage and retrieval, On the cost of recomputing: Tight bounds on pebbling with faults, Optimal Broadcast with Partial Knowledge, Strong Rabin numbers of folded hypercubes, On-line secret sharing, On the total\(_k\)-diameter of connection networks, Rabin numbers of Butterfly networks, DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES, CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS, Fault-tolerant routing in circulant networks and cycle prefix networks, Scalable secure storage when half the system is faulty, Application of the special Latin square to a parallel routing algorithm on a recursive circulant network., Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security, Reed-Muller Codes, Randomness in distribution protocols
