Locating replicas of a database on a network

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199708)30:1<31::AID-NET4>3.0.CO;2-M" /><31::AID-NET4>3.0.CO;2-M 10.1002/(SICI)1097-0037(199708)30:1<31::AID-NET4>3.0.CO;2-MzbMath0878.90025OpenAlexW1971607545MaRDI QIDQ4355483

S. Louis Hakimi, Edward F. Schmeichel

Publication date: 21 September 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199708)30:1<31::aid-net4>3.0.co;2-m

zbMATH Keywords

NP-hardtree networkscommunication costlocating replicas of a database

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Computer system organization (68M99)

Related Items (6)

Designing cost-effective content distribution networks ⋮ 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 ⋮ The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy ⋮ A family of facets for the uncapacitated \(p\)-median polytope ⋮ The edge-orientation problem and some of its variants on weighted graphs

This page was built for publication: Locating replicas of a database on a network