ETRI Journal

  • 제35권3호
  • /
  • Pages.414-424
  • /
  • 2013
  • /
  • 1225-6463(pISSN)
  • /
  • 2233-7326(eISSN)
한국전자통신연구원 (Electronics and Telecommunications Research Institute)
권호 표지
DOI QR코드

DOI QR Code

Bio-inspired Load Balancing Routing for Delay-Guaranteed Services in Ever-Changing Networks

  • Kim, Young-Min (Communications & Internet Research Laboratory, ETRI) ;
  • Kim, Hak Suh (Communications & Internet Research Laboratory, ETRI) ;
  • Jung, Boo-Geum (Communications & Internet Research Laboratory, ETRI) ;
  • Park, Hea-Sook (Communications & Internet Research Laboratory, ETRI) ;
  • Park, Hong-Shik (Department of Electrical Engineering, KAIST)
  • 투고 : 2012.05.11
  • 심사 : 2013.01.06
  • 발행 : 2013.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider a new load balancing routing for delay-guaranteed services in the network in which the traffic is dynamic and network topologies frequently change. For such an ever-changing network, we propose a new online load balancing routing called AntLBR, which exploits the ant colony optimization method. Generally, to achieve load balancing, researchers have tried to calculate the traffic split ratio by solving a complicated linear programming (LP) problem under the static network environment. In contrast, the proposed AntLBR does not make any attempt to solve this complicated LP problem. So as to achieve load balancing, AntLBR simply forwards incoming flows by referring to the amount of pheromone trails. Simulation results indicate that the AntLBR algorithm achieves a more load-balanced network under the changing network environment than techniques used in previous research while guaranteeing the requirements of delay-guaranteed services.

키워드

참고문헌

  1. A.C. Weaver and B.B. Morrison, "Social Networking," IEEE Comput., vol. 41, Feb. 2008, pp. 97-100.
  2. ITU-T Recommendation Y.2012, "Functional Requirements and Architecture of the NGN," Apr. 2000.
  3. A. Medina et al., "Traffic Matrix Estimation: Existing Techniques and New Directions," ACM SIGCOMM, Aug. 2002.
  4. M. Kodialam et al., "Traffic-Oblivious Routing for Guaranteed Bandwidth Performance," IEEE Commun. Mag., vol. 45, no. 4, Apr. 2007, pp. 46-51.
  5. M. Kodialam et al., "Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones," IEEE/ACM Trans. Netw., vol. 17, no. 2, Apr. 2009, pp. 459-472. https://doi.org/10.1109/TNET.2008.927257
  6. M. Antic and A. Smiljanic, "Routing with Load Balancing: Increasing the Guaranteed Node Traffics," IEEE Commun. Lett., vol. 13, no. 6, June 2009, pp. 450-452. https://doi.org/10.1109/LCOMM.2009.081874
  7. M. Antic et al., "Two Phase Load Balanced Routing Using OSPF," IEEE J. Sel. Areas Commun., vol. 28, no. 1, Jan. 2010, pp. 51-59. https://doi.org/10.1109/JSAC.2010.100106
  8. D. Applegate and E. Cohen, "Making Intra-domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs," ACM SIGCOMM, Aug. 2003.
  9. M. Kodialam et al., "Advances in Oblivious Routing of Internet Traffic," Performance Modeling and Engineering, Z. Liu and C.H. Xia, Eds., NY: Springer, 2008, Chapter 5, pp. 125-146.
  10. E. Oki and A. Iwaki, "Fine Two-Phase Routing with Traffic Matrix," IEEE ICCCN, Aug. 2009.
  11. C. Prehofer and C. Bettstetter, "Self-Organization in Communication Networks: Principles and Design Paradigms," IEEE Commun. Mag., vol. 43, July 2005, pp. 78-85.
  12. E. Bonabeau et al., "Inspiration for Optimization from Social Insect Behaviour," Nature, vol. 406, July 2000, pp. 39-42. https://doi.org/10.1038/35017500
  13. M. Dorigo and T. Stutzle, Ant Colony Optimization, Cambridge, MA: The MIT Press, 2004.
  14. Y.M. Kim et al., "Ant Colony Optimization Based Self- Organizing QoS Framework in IP Networks," IEEE Commun. Lett., vol. 14, Dec. 2010, pp. 1074-1076. https://doi.org/10.1109/LCOMM.2010.091710.101382
  15. Y.M. Kim et al., "Ant Colony Based Self-Adaptive Energy Saving Routing for Energy Efficient Internet," Elsevier Comput. Netw. vol. 56, no. 7, July 2012, pp. 2343-2354. https://doi.org/10.1016/j.comnet.2012.03.024
  16. J.H. Ahn and S.H. Kang, "NoC-Based SoC Test Scheduling Using Ant Colony Optimization," ETRI J., vol. 30, no. 1, Feb. 2008, pp. 129-140. https://doi.org/10.4218/etrij.08.0107.0090
  17. L. Zhenjiang et al., "Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet," IEEE/ACM Trans. Netw., vol. 10, no. 4, Aug. 2002, pp. 459-472.
  18. The Network Simulator - ns-2. http://www.isi.edu/nsnam/ns/