Optimizing server placement in distributed systems in the presence of competition
From MaRDI portal
Publication:635301
DOI10.1016/j.jpdc.2010.08.008zbMath1219.68059OpenAlexW1995845616MaRDI QIDQ635301
Jan-Jan Wu, Yi-Min Chung, Pangfeng Liu, Shu-Fan Shih
Publication date: 19 August 2011
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.08.008
resource allocationheuristic algorithmsdistributed systemoptimal algorithmscompetition-aware server placementgrid and cloudmaximizing benefitminimizing construction cost
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The distance-domination numbers of trees
- An algorithm for finding a \(k\)-median in a directed tree
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet
- Capacitated vertex covering
- A GRASP with path-relinking for private virtual circuit routing
- Mathematical Foundations of Computer Science 2003
- Algorithms – ESA 2005
This page was built for publication: Optimizing server placement in distributed systems in the presence of competition