CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES
From MaRDI portal
Publication:3022020
Recommendations
- Solving replica placement and request distribution in content distribution networks
- Using taxonomies for content-based routing with ants
- Optimization of a peer-to-peer system for efficient content replication
- scientific article; zbMATH DE number 1928256
- A new consistency algorithm for dynamic documents in content distribution networks.
Cited in
(6)- A new consistency algorithm for dynamic documents in content distribution networks.
- scientific article; zbMATH DE number 2016052 (Why is no real title available?)
- Solving replica placement and request distribution in content distribution networks
- Using taxonomies for content-based routing with ants
- Optimal node-selection algorithm for parallel download in overlay content-distribution networks
- On the asymptotic content routing stretch in network of caches: impact of popularity learning
This page was built for publication: CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3022020)