Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Matchmaking: Distributed Resource Management for High Throughput Computing
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
A Peer-to-Peer Approach to Resource Location in Grid Environments
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Efficient Content-Based Event Dispatching in the Presence of Topological Reconfiguration
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
A query federation of UDDI registries
ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
XNET: A Reliable Content-Based Publish/Subscribe System
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Peer-to-Peer Discovery of Computational Resources for Grid Applications
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Historic data access in publish/subscribe
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Distributed automatic service composition in large-scale systems
Proceedings of the second international conference on Distributed event-based systems
Routing of XML and XPath Queries in Data Dissemination Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Composite subscriptions in content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Resource and service discovery in large-scale multi-domain networks
IEEE Communications Surveys & Tutorials
Load Balancing Content-Based Publish/Subscribe Systems
ACM Transactions on Computer Systems (TOCS)
BPM in cloud architectures: business process management with SLAs and events
BPM'10 Proceedings of the 8th international conference on Business process management
A distributed framework for reliable and efficient service choreographies
Proceedings of the 20th international conference on World wide web
A framework for automatically supporting end-users in service composition
The smart internet
A framework for automatically supporting end-users in service composition
The smart internet
eQoSystem: supporting fluid distributed service-oriented workflows
Proceedings of the 5th ACM international conference on Distributed event-based system
Gossiping for resource discovering: An analysis based on complex network theory
Future Generation Computer Systems
Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments
ACM Computing Surveys (CSUR)
Service subscription and consumption for personal web applications
The Personal Web
| Hi-index | 0.00 |
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more dynamic discovery scenarios, including efficient discovery of resources whose attributes can change, and continuous monitoring for resources that satisfy a set of constraints. Furthermore, algorithms are developed to optimize the discovery cost by reusing results among similar concurrent discovery requests. Detailed evaluations under various workload distributions demonstrate the feasibility of the architecture and show significant benefits of the optimizations in terms of network traffic and discovery processing time.