Efficient event-based resource discovery

Wei Yan; Songlin Hu; Vinod Muthusamy; Hans Arno Jacobsen; Li Zha

doi:10.1145/1619258.1619284

Efficient event-based resource discovery

Wei Yan
, Songlin Hu
, Vinod Muthusamy
, Hans Arno Jacobsen
, Li Zha

Institute of Computing Technology Chinese Academy of Sciences
University of Chinese Academy of Sciences
University of Toronto

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

24 Scopus citations

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.

Original language	English
Title of host publication	Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009
Publisher	Association for Computing Machinery
ISBN (Print)	9781605586656
DOIs	https://doi.org/10.1145/1619258.1619284
State	Published - 2009
Externally published	Yes
Event	3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009 - Nashville, TN, United States Duration: 6 Jul 2009 → 9 Jul 2009

Publication series

Name	Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009
Volume	2009-January

Conference

Conference	3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009
Country/Territory	United States
City	Nashville, TN
Period	6/07/09 → 9/07/09

Keywords

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

Access to Document

10.1145/1619258.1619284

Cite this

Yan, W., Hu, S., Muthusamy, V., Jacobsen, H. A., & Zha, L. (2009). Efficient event-based resource discovery. In Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009 Article 19 (Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009; Vol. 2009-January). Association for Computing Machinery. https://doi.org/10.1145/1619258.1619284

@inproceedings{8398b2ff34a042c7a57de901e5eed87e,

title = "Efficient event-based resource discovery",

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.",

keywords = "content-based publish/subscribe, covering, publish/subscribe applications, resource discovery, service discovery, subscription similarity",

author = "Wei Yan and Songlin Hu and Vinod Muthusamy and Jacobsen, \{Hans Arno\} and Li Zha",

note = "Publisher Copyright: {\textcopyright} 2009 ACM.; 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009 ; Conference date: 06-07-2009 Through 09-07-2009",

year = "2009",

doi = "10.1145/1619258.1619284",

language = "English",

isbn = "9781605586656",

series = "Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009",

publisher = "Association for Computing Machinery",

booktitle = "Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009",

}

Yan, W, Hu, S, Muthusamy, V, Jacobsen, HA & Zha, L 2009, Efficient event-based resource discovery. in Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009., 19, Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009, vol. 2009-January, Association for Computing Machinery, 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009, Nashville, TN, United States, 6/07/09. https://doi.org/10.1145/1619258.1619284

Efficient event-based resource discovery. / Yan, Wei; Hu, Songlin; Muthusamy, Vinod et al.
Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009. Association for Computing Machinery, 2009. 19 (Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009; Vol. 2009-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient event-based resource discovery

AU - Yan, Wei

AU - Hu, Songlin

AU - Muthusamy, Vinod

AU - Jacobsen, Hans Arno

AU - Zha, Li

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - content-based publish/subscribe

KW - covering

KW - publish/subscribe applications

KW - resource discovery

KW - service discovery

KW - subscription similarity

UR - https://www.scopus.com/pages/publications/85139861057

U2 - 10.1145/1619258.1619284

DO - 10.1145/1619258.1619284

M3 - Conference contribution

AN - SCOPUS:85139861057

SN - 9781605586656

T3 - Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009

BT - Proceedings of the 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009

PB - Association for Computing Machinery

T2 - 3rd ACM International Conference on Distributed Event-Based Systems, DEBS 2009

Y2 - 6 July 2009 through 9 July 2009

ER -

Efficient event-based resource discovery

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this