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.

BCN­Routing : càlcul web de rutes amb pgRouting, OpenStreetMap i OpenLayers

En aquest projecte s'ha desenvolupat una interfície web per calcular rutes a la ciutat de Barcelona. Les rutes calculades són a peu, entre un punt d'origen qualsevol i un punt d'interès turístic de la ciutat com a destí. Per això s'han extret les dades dels carrers de Barcelona d'OpenStreetMap i s'han insertat a una base de dades postgreSQL/postGIS, juntament amb una capa vectorial de punts d'interès turístic que s'ha creat amb el SIG d'escriptori qGIS. El càlcul de les rutes amb les dades de la base de dades s'ha realitzat amb l'extensió pgRouting, i la interfície web per seleccionar els punts d'origen i destí, mostrar els mapes, i mostrar les rutes resultat, s'ha desenvolupat utilitzant la llibreria OpenLayers.

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

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

One kind of lawlessness: estimating the welfare cost of Somali piracy

This paper estimates the effect of piracy attacks on shipping costs using a unique data set on shipping contracts in the dry bulk market. We look at shipping routes whose shortest path exposes them to piracy attacks and find that the increase in attacks in 2008 lead to around a ten percent increase in shipping costs. We use this estimate to get a sense of the welfare loss imposed by piracy. Our intermediate estimate suggests that the creation of $120 million of revenue for pirates in the Somalia area led to a welfare loss of over $1.5 billion.

Tracing the Origin and Spread of Agriculture in Europe

The origins of early farming and its spread to Europe have been the subject of major interest for some time. The main controversy today is over the nature of the Neolithic transition in Europe: the extent to which the spread was, for the most part, indigenous and animated by imitatio (cultural diffusion) or else was driven by an influx of dispersing populations (demic diffusion). We analyze the spatiotemporal dynamics of the transition using radiocarbon dates from 735 early Neolithic sites in Europe, the Near East, and Anatolia. We compute great-circle and shortest-path distances from each site to 35 possible agricultural centers of origin—ten are based on early sites in the Middle East and 25 arehypothetical locations set at 58 latitude/longitude intervals. We perform a linear fit of distance versus age (and viceversa) for each center. For certain centers, high correlation coefficients (R . 0.8) are obtained. This implies that a steady rate or speed is a good overall approximation for this historical development. The average rate of the Neolithic spread over Europe is 0.6–1.3 km/y (95% confidence interval). This is consistent with the prediction of demic diffusion(0.6–1.1 km/y). An interpolative map of correlation coefficients, obtained by using shortest-path distances, shows thatthe origins of agriculture were most likely to have occurred in the northern Levantine/Mesopotamian area

Stable rank of leavitt path algebra

We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.

La raó circular

És un text epistemològic sobre les qüestions cognitives circulars que apareixen: a) Quan el subjecte forma part de l’objecte estudiat; b) En la recerca de les bases del coneixement; c) Al voler justificar la inducció; d) En algunes interpretacions filosòfiques i científiques. S’hi explica l’estat del punt a) el més problemàtic, i s’aclareixen els altres tres punts: els b) i c) pel fet científic que l’evolució cognitiva humana ha anat acoblada a l’evolució biològica, la qual ha generat els a priori kantians i altres innatismes. El d) perquè la formació del coneixement i de la ciència es progressiva, passant una i altra vegada sobre el que ja s’havia tractat però ascendint alhora i ampliant el panorama, tal com fa una escala de cargol.

Turkey's accession to the EU: interests, ideas and path dependence

The paper is divided into four sections. The first offers a critical assessment of explanations of both rationalist and constructivist approaches currently dominating European studies and assesses the notion of path dependence. The second and third sections analyse the role of both material interests and polity ideas in EU enlargement to Turkey, and conclude that explanations exclusively based on either strategic calculations or values and identities have significant shortcomings. The fourth section examines the institutional path of Turkey's candidacy to show how the course of action begun at Helsinki restricted the range of possible and legitimate options three years later in Copenhagen.

Chain conditions for Leavitt path algebras

In this paper, results known about the artinian and noetherian conditions for the Leavitt path algebras of graphs with finitely many vertices are extended to all row-finite graphs. In our first main result, necessary and sufficient conditions on a row-finite graph E are given so that the corresponding (not necessarily unital) Leavitt path K-algebra L(E) is semisimple. These are precisely the algebras L(E)for which every corner is left (equivalently, right)artinian. They are also precisely the algebras L(E) for which every finitely generated left (equivalently, right) L(E)-module is artinian. In our second main result, we give necessary and sufficient conditions for every corner of L(E) to be left (equivalently, right) noetherian. They also turn out to be precisely those algebras L(E) for which every finitely generated left(equivalently, right) L(E)-module is noetherian. In both situations, isomorphisms between these algebras and appropriate direct sums of matrix rings over K or K[x, x−1] are provided. Likewise, in both situations, equivalent graph theoretic conditions on E are presented.

The Difficult and tortuous path of agricultural cooperative networks in spain, 1890-1935

The rural associationism developed from the last decades of the XIX century could be consider as an answer of the agriculturists to the increasing integration of agriculture in the market, and to the effects of the Great Depression. In the case of Spain, the initiatives in this sense arose with certain delay in relation to the countries of Western Europe. The beginning of the Spanish cooperativism is closely bound to the Law of 1906. It granted the agrarian cooperatives with fiscal exemptions and other types of supports to the associates, although the process did not really accelerate until the promulgation of the law regulation in 1908.

Destruction of invariant curves in the restricted circular planar three body problem using comparison of action

"Vegeu el resum a l'inici del document del fitxer adjunt."

GNSS array: diseño de una antena con polarización circular

Aquest projecte es centra en el disseny d’una antena microstrip per a GNSS. Una antena per a GNSS ha de tenir adaptació de impedància d’entrada i polarització circular a dretes, com a principals especificacions, en el rang de 1.15-1.6 GHz. El tipus d’alimentació d’una antena microstrip amb el major ample de banda d’adaptació és l’alimentació mitjançant acoblament per apertura. Si a l’antena s’introdueixen dos apertures de forma ortogonal, alimentades amb un desfasament de 90º entre elles, s’aconsegueix polarització circular. L’opció de separar les apertures redueix la transferència de potència entre elles, i disminueix el guany de polarització creuada. La xarxa d’alimentació dissenyada és un divisor de Wilkinson amb una línia de λ/4 a la freqüència central, encara que el desfasament als extrems de la banda no sigui de 90º. Com a xarxa d’alimentació es va provar un hibrid de 90º, però l’elevat valor del paràmetre S21 de l’antena impossibilita l’adaptació a l’entrada del hibrid.

Tensor products of Leavitt path algebras

Vegeu el resum a l'inici del document del fitxer adjunt.

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