SOLVING THE NON-SPLIT WEIGHTED RING ARC-LOADING PROBLEM IN A RESILIENT PACKET RING USING PARTICLE SWARM OPTIMIZATION
Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gomez Pulido, Miguel Ángel Vega-Rodríguez
2009
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.
References
- Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., 2008. Solving the Ring Loading Problem using Genetic Algorithms with intelligent multiple operators. In Proceedings of International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008), pp. 235-244. Springer Berlin / Heidelberg.
- Carlisle, A., Doizier, G., 2001. An off- the-shelf PSO. ProcWorkshop Particle Swarm Optimization, Indianapolis, IN.
- Cho, K.S., Joo, U.G., Lee, H.S., Kim, B.T., Lee, W.D., 2005. Efficient Load Balancing Algorithms for a Resilient Packet Ring. ETRI Journal, Vol.27, no.1, pp. 110-113.
- Clerc, M., Kennedy, J., 2002. The particle swarmexplosion, stability, and convergence in a multidimensional complex space. IEEE transactions on evolutionary computation, Vol. 6, pp 58-64.
- Cosares, S., Saniee, I., 1994. An optimization problem related to balancing loads on SONET rings. Telecommunication Systems, Vol. 3, No. 2, pp. 165- 181. Springer Netherlands.
- Dell'Amico, M., Labbé, M., Maffioli, F., 1999. Exact solution of the SONET Ring Loading Problem. Operations Research Letters. Vol.25(3), pp. 119-129.
- Eberhart, R.C., Shi, Y., 2001. Particle swarm optimization: developments, applications and resources. In Proceedings 2001 Congress Evolutionary Computation, Vol.1. IEEE Press.
- Kennedy, J., Eberhart, R., 1995. Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks, pp. 1942-1948. IEEE Press.
- Kennedy, J., Eberhart, R., 1997. A discrete binary version of the particle swarm algorithm. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 4104-4108. IEEE Press.
- Kubat, P., Smith, J.M., 2005. Balancing traffic flows in resilient packet rings. Girard, André (ed.) et al., Performance evaluation and planning methods for the next generation internet. GERAD 25th Anniversary, Series 6, pp. 125-140. Springer.
- Myung, Y.S., Kim, H.G., 2004. On the ring loading problem with demand splitting. Operations Research Letters, Vol. 32, No. 2, pp. 167-173 (7), Elsevier.
- RPR Alliance, 2004. A Summary and Overview of the IEEE 802.17 Resilient Packet Ring Standard.
- Schrijver, A., Seymour, P., Winkler, P., 1998. The ring loading problem. SIAM Journal of Discrete Mathematics, Vol. 11, pp. 1-14.
- Shen, Q., Jiang, J.H., 2004. Modified Particle Swarm Optimization Algorithm for Variable Selection in MLR and PLS Modeling: QSAR Studies of Antagonism of Angiotensin II Antagonists. European Journal of Pharmaceutical Sciences, Amsterdam, Netherlands, Vol. 22, pp. 145-152.
- Wang, B.F., 2005. Linear time algorithms for the ring loading problem with demand splitting. Journal of Algorithms, Vol. 54, Issue 1, pp. 45-57. Academic Press, Inc., Duluth, MN.
- Wang, L., Wang, X., Fu, J., Zhen, L., 2008. A Novel Probability Binary Particle Swarm Optimization Algorithm and Its Application. Journal of software, Vol. 3, N. 9.
- Yuan J., Zhou S., 2004. Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting. Journal of Interconnection Networks, Vol. 5(2), pp. 193-200.
Paper Citation
in Harvard Style
Moreira Bernardino A., Moreira Bernardino E., Manuel Sánchez-Pérez J., Antonio Gomez Pulido J. and Ángel Vega-Rodríguez M. (2009). SOLVING THE NON-SPLIT WEIGHTED RING ARC-LOADING PROBLEM IN A RESILIENT PACKET RING USING PARTICLE SWARM OPTIMIZATION . In Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009) ISBN 978-989-674-014-6, pages 230-236. DOI: 10.5220/0002322102300236
in Bibtex Style
@conference{icec09,
author={Anabela Moreira Bernardino and Eugénia Moreira Bernardino and Juan Manuel Sánchez-Pérez and Juan Antonio Gomez Pulido and Miguel Ángel Vega-Rodríguez},
title={SOLVING THE NON-SPLIT WEIGHTED RING ARC-LOADING PROBLEM IN A RESILIENT PACKET RING USING PARTICLE SWARM OPTIMIZATION},
booktitle={Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)},
year={2009},
pages={230-236},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002322102300236},
isbn={978-989-674-014-6},
}
in EndNote Style
TY - CONF
JO - Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)
TI - SOLVING THE NON-SPLIT WEIGHTED RING ARC-LOADING PROBLEM IN A RESILIENT PACKET RING USING PARTICLE SWARM OPTIMIZATION
SN - 978-989-674-014-6
AU - Moreira Bernardino A.
AU - Moreira Bernardino E.
AU - Manuel Sánchez-Pérez J.
AU - Antonio Gomez Pulido J.
AU - Ángel Vega-Rodríguez M.
PY - 2009
SP - 230
EP - 236
DO - 10.5220/0002322102300236