Demand-aware network designs of bounded degree

DOI10.4230/LIPICS.DISC.2017.5MaRDI QIDQ6487477zbMATH OpenFDO

Authors Chen Avin, Kaushik Mondal, Stefan Schmid

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2017.5

zbMATH Keywords

entropynetwork designsparse spannersreconfigurable networksdatacenter topologypeer-topeer computing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Demand-aware network designs of bounded degree
• rDAN: toward robust demand-aware network designs
• Traffic-redundancy aware network design
• scientific article; zbMATH DE number 3906198
• Survivable network design with demand uncertainty

Cited in

(4)

• Demand-aware network designs of bounded degree
• Self-adjusting grid networks to minimize expected path length
• rDAN: toward robust demand-aware network designs
• Self-adjusting grid networks to minimize expected path length

This page was built for publication: Demand-aware network designs of bounded degree

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