Intranet Gestió d'incidències amb J2EE

El projecte consisteix en el disseny i implementació d'una aplicació web utilitzant la tecnologia open source en el desenvolupament, J2EE, que compta amb una base instal·lada molt àmplia i que està suportada per importants empreses constructores de programari.

Ensumeitor : analitzador gràfic del tràfic d'una xarxa informàtica en entorn GNU

El present Treball de Fi de Carrera es troba emmarcat dins de l'àrea de Xarxes de Computadors i consisteix, bàsicament, a fer una aplicació gràfica, en entorn GNU, que permeti analitzar el tràfic d'una xarxa informàtica. És el que s'anomena un Sniffer.

Eina d'anàlisi de rendiment d'unaxarxa

Detecció del tipus de protocols que tenim en la nostra xarxa per així poder fer un anàlisis i estudiar les possiblesanomalies que pugui patir la xarxa.

Gestió dels resultats acadèmics dels estudiants

L'objectiu principal d'aquest treball de final de carrera és desenvolupar una aplicació web integrada en la Intranet de Gestió Acadèmica de l'Escola Politècnica Superior de Castelldefels, de la UPC.

Análisis y diseño de un software de gestión de incidencias técnicas adaptado a la ISO/IEC 20000

El propósito de diseñar esta aplicación, es facilitar una herramienta a los usuarios de una red informática que gestione la resolución de incidencias técnicas con el objetivo que el servicio se vea interrumpido el menor tiempo posible.

MiRegaloPerfecto.com

MiRegaloPerfecto.com és una web del tipus xarxa social que neix amb la idea de que els usuaris puguin crear llistes de regals que els agradaria rebre en alguna ocasió, afegint-hi el nom, la descripció i, opcionalment, un preu aproximat, una web on trobar-lo i una fotografia. Aquestes llistes les podran compartir dins de la mateixa xarxa o a través d'eMail, Facebook, Twitter, etc. S'ha acabat rebre regals absurds, inútils o no desitjats! MiRegaloPerfecto.com elimina aquest problema per sempre més!

Desenvolupament d'un analitzador de xarxa (SNIFFER)

Desenvolupament d'un sniffer propi que capturarà el trànsit de la xarxa i es podrà analitzar. Per a això es generarà un entorn gràfic tant per a la captura com l'anàlisi final, obtenint percentatge de dades i tipus de paquets capturats

Anàlisis del contingut de webs antivacunes

Aquest estudi observacional transversal pretén analitzar la presència dels continguts antivacunes tipificats a l'article de Zimmerman et al. (2005) en els portals web que defensen aquestes postures. Del total de 16 pàgines web localitzades, la mitja del nombre de ítems avaluats que van aparèixer en cadascuna de les pàgines va ser 16,75 ± 5,7 (rang 9-27), destacant per damunt de tots l'ítem risc de malalties/seguretat de les vacunes" que hi apareix en totes les pàgines. També s'ha constatat que les pàgines web antivacunes al·leguen errades en les vacunes i greus violacions ètiques, incloent l'encobriment, conspiració, i violacions de llibertats civils.

Acceso a la Biblioteca de la UOC por medio de la telefonía móvil

La Universitat Oberta de Catalunya, va començar al febrer del 2000, a oferir part dels continguts del Campus Virtual per mitjà del WAP de primera generació.

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

Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates

TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes

Adding QoS protection in order to enhance MPLS QoS routing

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Full label space reduction in MPLS networks: asymmetric merged tunneling

Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization in MPLS networks, few of them have been focused in LSR label space reduction. This letter studies Asymmetric Merged Tunneling (AMT) as a new method for reducing the label space in MPLS network. The proposed method may be regarded as a combination of label merging (proposed in the MPLS architecture) and asymmetric tunneling (proposed recently in our previous works). Finally, simulation results are performed by comparing AMT with both ancestors. They show a great improvement in the label space reduction factor