@article {225,
	title = {Fault-tolerant meta-scheduler for price-based job scheduling by applying multi-reservation method},
	journal = {Journal of Digital Information Management},
	volume = {8},
	year = {2010},
	note = {Cited By (since 1996):1Export Date: 10 July 2014},
	month = {2010},
	pages = {213 - 218},
	abstract = {In market-like grids, applying an economical method for providing fault-tolerant job scheduling is necessary. Since we have to pay cost for job execution in economic grids, consumers tend to execute their jobs on a grid with minimum cost and acceptable completion time. To do this, many approaches have been proposed, but they unilaterally consider either time/cost or consumer/provider profit. Based on current research, a new approach has been proposed; the approach is an optimized, fault-tolerant method for meta-scheduler that considers bilateral satisfaction for consumer/provider and a tolerable completion time. We suppose that, if one of the provider nodes fails, there would not be enough time to start a task on a new node from the beginning. The experimental results show a promising improvement in job scheduling with less computation cost, better fault-tolerance, and an acceptable completion time.},
	keywords = {Check-pointing, Fault tolerance, Replication, Rough set},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960679148\&partnerID=40\&md5=e30a655c66545df2023a714a92a03da8},
	author = {Bouyer, A. and Abdullah, A.H.}
}
@article {241,
	title = {File replication method based on demand forecasting of file download in P2P networks},
	journal = {Journal of Digital Information Management},
	volume = {8},
	year = {2010},
	note = {Export Date: 10 July 2014},
	month = {2010},
	pages = {247 - 253},
	abstract = {In peer-to-peer (P2P) networks that support file-sharing services, the level of access demand can vary widely between different files. Since fewer nodes store files for which there is a lower demand, these files are more likely to be lost from the P2P networks if users leave the network or delete the files. File loss can cause users to seek alternatives to P2P services, and lead to degradation in service quality. We propose and evaluate a replication method based on demand forecasting that aims to prevent the loss of low-demand files. In this method, the number of file replicas to be placed is determined based on the forecast demand for the file, so that the loss of low-demand files is likely prevented by placing replicas at nodes that frequently use P2P services. Based on simulation results, we compared our proposed method with basic replication methods in terms of the number of files and the amount of storage used. Our experimental results show that the proposed method prevents file loss by preserving lowdemand files over extended periods of time. We also confirmed that the node storage resources consumed by this method are efficiently used.},
	keywords = {P2P file sharing, P2P networks, Replication},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960687658\&partnerID=40\&md5=3db4c30b2db7743416ab3f4cb69524b3},
	author = {Kobayashi, M. and Kageyama, J. and Shibusawa, S. and Yonekura, T.}
}
@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.}
}
