A carregar...
Publicação
Solving the non-split weighted ring arc-loading problem in a resilient packet ring using particle swarm optimization
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| Massive growth of the Internet traffic in last decades has motivated the design of high-speed optical networks. Resilient Packet Ring (RPR), also known as IEEE 802.17, is a standard designed for the optimized transport of data traffic over optical fiber ring networks. Its design is to provide the resilience found in SONET/SDH networks but instead of setting up circuit oriented connections, providing a packet based transmission. This is to increase the efficiency of Ethernet and IP services. In this paper, a weighted ring arc-loading problem (WRALP) is considered which arises in engineering and planning of the RPR systems (combinatorial optimization NP- complete problem). Specifically, for a given set of non-split and uni-directional point-to-point demands (weights), the objective is to find the routing for each demand (i.e., assignment of the demand to either clockwise or counter-clockwise ring) so that the maximum arc load is minimized. This paper suggests four variants of Particle Swarm Optimization (PSO), combined with a Local Search (LS) method to efficient non-split traffic loading on the RPR. Numerical simulation results show the effectiveness and efficiency of the proposed methods. | 1.6 MB | Adobe PDF |
Orientador(es)
Resumo(s)
Massive growth of the Internet traffic in last decades has motivated the design of high-speed optical networks. Resilient Packet Ring (RPR), also known as IEEE 802.17, is a standard designed for the optimized transport of data traffic over optical fiber ring networks. Its design is to provide the resilience found in SONET/SDH networks but instead of setting up circuit oriented connections, providing a packet based transmission. This is to increase the efficiency of Ethernet and IP services. In this paper, a weighted ring arc-loading problem (WRALP) is considered which arises in engineering and planning of the RPR systems (combinatorial optimization NP- complete problem). Specifically, for a given set of non-split and uni-directional point-to-point demands (weights), the objective is to find the routing for each demand (i.e., assignment of the demand to either clockwise or counter-clockwise ring) so that the maximum arc load is minimized. This paper suggests four variants of Particle Swarm Optimization (PSO), combined with a Local Search (LS) method to efficient non-split traffic loading on the RPR. Numerical simulation results show the effectiveness and efficiency of the proposed methods.
Descrição
1st International Joint Conference on Computational Intelligence, IJCCI 2009, 5 October 2009 through 7 October 2009 - Code 81347
Palavras-chave
Weighted ring Arc-Loading problem Particle swarm optimization Local search Optimization
Contexto Educativo
Citação
Bernardino, A. M., Bernardino, E. M., Sánchez-Pérez, J. M., Pulido, J. A. G., & Vega-Rodríguez, M. Á. (2009, October). Solving the non-split weighted ring arc-loading problem in a Resilient Packet Ring using Particle Swarm Optimization. In International Conference on Evolutionary Computation (Vol. 2, pp. 230-236). SCITEPRESS. DOI: https://doi.org/10.5220/0002322102300236.
Editora
SciTePress - Science and and Technology Publications
Licença CC
Sem licença CC