Servei de rutes basat en Open Source Routing Machine

Aquesta memòria descriu la preparació, l'execució i els resultats obtinguts d'implementar un sistema calculador de rutes. El projecte Open Source Routing Machine és un motor calculador de rutes d'alt rendiment que utilitza les dades de OpenStreetMaps per calcular el camí més curt entre dos punts. En aquest projecte final no únicament es volen utilitzar les dades OpenStreetMap sinó que també es pretenen utilitzar dades pròpies en format shapefile i poder visualitzar-los en un visor web. Aquest visor permet a l'usuari, de forma senzilla, sol•licitar rutes al servidor OSRM creat, obtenint la ruta desitjada en molt pocs milisegons

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

All-Optical Unicast/Multicast Routing in WDM Networks

Optical transport networks (OTN) must be prepared in terms of better resource utilization, for accommodating unicast and multicast traffic together. Light-trees have been proposed for supporting multicast connections in OTN. Nevertheless when traffic grooming is applied in light-trees, resources can be underutilized as traffic can be routed to undesirable destinations in order to avoid optical-electrical-optical (OEO) conversions. In this paper, a novel architecture named S/G light- tree for supporting unicast/multicast connections is proposed. The architecture allows traffic dropping and aggregation in different wavelengths without performing OEO conversions. A heuristic that routes traffic demands using less wavelengths by taking advantage of the proposed architecture is designed as well. Simulation results show that the architecture can minimize the number of used wavelengths and OEO conversions when compared to light-trees

Current Account imbalances, thriftiness and the real exchange rate in a growing economy

This paper analyses the theoretical relevance of the dynamical aspects of growth on the discussion about the observed positive correlation between per capita real income and real exchange rates. With this purpose, we develop a simple exogenous growth model where the internal, external and intertemporal equilibrium conditions of a typical macroeconomic model are imposed; this last one through the inclusion of a balanced growth path for the foreign assets accumulation. The main result under this consideration is that the relationship defended by the Balassa-Samuelson hypothesis is no more so straightforward. In our particular approach, the mentioned bilateral relationship depends on a parameter measuring thriftiness in the economy. Therefore, the probability of ending up with a positive relationship between growth and real exchange rates -as the classical economic theory predicts- will be higher when the economy is able to maintain a minimum saving ratio. Moreover, given that our model considers a simple Keynesian consumption function, some explosive paths can also be possible.

Consumption externalities, habit formation, and equilibrium efficiency

We analyze the welfare properties of the competitive equilibrium in a capital accumulation model where individual preferences are subjected to both habit formation and consumption spillovers. We also discuss how consumption externalities and habits interact to generate an inefficient dynamic equilibrium. Finally, we characterize optimal tax policies aimed to restore efficient decentralized paths.

Unemployment, growth and fiscal policy: new insights on the hysteresis hypothesis

We develop a growth model with unemployment due to imperfections in the labor market. In this model, wage inertia and balanced budget rules cause a complementarity between capital and employment capable of explaining the existence of multiple equilibrium paths. Hysteresis is viewed as the result of a selection between these diferent equilibrium paths. We use this model to argue that, in contrast to the US, those fiscal policies followed by most of the European countries after the shocks of the 1970’s may have played a central role in generating hysteresis.

Knowledge, networks of cities and growth in regional urban systems

The objective of this paper is to measure the impact of different kinds of knowledge and external economies on urban growth in an intraregional context. The main hypothesis is that knowledge leads to growth, and that this knowledge is related to the existence of agglomeration and network externalities in cities. We develop a three-tage methodology: first, we measure the amount and growth of knowledge in cities using the OCDE (2003) classification and employment data; second, we identify the spatial structure of the area of analysis (networks of cities); third, we combine the Glaeser - Henderson - De Lucio models with spatial econometric specifications in order to contrast the existence of spatially static (agglomeration) and spatially dynamic (network) external economies in an urban growth model. Results suggest that higher growth rates are associated to higher levels of technology and knowledge. The growth of the different kinds of knowledge is related to local and spatial factors (agglomeration and network externalities) and each knowledge intensity shows a particular response to these factors. These results have implications for policy design, since we can forecast and intervene on local knowledge development paths.

Catalan's intervals and realizers of triangulations

The Stanley lattice, Tamari lattice and Kreweras lattice are three remarkable orders defined on the set of Catalan objects of a given size. These lattices are ordered by inclusion: the Stanley lattice is an extension of the Tamari lattice which is an extension of the Kreweras lattice. The Stanley order can be defined on the set of Dyck paths of size n as the relation of being above. Hence, intervals in the Stanley lattice are pairs of non-crossing Dyck paths. In a former article, the second author defined a bijection Φ between pairs of non-crossing Dyck paths and the realizers of triangulations (or Schnyder woods). We give a simpler description of the bijection Φ. Then, we study the restriction of Φ to Tamari’s and Kreweras’ intervals. We prove that Φ induces a bijection between Tamari intervals and minimal realizers. This gives a bijection between Tamari intervals and triangulations. We also prove that Φ induces a bijection between Kreweras intervals and the (unique) realizers of stack triangulations. Thus, Φ induces a bijection between Kreweras intervals and stacktriangulations which are known to be in bijection with ternary trees.

An application of MSIASM to Chinese exosomatic energy metabolism

The methodology of Multi-Scale Integrated The methodology of Multi-Scale Integrated Analysis of Societal Metabolism (MSIASM) is applied to analyze the Chinese economy. This paper presents four tasks: (i) identifying a set of benchmarks that makes it possible to compare various characteristics of the Chinese economy with those of other country groups and the world (level) average; (ii) explaining the differences over the selected set of benchmarks, by looking at the characteristics of the various sub-sectors of the Chinese economy; (iii) understanding existing trends and future feasible future development paths for China by studying the existence of reciprocal constraints between the whole economy and its sub-sectors; and (iv) examining plausible future scenarios of development.

Anàlisi del sistema operatiu RTLinux e implementació d'un entorn de desenvolupament de tasques en temps real (aplicat al control de processos)

El projecte "Anàlisi del sistema operatiu RTLinux i implementació d'un entorn de desenvolupament de tasques en temps real" analitza la possibilitat de crear un entorn de desenvolupament de tasques en temps real per poder crear sistemes de control complex, tot això mitjançant codi lliure. Inicialment es fa un aprenentatge sobre el concepte de temps real, després s'elegeix el sistema operatiu en temps real RTLinux per a crear l'entorn de desenvolupament utilitzant el llenguatge de programació Tcl/Tk. Es creen un conjunt d'aplicacions (pel control computacional) per estudiar la viabilitat de la construcció de l'entorn desitjat per facilitar la tasca de l'usuari final. Aquest projecte obre multitud de possibles camins a continuar: comunicació remota, implementació de planificadors, estudi de controladors, etc.

Avaluació dels algorismes d'encaminament per a una NoC amb topologia Mesh 2D

Aquest projecte presenta una avaluació de les diferents alternatives d'encaminament per a una NoC amb una topologia mesh 2D. Per tal d'exposar aquestes alternatives s'ha estudiat la composició d'un router implementat amb l'algorisme determinista XY i s'ha adaptat per tal que aquest suportés els algorismes parcialment adaptatius West First, North Last i Negative First. Un cop tenim els routers implementats es disposa un estudi dels diferents algorismes i com cadascun d'aquests actuen en front uns mateixos estímuls per tal de crear una comparativa entre ells que ens faciliti una elecció a priori.

Enrutament i control de flux en xarxes híbrides satèl·lit-terrestre

Les xarxes híbrides satèl·lit-terrestre ofereixen connectivitat a zones remotes i aïllades i permeten resoldre nombrosos problemes de comunicacions. No obstant, presenten diversos reptes, ja que realitzen la comunicació per un canal mòbil terrestre i un canal satèl·lit contigu. Un d'aquests reptes és trobar mecanismes per realitzar eficientment l'enrutament i el control de flux, de manera conjunta. L'objectiu d'aquest projecte és simular i estudiar algorismes existents que resolguin aquests problemes, així com proposar-ne de nous, mitjançant diverses tècniques d'optimització convexa. A partir de les simulacions realitzades en aquest estudi, s'han analitzat àmpliament els diversos problemes d'enrutament i control de flux, i s'han avaluat els resultats obtinguts i les prestacions dels algorismes emprats. En concret, s'han implementat de manera satisfactòria algorismes basats en el mètode de descomposició dual, el mètode de subgradient, el mètode de Newton i el mètode de la barrera logarítmica, entre d'altres, per tal de resoldre els problemes d'enrutament i control de flux plantejats.

Label Space Reduction in All-Optical Label Switchiing Networks

Report for the scientific sojourn at the Department of Information Technology (INTEC) at the Ghent University, Belgium, from january to june 2007. 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 wayin 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 project studies and proposes 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 project, 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.

Coupling and monotonicity of queueing processes

The main purpose of this work is to give a survey of main monotonicity properties of queueing processes based on the coupling method. The literature on this topic is quite extensive, and we do not consider all aspects of this topic. Our more concrete goal is to select the most interesting basic monotonicity results and give simple and elegant proofs. Also we give a few new (or revised) proofs of a few important monotonicity properties for the queue-size and workload processes both in single-server and multi- server systems. The paper is organized as follows. In Section 1, the basic notions and results on coupling method are given. Section 2 contains known coupling results for renewal processes with focus on construction of synchronized renewal instants for a superposition of independent renewal processes. In Section 3, we present basic monotonicity results for the queue-size and workload processes. We consider both discrete-and continuous-time queueing systems with single and multi servers. Less known results on monotonicity of queueing processes with dependent service times and interarrival times are also presented. Section 4 is devoted to monotonicity of general Jackson-type queueing networks with Markovian routing. This section is based on the notable paper [17]. Finally, Section 5 contains elements of stability analysis of regenerative queues and networks, where coupling and monotonicity results play a crucial role to establish minimal suficient stability conditions. Besides, we present some new monotonicity results for tandem networks.