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/IF 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. |
Year | Venue | Keywords |
---|---|---|
2010 | ICEC 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION | Communication Networks,Weighted Ring Arc-Loading Problem,Scatter Search Algorithm,Bio-inspired Algorithms |
Field | DocType | Citations |
Arc (geometry),Search algorithm,Computer science,Algorithm | Conference | 1 |
PageRank | References | Authors |
0.36 | 0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Anabela Moreira Bernardino | 1 | 75 | 9.44 |
Eugénia Moreira Bernardino | 2 | 75 | 9.44 |
Juan Manuel Sánchez-Pérez | 3 | 219 | 28.40 |
Juan Antonio Gómez-Pulido | 4 | 334 | 43.02 |
Miguel Ángel Vega Rodríguez | 5 | 22 | 4.16 |