<?xml version="1.0"?>

<!DOCTYPE owl [
	<!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
	<!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
	<!ENTITY owl "http://www.w3.org/2002/07/owl#">
	<!ENTITY cc "http://web.resource.org/cc/#">
	<!ENTITY project "http://ebiquity.umbc.edu/ontology/project.owl#">
	<!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
	<!ENTITY pub "http://ebiquity.umbc.edu/ontology/publication.owl#">
	<!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">
]>

<!--

This ontology document is licensed under the Creative Commons
Attribution License. To view a copy of this license, visit
http://creativecommons.org/licenses/by/2.0/ or send a letter to
Creative Commons, 559 Nathan Abbott Way, Stanford, California
94305, USA.

-->

<rdf:RDF 
		xmlns:rdf = "&rdf;"
		xmlns:rdfs = "&rdfs;"
		xmlns:xsd = "&xsd;"
		xmlns:owl = "&owl;"
		xmlns:cc = "&cc;"
		xmlns:project = "&project;"
		xmlns:person = "&person;"
		xmlns:pub = "&pub;"
		xmlns:assert = "&assert;">
	<pub:InProceedings rdf:about="http://ebiquity.umbc.edu/paper/html/id/454/A-Prediction-Based-Fair-Replication-Algorithm-in-Structured-P2P-Systems">
		<rdfs:label><![CDATA[A Prediction-Based Fair Replication Algorithm in Structured P2P Systems]]></rdfs:label>
		<pub:title><![CDATA[A Prediction-Based Fair Replication Algorithm in Structured P2P Systems]]></pub:title>
		<pub:publishedOn rdf:datatype="&xsd;dateTime">2007-07-11T00:00:00-05:00</pub:publishedOn>
		<pub:abstract><![CDATA[Highly skewed query distribution in structured Peer-to-Peer system may cause huge amount of dropped queries and consequently lead to poor system performance. This paper describes a Prediction-based Fair Replication Algorithm (PFR), which aims to maintain excellent system performance when the query is highly skewed. For the purpose of fairly distributing load onto each node, nodes that host hot items always shed load onto light-loaded nodes by creating replicas along the query path. Through the use of a simple prediction method, we can foresee traffic surge and replicate beforehand. Consequently, the number of dropped queries will decrease. Further more, each node can fairly decide the load redistribution speed for itself merely based on local information. The experimental evaluation demonstrates the effectiveness of our approach, which can simultaneously reduce the number of dropped queries as well as the number of created replicas without introducing unaffordable overhead.]]></pub:abstract>
		<pub:counter>1991</pub:counter>
		<pub:booktitle><![CDATA[Proceedings of the 4th International Conference on Autonomic and Trusted Computing]]></pub:booktitle>
		<pub:author>
			<rdf:List>
				<rdf:first>
					<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Wenjia/Li"><person:name><![CDATA[Wenjia Li]]></person:name><rdfs:label><![CDATA[Wenjia Li]]></rdfs:label></person:Person>
				</rdf:first>
				<rdf:rest>					<rdf:List>
						<rdf:first>
							<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Xianshu/Zhu"><person:name><![CDATA[Xianshu Zhu]]></person:name><rdfs:label><![CDATA[Xianshu Zhu]]></rdfs:label></person:Person>
						</rdf:first>
						<rdf:rest>							<rdf:List>
								<rdf:first>
									<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Dafang/Zhang"><person:name><![CDATA[Dafang Zhang]]></person:name><rdfs:label><![CDATA[Dafang Zhang]]></rdfs:label></person:Person>
								</rdf:first>
								<rdf:rest>									<rdf:List>
										<rdf:first>
											<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Kun/Huang"><person:name><![CDATA[Kun Huang]]></person:name><rdfs:label><![CDATA[Kun Huang]]></rdfs:label></person:Person>
										</rdf:first>
										<rdf:rest rdf:resource="&rdf;nil" />
									</rdf:List>
								</rdf:rest>
							</rdf:List>
						</rdf:rest>
					</rdf:List>
				</rdf:rest>
			</rdf:List>
		</pub:author>
		<pub:firstAuthor>
<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Wenjia/Li"><person:name><![CDATA[Wenjia Li]]></person:name><rdfs:label><![CDATA[Wenjia Li]]></rdfs:label></person:Person>
		</pub:firstAuthor>
		<pub:softCopy><pub:SoftCopy>
			<pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
			<pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/450.pdf]]></pub:softCopyURI>
			<pub:softCopySize>64894</pub:softCopySize>
			</pub:SoftCopy>
			</pub:softCopy>
	</pub:InProceedings>

<rdf:Description rdf:about="">
	<cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
</rdf:Description>

</rdf:RDF>
