Optimizing server placement in distributed systems in the presence of competition
DOI10.1016/J.JPDC.2010.08.008zbMATH Open1219.68059OpenAlexW1995845616MaRDI QIDQ635301FDOQ635301
Authors: Jan-Jan Wu, Shu-Fan Shih, Pangfeng Liu, Yi-Min Chung 
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
Recommendations
- scientific article; zbMATH DE number 1409906
- Optimal Server Allocation in a System of Multi-Server Stations
- Optimal and heuristic policies for dynamic server allocation
- Optimal static distribution of prioritized customers to heterogeneous parallel servers
- scientific article; zbMATH DE number 1194425
- scientific article; zbMATH DE number 2089325
- Optimal Dynamic Server Allocation in Systems with On/Off Sources
- Optimal assignment of servers to tasks when collaboration is inefficient
resource allocationoptimal algorithmsdistributed systemheuristic algorithmscompetition-aware server placementgrid and cloudmaximizing benefitminimizing construction cost
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Capacitated vertex covering
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Algorithms – ESA 2005
- The distance-domination numbers of trees
- A GRASP with path-relinking for private virtual circuit routing
- An algorithm for finding a \(k\)-median in a directed tree
- Mathematical Foundations of Computer Science 2003
- Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Optimizing server placement in distributed systems in the presence of competition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635301)
