A coding-based approach to robust shortest-path routing

DOI10.1007/978-3-319-17296-5_3MaRDI QIDQ3460446zbMATH OpenOpenAlexFDO

Authors Ángela I. Barbero, Øyvind Ytrehus

Publication date 7 January 2016

Published in Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-17296-5_3

zbMATH Keywords

belief propagationcodingcommunication networksdistance vector algorithminformation theoryrouting

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Information theory (general) (94A15)

Recommendations

• A minimum-hop routing algorithm based on distributed information
• A distributed adaptive routing algorithm
• scientific article; zbMATH DE number 1717206
• Asymptotic optimality of shortest path routing algorithms
• On the distributed Bellman-Ford algorithm and the looping problem

Cites work

• On a routing problem

Cited in

(2)

• Problems in the information dissemination of the Internet routing
• scientific article; zbMATH DE number 1717206 (Why is no real title available?)

This page was built for publication: A coding-based approach to robust shortest-path routing

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