Abstract
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network latencies of links, constraints on servers’ capabilities and the service quality requirement, the solution to the minimum server placement problem attempts to place the minimum number of servers that meet both the constrains on servers’ capabilities and the service quality requirement. As our model considers both the different capabilities of servers and the network latencies, it is more general than similar works in the literatures. Instead of using a heuristic approach, we propose an optimal algorithm based on dynamic programming to solve the problem. We also consider the optimal service quality problem, which tries to place a given number of servers appropriately so that the maximum expected response time is minimized. We prove that an optimal server placement can be achieved by combining the dynamic programming algorithm with a binary search on the service quality requirement. The simulation results clearly show the improvement in the number of servers and the maximum expected response time.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Johnston, W.E.: Computational and data Grids in large-scale science and engineering. Future Generation Computer Systems 18(8), 1085–1100 (2002)
Grid Physics Network (GriphyN), http://www.griphyn.org
TeraGrid, http://www.teragrid.org
Wang, C.M., et al.: Efficient multi-source data transfer in data grids. In: CCGRID ’06, pp. 421–424 (2006)
Lamehamedi, H., et al.: Simulation of Dynamic Data Replication Strategies in Data Grids. IPDPS 2003, 100 (2003)
Deris, M.M., Abawajy, J.H., Suzuri, H.M.: An efficient replicated data access approach for large-scale distributed systems. In: CCGRID, pp. 588–594 (2004)
Hoschek, W., et al.: Data Management in an International Data Grid Project. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 77–90. Springer, Heidelberg (2000)
Krishnan, P., Raz, D., Shavitt, Y.: The cache location problem. IEEE/ACM Transactions on Networking 8(5), 568–582 (2000)
Ranganathan, K., Foster, I.T.: Identifying Dynamic Replication Strategies for a High-Performance Data Grid. In: Lee, C.A. (ed.) GRID 2001. LNCS, vol. 2242, pp. 75–86. Springer, Heidelberg (2001)
Tang, M.X., Xu, M.J.: QoS-aware replica placement for content distribution. IEEE Trans. Parallel Distrib. Syst. 16(10), 921–932 (2005)
Wang, H., Liu, P., Wu, J.J.: A QoS-aware heuristic algorithm for replica placement. In: International Conference on Grid Computing, pp. 96–103 (2006)
Wang, C.-M., et al.: Optimizing Server Placement in Hierarchical Grid Environments. In: Chung, Y.-C., Moreira, J.E. (eds.) GPC 2006. LNCS, vol. 3947, pp. 1–11. Springer, Heidelberg (2006)
Abawajy, J.H.: Placement of File Replicas in Data Grid Environments. In: Bubak, M., et al. (eds.) ICCS 2004. LNCS, vol. 3038, pp. 66–73. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Wang, CM., Hsu, CC., Liu, P., Chen, HM., Wu, JJ. (2007). Optimizing Server Placement for QoS Requirements in Hierarchical Grid Environments. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)