Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
IEEE/ACM Transactions on Networking (TON)
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
Facility Location with Nonuniform Hard Capacities
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimal Cost Replication of Dynamic Web Contents under Flat Update Delivery
IEEE Transactions on Parallel and Distributed Systems
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
The minimal cost distribution tree problem for recursive expiration-based consistency management
IEEE Transactions on Parallel and Distributed Systems
A parallel dual-type algorithm for a class of quadratic programming problems and applications
Expert Systems with Applications: An International Journal
Comparison of Access Policies for Replica Placement in Tree Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Proactive data dissemination to mission sites
Wireless Networks
| Hi-index | 0.00 |
The network planning problem of placing replicated servers with QoS constraints is considered. Each server site may consist of multiple server types with varying capacities and each site can be placed in any location among those belonging to a given set. Each client can be served by more than one location as long as the round-trip delay of data requests satisfies predetermined upper bounds. Our main focus is to minimize the cost of using the servers and utilizing the link bandwidth, while serving requests according to their delay constraint. This is an NP-hard problem. A pseudopolynomial and a polynomial algorithm that provide guaranteed approximation factors with respect to the optimal for the problem at hand are presented.