A Queueing Theoretic Model for Service Discovery in Ad-hoc Networks

Simple item page
dc.contributor.authorChakraborty, Dipanjan
dc.contributor.authorShenoi, Avinash
dc.contributor.authorYesha, Yelena
dc.contributor.authorYesha, Yaacov
dc.contributor.authorJoshi, Anupam
dc.contributor.authorSinghal, Mukesh
dc.date.accessioned2018-12-13T16:01:17Z
dc.date.available2018-12-13T16:01:17Z
dc.date.issued2004-01-31
dc.descriptionCommunication Networks and Distributed Systems Modeling and Simulation Conference (CNDS)en_US
dc.description.abstractThis 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.en_US
dc.description.urihttps://ebiquity.umbc.edu/paper/html/id/179/A-Queueing-Theoretic-Model-for-Service-Discovery-in-Ad-hoc-Networksen_US
dc.format.extent7 pagesen_US
dc.genreconference papers and proceedings preprintsen_US
dc.identifierdoi:10.13016/M2VX0670B
dc.identifier.urihttp://hdl.handle.net/11603/12251
dc.language.isoen_USen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department Collection
dc.relation.ispartofUMBC Faculty Collection
dc.relation.ispartofUMBC Student Collection
dc.rightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
dc.subjectservice discoveryen_US
dc.subjectqueuing theoryen_US
dc.subjectad-hoc networksen_US
dc.subjectUMBC Ebiquity Research Groupen_US
dc.titleA Queueing Theoretic Model for Service Discovery in Ad-hoc Networksen_US
dc.typeTexten_US

Files

License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.56 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

UMBC Computer Science and Electrical Engineering Department
UMBC Faculty Collection
UMBC Student Collection