This paper deals with the replica placement problem on fully homogeneous tree networks knownas the Replica Placementoptimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Benoit, V. Rehn, and Y. Robert. Impact of QoS on Replica Placement in Tree Networks. Research Report 2006-48, LIP, ENS Lyon, France, Dec. 2006. To appear in ICCS’2007.
A. Benoit, V. Rehn, and Y. Robert. Strategies for Replica Placement in Tree Networks. In HCW’2007. IEEE Computer Society Press, 2007.
I. Cidon, S. Kutten, and R. Soffer. Optimal allocation of electronic content. Computer Networks, 40(2):205-218, 2002.
M. Karlsson and C. Karamanolis. Choosing Replica Placement Heuristics for Wide-Area Systems. In ICDCS’04, pages 350-359, Washington, DC, USA, 2004. IEEE Computer Society.
M. Karlsson, C. Karamanolis, and M. Mahalingam. A Framework for Evaluating Replica Placement Algorithms. Research Report HPL-2002-219, HP Laboratories, Palo Alto, CA, 2002.
P. Liu, Y.-F. Lin, and J.-J. Wu. Optimal placement of replicas in data grid environments with locality assurance. In ICPADS. IEEE Computer Society Press, 2006.
V. Rehn. Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks. Research Report 2007-10, LIP, ENS Lyon, France, Mar. 2007.
X. Tang and J. Xu. QoS-Aware Replica Placement for Content Distribution. IEEE Transactions on Parallel and Distributed Systems, 16(10):921-932, 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this paper
Cite this paper
Rehn-Sonigo, V. (2007). Optimal Closest Policy with Qos and Bandwidth Constraints. In: Priol, T., Vanneschi, M. (eds) Towards Next Generation Grids. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-72498-0_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-72498-0_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-72497-3
Online ISBN: 978-0-387-72498-0
eBook Packages: Computer ScienceComputer Science (R0)