Share Email Print
cover

Proceedings Paper

A genetic algorithm for replica server placement
Author(s): Ghazaleh Eslami; Abolfazl Toroghi Haghighat
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Modern distribution systems use replication to improve communication delay experienced by their clients. Some techniques have been developed for web server replica placement. One of the previous studies was Greedy algorithm proposed by Qiu et al, that needs knowledge about network topology. In This paper, first we introduce a genetic algorithm for web server replica placement. Second, we compare our algorithm with Greedy algorithm proposed by Qiu et al, and Optimum algorithm. We found that our approach can achieve better results than Greedy algorithm proposed by Qiu et al but it's computational time is more than Greedy algorithm.

Paper Details

Date Published: 13 January 2012
PDF: 5 pages
Proc. SPIE 8349, Fourth International Conference on Machine Vision (ICMV 2011): Machine Vision, Image Processing, and Pattern Analysis, 83493D (13 January 2012); doi: 10.1117/12.921115
Show Author Affiliations
Ghazaleh Eslami, Qazvin Islamic Azad Univ. (Iran, Islamic Republic of)
Abolfazl Toroghi Haghighat, Qazvin Islamic Azad Univ. (Iran, Islamic Republic of)


Published in SPIE Proceedings Vol. 8349:
Fourth International Conference on Machine Vision (ICMV 2011): Machine Vision, Image Processing, and Pattern Analysis
Zhu Zeng; Yuting Li, Editor(s)

© SPIE. Terms of Use
Back to Top