Sub-graph based Multicast Protection in WDM Networks: A Multi/Many-Objective Evolutionary Algorithms approaches

In this paper is addressed the multicast routing-and-protection, and wavelength assignment (MRPWA) problem which is critical for the success of applications point-multipoint in WDM networks. Basically, it is proposed the design of the primary and protection multicast routes, where the resources protection are based on sub-graph protection strategy subject to the quality requirements of the QoP protection: dedicated (1 + 1), shared (M: N) and better effort (without protection). In this way, NSGA-II and NSGA-III, evolutionary algorithms, are applied to MRPWA considering multi- and many-objectives optimization context, respectively. The evolutionary algorithms optimize simultaneously: (i) the total number of links used, (ii) the number of wavelength converters, (iii) the number of splitter nodes, and (iv) the number of destinations served-and-protected. Considering Hyper-volume measure, the experimental tests on a set of instances indicate that the protection approach based on sub-graph proves to be promising in comparison to the dualtree protection strategy. On the other hand, the evolutionary technique oriented to many-objectives (NSGA-III) is more convenient than the oriented towards multi-objectives (NSGA-II) in the study problem.XIII Workshop Arquitectura, Redes (WARSO)Red de Universidades con Carreras en Informática (RedUNCI

Sub-graph based Multicast Protection in WDM Networks: A Multi/Many-Objective Evolutionary Algorithms approaches

In this paper is addressed the multicast routing-and-protection, and wavelength assignment (MRPWA) problem which is critical for the success of applications point-multipoint in WDM networks. Basically, it is proposed the design of the primary and protection multicast routes, where the resources protection are based on sub-graph protection strategy subject to the quality requirements of the QoP protection: dedicated (1 + 1), shared (M: N) and better effort (without protection). In this way, NSGA-II and NSGA-III, evolutionary algorithms, are applied to MRPWA considering multi- and many-objectives optimization context, respectively. The evolutionary algorithms optimize simultaneously: (i) the total number of links used, (ii) the number of wavelength converters, (iii) the number of splitter nodes, and (iv) the number of destinations served-and-protected. Considering Hyper-volume measure, the experimental tests on a set of instances indicate that the protection approach based on sub-graph proves to be promising in comparison to the dualtree protection strategy. On the other hand, the evolutionary technique oriented to many-objectives (NSGA-III) is more convenient than the oriented towards multi-objectives (NSGA-II) in the study problem.XIII Workshop Arquitectura, Redes (WARSO)Red de Universidades con Carreras en Informática (RedUNCI

Performance Evaluation of Non-Hitless Spectrum Defragmentation Algorithms in Elastic Optical Networks

Fragmentation in Elastic Optical Networks is an issue caused by isolated, non-aligned, and non-contiguous frequency slots that can not be used to allocate new connection request to the network, due to the optical layer restrictions imposed to the Routing and Spectrum Assignment (RSA) algorithms. To deal with this issue, several studies about Spectrum Defragmentation have been presented. In this work, we analyze the most important Non-Hitless Defragmentation Algorithms found in the literature, with proactive and reactive approaches that include rerouting and non-rerouting schemes, and compare their performance in terms of Blocking Probability, Entropy, and Bandwidth Fragmentation Ratio. Simulations results showed that the Fragmentation Aware schemes outperformed the other algorithms in low traffic load, but the Reactive schemes got better results in high traffic load.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Sub-graph based Multicast Protection in WDM Networks: A Multi/Many-Objective Evolutionary Algorithms approaches

In this paper is addressed the multicast routing-and-protection, and wavelength assignment (MRPWA) problem which is critical for the success of applications point-multipoint in WDM networks. Basically, it is proposed the design of the primary and protection multicast routes, where the resources protection are based on sub-graph protection strategy subject to the quality requirements of the QoP protection: dedicated (1 + 1), shared (M: N) and better effort (without protection). In this way, NSGA-II and NSGA-III, evolutionary algorithms, are applied to MRPWA considering multi- and many-objectives optimization context, respectively. The evolutionary algorithms optimize simultaneously: (i) the total number of links used, (ii) the number of wavelength converters, (iii) the number of splitter nodes, and (iv) the number of destinations served-and-protected. Considering Hyper-volume measure, the experimental tests on a set of instances indicate that the protection approach based on sub-graph proves to be promising in comparison to the dualtree protection strategy. On the other hand, the evolutionary technique oriented to many-objectives (NSGA-III) is more convenient than the oriented towards multi-objectives (NSGA-II) in the study problem.XIII Workshop Arquitectura, Redes (WARSO)Red de Universidades con Carreras en Informática (RedUNCI

Performance Evaluation of Non-Hitless Spectrum Defragmentation Algorithms in Elastic Optical Networks

Fragmentation in Elastic Optical Networks is an issue caused by isolated, non-aligned, and non-contiguous frequency slots that can not be used to allocate new connection request to the network, due to the optical layer restrictions imposed to the Routing and Spectrum Assignment (RSA) algorithms. To deal with this issue, several studies about Spectrum Defragmentation have been presented. In this work, we analyze the most important Non-Hitless Defragmentation Algorithms found in the literature, with proactive and reactive approaches that include rerouting and non-rerouting schemes, and compare their performance in terms of Blocking Probability, Entropy, and Bandwidth Fragmentation Ratio. Simulations results showed that the Fragmentation Aware schemes outperformed the other algorithms in low traffic load, but the Reactive schemes got better results in high traffic load.Sociedad Argentina de Informática e Investigación Operativa (SADIO

KhronoPol: Time Planning System for the Facultad Politécnica UNA

This work presents an integral solution for the administration and automatic generation of class schedules and class assignment denominated KhronoPol. The system developed is based on a modular architecture, multiuser and accessible from the Internet with a high degree of maintainability. Given the complexity that the problem can reach KhronoPol has 2 phases: in the first phase a Genetic Algorithm seeks the optimal allocation of time and subjects, and the second phase a Backtracking Algorithm performs the assignment of classrooms to previously calculated subjects. It has been taken as a case study the schedule of the Facultad Polit´ecnica - Universidad Nacional de Asunci´on (FPUNA) in which two real scenarios are posed: (a) initial scheduling, and (b) rescheduling minimizing changes considering new sections and changes of teachers. The FPUNA consists of 16 undergraduate degrees, 1.000 courses per semester, 60 classrooms of different capacities, and 300 teachers.Sociedad Argentina de Informática e Investigación Operativa (SADIO

WDM Network Design with Node Protection : An approach based on MOACO

This work studies the survivable optical network design prob- lem subject to simple node failure where disruption by network recon g- uration degrades the Quality of Service. The impact of the number of recon gurations when a node fails over other objective functions is crit- ical. Therefore, a Multi-Objective Ant Colony Optimization (MOACO) Algorithm is proposed, which tries to nd the best network design as well as the primary and back-up multicast trees considering a multicast re- quest set. The MOACO algorithm simultaneously minimizes the network design cost, the maximum end-to-end optical delay, the total number of recon gurations and the maximum number of recon gurations. The ex- perimental results over di erent instances show the bene ts of the pro- posed approach front to two state-of-the-art protection approaches based on total or partial recon guration.IX Workshop de Arquitecturas, Redes y Sistemas OperativosRed de Universidades con Carreras en Informática (RedUNCI

WDM Network Design with Node Protection : An approach based on MOACO

This work studies the survivable optical network design prob- lem subject to simple node failure where disruption by network recon g- uration degrades the Quality of Service. The impact of the number of recon gurations when a node fails over other objective functions is crit- ical. Therefore, a Multi-Objective Ant Colony Optimization (MOACO) Algorithm is proposed, which tries to nd the best network design as well as the primary and back-up multicast trees considering a multicast re- quest set. The MOACO algorithm simultaneously minimizes the network design cost, the maximum end-to-end optical delay, the total number of recon gurations and the maximum number of recon gurations. The ex- perimental results over di erent instances show the bene ts of the pro- posed approach front to two state-of-the-art protection approaches based on total or partial recon guration.IX Workshop de Arquitecturas, Redes y Sistemas OperativosRed de Universidades con Carreras en Informática (RedUNCI

Técnica de pronóstico de la demanda basada en Business Intelligence y Machine Leaming

Pronosticar ciertos eventos constituye una actividad por la cual el ser humano siempre sintió fascinación y necesidad de realizarlo. En la actualidad, uno de esos eventos se relacionan con las empresas y consiste en pronosticar la demanda de ventas para un período futuro, a su vez representa uno de los más importantes retos con que se enfrenta una organización. Este pronóstico de demanda disminuirá la incertidumbre del Gerente de Compras en el momento de tomar decisiones acerca del volumen de productos a adquirir para la reposición de stock. Este trabajo propone una nueva técnica de pronósticos basada en la integración de herramientas de Business Intelligence y Machine Leaming. Los experimentos indican que el modelo propuesto alcanza resultados prometedores y esta nueva técnica puede transformarse en una sólida herramienta de apoyo para la toma de decisionesSociedad Argentina de Informática e Investigación Operativa (SADIO

Diseño de un modelo de optimización para la disposición final de envases de vidrios en los barrios de la ciudad de Asunción - Paraguay

Una gestión integral de residuos sólidos eficiente y sostenible en términos ambientales, es aquella que permite que llegue como máximo un 20% de los residuos totales a vertederos o rellenos sanitarios como destino final (Abbate, 2011). Para el 2017, el Ministerio del Ambiente y Desarrollo Sostenible estimó que un 20% de los 254 municipios del Paraguay cuentan con programas de reciclajes (MADES, 2020), utilizando precarios procesos de separación de materiales en vertederos municipales y clandestinos, con trabajadores informales. Actualmente, existe una brecha enorme entre los negocios realizados por los grupos de recicladores en el principal relleno sanitario de la capital, Cateura, y el volumen potencial de negocios que podría realizarse en el mismo lugar, desde una perspectiva distinta. Salvo casos aislados, como el programa Recicla 2.0 de Asunción para potenciar el reciclaje en barrios, se resalta que la separación y recolección de residuos tiene poca participación en las agendas medioambientales, y en este trabajo se da foco a uno de los residuos menos considerados: el vidrio (MADES, 2020). En este sentido, con el fin de fortalecer la gestión de residuos en los municipios, se plantea la posibilidad de estructurar la disposición temporal y final del vidrio, mediante un modelo de programación mixta entera lineal que permita ubicar puntos de captación de residuos (puntos verdes) en los barrios de la ciudad de Asunción, y también localizar centros de acopio con posibilidades de triturado y/o acondicionamiento de dicho residuo. Además, se desea asignar y rutear vehículos para la recolección desde los puntos verdes hasta los centros de acopio, y programar la distribución de materiales procesados hasta los clientes finales. Conjuntamente, se analizarán estrategias económicamente viables para determinar la rentabilidad de la inversión en una unidad de negocio verde, proveedora de clientes que utilicen productos reciclados o reutilizados como insumo industrial o comercial. Finalmente, es axiomático que, si se clasifican los residuos de las viviendas en reciclables y no reciclables, el mercado del reciclaje se incrementará considerablemente con el consecuente impacto social, económico y ambiental positivo que ello conlleva, además de la mejora ambiental que implicaría no enterrar un gran porcentaje de materiales que hoy tienen valor comercial (Abbate, 2011); razón por la que se emprende esta investigación.Sociedad Argentina de Informática e Investigación Operativ