<?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/179/A-Queueing-Theoretic-Model-for-Service-Discovery-in-Ad-hoc-Networks">
    <rdfs:label><![CDATA[A Queueing Theoretic Model for Service Discovery in Ad-hoc Networks]]></rdfs:label>
    <pub:title><![CDATA[A Queueing Theoretic Model for Service Discovery in Ad-hoc Networks]]></pub:title>
    <pub:publishedOn rdf:datatype="&xsd;dateTime">2004-01-31T00:00:00-05:00</pub:publishedOn>
    <pub:abstract><![CDATA[This paper describes an analytical model for service discovery protocols in ad-hoc networks. We propose a bottom-up approach towards modeling various essential features of distributed service discovery protocols. More specifically this paper proposes a method to analytically model the service cache (SC) on an ad-hoc node. 
%A Service Cache stores service advertisements. 
We employ the use of stochastic process models and fundamental queuing theory to model the data present in the cache. We show using simulations how our model can be used to predict the service cache usage at the node level. 
Our model is based on the assumption of non-preemption of service descriptions from the service cache and that the system is at steady state. We assume that there are infinite number of services in the system.  
We also experimentally verify that our model predicts the service system behavior reasonably well even when the assumption of infinite services does not hold.
]]></pub:abstract>
    <pub:counter>1865</pub:counter>
    <pub:googleKey>gWtbGrL5eR0J</pub:googleKey>
    <pub:googleCitations>6</pub:googleCitations>
    <pub:booktitle><![CDATA[Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS)]]></pub:booktitle>
    <pub:author>
       <rdf:List>
         <rdf:first><person:Alumnus rdf:about="http://ebiquity.umbc.edu/person/html/Dipanjan/Chakraborty/"><person:name><![CDATA[Dipanjan  Chakraborty]]></person:name><rdfs:label><![CDATA[Dipanjan  Chakraborty]]></rdfs:label></person:Alumnus></rdf:first>
         <rdf:rest>
           <rdf:List>
             <rdf:first><person:Alumnus rdf:about="http://ebiquity.umbc.edu/person/html/Avinash/Shenoi/"><person:name><![CDATA[Avinash  Shenoi]]></person:name><rdfs:label><![CDATA[Avinash  Shenoi]]></rdfs:label></person:Alumnus></rdf:first>
             <rdf:rest>
               <rdf:List>
                 <rdf:first><person:PrincipalFaculty rdf:about="http://ebiquity.umbc.edu/person/html/Yelena/Yesha/"><person:name><![CDATA[Yelena  Yesha]]></person:name><rdfs:label><![CDATA[Yelena  Yesha]]></rdfs:label></person:PrincipalFaculty></rdf:first>
                 <rdf:rest>
                   <rdf:List>
                     <rdf:first><person:AffiliatedFaculty rdf:about="http://ebiquity.umbc.edu/person/html/Yaacov/Yesha/"><person:name><![CDATA[Yaacov  Yesha]]></person:name><rdfs:label><![CDATA[Yaacov  Yesha]]></rdfs:label></person:AffiliatedFaculty></rdf:first>
                     <rdf:rest>
                       <rdf:List>
                         <rdf:first><person:PrincipalFaculty rdf:about="http://ebiquity.umbc.edu/person/html/Anupam/Joshi/"><person:name><![CDATA[Anupam  Joshi]]></person:name><rdfs:label><![CDATA[Anupam  Joshi]]></rdfs:label></person:PrincipalFaculty></rdf:first>
                         <rdf:rest rdf:resource="&rdf;nil" />
                       </rdf:List>
                     </rdf:rest>
                   </rdf:List>
                 </rdf:rest>
               </rdf:List>
             </rdf:rest>
           </rdf:List>
         </rdf:rest>
       </rdf:List>
    </pub:author>
    <pub:firstAuthor><person:Alumnus rdf:about="http://ebiquity.umbc.edu/person/html/Dipanjan/Chakraborty/"><person:name><![CDATA[Dipanjan  Chakraborty]]></person:name><rdfs:label><![CDATA[Dipanjan  Chakraborty]]></rdfs:label></person:Alumnus></pub:firstAuthor>
    <pub:relatedProject><project:PastProject rdf:about="http://ebiquity.umbc.edu/project/html/id/37/Anamika-Distributed-Service-Discovery-and-Composition-for-Pervasive-Environments"><project:title><![CDATA[Anamika: Distributed Service Discovery and Composition for Pervasive Environments]]></project:title><rdfs:label><![CDATA[Anamika: Distributed Service Discovery and Composition for Pervasive Environments]]></rdfs:label></project:PastProject></pub:relatedProject>
    <pub:softCopy><pub:SoftCopy>
      <pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
      <pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/103.pdf]]></pub:softCopyURI>
      <pub:softCopySize>203981</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>

