Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A Comprehensive Model for the Design of Distributed Computer Systems
IEEE Transactions on Software Engineering
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Network Computing
ACM Transactions on Information Systems (TOIS)
Virtual private networks: technologies and solutions
Virtual private networks: technologies and solutions
Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach
IEEE Transactions on Parallel and Distributed Systems
Tabu Search
What's Size Got to Do With It?: Understanding Computer Rightsizing
What's Size Got to Do With It?: Understanding Computer Rightsizing
Scaling for E Business: Technologies, Models, Performance, and Capacity Planning
Scaling for E Business: Technologies, Models, Performance, and Capacity Planning
Legacy Information Systems: Issues and Directions
IEEE Software
Distributed Information Systems: An Advanced Methodology
IEEE Transactions on Software Engineering
A Method for Design and Performance Modeling of Client/Server Systems
IEEE Transactions on Software Engineering
Revised Papers from the Second International Workshop on Engineering Distributed Objects
EDO '00 Revised Papers from the Second International Workshop on Engineering Distributed Objects
A cost-oriented approach for infrastructural design
Proceedings of the 2004 ACM symposium on Applied computing
Windows Server 2003/2000 Thin Client Solutions
Windows Server 2003/2000 Thin Client Solutions
Information Sciences: an International Journal
Application of load balancing based on symmetric balanced incomplete block design to random networks
Information Sciences: an International Journal
A hierarchical model for test-cost-sensitive decision systems
Information Sciences: an International Journal
| Hi-index | 0.07 |
The selection of a cost-minimizing combination of hardware and network components of Internet-based systems to satisfy organizational requirements is a complex design problem with multiple degrees of freedom. Decisions must be made on how to distribute the overall computing load onto multiple computers, where to locate computers and how to take advantage of legacy components. The corresponding optimization problem not only embeds the structure of NP-hard problems, but also represents a challenge with a well-structured heuristic approach. A scientific approach has been rarely applied to cost minimization and a rigorous methodological support to cost issues of the design of Internet-based distributed systems is still lacking. The methodological contribution of this paper is the representation of complex design issues as a set of four intertwined cost-minimization sub-problems: two set-partitionings, a set-packing and a min k-cut with a non-linear objective function. Optimization is accomplished by sequentially solving these sub-problems with a heuristic approach and tuning their solution with a local-search approach. Results indicate that decomposition significantly reduces optimization time and solutions have also lower costs than those identified without prior decomposition (20-60%). Cost reductions considerably grow (25-70%) when methodological outputs are compared with practitioners' solutions.