Abstract
Communication has a remarkable and strategic role for the success of every enterprise. Nowadays, computer networks can be used as efficient tools to create connections between departments of an organization and to communicate with customers. Therefore, it is crucial for companies with IT-based activities to use computer networks so as to increase their efficiencies. In this paper, a bi-objective mathematical formulation is proposed for server farms. A server farm is a cluster of computer systems connected together to provide services to an organization and its customers. This model optimizes reliability and cost of server farms, concurrently. This problem is called the redundancy allocation problem that belongs to the class of NP-hard problems. Therefore, three meta-heuristics namely non-dominated sorting genetic algorithm II, pareto envelope-based selection algorithm II, and strength pareto evolutionary algorithm II have been hired to obtain feasible solutions in a reasonable computation time. To evaluate the performances of meta-heuristic methods, the e-constraint method as an exact algorithm has also been used. The outputs demonstrate appropriate effectiveness of the employed algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of System Assurance Engineering and Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
