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.

COINE Project : Cultural Objects in Networked Environments

La idea subjacent al Projecte de Recerca i Desenvolupament COINE és permetre a la gent contar les seves pròpies històries. COINE pretén proporcionar les eines necessàries per crear estructuradament, un entorn basat en el World Wide Web, que permeti compartir continguts. Els resultats del Projecte ajudaran al desenvolupament d'estàndards per a la implantació i la recuperació estructurades de recursos digitals en entorns en xarxa distribuïda. El Projecte de COINE s'inicià el març de 2002 i finalitzà l'agost de 2004. Avui en dia estem al WorkPackage 5 on estem construint el Sistema, el programari i les interfícies. COINE pretén cobrir la gamma més àmplia possible d'usuaris potencials, des d'organitzacions de patrimoni cultural i institucions de qualsevol mida (principalment biblioteques, arxius i museus) fins a individus de qualsevol edat sense habilitats en l'ús de les TIC, o a grups petits de ciutadans. Els usuaris no utilitzaran només COINE com a eina de cerca, sinó que contribuiran amb el seu propi contingut.

Preserving memories on-line : the exhibition 'Memories of our childhood' and the Catalan Immigration History Museum

Gràcies a la introducció d'Internet, les institucions de la memòria poden anar ara un pas endavant i proporcionar narratives i documentació en línia. La present comunicació intenta descobrir com poden ser utilitzades les memòries en línia basant-se en dues experiències: una exposició de nens de la guerra i un portal d'immigració.

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ó.

¿Qué información sobre salud esconde Internet? Un análisis cualitativo de su contenido

L'acostament entre el professional de la salut i el qui necessita els seus serveis és un tema d'interès per a la psicologia de la salut des que va començar com a disciplina. En el context de la societat de la informació i el coneixement apareix un nou escenari d'intervenció d'aquests dos col·lectius que és necessari conèixer. Per això s'han començat diferents propostes, però la que presenta el grup d'investigació de Psicologia de la Salut i Xarxa (PSINET) de la Universitat Oberta de Catalunya s'encamina a potenciar la creació d'espais virtuals de trobada entre ambdós col·lectius (professionals de la salut i usuaris de serveis de salut). L'establiment de plataformes digitals de serveis sanitaris per als ciutadans del segle XXI passa primer per conèixer la realitat dels diferents col·lectius implicats en la relació salut i xarxa. L'objectiu que es planteja en aquest estudi se centra en el primer col·lectiu i en el descobriment del que hi ha sobre salut a Internet. Per a això, seguint una metodologia de recerca exhaustiva per Internet, s'han recollit webs sobre salut en català i castellà, i s'ha fet una anàlisi de dades textuals de la informació que contenien els webs en català. Aquesta anàlisi ha permès conèixer i descriure el prototip de web sobre salut que hi ha a la xarxa en el moment de fer l'estudi.

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

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

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

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more