Bandwidth constrained placement in a WAN

DOI10.1145/383962.384002MaRDI QIDQ2787675zbMATH OpenOpenAlexFDO

Authors Arun Venkataramani, Phoebe Weidmann, Mike Dahlin

Publication date 4 March 2016

Published in Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/383962.384002

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Placement algorithms for hierarchical cooperative caching
• scientific article; zbMATH DE number 1305451
• Computational Science and Its Applications – ICCSA 2004
• Approximation Algorithms for Data Placement Problems
• Approximation algorithms for data placement in arbitrary networks

Cited in

(1)

• Data transfer planning with tree placement for collaborative environments

This page was built for publication: Bandwidth constrained placement in a WAN

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