Abstract
A reliable server assignment (RSA) problem in networks is defined as determining a deployment of identical servers to maximize a measure of service availability. In networks, the communication between a client and a server might be interrupted since the server itself is offline or unreachable as a result of catastrophic network failures. In this paper, a novel simulation optimization approach is developed based on a Monte Carlo (MC) simulation and embedded into Particle Swarm Optimization (PSO) to solve the RSA problem. The experimental results show that the simulation optimization embedded PSO is an effective heuristic method.
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 callDisclaimer: 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.
