A model-based survey of alert correlation techniques

As telecommunication networks evolve rapidly in terms of scalability, complexity, and heterogeneity, the efficiency of fault localization procedures and the accuracy in the detection of anomalous behaviors are becoming important factors that largely influence the decision making process in large management companies. For this reason, telecommunication companies are doing a big effort investing in new technologies and projects aimed at finding efficient management solutions. One of the challenging issues for network and system management operators is that of dealing with the huge amount of alerts generated by the managed systems and networks. In order to discover anomalous behaviors and speed up fault localization processes, alert correlation is one of the most popular resources. Although many different alert correlation techniques have been investigated, it is still an active research field. In this paper, a survey of the state of the art in alert correlation techniques is presented. Unlike other authors, we consider that the correlation process is a common problem for different fields in the industry. Thus, we focus on showing the broad influence of this problem. Additionally, we suggest an alert correlation architecture capable of modeling current and prospective proposals. Finally, we also review some of the most important commercial products currently available.     

Realization strategies of dedicated path protection: A bandwidth cost perspective

Communication networks have to provide a high level of availability and instantaneous recovery after failures in order to ensure sufficient survivability for mission-critical services. Currently, dedicated path protection (or 1 + 1) is implemented in backbone networks to provide the necessary resilience and instantaneous recovery against single link failures with remarkable simplicity. However, in order to satisfy strict availability requirements, connections also have to be resilient against Shared Risk Link Group (SRLG) failures. In addition, switching matrix reconfigurations have to be avoided after a failure in order to guarantee instantaneous recovery. For this purpose, there are several possible realization strategies improving the characteristics of traditional 1 + 1 path protection by lowering reserved bandwidth while conserving all its favorable properties. These methods either utilize diversity coding, network coding, or generalize the disjoint-path constraint of 1 + 1.In this paper, we consider the cost aspect of the traditional and the alternative 1 + 1 realization strategies. We evaluate the bandwidth cost of different schemes both analytically and empirically in realistic network topologies. As the more complex realizations lead to NP-complete problems even in the single link failure case, we propose both Integer Linear Programming (ILP) based optimal methods, as well as heuristic and meta-heuristic approaches to solve them. Our findings provide a tool and guidelines for service providers for selecting the path protection method with the lowest bandwidth cost for their network corresponding to a given level of reliability.     

Applying model-driven engineering to the development of Rich Internet Applications for Business Intelligence

Business Intelligence (BI) applications have been gradually ported to the Web in search of a global platform for the consumption and publication of data and services. On the Internet, apart from techniques for data/knowledge management, BI Web applications need interfaces with a high level of interoperability (similar to the traditional desktop interfaces) for the visualisation of data/knowledge. In some cases, this has been provided by Rich Internet Applications (RIA). The development of these BI RIAs is a process traditionally performed manually and, given the complexity of the final application, it is a process which might be prone to errors. The application of model-driven engineering techniques can reduce the cost of development and maintenance (in terms of time and resources) of these applications, as they demonstrated by other types of Web applications. In the light of these issues, the paper introduces the S^m4RIA-B methodology, i.e., a model-driven methodology for the development of RIA as BI Web applications. In order to overcome the limitations of RIA regarding knowledge management from the Web, this paper also presents a new RIA platform for BI, called RI@BI, which extends the functionalities of traditional RIAs by means of Semantic Web technologies and B2B techniques. Finally, we evaluate the whole approach on a case study—the development of a social network site for an enterprise project manager.     

An optimization algorithm for multimodal functions inspired by collective animal behavior

Interest in multimodal function optimization is expanding rapidly as real-world optimization problems often demand locating multiple optima within a search space. This article presents a new multimodal optimization algorithm named as the collective animal behavior. Animal groups, such as schools of fish, flocks of birds, swarms of locusts, and herds of wildebeest, exhibit a variety of behaviors including swarming about a food source, milling around a central location, or migrating over large distances in aligned groups. These collective behaviors are often advantageous to groups, allowing them to increase their harvesting efficiency to follow better migration routes, to improve their aerodynamic, and to avoid predation. In the proposed algorithm, searcher agents are a group of animals which interact with each other based on the biologic laws of collective motion. Experimental results demonstrate that the proposed algorithm is capable of finding global and local optima of benchmark multimodal optimization problems with a higher efficiency in comparison with other methods reported in the literature.     

The Price of Anarchy in Network Creation Games Is (Mostly) Constant

