Desenvolvimento de um BMS para aplicações de mobilidade elétrica

Dissertação de mestrado integrado em Engenharia Eletrónica Industrial e de Computadores

Analizador de red (sniffer) en entorno GNU

Aquest projecte mira de reflectir els coneixements adquirits en les assignatures pròpies de la carrera, com ara Fonaments de programació, Sistemes operatius i Ampliació de sistemes operatius, Xarxes, Estructura de xarxes de computadors i Seguretat en xarxes de computadors.

Esquema criptogràfic per la gestiód'expedients mèdics

Donada la naturalesa de la informació que conté un expedient mèdic, és de vital importància que tant l'accés a les dades, com l'emmagatzemament d'aquestes, es porti a terme amb la major seguretat possible.

El juego seguro de la Oca

L'objectiu d'aquest projecte és desenvolupar una aplicació que implementi la funcionalitat del joc de l'oca de manera segura, amb n jugadors distribuïts en diferents ordinadors amb adreces IP i ports diferents connectats per mitjà d'una xarxa, que pot ser Internet, una intranet o una xarxa corporativa.

Proveïment de serveis segurs

Aquest projecte és una mostra de les possibilitats de dotar de seguretat a les aplicacions web i d¿arquitectura Client/Servidor basades en Java

Comparativa d'eines de monitorització de sistemes

El següent projecte està estructurat en tres fases, les quals tenen com objectiu la comparació d'eines de monitorització de sistemes. Una primera fase d'introducció on comentaré la importància de la monitorització de sistemes i de la descripció de com seleccionar la millor eina. En la segona fase em centraré en l'estudi de cadascuna de les eines. I per últim una tercera fase de conclusions i les línies obertes del projecte.

Comparativa d'eines de monitorització

Metodologia per a la comparativa d'eines de monitorització Nagios, Pandorafms i Zenoss.

PGPWebmail : cliente de correo web con PGP

Trabajo Final de Carrera en desarrollo .NET: Aplicación web ASP.NET MVC cliente de correo electrónico con cifrado PGP y servicio web WCF que brinda funcionalidades de cifrado PGP.

A quality-based cost distribution charging scheme for QoS multicast networks

This paper presents a new charging scheme for cost distribution along a point-to-multipoint connection when destination nodes are responsible for the cost. The scheme focus on QoS considerations and a complete range of choices is presented. These choices go from a safe scheme for the network operator to a fair scheme to the customer. The in-between cases are also covered. Specific and general problems, like the incidence of users disconnecting dynamically is also discussed. The aim of this scheme is to encourage the users to disperse the resource demand instead of having a large number of direct connections to the source of the data, which would result in a higher than necessary bandwidth use from the source. This would benefit the overall performance of the network. The implementation of this task must balance between the necessity to offer a competitive service and the risk of not recovering such service cost for the network operator. Throughout this paper reference to multicast charging is made without making any reference to any specific category of service. The proposed scheme is also evaluated with the criteria set proposed in the European ATM charging project CANCAN

Enhancing fault management performance of two-step QoS routing algorithms in GMPLS networks

In this paper a novel methodology aimed at minimizing the probability of network failure and the failure impact (in terms of QoS degradation) while optimizing the resource consumption is introduced. A detailed study of MPLS recovery techniques and their GMPLS extensions are also presented. In this scenario, some features for reducing the failure impact and offering minimum failure probabilities at the same time are also analyzed. Novel two-step routing algorithms using this methodology are proposed. Results show that these methods offer high protection levels with optimal resource consumption

Label Space Reduction in MPLS Networks: How Much Can A Single Stacked Label Do?

Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying virtual private networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the configuration of multipoint-to-point connections (MP2P)-as a means of reducing label space in LSRs. We found two main drawbacks in this label space reduction a)it should be separately applied to a set of LSPs with the same egress LSR-which decreases the options for better reductions, and b)LSRs close to the edge of the network experience a greater label space reduction than those close to the core. The later implies that MP2P connections reduce the number of labels asymmetrically

Uncorrelatedness in growing networks with preferential survival of nodes

The emergence of uncorrelated growing networks is proved when nodes are removed either uniformly or under the preferential survival rule recently observed in the World Wide Web evolution. To this aim, the rate equation for the joint probability of degrees is derived, and stationary symmetrical solutions are obtained, by passing to the continuum limit. When a uniformly random removal of extant nodes and linear preferential attachment of new nodes are at work, we prove that the only stationary solution corresponds to uncorrelated networks for any removal rate r ∈ (0,1). In the more general case of preferential survival of nodes, uncorrelated solutions are also obtained. These results generalize the uncorrelatedness displayed by the (undirected) Barab´asi-Albert network model to models with uniformly random and selective (against low degrees) removal of nodes

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

Diffusion dynamics on multiplex networks

We study the time scales associated with diffusion processes that take place on multiplex networks, i.e., on a set of networks linked through interconnected layers. To this end, we propose the construction of a supra-Laplacian matrix, which consists of a dimensional lifting of the Laplacian matrix of each layer of the multiplex network. We use perturbative analysis to reveal analytically the structure of eigenvectors and eigenvalues of the complete network in terms of the spectral properties of the individual layers. The spectrum of the supra-Laplacian allows us to understand the physics of diffusionlike processes on top of multiplex networks.

Deciphering the global organization of clustering in real complex networks

We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles.