Wei Yan
ABSTRACT
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.
- Gnutella. http://www.gnutella.com.Google Scholar
- I. Aekaterinidis and P. Triantafillou. Pastrystrings: A comprehensive content-based publish/subscribe DHT network. In ICDCS, 2006. Google ScholarDigital Library
- M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra. Matching events in a content-based subscription system. In PODC, 1999. Google ScholarDigital Library
- R. Ahmed, N. Limam, J. Xiao, Y. Iraqi, and R. Boutaba. Resource and service discovery in large-scale multi-domain networks. IEEE Communications Surveys&Tutorials, 9(4), 2007. Google ScholarDigital Library
- A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. 2004.Google Scholar
- L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web catching and Zipf-like distributions: Evidence and implications. In INFOCOM, 1999.Google ScholarCross Ref
- R. Chand and P. Felber. XNET: A reliable content-based publish/subscribe system. In SRDS, 2004. Google ScholarDigital Library
- A. S. Cheema, M. Muhammad, and I. Gupta. Peer-to-peer discovery of computational resources for grid applications. In GRID, 2005. Google ScholarDigital Library
- K. Czajkowski, C. Kesselman, S. Fitzgerald, and I. Foster. Grid information services for distributed resource sharing. IEEE HPDC, 2001. Google ScholarDigital Library
- F. Fabret, H.-A. Jacobsen, L. F, J. Pereira, K. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe systems. In A CM SIGMOD, 2001. Google ScholarDigital Library
- E. Fidler, H.-A. Jacobsen, G. Li, and S. Mankovski. The PADRES distributed publish/subscribe system. In ICFI, 2005.Google Scholar
- A. Gupta, O. D. Sahin, D. Agrawal, and A. E. Abbadi. Meghdoot: Content-based publish/subscribe over P2P networks. In ACM Middleware, 2004. Google ScholarDigital Library
- S. Hu, V. Muthusamy, G. Li, and H.-A. Jacobsen. Distributed automatic service composition in large-scale systems. In DEBS, 2008. Google ScholarDigital Library
- A. Iamnitchi, I. Foster, and D. C. Nurmi. A peer-to-peer approach to resource discovery in grid environments. In IEEE HPDC, 2002. Google ScholarDigital Library
- R. S. Kazemzadch and H.-A. Jacobsen. Delta-fault-tolerant publish/subscribe systems. Tech Report, Univ. of Toronto, 2007.Google Scholar
- G. Li, A. Cheung, S. Hou, S. Hu, V. Muthusamy, R. Sherafat, A. Wun, H.-A. Jacobsen, and S. Manovski. Historic data access in publish/subscribe. In DEBS, 2007. Google ScholarDigital Library
- G. Li, S. Hou, and H.-A. Jacobsen. Routing of XML and XPath queries in data dissemination networks. In IEEE ICDCS, 2008. Google ScholarDigital Library
- G. Li and H.-A. Jacobsen. Composite subscriptions in content-based publish/subscribe systems. In ACM Middleware, 2005. Google ScholarDigital Library
- D. Lynch. A proactive approach of semantically oriented service discovery. Master's thesis, Trinity College Dublin, 2005.Google Scholar
- V. Muthusamy and H.-A. Jacobsen. Small-scale peer-to-peer publish/subscribe. In P2P Knowledge Management Workshop at MobiQuitous, July 2005.Google Scholar
- G. P. Picco, G. Cugola, and A. L. Murphy. Efficient content-based event dispatching in presence of topological reconfiguration. In ICDCS, 2003. Google ScholarDigital Library
- R. Raman, M. Livny, and M. Solomon. Matchmaking: distributed resource management for high throughput computing. In IEEE HPDC, 1998. Google ScholarDigital Library
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In ACM SIGCOMM, 2001. Google ScholarDigital Library
- P. Rompothong and T. Senivongse. A query federation of UDDI registries. In Proc. of the 1st International Symposium on Information and Communication Technologies. Trinity College Dublin, 2003. Google ScholarDigital Library
- A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In ACM Middleware, 2001.Google ScholarCross Ref
- I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM, 2001. Google ScholarDigital Library
- B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and and routing. Technical report, Berkeley, CA, USA, 2001.Google Scholar
Index Terms
- Efficient event-based resource discovery
Recommendations
Resource descriptions, ontology, and resource discovery
Resource discovery systems may assist scientists in the selection of bioinformatics resources suitable to implement scientific workflows. In this paper we address several problems related to resource discovery. They include resource publication formats, ...
Resource and application-aware resource discovery in computing environments
Efficient resource discovery plays a vital role in the effective management of resources and applications in heterogeneous computing environments. Therefore, the knowledge of applications' behavior and resources' usage pattern improves resource ...
A time-to-live based reservation algorithm on fully decentralized resource discovery in Grid computing
We present an alternative algorithm of fully decentralized resource discovery in Grid computing, which enables the sharing, selection, and aggregation of a wide variety of geographically distributed computational resources. Our algorithm is based on a ...
Comments