Publication
Solving the non-split weighted ring arc-loading problem in a resilient packet ring using particle swarm optimization
dc.contributor.author | Bernardino, Anabela | |
dc.contributor.author | Bernardino, Eugénia | |
dc.contributor.author | Sánchez-Pérez, Juan Manuel | |
dc.contributor.author | Gómez-Pulido, Juan Antonio | |
dc.contributor.author | Vega-Rodríguez, Miguel Angel | |
dc.date.accessioned | 2025-06-02T11:46:31Z | |
dc.date.available | 2025-06-02T11:46:31Z | |
dc.date.issued | 2009-10 | |
dc.description | 1st International Joint Conference on Computational Intelligence, IJCCI 2009, 5 October 2009 through 7 October 2009 - Code 81347 | |
dc.description.abstract | 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. | eng |
dc.identifier.citation | 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. | |
dc.identifier.doi | 10.5220/0002322102300236 | |
dc.identifier.isbn | 978-989674014-6 | |
dc.identifier.uri | http://hdl.handle.net/10400.8/13052 | |
dc.language.iso | eng | |
dc.peerreviewed | yes | |
dc.publisher | SciTePress - Science and and Technology Publications | |
dc.relation.hasversion | https://www.scitepress.org/PublishedPapers/2009/23221/23221.pdf | |
dc.relation.ispartof | Proceedings of the International Joint Conference on Computational Intelligence | |
dc.rights.uri | N/A | |
dc.subject | Weighted ring Arc-Loading problem | |
dc.subject | Particle swarm optimization | |
dc.subject | Local search | |
dc.subject | Optimization | |
dc.title | Solving the non-split weighted ring arc-loading problem in a resilient packet ring using particle swarm optimization | eng |
dc.type | conference paper | |
dspace.entity.type | Publication | |
oaire.citation.conferenceDate | 2009-10 | |
oaire.citation.conferencePlace | Funchal, Madeira, Portugal | |
oaire.citation.endPage | 236 | |
oaire.citation.startPage | 230 | |
oaire.citation.title | International Joint Conference on Computational Intelligence | |
oaire.citation.volume | 2 | |
oaire.version | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |
person.familyName | Moreira Bernardino | |
person.familyName | Bernardino | |
person.givenName | Anabela | |
person.givenName | Eugénia | |
person.identifier.ciencia-id | 081E-F3B8-316A | |
person.identifier.ciencia-id | 9616-F1BC-D8BD | |
person.identifier.orcid | 0000-0002-6561-5730 | |
person.identifier.orcid | 0000-0001-5301-5853 | |
person.identifier.scopus-author-id | 24402754700 | |
relation.isAuthorOfPublication | 375ebe15-f84c-46a4-a3d9-6e4935a92187 | |
relation.isAuthorOfPublication | 893cf15c-eff8-4e43-949c-c1de6eb87599 | |
relation.isAuthorOfPublication.latestForDiscovery | 375ebe15-f84c-46a4-a3d9-6e4935a92187 |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Solving the non-split weighted ring arc-loading problem in a resilient packet ring using particle swarm optimization.pdf
- Size:
- 1.6 MB
- Format:
- Adobe Portable Document Format
- Description:
- 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.
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.32 KB
- Format:
- Item-specific license agreed upon to submission
- Description: