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

Infraestructuras com servicio en arquitecturas de nubes privadas

El objetivo de este trabajo es proporcionar una arquitectura de nube privada basada en sistemas virtualizados, desarrollando el concepto de IaaS, donde la arquitectura propuesta ofrece un nuevo modelo de servicio orientado especialmente a unainfraestructura que a su vez permita ofrecer el servicio de escritorios y servidores virtualizados al personal de la Fundación i2CAT.

Transfer of MPEG-2 Transport Stream over MPLS

This study examines how MPEG-2 Transport Stream, used in DVB-T video transmission, can be reliably and efficiently transferred to remote locations over an MPLS network. All the relevant technologies used in this scenario are also discussed in the study. This study was done for Digita Oy, which is a major radio and television content distributor in Finland. The theoretical part of the study begins with the introduction to MPLS technology and continues with explanation of IP Multicast and its components. The fourth section discusses MPEG-2 and the formation and content of MPEG-2 Transport Stream. These technologies were studied in relevant literature and RFC documentation. After the theoretical part of the study, the test setup and the test cases are presented. The results of the test cases, and the conclusions that can be drawn based on them, are discussed in the last section of the study. The tests showed that it is possible to transfer digital video quite reliably over an MPLS network using IP Multicast. By configuring the equipment correctly, the recovery time of the network in case of a failure can be shortened remarkably. Also, the unwanted effect of other traffic on the critical video traffic can be eliminated by defining the Quality of Service parameters correctly. There are, however, some issues that need to be tested further before this setup can be used in broadcast networks. Reliable operation of IP Multicast and proper error correction are the main subjects for future testing.

Buffer Capacity Allocation: A method to QoS support on MPLS networks

This paper describes an optimized model to support QoS by mean of Congestion minimization on LSPs (Label Switching Path). In order to perform this model, we start from a CFA (Capacity and Flow Allocation) model. As this model does not consider the buffer size to calculate the capacity cost, our model- named BCA (Buffer Capacity Allocation)- take into account this issue and it improve the CFA performance. To test our proposal, we perform several simulations; results show that BCA model minimizes LSP congestion and uniformly distributes flows on the network

Generación de Agentes Móviles Seguros a partir de Itinerarios y Arquitecturas Criptográficas

En este trabajo presentamos un esquema para la creación de agentes móviles seguros a partir de una representación del itinerario que deben seguir, el código a ejecutar, y una especificación de la arquitectura criptográfica con la que estarán protegidos. Este tipo de agentes es muy útil en aplicaciones seguras, pero su programación resulta muy complicada. El esquema propuesto facilita enormemente esta tarea, automatizando el proceso a partir de especificaciones concretas. En la práctica hemos conseguido un sistema de generación de código de fácil utilización que permite, no sólo la programación de agentes móviles seguros, sino también la creación sencilla de nuevos esquemas criptográficos para la protección del código y los datos de los agentes. El sistema puede usarse para desarrollar aplicaciones de propósito general basadas en el framework de ejecución de agentes Jade.

Arquitecturas pintadas. Del Renacimiento al siglo XVIII

Los transfondos arquitectónicos fueron utilizados a lo largo de los siglos XIV y XV como recursos de creación ilusionista de espacio, de la cual los pintores hacían alarde con la inclusión de pavimentos, techumbres o, en general, de ambientes interiores. Comenzaron también a aparecer en la pintura del quattrocento como complemento indispensable del paisaje, como excusa para una captación detallista de los interiores y de la vida cotidiana, y se elevaron a la condición alegórica cuando se constituyeron, por ejemplo, en la imagen del paganismo vencido por la religión cristiana. Desde el siglo XVI, asimismo, las representaciones pictóricas de edificios singulares y de conjuntos monumentales urbanos adquirieron una función documental, y se consolidaron como un objeto narrativo de carácter topográfico. Se convirtieron en un recurso poético cuando, especialmente a lo largo del siglo XVIII, se utilizaron para crear ambientes bucólicos y misteriosos. Fueron, por último, aplicadas muy a menudo con una voluntad escenográfica y teatral, un recurso visual que entronca directamente con el que, probablemente, haya sido el papel más importante de los desarrollados a lo largo de la época moderna por las arquitecturas incluidas en la pintura: el compositivo, la arquitectura utilizada como ordenadora del espacio y como distribuidora de acciones, escenas y personajes; la arquitectura entendida, pues, como vehículo narrativo.

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This 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), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

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

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

Proyecto de implementación de la red IP MPLs para la ETB

En el primer capítulo, Procesos de Iniciación, se especifican todas las actividades realizadas para darle vida al proyecto, comenzando con la reuniones que involucran los Stakeholders, considerando que ETB es una compañía del Distrito Capital – Bogotá, la su aprobación para continuar con la fase de licitación e implementación del proyecto. En el segundo capítulo, se tiene como proceso núcleo, todos los procesos relacionados con las Gerencias de Integración, Alcance, Plantación y Programación, de Costos, detallando en cada una de ellas las actividades que permitan Planear y diseñar el proyecto y darle un alcance que permita cumplir con las actividades en tiempo, costo; Los procesos que Facilitan y Complementa el proyecto, dentro de ellos se encuentran, la plantación de los proceso de comunicación, adquisición de materiales e insumos, manejo de los recursos humanos, control de calidad y la planeación de los riesgos a los cuales puede estar expuesto el proyecto y como realizar la mitigación de estos. Como tercer capítulo, se encuentra el procesos de ejecución, dentro del cual se detalla la gestión en cada una de las fases, verificando lo que se esta ejecutando del proyecto, como se esta contrndo que realmente se estén llevando a cabo todas las actividades que se detallaron en el capítulo dos y si existe alguna diferencia como se esta corrigiendo. En capítulo cuarto, procesos de control, los cambios se pueden dar en cualquier etapa de ejecución del proyecto, por lo tanto se definieron herramientas o mecanismos para el registro, seguimiento y control de los cambios en un proyecto. Por ultimo, en el capítulo quinto, esta el pproceso de cierre, se ejecutan todas las actividades requeridas para el cierre de los contratos a terceros realizados en el proyecto y la aceptación formal de los mismos.