Skip to main content

Efficient Load Balancing Using the Bees Algorithm

  • Conference paper
Modern Approaches in Applied Intelligence (IEA/AIE 2011)

Abstract

The massive growth of the Internet traffic in the 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 optimising the transport of data traffic over optical fiber ring networks. In this paper, we consider a Weighted Ring Arc-Loading Problem (WRALP), which arises in engineering and planning of the RPR systems. The WRALP is a combinatorial optimisation NP-complete problem. Given a set of point-to-point unidirectional traffic demands of a specified bandwidth, the demands should be assigned to the clockwise or to the counter-clockwise ring in order to yield the best performance. This paper suggests an efficient load balancing algorithm – the Bees Algorithm. We compare our results with nine meta-heuristics used in literature to solve the same problem. The simulation results verify the effectiveness and robustness of the Bees Algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. RPR Alliance: A Summary and Overview of the IEEE 802.17 Resilient Packet Ring Standard (2004)

    Google Scholar 

  2. Davik, F., Yilmaz, M., Gjessing, S., Uzun, N.: IEEE 802.17 Resilient Packet Ring Tutorial. IEEE Communications Magazine 42(3), 112–118 (2004)

    Article  Google Scholar 

  3. Yuan, P., Gambiroza, V., Knightly, E.: The IEEE 802.17 Media Access Protocol for High-Speed Metropolitan-Area Resilient Packet Rings. IEEE Network 18(3), 8–15 (2004)

    Article  Google Scholar 

  4. Cosares, S., Saniee, I.: An optimization problem related to balancing loads on SONET rings. Telecommunication Systems 3(2), 165–181 (1994)

    Article  Google Scholar 

  5. Dell’Amico, M., Labbé, M., Maffioli, F.: Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3), 119–129 (1999)

    Article  MATH  Google Scholar 

  6. Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. SIAM Journal of Discrete Mathematics 11, 1–14 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Myung, Y.S., Kim, H.G.: On the ring loading problem with demand splitting. Operations Research Letters 32(2), 167–173 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Wang, B.F.: Linear time algorithms for the ring loading problem with demand splitting. Journal of Algorithms 54(1), 45–57 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kubat, P., Smith, J.M.: Balancing traffic flows in resilient packet rings. In: Performance Evaluation and Planning Methods for the Next Generation Internet, Series 6, pp. 125–140. Springer, Heidelberg (2005), GERAD 25th Anniversary

    Chapter  Google Scholar 

  10. Cho, K.S., Joo, U.G., Lee, H.S., Kim, B.T., Lee, W.D.: Efficient Load Balancing Algorithms for a Resilient Packet Ring. ETRI Journal 27(1), 110–113 (2005)

    Article  Google Scholar 

  11. Yuan, J., Zhou, S.: Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting. Journal of Interconnection Networks 5(2), 193–200 (2004)

    Article  Google Scholar 

  12. Kim, S.-S., Kim, I.-H., Mani, V., Kim, H.J.: Ant Colony Optimization for SONET Ring Loading Problem. International Journal of Innovative Computing, Information and Control 4(7), 1617–1626 (2008)

    Google Scholar 

  13. Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Vega-Rodríguez, M.A., Gómez-Pulido, J.A.: Solving ring loading problems using Bio-inspired algorithms. Journal of Network and Computer Applications 34(2), 668–685 (2011)

    Article  Google Scholar 

  14. Eiben, A.E., Smith, J.E.: Intro duction to Evolutionary Computing. Springer, Berlin (2003)

    Book  MATH  Google Scholar 

  15. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm intelligence. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  16. Karaboga, D., Akay, B.: A survey: algorithms simulating bee swarm intelligence. Journal Artificial Intelligence Review 31(1-4), 61–85

    Google Scholar 

  17. Memetic Algorithms Website, http://www.ing.unlp.edu.ar/cetad/mos/memetic_home.html

  18. Pham, D.T., Ghanbarzadeh, A., Koç, E., Otri, S., Rahim, S., Zaidi, M.: The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK (2005)

    Google Scholar 

  19. Pham, D.T., Afify, A.A., Koç, E.: Manufacturing cell formation using the Bees Algorithm. In: Innovative Production Machines and Systems Virtual Conference, Cardiff, UK (2007)

    Google Scholar 

  20. Bees Algorithm Website, http://www.bees-algorithm.com/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Gómez-Pulido, J.A., Vega-Rodríguez, M.A. (2011). Efficient Load Balancing Using the Bees Algorithm. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21827-9_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21826-2

  • Online ISBN: 978-3-642-21827-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics