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

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm

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

Enhanced multi-layer protection in multi-service GMPLS networks

This paper focuses on QoS routing with protection in an MPLS network over an optical layer. In this multi-layer scenario each layer deploys its own fault management methods. A partially protected optical layer is proposed and the rest of the network is protected at the MPLS layer. New protection schemes that avoid protection duplications are proposed. Moreover, this paper also introduces a new traffic classification based on the level of reliability. The failure impact is evaluated in terms of recovery time depending on the traffic class. The proposed schemes also include a novel variation of minimum interference routing and shared segment backup computation. A complete set of experiments proves that the proposed schemes are more efficient as compared to the previous ones, in terms of resources used to protect the network, failure impact and the request rejection ratio

Adding new components to the knowledge plane GMPLS over WDM networks

A recent study defines a new network plane: the knowledge plane. The incorporation of the knowledge plane over the network allows having more accurate information of the current and future network states. In this paper, the introduction and management of the network reliability information in the knowledge plane is proposed in order to improve the quality of service with protection routing algorithms in GMPLS over WDM networks. Different experiments prove the efficiency and scalability of the proposed scheme in terms of the percentage of resources used to protect the network

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

Lightweight monitoring of label switched paths for bandwidth management

The purpose of resource management is the efficient and effective use of network resources, for instance bandwidth. In this article, a connection oriented network scenario is considered, where a certain amount of bandwidth is reserved for each label switch path (LSP), which is a logical path, in a MPLS or GMPLS environment. Assuming there is also some kind of admission control (explicit or implicit), these environments typically provide quality of service (QoS) guarantees. It could happen that some LSPs become busy, thus rejecting connections, while other LSPs may be under-utilised. We propose a distributed lightweight monitoring technique, based on threshold values, the objective of which is to detect congestion when it occurs in an LSP and activate the corresponding alarm which will trigger a dynamic bandwidth reallocation mechanism

Dynamic bandwidth management as part of an integrated network management system based on distributed agents

We present a system for dynamic network resource configuration in environments with bandwidth reservation and path restoration mechanisms. Our focus is on the dynamic bandwidth management results, although the main goal of the system is the integration of the different mechanisms that manage the reserved paths (bandwidth, restoration, and spare capacity planning). The objective is to avoid conflicts between these mechanisms. The system is able to dynamically manage a logical network such as a virtual path network in ATM or a label switch path network in MPLS. This system has been designed to be modular in the sense that in can be activated or deactivated, and it can be applied only in a sub-network. The system design and implementation is based on a multi-agent system (MAS). We also included details of its architecture and implementation

Tombes i cementiris del sector nord-oriental del turó d'Empúries

Descripció de les troballes arqueològiques que al 1982 es van fer a la part nord-oriental del turó d’Empúries, conegut com Muntanya dels Horts, o Horts de la Palanca.. Es trcta de 2 enterraments infantils en àmfora

Reviu la vil·la romana de Tossa

Descripció de les actuacions al jaciment arqueològic de la vil•la romana dels Ametllers de Tossa de Mar, durant l’estiu del 2000. La finalitat d’aquestes actuacions era realitzar un recorregut coherent i atractiu des del punt de vista museístic i turístic, per tal de presentar el jaciment als habitants i als visitants de la vil•la

Roses a l'antiguitat tardana: el cementiri de Santa Maria

Article sobre els resultats de les excavacions a Roses que daten de entre l’antiguitat tardana i els inicis de l’alta edat mitjana, concretament es tracta del cementiri de Santa Maria

Noves aportacions a l'estudi dels orígens de Gerunda

Revisió de les teories sobre els orígens de Gerunda. Es tracten aspectes com ara el nom de la ciutat, la situació topogràfica i la planta del municipi romà, la localització sobre el perímetre emmurallat que envolta la ciutat romana i la troballa de ceràmica indígena anterior a la conquesta romana

Algunes notes a l'entorn de la vil·la del Pla de l'Horta a Sarrià de Dalt (Girona)

Es presenten notes sobre el jaciment arqueològic de la vil·la del Pla d'Horta a Sarrià de Dalt, com ara, la descripció de la situació i planta de l’edifici, els resultats de sondejos de les habitacions i la cronologia del jaciment i les fases d’ocupació

Empúries. De les darreries del segle III a mitjan segle I a.C. Algunes idees

A l’article s’estableixen un seguit d’hipòtesis que expliquen el procés històric d’Empúries al llarg dels del segle i mig immediatament anterior al canvi d’Era, és a dir, cap als segles II i I a.C. Es tracta de teories que es recolzen en evidències força segures

El Paisatge

El paisatge de l’Alta Garrotxa ha sofert canvis radicals al llarg del temps i molt especial a les darreres dècades. Es proporcionen dades estadístiques sobre bosc, bosquina, pastura, conreu, vegetació de cinglera i zona estèril (roca nua, etc.)