Authors:
Anabela Moreira Bernardino
1
;
Eugénia Moreira Bernardino
1
;
Juan Manuel Sánchez-Pérez
2
;
Juan Antonio Gómez-Pulido
2
and
Miguel Angel Vega-Rodríguez
2
Affiliations:
1
Polytechnic Institute of Leiria, Portugal
;
2
University of Extremadura, Spain
Keyword(s):
Communication Networks, Weighted Ring Arc-Loading Problem, Scatter Search Algorithm, Bio-inspired Algorithms.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Bio-inspired Hardware and Networks
;
Co-Evolution and Collective Behavior
;
Computational Intelligence
;
Evolutionary Computing
;
Genetic Algorithms
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Soft Computing
;
Swarm/Collective Intelligence
Abstract:
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.
(More)