Optimizing server placement in distributed systems in the presence of competition
From MaRDI portal
Publication:635301
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2119651 (Why is no real title available?)
- A GRASP with path-relinking for private virtual circuit routing
- Algorithms – ESA 2005
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- An algorithm for finding a k-median in a directed tree
- Capacitated vertex covering
- Mathematical Foundations of Computer Science 2003
- Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet
- The distance-domination numbers of trees
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)