Joint object placement and node dimensioning for internet content distribution

Authors:
Nikolaos Laoutaris;Vassilios Zissimopoulos;Ioannis Stavrakakis
Affiliations:
Department of Informatics and Telecommunications, University of Athens, 15784 Athens, Greece;Department of Informatics and Telecommunications, University of Athens, 15784 Athens, Greece;Department of Informatics and Telecommunications, University of Athens, 15784 Athens, Greece
Venue:
Information Processing Letters
Year:
2004

Citing 9
Cited 12

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Approximation algorithms for geometric median problems

Information Processing Letters
Analysis of a local search heuristic for facility location problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Placement algorithms for hierarchical cooperative caching

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for finding a K-median in a directed tree

Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Approximation algorithms for data placement in arbitrary networks

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete 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
Discrete Optimization Algorithms with Pascal Programs

Discrete Optimization Algorithms with Pascal Programs
An O(pn2) algorithm for the p -median and related problems on tree graphs

Operations Research Letters

Distributed Selfish Replication

IEEE Transactions on Parallel and Distributed Systems
Designing cost-effective content distribution networks

Computers and Operations Research
Exact algorithms for the joint object placement and request routing problem in content distribution networks

Computers and Operations Research
On the optimization of storage capacity allocation for content distribution

Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and performance evaluation of a content distribution overlay optimized for streaming

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Scalable service migration in autonomic network environments

IEEE Journal on Selected Areas in Communications
Design, optimization and performance evaluation of a content distribution overlay for streaming

Computer Communications
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions

Computer Communications
Local utility aware content replication

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Content distribution through autonomic content and storage management

WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
Designing content distribution networks for optimal cost and performance

Information Technology and Management
Survey of Clustering: Algorithms and Applications

International Journal of Information Retrieval Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper studies a resource allocation problem in a graph, concerning the joint optimization of capacity allocation decisions and object placement decisions, given a single capacity constraint. This problem has applications in Internet content distribution and other domains. The solution to the problem comes through a multi-commodity generalization of the single commodity k-median problem. A two-step algorithm is developed that is capable of solving the multi-commodity case optimally in polynomial time for the case of tree graphs, and approximately (within a constant factor of the optimal) in polynomial time for the case of general graphs.