Asynchronous throughput-optimal routing in malicious networks

DOI10.1007/978-3-642-14162-1_20zbMATH Open1288.68010OpenAlexW1521027747MaRDI QIDQ3587442FDOQ3587442

Authors: Paul Bunn, Rafail Ostrovsky 

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

Recommendations

• Authenticated adversarial routing
• Authenticated Adversarial Routing
• Distributed asynchronous optimal routing in data networks
• Information Security Practice and Experience
• scientific article; zbMATH DE number 1760011

zbMATH Keywords

competitive analysiscommunication complexityfault localizationnetwork routingend-to-end communicationasynchronous protocolsmulti-party computation in presence of dishonest majority

Mathematics Subject Classification ID

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

Cited In (3)

• Shortest path network interdiction with asymmetric information
• Authenticated adversarial routing
• Authenticated Adversarial Routing

This page was built for publication: Asynchronous throughput-optimal routing in malicious networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587442)