A Hybrid Genetic Algorithm/Variable Neighborhood Search Approach to Maximizing Residual Bandwidth of Links for Route Planning

  • Gajaruban Kandavanam
  • Dmitri Botvich
  • Sasitharan Balasubramaniam
  • Brendan Jennings
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5975)


This paper proposes a novel approach to performing residual bandwidth optimization with QoS guarantees in multi-class networks. The approach combines the use of a new highly scalable hybrid GA-VNS algorithm (Genetic Algorithm with Variable Neighborhood Search) with the efficient and accurate estimation of QoS requirements using empirical effective bandwidth estimations. Given a QoS-aware demand matrix, experimental results indicate that the GA-VNS algorithm shows significantly higher success rate in terms of converging to optimum/near optimum solution in comparison to pure GA and another combination of GA and local search heuristic, and also exhibits better scalability and performance. Additional results also show that the proposed solution performs significantly better than OSPF in optimizing residual bandwidth in a medium to large sized network.


Feasible Region Variable Neighborhood Search Internet Service Provider Link Utilization Local Search Heuristic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kodialam, M., Lakshman, T.V.: Dynamic Routing of Restorable Bandwidth-Guaranteed Tunnels using Aggregated Network Resource Usage Information. IEEE/ACM Transactions on Networking 11(3) (June 2003)Google Scholar
  2. 2.
    Riedl, A., Schupke, D.A.: Routing Optimization in IP Networks Utilizing Additive and Concave Link Metrics. IEEE/ACM Transactions on Networking 15(5) (October 2007)Google Scholar
  3. 3.
    Applegate, D., Cohen, E.: Making Routing Robust to Changing Traffic Demands: Algorithm and Evaluation. IEEE/ACM Transactions on Networking 14(-6) (December 2006)Google Scholar
  4. 4.
    Kodialam, M., Lakshman, T.V., Sengupta, S.: Online Multicast Routing With Bandwidth Guarantees: A New Approach Using Multicast Network Flow. IEEE/ACM Transactions on Networking 11(4) (August 2003)Google Scholar
  5. 5.
    Yaiche, H., Mazumdar, R.R., Rosenberg, C.: A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks. IEEE/ACM Transactions on Networking 8(5) (October 2000)Google Scholar
  6. 6.
    Spring, N., Mahajan, R., Whetherall, D.: Measuring ISP Topologies with Rocketfuel. In: Proc ACM SIGCOMM, pp. 133–145 (2002)Google Scholar
  7. 7.
    Kohler, S., Binzenhofer, A.: MPLS Traffic Engineering in OSPF Networks-A Combined Approach. Univ. Wurzburg, Germany, Tech. Rep. 304 (February 2003)Google Scholar
  8. 8.
    Davy, A., Botvich, D., Jennings, B.: On the use of Accounting Data for QoS-aware IP Network Planning. In: Mason, L.G., Drwiega, T., Yan, J. (eds.) ITC 2007. LNCS, vol. 4516, pp. 348–360. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Kandavanam, G., Botvich, D., Balasubramaniam, S., Suganthan, P.N., Tasgetiren, M.F.: A Dynamic Bandwidth Guaranteed Routing Using Heuristic Search for Clustered Topology. In: IEEE Advanced Networks and Telecommunication Systems (December 2008)Google Scholar
  10. 10.
    Kelly, F.: Notes on Effective Bandwidth. In: Kelly, F.P., Zachary, S., Ziedins, I.B. (eds.) Stochastic Networks: Theory and Application. Royal Statistical Society Lecture Notes Series, vol. 4, pp. 141–168. Oxford University Press, Oxford (1996) ISBN 0-19-852399-8Google Scholar
  11. 11.
    Tasgetiren, M.F., Sevkli, M., Liang, Y.C., Gencyilmaz, G.: Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem. LNCS. Springer, Heidelberg (2004)Google Scholar
  12. 12.
    Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer methods in applied mechanics and engineering 191(11-12), 1245–1287 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1989) ISBN:0201157675zbMATHGoogle Scholar
  14. 14.
    Kandavanam, G., Botvich, D., Balasubramaniam, S., Suganthan, P.N., Donnelly, W.: A Multi Layered Solution for Supporting ISP Traffic Demand using Genetic Algorithm. In: The proc. of IEEE Congress on Evolutionary Computation (September 2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Gajaruban Kandavanam
    • 1
  • Dmitri Botvich
    • 1
  • Sasitharan Balasubramaniam
    • 1
  • Brendan Jennings
    • 1
  1. 1.TSSGWaterford Institute of TechnologyIreland

Personalised recommendations