Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Introduction to algorithms
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
An algorithm for finding a K-median in a directed tree
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Network attached storage architecture
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
On filter effects in web caching hierarchies
ACM Transactions on Internet Technology (TOIT)
Analysis of web caching architectures: hierarchical and distributed caching
IEEE/ACM Transactions on Networking (TON)
Balanced-Replication Algorithms for Distribution Trees
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Performance Modelling of Reliable Multicast Transmission
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An overview of DNS-based server selections in content distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint object placement and node dimensioning for internet content distribution
Information Processing Letters
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Measurement and analysis of a streaming-media workload
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Organization-based analysis of web-object sharing and caching
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
System design issues for internet middleware services: deductions from a large client trace
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Object replication strategies in content distribution networks
Computer Communications
Optimal Web cache sizing: scalable methods for exact solutions
Computer Communications
Web caching and content distribution: a view from the interior
Computer Communications
IEEE Journal on Selected Areas in Communications
Constrained mirror placement on the Internet
IEEE Journal on Selected Areas in Communications
Networking requirements for interactive video on demand
IEEE Journal on Selected Areas in Communications
Policies for Caching OLAP Queries in Internet Proxies
IEEE Transactions on Parallel and Distributed Systems
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
Designing cost-effective content distribution networks
Computers and Operations Research
IEEE Transactions on Parallel and Distributed Systems
Computers and Operations Research
Equipment allocation in video-on-demand network deployments
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A proactive low-overhead file replication scheme for structured P2P content delivery networks
Journal of Parallel and Distributed Computing
Evaluating the utility of content delivery networks
Proceedings of the 4th edition of the UPGRADE-CN workshop on Use of P2P, GRID and agents for the development of content networks
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
CDNsim: A simulation tool for content distribution networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Video-on-demand server selection and placement
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
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
CEA: A Cyclic Expansion Algorithm for data migration in parallel video servers
Journal of Parallel and Distributed Computing
Optimal content placement for peer-to-peer video-on-demand systems
IEEE/ACM Transactions on Networking (TON)
A novel cache size optimization scheme based on manifold learning in Content Centric Networking
Journal of Network and Computer Applications
Hi-index | 0.00 |
The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced end-user delay, reduced network traffic, and improved scalability. The problem of allocating an available storage budget to the nodes of a hierarchical content distribution system is formulated; optimal algorithms, as well as fast/efficient heuristics, are developed for its solution. An innovative aspect of the presented approach is that it combines all relevant subproblems, concerning node locations, node sizes, and object placement, and solves them jointly in a single optimization step. The developed algorithms may be utilized in content distribution networks that employ either replication or caching/replacement. In addition to reducing the average fetch distance for the requested content, they also cater to load balancing and workload constraints on a given node. Strictly hierarchical, as well as hierarchical with peering, request routing models are considered.