Designing cost-effective content distribution networks

DOI10.1016/J.COR.2005.09.013zbMATH Open1144.90336OpenAlexW2171831991MaRDI QIDQ869005FDOQ869005

Osman Oguz, Iradj Ouveysi, Tolga Bektaş

Publication date: 26 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/11442

Recommendations

• Exact algorithms for the joint object placement and request routing problem in content distribution networks
• A two-level simulated annealing algorithm for efficient dissemination of electronic content
• Solving replica placement and request distribution in content distribution networks
• scientific article; zbMATH DE number 2089324
• A distributed transportation simplex applied to a Content Distribution Network problem

zbMATH Keywords

integer programmingexact solutionBenders' decompositioncontent distribution network

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Partitioning procedures for solving mixed-variables programming problems
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Formulating logical implications in combinatorial optimisation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Configuration of fully replicated distributed database system over wide area networks
• Database Location in Computer Networks
• Monge strikes again: Optimal placement of web proxies in the internet
• An integer programming model for the allocation of databases in a distributed computer system
• Joint object placement and node dimensioning for internet content distribution
• A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• Resource allocation and capacity assignment in distributed systems
• File distribution in networks with multimedia storage servers
• Locating replicas of a database on a network
• Title not available (Why is that?)

Cited In (13)

• Equitable bandwidth allocation in content distribution networks
• A new hybrid heuristic for replica placement and request distribution in content distribution networks
• Title not available (Why is that?)
• Solving replica placement and request distribution in content distribution networks
• Provisioning overlay distribution networks
• Exact approaches for static data segment allocation problem in an information network
• A greedy algorithm for capacity-constrained surrogate placement in CDNs
• Title not available (Why is that?)
• Exact algorithms for the joint object placement and request routing problem in content distribution networks
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
• Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique
• Solving a capacitated hub location problem
• Organizing Distribution Channels for Information Goods on the Internet

This page was built for publication: Designing cost-effective content distribution networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869005)