Asynchronous Throughput-Optimal Routing in Malicious Networks

DOI10.1007/978-3-642-14162-1_20zbMath1288.68010OpenAlexW1521027747MaRDI QIDQ3587442

Rafail Ostrovsky, Paul Bunn

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_20

zbMATH Keywords

competitive analysiscommunication complexitynetwork routingfault localizationend-to-end communicationasynchronous protocolsmulti-party computation in presence of dishonest majority

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (1)

Authenticated adversarial routing

This page was built for publication: Asynchronous Throughput-Optimal Routing in Malicious Networks