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

G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours

In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent wavelength-routing switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive optical-electrical-optical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one ingress node (all inline) and, b) traffic demands can partially use optical routes to reach their destination. The proposed optical routes are named "lighttours" since the traffic originating from different sources can be forwarded together in a single optical route, i.e., as taking a "tour" over different sources towards the same destination. The possibility of creating lighttours is the consequence of a novel WRS architecture proposed in this article, named "enhanced grooming" (G+). The ability to groom more traffic in the middle of a lighttour is achieved with the support of a simple optical device named lambda-monitor (previously introduced in the RingO project). In this article, we present the new WRS architecture and its advantages. To compare the advantages of lighttours with respect to classical lightpaths, an integer linear programming (ILP) model is proposed for the well-known multilayer problem: traffic grooming, routing and wavelength assignment The ILP model may be used for several objectives. However, this article focuses on two objectives: maximizing the network throughput, and minimizing the number of optical-electro-optical conversions used. Experiments show that G+ can route all the traffic using only half of the total OEO conversions needed by classical grooming. An heuristic is also proposed, aiming at achieving near optimal results in polynomial time

Asymmetric tunnels in P2MP LSPs as a label space reduction method

The objective of traffic engineering is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization, few works have focused on LSR (label switched router) label space. This paper proposes an algorithm that takes advantage of the MPLS label stack features in order to reduce the number of labels used in LSPs. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The described algorithm sets up NHLFE (next hop label forwarding entry) tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the described algorithm achieves a great reduction factor in the label space. The presented works apply for both types of connections: P2MP (point-to-multipoint) and P2P (point-to-point)

A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels

The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P

Mapping sub-flows to p2mp LSPs

In previous work we proposed a multi-objective traffic engineering scheme (MHDB-S model) using different distribution trees to multicast several flows. In this paper, we propose a heuristic algorithm to create multiple point-to-multipoint (p2mp) LSPs based on the optimum sub-flow values obtained with our MHDB-S model. Moreover, a general problem for supporting multicasting in MPLS networks is the lack of labels. To reduce the number of labels used, a label space reduction algorithm solution is also considered

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

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

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

Decentralized model reference control of flexible cable-stayed beam structures

A decentralized model reference controller is designed to reduce the magnitude of the transversal vibration of a flexible cable-stayed beam structure induced by a seismic excitation. The controller design is made based on the principle of sliding mode such that a priori knowledge

Échame otro cable.

Durante una convocatoria anterior y gracias a la ayuda de los proyectos Échame un cable de PNTIC, Jóvenes estudiantes del Ayuntamiento de Palma y el grupo de Trabajo, se instalaron los primeros cables de la intranet del centro, se instaló el primer servidor de páginas web local y se estableció la conexión a Internet para ocho ordenadores del centro. El grupo de trabajo solicitó ampliar el programa ya que el centro se encontraba en el Proyecto Atenea y contaba con un presupuesto aceptable y la implicación de la comunidad escolar

Proceso de Internacionalización y aproximación a la logística de servicios: TELMEX COLOMBIA

Telmex es una organización que inicia su operación como empresa estatal mexicana con bajos niveles de eficiencia, posterior a su privatización tomó un nuevo rumbo en sus procesos internos, llevándola a generar modelos de negocio diferenciados y enfocados a la prestación de servicios de telecomunicación a la vanguardia. A partir de la búsqueda de nuevos horizontes la compañía logra tener presencia en la mayoría de los países del continente americano operando bajo la marca de “Telmex Internacional”, y a su vez, con sus respectivas subsidiarias en cada uno de los diferentes países, con el objetivo de satisfacer las necesidades locales con mayor efectividad. Con el apoyo de los diferentes acercamientos teóricos se busca identificar los patrones que le permitieron a Telmex llegar a posicionarse como una compañía líder en el sector de las telecomunicaciones en Latinoamérica y específicamente en Colombia, manteniéndose en un mercado competitivo mediante la oferta de servicios de empaquetamiento ajustados a las necesidades de los clientes.

Proceso de Internacionalización y aproximación a la logística de servicios: TELMEX COLOMBIA

Telmex es una organización que inicia su operación como empresa estatal mexicana con bajos niveles de eficiencia, posterior a su privatización tomó un nuevo rumbo en sus procesos internos, llevándola a generar modelos de negocio diferenciados y enfocados a la prestación de servicios de telecomunicación a la vanguardia. A partir de la búsqueda de nuevos horizontes la compañía logra tener presencia en la mayoría de los países del continente americano operando bajo la marca de “Telmex Internacional”, y a su vez, con sus respectivas subsidiarias en cada uno de los diferentes países, con el objetivo de satisfacer las necesidades locales con mayor efectividad. Con el apoyo de los diferentes acercamientos teóricos se busca identificar los patrones que le permitieron a Telmex llegar a posicionarse como una compañía líder en el sector de las telecomunicaciones en Latinoamérica y específicamente en Colombia, manteniéndose en un mercado competitivo mediante la oferta de servicios de empaquetamiento ajustados a las necesidades de los clientes

La vida continúa: relatos de cómo se vive y se supera el ser víctima

Este trabajo es una colección de perfiles y crónicas sobre personas que tienen tres cosas en común: son víctimas de la violencia colombiana, el hecho de ser víctimas los afectó profundamente, y decidieron continuar con sus vidas pese a ello.

Ruta de internacionalización : Claro Telecomunicaciones.

Actualmente, los procesos de expansión y apertura hacia nuevos mercados, son cada vez más implementados por parte de las grandes empresas. La aplicación de las teorías de internacionalización, han ayudado al desarrollo de dichos procesos en favor del crecimiento y proliferación de las compañías alrededor del mundo.