Database Location in Computer Networks
From MaRDI portal
Recommendations
Cited in
(36)- An integer programming model for the allocation of databases in a distributed computer system
- Efficient algorithms for the capacitated concentrator location problem
- The multicovering problem
- Valid inequalities and facets of the capacitated plant location problem
- A constrained nonlinear 0-1 program for data allocation
- Database placement in communication networks for minimizing the overall transmission cost
- Optimal allocation for partially replicated database systems on tree- based networks
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
- Lagrangean relaxation. (With comments and rejoinder).
- Dynamic replication of web contents
- scientific article; zbMATH DE number 4129970 (Why is no real title available?)
- A dual ascent approach for steiner tree problems on a directed graph
- Exact approaches for static data segment allocation problem in an information network
- Groupings of nodes for distributed databases
- Modeling and Managing Uncertainty in Process Planning and Scheduling
- scientific article; zbMATH DE number 4080982 (Why is no real title available?)
- scientific article; zbMATH DE number 4098745 (Why is no real title available?)
- scientific article; zbMATH DE number 4100633 (Why is no real title available?)
- Locating replicas of a database on a network
- scientific article; zbMATH DE number 1066868 (Why is no real title available?)
- The maintenance of common data in a distributed system
- scientific article; zbMATH DE number 220156 (Why is no real title available?)
- Location of Software in Distributed Computing Systems
- scientific article; zbMATH DE number 6125225 (Why is no real title available?)
- Facility location models to locate data in information networks: a literature review
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
- Distributed Computing – IWDC 2005
- Optimization of resource location in hierarchical computer networks
- On page migration and other relaxed task systems
- Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique
- Facility location models for distribution system design
- A coordinated planning model for the design of a distributed database system
- Models for planning capacity expansion in local access telecommunication networks
- Designing cost-effective content distribution networks
- Parallel general prefix computations with geometric, algebraic, and other applications
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
This page was built for publication: Database Location in Computer Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3890141)