Traffic-redundancy aware network design

MaRDI QIDQ5743493zbMATH OpenFDO

Authors Siddharth Barman, Shuchi Chawla

Publication date 10 May 2019

Full work available at URL https://arxiv.org/abs/1110.4150, https://dl.acm.org/citation.cfm?id=2095234

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Recommendations

• Network design with coverage costs
• Network design with a discrete set of traffic matrices
• Network design for information networks
• On the approximability of robust network design
• Approximation algorithms for access network design

Cites work

• A tight bound on approximating arbitrary metrics by tree metrics
• Approximation algorithms for geometric median problems
• Cost-Distance: Two Metric Network Design
• Facility location with hierarchical facility costs
• Facility location with service installation costs
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• scientific article; zbMATH DE number 2086941 (Why is no real title available?)
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• Network design for information networks
• Optimal lower bounds for universal and differentially private Steiner trees and TSPs
• Simpler and better approximation algorithms for network design
• Universal approximations for TSP, Steiner tree, and set cover

Cited in

(6)

• Physical network design to facilitate capacity reallocation
• rDAN: toward robust demand-aware network designs
• Demand-aware network designs of bounded degree
• Network design with coverage costs
• Demand-aware network designs of bounded degree
• Traffic engineering of tunnel-based networks with class specific diversity requirements

This page was built for publication: Traffic-redundancy aware network design

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