[go: up one dir, main page]

Censor-Hillel et al., 2019 - Google Patents

Making asynchronous distributed computations robust to noise

Censor-Hillel et al., 2019

View PDF
Document ID
17486578573259194510
Author
Censor-Hillel K
Gelles R
Haeupler B
Publication year
Publication venue
Distributed Computing

External Links

Snippet

We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. van Duuren system; ARQ protocols
    • H04L1/1867—Arrangements specific to the transmitter end
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Application independent communication protocol aspects or techniques in packet data networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements

Similar Documents

Publication Publication Date Title
Censor-Hillel et al. Making asynchronous distributed computations robust to noise
Ganesh et al. Optimal extension protocols for byzantine broadcast and agreement
Liebhold et al. Network coding with flags
Dolev et al. Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-fifo) dynamic networks
Barati et al. RDTP: Reliable data transport protocol in wireless sensor networks
Schlumberger De Bruijn communications networks.
Censor-Hillel et al. Making asynchronous distributed computations robust to channel noise
Ye et al. RESIDENT: a reliable residue number system-based data transmission mechanism for wireless sensor networks
Tseng et al. Reliable broadcast in networks with trusted nodes
Gelles et al. Efficient multiparty interactive coding for insertions, deletions, and substitutions
Bonomi et al. Reliable broadcast in dynamic networks with locally bounded byzantine failures
Chongchitmate et al. Information-theoretic broadcast with dishonest majority for long messages
Kocik et al. Node-to-set disjoint paths problem in a Möbius cube
Darabkh Evaluation of channel adaptive access point systemwith Fano decoding
Jayanti et al. Efficient constructions for almost-everywhere secure computation
Bogatyrev et al. Timely Redundant Service of Requests by a Sequence of Cluster.
Ho et al. Distributed asynchronous algorithms for multicast network coding
Kim et al. On bounding node–to–sink latency in wireless sensor networks with multiple sinks
US20220182153A1 (en) Classical implementation of entanglement
Alsulami et al. Collaborative editing over opportunistic networks
Yang et al. Efficient hardware architecture of deterministic MPA decoder for SCMA
Kumar et al. Fault-tolerant graph realizations in the congested clique
Konwar et al. Semi-fast byzantine-tolerant shared register without reliable broadcast
Yu et al. Golay code clustering for mobility behavior similarity classification in pocket switched networks
Vladimirov Pseudo-Random Error-Correcting Codes in Network Coding