Snooper - Analitzador Gràfic de Xarxes en entorn GNU

Snooper, Analitzador Gràfic de Xarxes en entorn GNU, TFC-Xarxes

NetEye - Network Monitoring, Zabbix implementation

Trabajo de presentación en formato PowerPoint del TFC NetEye- Zabbix, network monitoring implementation.

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

Evaluating the probability and the impact of a failure in GMPLS based networks

In this paper, we define a new scheme to develop and evaluate protection strategies for building reliable GMPLS networks. This is based on what we have called the network protection degree (NPD). The NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability, and an a posteriori evaluation, the failure impact degree (FID), which determines the impact on the network in case of failure, in terms of packet loss and recovery time. Having mathematical formulated these components, experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms in order to offer a certain degree of protection

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

Partial disjoint path for multi-layer protection in GMPLS networks

In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio

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

Fuerza de ventas en Android

Desarrollo e implementación de una aplicación para la gestión de pedidos en dispositivos Android y su posterior transmisión vía 3G a un servidor empresarial.

eDenuncia : Creació d'una aplicació mòbil per a dispositius Android

La realització d'aquest projecte pretén desenvolupar una aplicació mòbil que permeti a l'usuari documentar queixes sobre aspectes de l'espai o dels equipaments públics que són responsabilitat de les administracions amb el suport d'imatges i d'informació de localització precisa, per tal de ser enviades en forma de correu electrònic als destinataris més adients.

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

localiCEA : Localización de centros educativos en Andalucía

Aplicación Android que permite seleccionar provincia y municipio de Andalucía y localizar los centros escolares que hay cerca.

Sistema per al control de sensors mitjançant P2P

L'objectiu del projecte és la creació d'una aplicació Android que permeti monitoritzar i controlar l'estat de sensors. El projecte ha de definir l'arquitectura del sistema complet tot i que es desenvolupa únicament l'aplicació d'Android i la comunicació peer-to-peer. L'ús de sensors és simulat i queda fora de l'abast d'aquest projecte.

Aplicació gràfica per analitzar el tràfic de xarxa (sniffer) amb entorn GNU

Creació d'un sniffer amb entorn GNU.

Eina d'anàlisi de rendiment d'una xarxa : TaFanet v1.0

Treball de final de carrera que descriu el procés d'implementació de TaFanet v1.0.