Designing cost-effective content distribution networks
From MaRDI portal
Publication:869005
DOI10.1016/j.cor.2005.09.013zbMath1144.90336OpenAlexW2171831991MaRDI QIDQ869005
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
Integer programming (90C10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items
Solving Replica Placement and Request Distribution in Content Distribution Networks, Solving a capacitated hub location problem, Exact approaches for static data segment allocation problem in an information network, Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique, 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, Equitable bandwidth allocation in content distribution networks, A new hybrid heuristic for replica placement and request distribution in content distribution networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Joint object placement and node dimensioning for internet content distribution
- An integer programming model for the allocation of databases in a distributed computer system
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Partitioning procedures for solving mixed-variables programming problems
- Configuration of fully replicated distributed database system over wide area networks
- Monge strikes again: Optimal placement of web proxies in the internet
- Formulating logical implications in combinatorial optimisation
- Resource allocation and capacity assignment in distributed systems
- File distribution in networks with multimedia storage servers
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Database Location in Computer Networks
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Locating replicas of a database on a network
