Pages that link to "Item:Q869005"
From MaRDI portal
The following pages link to Designing cost-effective content distribution networks (Q869005):
Displaying 18 items.
- Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
- Jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks (Q1661883) (← links)
- The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic (Q2260900) (← links)
- A new hybrid heuristic for replica placement and request distribution in content distribution networks (Q2341096) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- Provisioning overlay distribution networks (Q2485273) (← links)
- (Q2762752) (← links)
- The location-dispatching problem: polyhedral results and content delivery network design (Q2861504) (← links)
- Solving replica placement and request distribution in content distribution networks (Q2883556) (← links)
- Organizing Distribution Channels for Information Goods on the Internet (Q3116747) (← links)
- Service Adoption and Pricing of Content Delivery Network (CDN) Services (Q3117745) (← links)
- A two-level simulated annealing algorithm for efficient dissemination of electronic content (Q3394025) (← links)
- Equitable bandwidth allocation in content distribution networks (Q3553745) (← links)
- Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique (Q6102822) (← links)