We study the price of anarchy and the structure of equilibria in network creation games. A network creation game is played by n players {1,2,…,n}, each identified with a vertex of a graph (network), where the strategy of player i, i=1,…,n, is to build some edges adjacent to i. The cost of building an edge is α>0, a fixed parameter of the game. The goal of every player is to minimize its creation cost plus its usage cost. The creation cost of player i is α times the number of built edges. In the SumGame variant, the usage cost of player i is the sum of distances from i to every node of the resulting graph. In the MaxGame variant, the usage cost is the eccentricity of i in the resulting graph of the game. In this paper we improve previously known bounds on the price of anarchy of the game (of both variants) for various ranges of α, and give new insights into the structure of equilibria for various values of α. The two main results of the paper show that for α>273?n all equilibria in SumGame are trees and thus the price of anarchy is constant, and that for α>129 all equilibria in MaxGame are trees and the price of anarchy is constant. For SumGame this answers (almost completely) one of the fundamental open problems in the field—is price of anarchy of the network creation game constant for all values of α?—in an affirmative way, up to a tiny range of α.     

A multiobjective approach based on artificial bee colony for the static routing and wavelength assignment problem

Nowadays, the most promising technology for designing optical networks is the wavelength division multiplexing. This technique divides the huge bandwidth of an optical fiber link into different wavelengths, providing different available channels per link. However, a problem comes up when it is necessary to interconnect a set of traffic demands. This problem is known as routing and wavelength assignment problem, and due to its complexity (NP-hard problem) it is very suitable for being solved using evolutionary computation. The selected heuristics is the artificial bee colony algorithm, an heuristics based on the behavior of honeybee foraging for nectar. Therefore, we have applied multiobjective optimization to solve the static routing and wavelength assignment problem, and adapted this algorithm to the multiobjective context. New results have been obtained that significantly improve those published in previous researches.     

Service oriented evolutionary algorithms

This work presents a service oriented architecture for evolutionary algorithms, and an implementation of this architecture using a specific technology (called OSGiLiath). Service oriented architecture is a computational paradigm where users interact using services to increase the integration between systems. The presented abstract architecture is formed by loosely coupled, highly configurable and language-independent services. As an example of an implementation of this architecture, a complete process development using a specific service oriented technology is explained. With this implementation, less effort than classical development in integration, distribution mechanisms and execution time management has been attained. In addition, steps, ideas, advantages and disadvantages, and guidelines to create service oriented evolutionary algorithms are presented. Using existing software, or from scratch, researchers can create services to increase the interoperability in this area.     

P distribution in different sediment fraction of a constructed wetland

The aim of this work was to study the accumulation and fractionation of P in the inlet and outlet sediment of a constructed wetland for the wastewater treatment of a metallurgic plant in Argentina. It was important to predict whether P could be released into the water again by changing environmental conditions or retained over time. P-fractionation was performed using a sequential extraction method. Sediment cores were sliced at depths of: 0-3; 3-7 and 7-10 cm. Sediment showed high pH values and anoxic conditions. In the inlet area, P was principally bound to the carbonate fraction, whereas in the outlet area, it was mainly bound in the residual fraction. This behavior was justified by the effluent composition, which is rich in Ca2+ and Fe3+ and presents high values of pH and conductivity. These conditions favor CaCO3 and Fe(OOH)n precipitation and the subsequent sorption of P to their surface. The sediment active layer involved in the exchange reactions was the superficial one (0-3 cm). The wetland is highly efficient in P retention. P was retained by sediment in fractions that will not release it to the water while chemical and environmental conditions of the system are maintained.     

Influence of hydraulic retention time on UASB post-treatment with UF membranes

A pilot UASB reactor coupled with an external ultrafiltration (UF) membrane was operated under three different hydraulic retention times (HRT) for domestic wastewater treatment. The aim was to assess the HRT influence on system performance and fouling. The highest concentrations of COD, total solids, extracellular polymeric substances (EPS) and soluble microbial products (SMP) in UASB effluent and permeate were found when the UASB reactor was operated under the lowest HRT studied (4 hours); although the fulfillment of Mexican Standard for wastewater reclamation was not compromised. This fact could be attributed to the higher shear stress forces inside the UASB reactor when it was operated at low HRT, which promoted the release of biopolymeric substances in its effluent. Besides, the fouling propensity in the UASB effluent was worsened with HRT reduction, by increasing the fouling rate and the specific cake resistance. Based on these results, it is recommended to avoid operating the UASB reactor at low HRTs (less than 4 hours) in order to control SMP and EPS fouling potential. The results presented also suggest that HRT reduction has a detrimental effect on performance and fouling.     

Estimating the Economic Value of Landscape Losses Due to Flooding by Hydropower Plants in the Chilean Patagonia

This paper presents a contingent valuation study concerning landscape impacts generated by the construction of one dam (Baker 1) of the HIDROAYSEN hydropower project located in the Chilean Patagonia. A survey was used to collect information about citizens’ opinions towards the hydropower project in four major cities in Chile. Specifically, a One-and-One-Half-Bound (OOHB) willingness to pay eliciting format was applied to capture citizens’ WTP. The economic loss, associated to the landscape impacts for people living in urban areas of the country, is found to be approximately US$ 205 million, which is nearly 28% of the total investment. Our results also show that the cities’ distance from the dam affects citizens’ willingness to pay.