@article {58,
	title = {Optimal placement of Web proxies in the Internet with link capacity constraints},
	journal = {Journal of Digital Information Management},
	volume = {4},
	year = {2006},
	note = {Cited By (since 1996):1Export Date: 10 July 2014},
	month = {2006},
	pages = {238 - 242},
	abstract = {This paper considers the problem of placing a fixed number of proxies in the Web modelled as a tree network. The study assumes that each link in the network has a fixed capacity, and that the total load passing through a link cannot exceed this capacity. We are interested in finding a minimum cost replication set that optimises the cost of servicing access requests in a read-only environment taking into account the capacity constraints of the links.},
	keywords = {Dynamic programming, Link capacity, Replication, Tree network, Web server},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845933875\&partnerID=40\&md5=9e8af6a6d40a5eb4fb54dbc61e62f0cc},
	author = {Tenzakhti, F.}
}
