Efficient algorithms for selecting optimal data collection locations in business process management

Yue Zhang*, Kwei Jay Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The flexibility and dynamism of service-oriented architecture (SOA) makes it critical to monitor and manage services behaviors at runtime for performance assurance. In this paper, two efficient evidence channel selection (ECS) algorithms are designed to select service run-time data collection locations for business process management. The design of ESC algorithms are based on the classic facilities location problems: k-median and Set-Covering. The performance study shows that these ECS algorithms significantly reduce data collection cost and achieve better diagnosis correctness compared to random ECS selection.

Original languageEnglish
Title of host publicationIEEE International Conference on e-Business Engineering, ICEBE'08 - Workshops
Subtitle of host publicationAiR'08, EM2I'08, SOAIC'08, SOKM'08, BIMA'08, DKEEE'08
Pages747-752
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
EventIEEE International Conference on e-Business Engineering, ICEBE'08 - Xi'an, China
Duration: 22 10 200824 10 2008

Publication series

NameIEEE International Conference on e-Business Engineering, ICEBE'08 - Workshops: AiR'08, EM2I'08, SOAIC'08, SOKM'08, BIMA'08, DKEEE'08

Conference

ConferenceIEEE International Conference on e-Business Engineering, ICEBE'08
Country/TerritoryChina
CityXi'an
Period22/10/0824/10/08

Fingerprint

Dive into the research topics of 'Efficient algorithms for selecting optimal data collection locations in business process management'. Together they form a unique fingerprint.

Cite this