Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Analytical models (2)
- Delay (2)
- Probability (2)
- Accuracy (1)
- Age-based selection (1)
-
- Age-proportional graphs (1)
- Algorithm design and analysis (1)
- Arbitrary age-biased neighbor-selection algorithm (1)
- Automatic Query Optimization (1)
- Big Data (1)
- Botnet proliferation (1)
- Bro (1)
- Chen-Stein theorem (1)
- Classification (1)
- Cloud computing (1)
- Clustering (1)
- Complex Event Processing (1)
- Complex event processing (1)
- Computer network security (1)
- Computer science (1)
- Computer viruses (1)
- Exponential user lifetimes (1)
- Failure analysis (1)
- Fast scan techniques (1)
- Finite-size graphs (1)
- Genetic Algorithms (1)
- Graph partitioning (1)
- Graph theory (1)
- Grid Computing (1)
- Grid Scheduling (1)
- File Type
Articles 1 - 9 of 9
Full-Text Articles in Systems Architecture
Metalogic Notes, Saverio Perugini
Metalogic Notes, Saverio Perugini
Saverio Perugini
A collection of notes, formulas, theorems, postulates and terminology in symbolic logic, syntactic notions, semantic notions, linkages between syntax and semantics, soundness and completeness, quantified logic, first-order theories, Goedel's First Incompleteness Theorem and more.
Statistics Notes, Saverio Perugini
Statistics Notes, Saverio Perugini
Saverio Perugini
A collection of terms, definitions, formulas and explanations about statistics.
Query Analyzer And Manager For Complex Event Processing As A Service, Wilson Higashino, Cedric Eichler, Miriam A M Capretz, Thierry Monteil, M. Beatriz F. Toledo, Patricia Stolf
Query Analyzer And Manager For Complex Event Processing As A Service, Wilson Higashino, Cedric Eichler, Miriam A M Capretz, Thierry Monteil, M. Beatriz F. Toledo, Patricia Stolf
Wilson A Higashino
Complex Event Processing (CEP) is a set of tools and techniques that can be used to obtain insights from high-volume, high-velocity continuous streams of events. CEP-based systems have been adopted in many situations that require prompt establishment of system diagnostics and execution of reaction plans, such as in monitoring of complex systems. This article describes the Query Analyzer and Manager (QAM) module, a first effort toward the development of a CEP as a Service (CEPaaS) system. This module is responsible for analyzing user-defined CEP queries and for managing their execution in distributed cloud-based environments. Using a language-agnostic internal query representation, …
Evaluation Of Particle Swarm Optimization Applied To Grid Scheduling, Wilson Higashino, Miriam Capretz, M. Beatriz Toledo
Evaluation Of Particle Swarm Optimization Applied To Grid Scheduling, Wilson Higashino, Miriam Capretz, M. Beatriz Toledo
Wilson A Higashino
The problem of scheduling independent users’ jobs to resources in Grid Computing systems is of paramount importance. This problem is known to be NP-hard, and many techniques have been proposed to solve it, such as heuristics, genetic algorithms (GA), and, more recently, particle swarm optimization (PSO). This article aims to use PSO to solve grid scheduling problems, and compare it with other techniques. It is shown that many often-overlooked implementation details can have a huge impact on the performance of the method. In addition, experiments also show that the PSO has a tendency to stagnate around local minima in high-dimensional …
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Zhongmei Yao
Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …
Stochastic Analysis Of Horizontal Ip Scanning, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Stochastic Analysis Of Horizontal Ip Scanning, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Zhongmei Yao
Intrusion Detection Systems (IDS) have become ubiquitous in the defense against virus outbreaks, malicious exploits of OS vulnerabilities, and botnet proliferation. As attackers frequently rely on host scanning for reconnaissance leading to penetration, IDS is often tasked with detecting scans and preventing them. However, it is currently unknown how likely an IDS is to detect a given Internet-wide scan pattern and whether there exist sufficiently fast scan techniques that can remain virtually undetectable at large-scale. To address these questions, we propose a simple analytical model for the window-expiration rules of popular IDS tools (i.e., Snort and Bro) and utilize a …
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Zhongmei Yao
Clustering is well-suited for Web mining by automatically organizing Web pages into categories, each of which contains Web pages having similar contents. However, one problem in clustering is the lack of general methods to automatically determine the number of categories or clusters. For the Web domain in particular, currently there is no such method suitable for Web page clustering. In an attempt to address this problem, we discover a constant factor that characterizes the Web domain, based on which we propose a new method for automatically determining the number of clusters in Web page data sets. We discover that the …
Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov
Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov
Zhongmei Yao
Previous analytical studies of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared with uniform selection of neighbors. In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases …
Cepsim: A Simulator For Cloud-Based Complex Event Processing, Wilson Higashino, Miriam Capretz, Luiz Bittencourt
Cepsim: A Simulator For Cloud-Based Complex Event Processing, Wilson Higashino, Miriam Capretz, Luiz Bittencourt
Wilson A Higashino
As one of the Vs defining Big Data, data velocity brings many new challenges to traditional data processing approaches. The adoption of cloud environments in complex event processing (CEP) systems is a recent architectural style that aims to overcome these challenges. Validating cloud-based CEP systems at the required Big Data scale, however, is often a laborious, error-prone, and expensive task. This article presents CEPSim, a new simulator that has been developed to facilitate this validation process. CEPSim extends CloudSim, an existing cloud simulator, with an application model based on directed acyclic graphs that is used to represent continuous CEP queries. …