{"title":"DCEP-Sim: An Open Simulation Framework for Distributed CEP","authors":"Fabrice Starks, T. Plagemann, Stein Kristiansen","doi":"10.1145/3093742.3093919","DOIUrl":"https://doi.org/10.1145/3093742.3093919","url":null,"abstract":"Distributed Complex Event Processing (CEP) is gaining increasing interest for two reasons: (1) to scale system performance to handle higher workloads in real-time, and (2) to perform in-network processing, e.g., in mobile networks to reduce the amount of data that has to be transferred through the network. System scalability and the complexity of mobile systems are some of the major challenges when evaluating the performance of new Distributed CEP solutions. We propose an open framework for distributed CEP (DCEP-Sim) built on a well-established network simulator, i.e, ns-3. The design of DCEP-Sim is based on the engineering principles of separation of concerns and the separation of mechanisms and policies. By leveraging the ns-3 feature of object aggregation it is very easy to add new policies, e.g., placement or selection policies, and evaluate them without changing anything else in the DCEP-Sim. The fact that ns-3 includes many accurate network models implies that Distributed CEP simulation with DCEP-Sim will also be much more accurate than ad-hoc handcrafted simulations. We demonstrate in a use case how easy it is to configure performance evaluation experiments and we perform experiments to confirm that the integration of the Distributed CEP in ns-3 is good foundation for large-scale experiments. The evaluation results demonstrate that DCEP-Sim substantially reduces the effort and costs of Distributed CEP evaluation.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115044692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Large-Scale Stream Graph Processing: Doctoral Symposium","authors":"D. Margan, P. Pietzuch","doi":"10.1145/3093742.3093907","DOIUrl":"https://doi.org/10.1145/3093742.3093907","url":null,"abstract":"Dynamically changing graphs are a powerful abstraction used to represent temporal relationships and connections occurring between data entities in various real-world organizations, such as social and telecommunication networks. The increasing volume, variety and velocity of graph-structured data in many application domains have led to a development of large-scale graph processing systems. However, current state-of-the-art graph processing systems do not provide efficient support for streaming graph scenarios. In this report, we describe and discuss stream graph processing, which narrows the problem of traditional graph processing by focusing on near real-time analysis of dynamic graph data constructed and maintained from stream sources, as opposed to processing of historical graph datasets loaded from a disk storage. We provide an outline of challenges in stream graph processing and present our preliminary approach to designing a stream graph processing system done as a part of early PhD work.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115503917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"One for All and All for One: Simultaneous Approximation of Multiple Functions over Distributed Streams","authors":"A. Lazerson, Moshe Gabel, D. Keren, A. Schuster","doi":"10.1145/3093742.3093918","DOIUrl":"https://doi.org/10.1145/3093742.3093918","url":null,"abstract":"Distributed monitoring methods address the difficult problem of continuously approximating functions over distributed streams, while minimizing the communication cost. However, existing methods are concerned with the approximation of a single function at a time. Employing these methods to track multiple functions will multiply the communication volume, thus eliminating their advantage in the first place. We introduce a novel approach that can be applied to multiple functions. Our method applies a communication reduction scheme to the set of functions, rather than to each function independently, keeping a low communication volume. Evaluation on several real-world datasets shows that our method can track many functions with reduced communication, in most cases incurring only a negligible increase in communication over distributed approximation of a single function.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128866065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sukanya Bhowmik, M. Tariq, Alexander Balogh, K. Rothermel
{"title":"Addressing TCAM Limitations of Software-Defined Networks for Content-Based Routing","authors":"Sukanya Bhowmik, M. Tariq, Alexander Balogh, K. Rothermel","doi":"10.1145/3093742.3093924","DOIUrl":"https://doi.org/10.1145/3093742.3093924","url":null,"abstract":"In recent years, content-based publish/subscribe middleware has harnessed the power of Software-Defined Networking (SDN) to leverage performance gains in terms of throughput rates, end-to-end latency, etc. To this end, content filters are directly installed on the Ternary Content Addressable Memory (TCAM) of switches. Such a middleware assumes unlimited TCAM space to deploy content filters. However, in reality, TCAM is a scarce resource and the number of flow table entries available for publish/subscribe traffic is severely limited. While such a limitation poses severe problems for the deployment of publish/subscribe middleware in practice, it is yet to be addressed in literature. So, in this paper, we design a filter aggregation algorithm that merges content filters on individual switches to respect TCAM constraints while ensuring minimal increase in unnecessary network traffic. Our algorithm uses the knowledge of advertisements, subscriptions, and a global view of the network state to perform bandwidth-efficient aggregation decisions on necessary switches. We provide different flavors of this algorithm with varying degrees of accuracy and complexity and thoroughly evaluate their performances under realistic workload. Our evaluation results show that our designed aggregation algorithm successfully meets TCAM constraints on switches while also reducing unnecessary traffic introduced in the network due to aggregation as compared to a baseline approach by up to 99.9%.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132015533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Suad Sejdovic, Sven Euting, Dominik Riemer, York Sure-Vetter
{"title":"Considering Human Factors in the Development of Situation-Aware CEP Applications: New Direction Paper","authors":"Suad Sejdovic, Sven Euting, Dominik Riemer, York Sure-Vetter","doi":"10.1145/3093742.3093916","DOIUrl":"https://doi.org/10.1145/3093742.3093916","url":null,"abstract":"Stream processing has emerged as the major paradigm to tackle the digital information flood. Within stream processing, complex event processing (CEP) represents a pattern-based approach that enables automated situation detection and real-time monitoring. One deficit of CEP applications is the negligence of the evolution of situations, as only two states are differentiated with regard to the occurrence of situations: detected and not detected. This behavior might lead to critical situations due to a decreased comprehensibility for operators. On the other side situation awareness (SAW) is a recognized psychological model describing the characteristics and mechanisms of operators responsible for complex systems. In this paper, we combine the technological method CEP with the human factors identified in SAW to determine the missing links. In order to bridge the gap, this paper presents an extension of the state-of-the-art situation lifecycle to support SAW to its full extent. Furthermore, requirements for situation-aware CEP applications are derived and a methodology to develop such applications is proposed.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133201012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Miyuru Dayarathna, Minudika Malshan, S. Perera, Malith Jayasinghe
{"title":"Scalable Complex Event Processing on a Notebook: Demo","authors":"Miyuru Dayarathna, Minudika Malshan, S. Perera, Malith Jayasinghe","doi":"10.1145/3093742.3095093","DOIUrl":"https://doi.org/10.1145/3093742.3095093","url":null,"abstract":"Recently data analytics notebooks are becoming attractive tool for data science experiments. While data analytics notebooks have been frequently used for batch analytics applications there are multiple unique problems which need to be addressed when they are used for online analytics scenarios. Issues such as mapping the event processing model into notebooks, summarizing data streams to enable visualizations, scalability of distributed event processing pipelines in notebook servers remain as some of the key issues to be solved. As a solution in this demonstration we present an implementation of event processing paradigm in a notebook environment. Specifically, we implement WSO2 Data Analytics Server (DAS)'s event processor in Apache Zeppelin notebook environment. We first demonstrate how an event processing network could be implemented in a stream processing notebook itself. Second, we demonstrate how such network could be extended for distributed stream processing scenario using WSO2 DAS and Apache Storm. Also we discuss about various improvements which need to be done at the user interface aspects to develop stream processing network in such notebook environment.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133885983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Artikis, Nikos Katzouris, Ivo Correia, Chris Baber, Natan Morar, Inna Skarbovsky, Fabiana Fournier, G. Paliouras
{"title":"A Prototype for Credit Card Fraud Management: Industry Paper","authors":"A. Artikis, Nikos Katzouris, Ivo Correia, Chris Baber, Natan Morar, Inna Skarbovsky, Fabiana Fournier, G. Paliouras","doi":"10.1145/3093742.3093912","DOIUrl":"https://doi.org/10.1145/3093742.3093912","url":null,"abstract":"To prevent problems and capitalise on opportunities before they even occur, the research project SPEEDD proposed a methodology, and developed a prototype for proactive event-driven decisionmaking. We present the application of this methodology to credit card fraud management. The machine learning component of the SPEEDD prototype supports the online construction of fraud patterns, allowing it to efficiently adapt to the continuously changing fraud types. Moreover, the user interface of the prototype enables fraud analysts to make the most out of the results of automation (complex event processing) and thus reach informed decisions. Unlike most academic research on credit card fraud management, the assessment of the prototype (components) is based on representative transaction datasets, allowing for a realistic evaluation.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"55 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116013137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Vincenzo Gulisano, A. Papadopoulos, Y. Nikolakopoulos, M. Papatriantafilou, P. Tsigas
{"title":"Performance Modeling of Stream Joins","authors":"Vincenzo Gulisano, A. Papadopoulos, Y. Nikolakopoulos, M. Papatriantafilou, P. Tsigas","doi":"10.1145/3093742.3093923","DOIUrl":"https://doi.org/10.1145/3093742.3093923","url":null,"abstract":"Streaming analysis is widely used in a variety of environments, from cloud computing infrastructures up to the network's edge. In these contexts, accurate modeling of streaming operators' performance enables fine-grained prediction of applications' behavior without the need of costly monitoring. This is of utmost importance for computationally-expensive operators like stream joins, that observe throughput and latency very sensitive to rate-varying data streams, especially when deterministic processing is required. In this paper, we present a modeling framework for estimating the throughput and the latency of stream join processing. The model is presented in an incremental step-wise manner, starting from a centralized non-deterministic stream join and expanding up to a deterministic parallel stream join. The model describes how the dynamics of throughput and latency are influenced by the number of physical input streams, as well as by the amount of parallelism in the actual processing and the requirement for determinism. We present an experimental validation of the model with respect to the actual implementation. The proposed model can provide insights that are catalytic for understanding the behavior of stream joins against different system deployments, with special emphasis on the influences of determinism and parallelization.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125919898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Aleksandar Antonic, M. Marjanović, Ivana Podnar Žarko
{"title":"Modeling Aggregate Input Load of Interoperable Smart City Services","authors":"Aleksandar Antonic, M. Marjanović, Ivana Podnar Žarko","doi":"10.1145/3093742.3093928","DOIUrl":"https://doi.org/10.1145/3093742.3093928","url":null,"abstract":"The Internet of Things (IoT) is expanding and reaching the maturity level beyond initial deployments. An integrative and interoperable IoT platform proves to be a suitable execution environment for Smart City services because users simultaneously use multiple services, while an IoT platform enables cross-service data sharing. A large number of various IoT and mobile devices as well as the corresponding services can generate tremendous input load on an underlying IoT platform. Thus, it is crucial to analyze the overall input rate on Smart City services to ensure predefined quality of service (e.g., low latency required by some IoT services). An aggregate input rate which characterizes a real world deployment can be used to check if a platform is able to adequately support multiple services running in parallel and to evaluate its overall performance. In this paper we review IoT-based Smart City services to identify key applications characterizing the domain, e.g., smart mobility, smart utilities, and citizen-driven mobile crowd sensing services. Next, we analyze the potential load which such applications pose on IoT services that continuously process the generated data streams. The analysis is used to create a model estimating an aggregate load generated by Smart City applications. We simulate a number of characteristic application compositions to provide insight about the aggregate input load and its potential impact on the performance of Smart City services. The proposed model is a first step towards predicting the processing load of Smart City services to facilitate the assessment and planning of required resources for continuous processing of sensor data in the context of Smart City services.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129776315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Customer Experience Case: The Needle in the Haystack","authors":"Sergi Zapater","doi":"10.1145/3093742.3098278","DOIUrl":"https://doi.org/10.1145/3093742.3098278","url":null,"abstract":"Telecommunications usage is growing, with mobile broadband being at the forefront. Mobile operators need to cope with a massive amount of data to provide exceptional services and keep their end Subscribers. In this highly competitive context, Subscribers demand useful care services in real time.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133151734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}