Efficient event-based resource discovery

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient event-based resource discovery

Full text

Pdf (1.25 MB)

Source

Distributed event-based systems archive
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems table of contents

Nashville, Tennessee

SESSION: Decentralized, peer-to-peer, and sensor systems table of contents

Article No. 19

Year of Publication: 2009

ISBN:978-1-60558-665-6

Authors

Wei Yan	Chinese Academy of Sciences, Beijing, China
Songlin Hu	Chinese Academy of Sciences, Beijing, China
Vinod Muthusamy	University of Toronto, Toronto, Canada
Hans-Arno Jacobsen	University of Toronto, Toronto, Canada
Li Zha	Chinese Academy of Sciences, Beijing, China

Sponsor

: ACM

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 12, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1619258.1619284 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Gnutella. http://www.gnutella.com.
	2	I. Aekaterinidis and P. Triantafillou. Pastrystrings: A comprehensive content-based publish/subscribe DHT network. In ICDCS, 2006.
	3	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.
	4	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.
	5	A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. 2004.
	6	L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web catching and Zipf-like distributions: Evidence and implications. In INFOCOM, 1999.
	7	R. Chand and P. Felber. XNET: A reliable content-based publish/subscribe system. In SRDS, 2004.
	8	A. S. Cheema, M. Muhammad, and I. Gupta. Peer-to-peer discovery of computational resources for grid applications. In GRID, 2005.
	9	K. Czajkowski, C. Kesselman, S. Fitzgerald, and I. Foster. Grid information services for distributed resource sharing. IEEE HPDC, 2001.
	10	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.
	11	E. Fidler, H.-A. Jacobsen, G. Li, and S. Mankovski. The PADRES distributed publish/subscribe system. In ICFI, 2005.
	12	A. Gupta, O. D. Sahin, D. Agrawal, and A. E. Abbadi. Meghdoot: Content-based publish/subscribe over P2P networks. In ACM Middleware, 2004.
	13	S. Hu, V. Muthusamy, G. Li, and H.-A. Jacobsen. Distributed automatic service composition in large-scale systems. In DEBS, 2008.
	14	A. Iamnitchi, I. Foster, and D. C. Nurmi. A peer-to-peer approach to resource discovery in grid environments. In IEEE HPDC, 2002.
	15	R. S. Kazemzadch and H.-A. Jacobsen. Delta-fault-tolerant publish/subscribe systems. Tech Report, Univ. of Toronto, 2007.
	16	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.
	17	G. Li, S. Hou, and H.-A. Jacobsen. Routing of XML and XPath queries in data dissemination networks. In IEEE ICDCS, 2008.
	18	G. Li and H.-A. Jacobsen. Composite subscriptions in content-based publish/subscribe systems. In ACM Middleware, 2005.
	19	D. Lynch. A proactive approach of semantically oriented service discovery. Master's thesis, Trinity College Dublin, 2005.
	20	V. Muthusamy and H.-A. Jacobsen. Small-scale peer-to-peer publish/subscribe. In P2P Knowledge Management Workshop at MobiQuitous, July 2005.
	21	G. P. Picco, G. Cugola, and A. L. Murphy. Efficient content-based event dispatching in presence of topological reconfiguration. In ICDCS, 2003.
	22	R. Raman, M. Livny, and M. Solomon. Matchmaking: distributed resource management for high throughput computing. In IEEE HPDC, 1998.
	23	S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In ACM SIGCOMM, 2001.
	24	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.
	25	A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In ACM Middleware, 2001.
	26	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.
	27	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.

INDEX TERMS

Keywords:
content-based publish/subscribe, covering, publish/subscribe applications, resource discovery, service discovery, subscription similarity

Adobe Acrobat

QuickTime

Windows Media Player

Real Player