Minimum congestion mapping in a cloud
From MaRDI portal
Publication:2943405
DOI10.1145/1993806.1993854zbMath1321.68446OpenAlexW2121752873MaRDI QIDQ2943405
Viswanath Nagarajan, Nikhil Bansal, Kang-Won Lee, Murtaza Zafer
Publication date: 11 September 2015
Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Approximation algorithms (68W25)
Related Items
Competitive and deterministic embeddings of virtual networks, Minimum Congestion Mapping in a Cloud, Self-adjusting grid networks to minimize expected path length, Self-adjusting Grid Networks to Minimize Expected Path Length, Adversarial topology discovery in network virtualization environments: a threat for ISPs?
Cites Work
- Unnamed Item
- Gradient clock synchronization in dynamic networks
- Consensus algorithms with one-bit messages
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Broadcasting in dynamic radio networks
- Programming simultaneous actions using common knowledge
- Continuous consensus via common knowledge
- Distributed computation in dynamic networks
- Flooding time in edge-Markovian dynamic graphs
- Knowledge and common knowledge in a distributed environment
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
- Fault Tolerance in Networks of Bounded Degree
- Reaching Agreement in the Presence of Faults
- Perfectly secure message transmission
- Parsimonious flooding in dynamic graphs
- Optimal gradient clock synchronization in dynamic networks
- Almost-Everywhere Secure Computation
