K-nearest Neighbor Rule:  A Replica Selection Approach in Grid 
Environment

Rahman, Mohammad Rashedur

K-nearest Neighbor Rule: A Replica Selection Approach in Grid Environment

dc.contributor.author	Rahman, Mohammad Rashedur	eng
dc.date.accessioned	2008-05-20T23:25:24Z
dc.date.available	2008-05-20T23:25:24Z
dc.date.computerscience	2006-02-14	eng
dc.date.issued	2006-02-14	eng
dc.description.abstract	Grid technology is developed to share data across many organizations in different geographical locations. Data replication is a good technique that helps to move data because it caches data closer to users. The idea of replication is to store copies in different locations so it can be easily recovered if one copy at one location is lost. Moreover, if data can be kept closer to user via replication, data access performance can be improved dramatically. When different sites hold replicas, there are significant benefits realized when selecting the best replica. Network performance plays a major role in selecting a replica. However, current research shows that other factors such as disk I/O also plays an important role in file transfer. In this paper, we describe a new optimization technique that considers both disk throughput and network latencies when selecting the best replica. Previous history of data transfer can help in predicting the best site that can hold replica. The k-nearest neighbor rule is one such predictive technique. In this technique, when a new request arrives for best replica, it looks at all previous data to find a subset of previous file requests that are similar to it and uses them to predict the best site that can hold replica. In this work, we implement and test the k-nearest algorithm for various file access patterns and compare results with the traditional replica catalog based model. The results demonstrate that our model outperforms the traditional model for sequential and unitary random file access requests.	eng
dc.description.notes	We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca	eng
dc.identifier.department	2006-811-04	eng
dc.identifier.doi	http://dx.doi.org/10.11575/PRISM/31325
dc.identifier.uri	http://hdl.handle.net/1880/46472
dc.language.iso	Eng	eng
dc.publisher.corporate	University of Calgary	eng
dc.publisher.faculty	Science	eng
dc.subject	Computer Science	eng
dc.title	K-nearest Neighbor Rule: A Replica Selection Approach in Grid Environment	eng
dc.type	unknown
thesis.degree.discipline	Computer Science	eng