An ATM distributed simulator for network management research

Due to the high cost of a large ATM network working up to full strength to apply our ideas about network management, i.e., dynamic virtual path (VP) management and fault restoration, we developed a distributed simulation platform for performing our experiments. This platform also had to be capable of other sorts of tests, such as connection admission control (CAC) algorithms, routing algorithms, and accounting and charging methods. The platform was posed as a very simple, event-oriented and scalable simulation. The main goal was the simulation of a working ATM backbone network with a potentially large number of nodes (hundreds). As research into control algorithms and low-level, or rather cell-level methods, was beyond the scope of this study, the simulation took place at a connection level, i.e., there was no real traffic of cells. The simulated network behaved like a real network accepting and rejecting SNMP ones, or experimental tools using the API node

NetEye - Network Monitoring, Zabbix implementation

Con este proyecto se pretende implementar en un entorno real la herramienta Zabbix de monitoring de red. La idea es realizar un estudio de las necesidades, instalar la plataforma base, comprobar con ejemplos reales que la plataforma cumple con las necesidades corporativas y por último diseñar el plan de acción para el despliegue final a la organización.

Public screens

Creació d'un sistema amb terminals repartits per diverses ubicacions. Aquests terminals serviran per mostrar informació en determinats establiments comercials segons les necessitats del client.

Continuum formalism for modeling growing networks with deletion of nodes

We present a continuum formalism for modeling growing random networks under addition and deletion of nodes based on a differential mass balance equation. As examples of its applicability, we obtain new results on the degree distribution for growing networks with a uniform attachment and deletion of nodes, and complete some recent results on growing networks with preferential attachment and uniform removal

Generalized Multiobjective Multitree model solution using MOEA

In a previous paper a novel Generalized Multiobjective Multitree model (GMM-model) was proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, in this paper a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) is proposed. Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows

Uso de un sistema de elearning como intranet en la Fac. de Biblioteconomia i Documentació de la Univ. de Barcelona

Se presenta la adaptación de un programa de gestión de aprendizaje (Moodle) a las necesidades de gestión de una intranet administrativa. Se describen los requisitos, su estructura y se analiza su grado de utilización cuatro años después de su puesta en marcha, indicando los principales puntos débiles del sistema y las posibles aplicaciones complementarias para contrarrestarlas.

Clustering in complex networks. I. General formalism

We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in that it involves the properties of two¿and not just one¿vertices. The formalism is completed with the definition of a three-vertex correlation function, which is the fundamental quantity describing the properties of clustered networks. The formalism suggests different metrics that are able to thoroughly characterize transitive relations. A rigorous analysis of several real networks, which makes use of this formalism and the metrics, is also provided. It is also found that clustered networks can be classified into two main groups: the weak and the strong transitivity classes. In the first class, edge multiplicity is small, with triangles being disjoint. In the second class, edge multiplicity is high and so triangles share many edges. As we shall see in the following paper, the class a network belongs to has strong implications in its percolation properties.

Hierarchical neural network with high storage capacity

A recent method used to optimize biased neural networks with low levels of activity is applied to a hierarchical model. As a consequence, the performance of the system is strongly enhanced. The steps to achieve optimization are analyzed in detail.

Class of correlated random networks with hidden variables

We study a class of models of correlated random networks in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices. We find analytical expressions for the main topological properties of these models as a function of the distribution of hidden variables and the probability of connecting vertices. The expressions obtained are checked by means of numerical simulations in a particular example. The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure. We also present an extension of the class, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.

Networking of differentially expressed genes in human cancer cells resistant to methotrexate

BACKGROUND: The need for an integrated view of data obtained from high-throughput technologies gave rise to network analyses. These are especially useful to rationalize how external perturbations propagate through the expression of genes. To address this issue in the case of drug resistance, we constructed biological association networks of genes differentially expressed in cell lines resistant to methotrexate (MTX). METHODS: Seven cell lines representative of different types of cancer, including colon cancer (HT29 and Caco2), breast cancer (MCF-7 and MDA-MB-468), pancreatic cancer (MIA PaCa-2), erythroblastic leukemia (K562) and osteosarcoma (Saos-2), were used. The differential expression pattern between sensitive and MTX-resistant cells was determined by whole human genome microarrays and analyzed with the GeneSpring GX software package. Genes deregulated in common between the different cancer cell lines served to generate biological association networks using the Pathway Architect software. RESULTS: Dikkopf homolog-1 (DKK1) is a highly interconnected node in the network generated with genes in common between the two colon cancer cell lines, and functional validations of this target using small interfering RNAs (siRNAs) showed a chemosensitization toward MTX. Members of the UDP-glucuronosyltransferase 1A (UGT1A) family formed a network of genes differentially expressed in the two breast cancer cell lines. siRNA treatment against UGT1A also showed an increase in MTX sensitivity. Eukaryotic translation elongation factor 1 alpha 1 (EEF1A1) was overexpressed among the pancreatic cancer, leukemia and osteosarcoma cell lines, and siRNA treatment against EEF1A1 produced a chemosensitization toward MTX. CONCLUSIONS: Biological association networks identified DKK1, UGT1As and EEF1A1 as important gene nodes in MTX-resistance. Treatments using siRNA technology against these three genes showed chemosensitization toward MTX.

Localitzador gràfic d'adreces IP

Internet s'ha convertit en una font extraordinària de recursos per una audiència en constant creixement arreu el món. A l'igual que en altres activitats de la nostra societat, el coneixement de la localització geogràfica d'aquests recursos i de la gent que hi accedeix és útil tant pels usuaris com pels proveïdors d'informació. La geolocalització IP, però, pot donar informació errònia o amb un nivell de precisió que no vagi més enllà de la referència a un país.Aquest treball recull els diferents actors que formen part de la geolocalització IP i s'ha analitzat el paper que juguen en aquest procés així com la seva influència en el nivell de fiabilitat i exactitud final. Amb aquests sòlids fonaments s'ha desenvolupat una aplicació per representar gràficament en un mapa la geolocalització IP d'un dispositiu i la dels nodes que formen el camí realitzat fins arribar-hi, així com tota la informació addicional que de cada IP s'ha pogut obtenir.El resultat ha estat una memòria tècnica de tot el treball de recerca juntament amb una aplicació que s'executa en l'entorn de Microsoft Windows i plataforma .NET, caracteritzada per la seva facilitat d'ús gràcies a un disseny simple molt intuïtiu i efectiu, la rapidesa d'execució per què aprofita la programació de fils, i un positiu impacte visual ja que fa servir l'API de Google Maps per a la representació visual de la traça.