TY - GEN
T1 - Optimizing correlation structure of event services considering time and capacity constraints
AU - Zhang, Bin
AU - Al-Shaer, Ehab
PY - 2009
Y1 - 2009
N2 - Constructing optimal event correlation architecture is crucial to large-scale event services. It plays an instrumental role in detecting composite events requested by different subscribers in scalable and timely manner. However, events generated from different sources might have different time and priority requirements. In addition, the network links and correlation servers might have different bandwidth and processing constraints respectively. In this work, we address the problem of optimizing distributed event correlation to maximize the correlation profit (benefit minus shipping and processing cost) of detecting composite events, while at the same time satisfying the network bandwidth, node capacity, and correlation tasks time constrains. We show that this problem is NP-hard and provide a heuristic approximation algorithm. We evaluate our heuristic approach with different network sizes, topologies under different event delivery and detection requirements. Our simulation study shows that the results obtained by our heuristic are close to the upper bound.
AB - Constructing optimal event correlation architecture is crucial to large-scale event services. It plays an instrumental role in detecting composite events requested by different subscribers in scalable and timely manner. However, events generated from different sources might have different time and priority requirements. In addition, the network links and correlation servers might have different bandwidth and processing constraints respectively. In this work, we address the problem of optimizing distributed event correlation to maximize the correlation profit (benefit minus shipping and processing cost) of detecting composite events, while at the same time satisfying the network bandwidth, node capacity, and correlation tasks time constrains. We show that this problem is NP-hard and provide a heuristic approximation algorithm. We evaluate our heuristic approach with different network sizes, topologies under different event delivery and detection requirements. Our simulation study shows that the results obtained by our heuristic are close to the upper bound.
UR - http://www.scopus.com/inward/record.url?scp=70449333342&partnerID=8YFLogxK
U2 - 10.1109/INM.2009.5188811
DO - 10.1109/INM.2009.5188811
M3 - Conference contribution
AN - SCOPUS:70449333342
SN - 9781424434879
T3 - 2009 IFIP/IEEE International Symposium on Integrated Network Management, IM 2009
SP - 203
EP - 210
BT - 2009 IFIP/IEEE International Symposium on Integrated Network Management, IM 2009
T2 - 2009 IFIP/IEEE International Symposium on Integrated Network Management, IM 2009
Y2 - 1 June 2009 through 5 June 2009
ER -