The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Not all hits are created equal: cooperative proxy caching over a wide-area network
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Database Location in Computer Networks
Journal of the ACM (JACM)
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SPREAD: scalable platform for reliable and efficient automated distribution
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
IEEE/ACM Transactions on Networking (TON)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Approximation algorithms
Analysis of web caching architectures: hierarchical and distributed caching
IEEE/ACM Transactions on Networking (TON)
Web caching and replication
The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
Coordinated En-Route Web Caching
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Internet Computing
Choosing Replica Placement Heuristics for Wide-Area Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Optimal Placement of Web Proxies for Tree Networks
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
IEEE Communications Magazine
Constrained mirror placement on the Internet
IEEE Journal on Selected Areas in Communications
Placement problems for transparent data replication proxy services
IEEE Journal on Selected Areas in Communications
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Optimal Placement of Replicas in Data Grid Environments with Locality Assurance
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Analysis of Replica Placement under Expiration-Based Consistency Management
IEEE Transactions on Parallel and Distributed Systems
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
Computers and Operations Research
Design and analysis of an adaptive object replication algorithm in distributed network systems
Computer Communications
Impact of QoS on Replica Placement in Tree Networks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Optimal replica placement in hierarchical Data Grids with locality assurance
Journal of Parallel and Distributed Computing
CPI: A Novel Three-Phase Algorithm for QoS-Aware Replica Placement Problem
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
A QoS-Aware Heuristic Algorithm for Replica Placement
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
QoS-aware, access-efficient, and storage-efficient replica placement in grid environments
The Journal of Supercomputing
Optimizing server placement for QoS requirements in hierarchical grid environments
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Energy efficient network design tool for green IP/Ethernet networks
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
Journal of Systems and Software
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Managing traffic demand uncertainty in replica server placement with robust optimization
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Integrating caching techniques on a content distribution network
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Planning for optimal multi-site data distribution for disaster recovery
GECON'11 Proceedings of the 8th international conference on Economics of Grids, Clouds, Systems, and Services
QoS-aware replica placement for grid computing
Concurrency and Computation: Practice & Experience
International Journal of Grid and Utility Computing
Proactive data dissemination to mission sites
Wireless Networks
GCplace: geo-cloud based correlation aware data replica placement
Proceedings of the 28th Annual ACM Symposium on Applied Computing
QoS-aware placement of stream processing service
The Journal of Supercomputing
An efficient and reliable approach for quality-of-service-aware service composition
Information Sciences: an International Journal
| Hi-index | 0.00 |
The rapid growth of new information services and business-oriented applications entails the consideration of quality of service (QoS) in content distribution. This paper investigates the QoS-aware replica placement problems for responsiveness QoS requirements. We consider two classes of service models: replica-aware services and replica-blind services. In replica-aware services, the servers are aware of the locations of replicas and can therefore optimize request routing to improve responsiveness. We show that the QoS-aware placement problem for replica-aware services is NP-complete. Several heuristic algorithms for fast computation of good solutions are proposed and experimentally evaluated. In replica-blind services, the servers are not aware of the locations of replicas or even their existence. As a result, each replica only serves the requests flowing through it under some given routing strategy. We show that there exist polynomial optimal solutions to the QoS-aware placement problem for replica-blind services. Efficient algorithms are proposed to compute the optimal locations of replicas under different cost models.