Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)

Bhaskaran, Kavitha; Triay, Joan; Vokkarane, Vinod M.

doi:10.1109/icc.2011.5962826

Cited by 33 publications

(18 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…La Figura 3 muestra una clasificación de las estrategias encontradas en la literatura para resolver los problemas de SLE y DLE. Los algoritmos heurísticos son muy utilizados en la búsqueda de buenas rutas y no necesariamente rutas óptimas, tales como: Hormiga [12][13][14], Genéticos [3,7,22], Búsqueda Tabú [1,[15][16][17][18][19] y Simulated Annealing [8], todos los trabajos con la estrategia de dividir el problema en dos partes, excepto [3,[7][8] que los hace integralmente, es decir, sin dividir el problema solucionándolo en un solo proceso algorítmico.…”

Section: Descripción De Los Algoritmosunclassified

Enrutamiento y asignación de longitud de onda: una solución con búsqueda Tabú en tráfico dinámico

García

López

Méndez

et al. 2014

Ingeniare. Rev. chil. ing.

View full text Add to dashboard Cite

Enrutamiento y asignación de longitud de onda: una solución con búsqueda Tabú en tráfico dinámico Routing wavelength assignement: a solution with Tabu search in dynamic traffic RESUMENEl aumento de la demanda de servicios por internet ha generado la necesidad de aumentar la oferta de ancho de banda y el acceso oportuno a los servicios de transporte en las redes ópticas con tecnología WDM (Wavelength Division Multiplexing). Sin embargo, los algoritmos heurísticos como algoritmos genéticos, Simulated Annealing, asociados a brindar este servicio, no logran un desempeño óptimo bajo alta carga de demanda en condiciones de tráfico dinámico. El presente trabajo propone una estrategia integral para solucionar el DLE (Dynamic Ligthpath Establishment), es decir, sin dividir el problema, utilizando el algoritmo Búsqueda Tabú. Los resultados muestran que el algoritmo utilizado responde mejor en escenarios dinámicos, pero con una alta utilización de la red.Palabras clave: Recocido simulado, algoritmo genético, longitud de onda, búsqueda Tabú. ABSTRACT

show abstract

Section: Descripción De Los Algoritmosunclassified

Enrutamiento y asignación de longitud de onda: una solución con búsqueda Tabú en tráfico dinámico

García

López

Méndez

et al. 2014

Ingeniare. Rev. chil. ing.

View full text Add to dashboard Cite

show abstract

“…(Note that [11] also briefly touches on the associated online routing problem. Heuristic solutions to online anycast routing in WDM networks are also studied in [12], which proposes to vary the number of candidate anycast sites over time, according to time-varying load, and highlights the impact of physical layer impairments. )…”

Section: Related Workmentioning

confidence: 99%

Resilient network dimensioning for optical grid/clouds using relocation

Develder

Buysse

Leenheer

et al. 2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-In this paper we address the problem of dimensioning infrastructure, comprising both network and server resources, for large-scale decentralized distributed systems such as grids or clouds. We will provide an overview of our work in this area, and in particular focus on how to design the resulting grid/cloud to be resilient against network link and/or server site failures. To this end, we will exploit relocation: under failure conditions, a request may be sent to an alternate destination than the one under failure-free conditions. We will provide a comprehensive overview of related work in this area, and focus in some detail on our own most recent work. The latter comprises a case study where traffic has a known origin, but we assume a degree of freedom as to where its end up being processed, which is typically the case for e.g., grid applications of the bagof-tasks (BoT) type or for providing cloud services. In particular, we will provide in this paper a new integer linear programming (ILP) formulation to solve the resilient grid/cloud dimensioning problem using failure-dependent backup routes. Our algorithm will simultaneously decide on server and network capacity. We find that in the anycast routing problem we address, the benefit of using failure-dependent (FD) rerouting is limited compared to failure-independent (FID) backup routing. We confirm our earlier findings in terms of network capacity savings achieved by relocation compared to not exploiting relocation (order of 6-10% in the current case studies).

show abstract

“…This model amounts to anycast routing, solving the problem of selecting a route to one target destination chosen from a set of nodes, as opposed to unicast where the sourcedestination pair is known in advance. Anycast has been shown to be beneficial for the overall network performance, either in terms of network survivability [5,6], impairment avoidance [7], energy minimization [8,9] or blocking probability reduction [10]. Consequently, the control mechanism of an integrated network and IT infrastructure to select both the data center (i.e., the IT end point, without initially specifying its location) and the network resources (the path to the chosen IT end point) becomes critical for guaranteeing an efficient operation of the entire infrastructure.…”

Section: Introductionmentioning

confidence: 99%

NCP+: An integrated network and IT control plane for cloud computing

Buysse

Leenheer

Contreras

et al. 2014

Optical Switching and Networking

View full text Add to dashboard Cite

Cloud computing, building on the idea of "computation as a public utility" is made possible by the increased network capabilities in terms of bandwidth and reduced latency. Today, the cloud paradigm today sees adoption in many businesses, given its advantages not only from a customer point of view (e.g., universal access to the same applications across all company branches), but also from the application provider and network operator perspective (e.g., software updates no longer need to be distributed). To be able to offer cloud computing services efficiently, service providers need not just an infrastructure comprising both network and IT resources, but especially a control system that is able to orchestrate such integrated network and IT services. This paper offers a new proposal for such a system: an enhanced network control plane, the NCP+, which is based on a GMPLS control plane with a Hierarchical Path Computation Element (PCE) architecture able to jointly make network routing and IT server provisioning decisions. Indeed, in the assumed cloud paradigm, a user generally does not care what exact server the offered service is using, as long as its service requirements are met: the anycast principle applies. The paper discusses (i) the architecture of the NCP+, (ii) two IT-aware aggregation mechanisms to be used in the hierarchical PCE approach, and (iii) routing and scheduling algorithms for those aggregation mechanisms. We conclude this work with a thorough simulation analysis of the aggregation and routing/scheduling policies showing that Full Mesh aggregation where the domain topology is represented by a complete graph, although less scalable in terms of computation time, is able to provision efficiently using the proposed load balancing routing and scheduling policy. However, for a scenario with stringent IT requirements, Star could be used in parallel for scenarios where end-to-end setup times are important.

show abstract

Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)

Cited by 33 publications

References 8 publications

Enrutamiento y asignación de longitud de onda: una solución con búsqueda Tabú en tráfico dinámico

Enrutamiento y asignación de longitud de onda: una solución con búsqueda Tabú en tráfico dinámico

Resilient network dimensioning for optical grid/clouds using relocation

NCP+: An integrated network and IT control plane for cloud computing

Contact Info

Product

Resources

About