Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

Carrier Ethernet "label" scalability

A collection of slides from the authorpsilas seminar presentation is given

Improving Label Space Usage for Ethernet Label Switched Paths

Ethernet is becoming the dominant aggregation technology for carrier transport networks; however, as it is a LAN technology, native bridged ethernet does not fulfill all the carrier requirements. One of the schemes proposed by the research community to make ethernet fulfill carrier requirements is ethernet VLAN-label switching (ELS). ELS allows the creation of label switched data paths using a 12-bit label encoded in the VLAN TAG control information field. Previous label switching technologies such as MPLS use more bits for encoding the label. Hence, they do not suffer from label sparsity issues as ELS might. This paper studies the sparsity issues resulting from the reduced ELS VLAN-label space and proposes the use of the label merging technique to improve label space usage. Experimental results show that label merging considerably improves label space usage

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

Availability analysis of GMPLS connections based on physical network topology

This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics

Transmission delays in residual computation

The design of control, estimation or diagnosis algorithms most often assumes that all available process variables represent the system state at the same instant of time. However, this is never true in current network systems, because of the unknown deterministic or stochastic transmission delays introduced by the communication network. During the diagnosing stage, this will often generate false alarms. Under nominal operation, the different transmission delays associated with the variables that appear in the computation form produce discrepancies of the residuals from zero. A technique aiming at the minimisation of the resulting false alarms rate, that is based on the explicit modelling of communication delays and on their best-case estimation is proposed

Instrumentació i anàlisi de dades d'assaigs de bigues de formigó armades amb barres de FRP

Estudi experimental del comportament de bigues de formigó armades amb barres de materials compostos de matriu polimèrica (FRP)

Xarxa de comunicacions de la UdG

La Universitat de Girona disposa d'una xarxa física de comunicacions que uneix tots els campus. Es tracta d'un avantatge important que permet la transmissió de dades i telefonia de manera segura i fiable, sense haver de llogar els enllaços a operadors externs

Les Imatges digitals en l'ensenyament de la Història de l'art: base de dades d'imatges d'art contemporani

L’objectiu d’aquesta comunicació és presentar el treball que s’ha vingut desenvolupant al llarg dels darrers anys en els estudis d’Història de l’art de la Universitat de Girona, i més concretament entorn de l’àrea de coneixement d’Art contemporani. Aquest treball, emmarcat en diversos programes d’innovació docent, va consistir, en una primera fase, en la digitalització del material visual utilitzat en la docència (les anteriors diapositives); i en la fase que actualment estem desenvolupant, en la creació i posta en marxa d’una Base d’imatges d’art contemporani en línia, que està actualment en fase de proves. Des del punt de vista docent, aquest projecte posa èmfasi en l’aspecte que nosaltres considerem clau en l’àmbit de la nostra tasca docent: el que hem intentat és crear una eina que faciliti la tasca dels nostres estudiants posant a la seva disposició tot el material visual treballat a les classes, de manera que el seu procés d’aprenentatge esdevingui molt més autònom i individualitzat. La valoració que els estudiants han fet de les fases del projecte executades fins ara ha estat molt positiva, i per això creiem que aquest projecte continua essent vàlid per al seu desenvolupament futur. Així mateix, aquesta eina s’està mostrant també molt útil pel que fa a temes de recerca, tant per als docents com per els estudiants, i voldríem aprofundir també en aquesta direcció. En la propera fase el que pretenem és afavorir molt més la implicació de l’estudiant, ja que posant al seu abast més recursos, esperem que els utilitzi també de forma més autònoma i creativa, i que això tingui una repercussió positiva en el seu procés d’aprenentatge. Així mateix, i partint del fet que tot aquest material serà disponible on-line, pretenem explorar les possibilitats de connectar el nostre recurs amb altres de similars que puguin altres universitats, amb l’objectiu d’optimitzar-ne l’ús i les potencialitats

De l'objecció a la prestació social substitutòria: algunes dades

Aporta dades sobre l'objecció de consciència i valora el canvi cap a la prestació social substitutòria

Entorn de simulació per a xarxes òptiques de transport

Aquest projecte final de carrera pretén investigar i experimentar una nova línia de desenvolupament d’algorismes dinàmics. A partir de l’algorisme AntNet-QoS [2] s’ incorporen noves mesures a l’algorisme (mesura de l’amplada de banda disponible i jitter), les quals combinant amb la mesura de retard ja feta servir, permet adaptar-se millor a les condicions actuals del trànsit en la xarxa i als requeriments específics de qualitat (QoS) per part del trànsit

Noves dades sobre el sindicat remença de 1448 [Ressenya del llibre El sindicat remença de l'any 1448, de M. Mercè Homs Brugarolas]

L'Ajuncament de Girona ha publicat un nou volum de la col•lecció Documents de l'Arxiu Municipal, el número 11, fent realitat un dels objecrius que van inspirar el naixement d'aquesta extraordinària col•lecció: posar els documents històrics de la ciutat a l'abast dels investigadors i els ciutadans interessats

QoS online routing and MPLS multilevel protection: a survey

A survey of MPLS protection methods and their utilization in combination with online routing methods is presented in this article. Usually, fault management methods pre-establish backup paths to recover traffic after a failure. In addition, MPLS allows the creation of different backup types, and hence MPLS is a suitable method to support traffic-engineered networks. In this article, an introduction of several label switch path backup types and their pros and cons are pointed out. The creation of an LSP involves a routing phase, which should include QoS aspects. In a similar way, to achieve a reliable network the LSP backups must also be routed by a QoS routing method. When LSP creation requests arrive one by one (a dynamic network scenario), online routing methods are applied. The relationship between MPLS fault management and QoS online routing methods is unavoidable, in particular during the creation of LSP backups. Both aspects are discussed in this article. Several ideas on how these actual technologies could be applied together are presented and compared

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

Estimation of the probability of congestion using Monte Carlo method in OPS networks

In networks with small buffers, such as optical packet switching based networks, the convolution approach is presented as one of the most accurate method used for the connection admission control. Admission control and resource management have been addressed in other works oriented to bursty traffic and ATM. This paper focuses on heterogeneous traffic in OPS based networks. Using heterogeneous traffic and bufferless networks the enhanced convolution approach is a good solution. However, both methods (CA and ECA) present a high computational cost for high number of connections. Two new mechanisms (UMCA and ISCA) based on Monte Carlo method are proposed to overcome this drawback. Simulation results show that our proposals achieve lower computational cost compared to enhanced convolution approach with an small stochastic error in the probability estimation