A carregar...
Publicação
Solving the ring arc-loading problem using a hybrid scatter search algorithm
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| Resilient Packet Ring (RPR) is a standard that uses Ethernet switching and a dual counter-rotating ring topology to provide SONET-like network resiliency and optimised bandwidth usage, while it delivers multipoint Ethernet/IP services. An important optimisation problem arising in this context is the Weighted Ring Arc Loading Problem (WRALP). That is the design of a direct path for each request in a communication network, in such a way that high load on the arcs will be avoided, where an arc is an edge endowed with a direction. The load of an arc is defined as the total weight of those requests routed through the arc in its direction. WRALP ask for a routing scheme such that the maximum load on the arcs will be minimum. In this paper we study the loading problem without demand splitting and for solving it we propose a Hybrid Scatter Search (HSS) algorithm. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to WRALP instances, improving the results obtained by previous approaches. | 756.69 KB | Adobe PDF |
Orientador(es)
Resumo(s)
Resilient Packet Ring (RPR) is a standard that uses Ethernet switching and a dual counter-rotating ring topology to provide SONET-like network resiliency and optimised bandwidth usage, while it delivers multipoint Ethernet/IP services. An important optimisation problem arising in this context is the Weighted Ring Arc Loading Problem (WRALP). That is the design of a direct path for each request in a communication network, in such a way that high load on the arcs will be avoided, where an arc is an edge endowed with a direction. The load of an arc is defined as the total weight of those requests routed through the arc in its direction. WRALP ask for a routing scheme such that the maximum load on the arcs will be minimum. In this paper we study the loading problem without demand splitting and for solving it we propose a Hybrid Scatter Search (HSS) algorithm. Coupled with the Scatter Search algorithm we use a Tabu Search algorithm to locate the global minimum. We show that HSS is able to achieve feasible solutions to WRALP instances, improving the results obtained by previous approaches.
Descrição
Conference name - International Conference on Evolutionary Computation, ICEC 2010; Conference date - 24 October 2010 - 26 October 2010; Conference code - 83493
Fontes: https://scholar.google.com/scholar?q=Solving%20the%20ring%20arc-loading%20problem%20using%20a%20hybrid%20scatter%20search%20algorithm https://www.scitepress.org/papers/2010/30762/30762.pdf
Fontes: https://scholar.google.com/scholar?q=Solving%20the%20ring%20arc-loading%20problem%20using%20a%20hybrid%20scatter%20search%20algorithm https://www.scitepress.org/papers/2010/30762/30762.pdf
Palavras-chave
Communication Networks Weighted Ring Arc-Loading Problem Scatter Search Algorithm Bio-inspired Algorithms
Contexto Educativo
Citação
Bernardino, A. M., Bernardino, E. M., Sánchez-Pérez, J. M., Pulido, J. A. G., & Rodríguez, M. Á. V. (2010). Solving the Ring Arc-Loading Problem using a Hybrid Scatter Search Algorithm. In IJCCI (ICEC) (pp. 60-69). DOI: https://doi.org/10.5220/0003076200600069.
Editora
SciTePress - Science and Technology Publications
Licença CC
Sem licença CC