Design of a Location-based Publish/Subscribe Service using a Graph-based Computing Model
2017-11-21
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Design of a Location-based Publish/Subscribe Service using a Graph-based Computing Model
Authors
Published Date
2017-11-21
Publisher
Type
Report
Abstract
We present here the initial results of our investigation of a system architecture for location-based publish/subscribe services utilizing a graph-based model for managing data and computations. This architecture is implemented on a cluster computer using the facilities and the computation model provided by the Beehive framework which supports a transactional model of parallel computing on dynamic graph data structures. We implemented a {em Museum Visitor Service} as an example of a location-based publish/subscribe system to study and evaluate the performance this approach. This service includes features utilizing location-based publish/subscribe functions for supporting coordination and collaboration among members in a social group visiting the museum. We implemented a testbed system for this service and evaluated its performance on a cluster computer. Our work also illustrates that weaker consistency models for transactions can be utilized in such services to achieve higher performance and scalability.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Tripathi, Anand; Hoang, Henry. (2017). Design of a Location-based Publish/Subscribe Service using a Graph-based Computing Model. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/216015.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.