Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Layered Network Flow Algorithm for the Tunnel Design Problem in Virtual Private Networks with QoS Guarantee

  • Published : 2006.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers the problem of designing logical tunnels in virtual private networks considering QoS guarantee which restricts the number of tunnel hops for each traffic routing. The previous researches focused on the design of logical tunnel itself and Steiner-tree based solution algorithms were proposed. However, we show that for some objective settings it is not sufficient and is necessary to consider both physical and logical connectivity at the same time. Thereupon, the concept of the layered network is applied to the logical tunnel design problem in virtual private networks. The layered network approach considers the design of logical tunnel as well as its physical routing and we propose a modified branch-and-price algorithm which is known to solve layered network design problems effectively. To show the performance of the proposed algorithm, computational experiments have been done and the results show that the proposed algorithm solves the given problem efficiently and effectively.

Keywords

References

  1. Aneroussis, N. and A. A. Lazar, 'Virtual path control for ATM networks with call level quality of service guarantees,' IEEE/ACM Transactions on Networking 6, 2 (1998), 222-236 https://doi.org/10.1109/90.664270
  2. Balakrishnan, A. and K. Altinkemer, 'Using a hop-constrained model to generate alternative communications network design,' ORSA Journal on Computing 4 (1992), 192-205 https://doi.org/10.1287/ijoc.4.2.192
  3. Barnhart, C. et al., 'Branch-and-price: Column generation for solving huge integer programs,' Operations Research 46, 3 (1998), 316-329 https://doi.org/10.1287/opre.46.3.316
  4. Bondy, J. A. and U. S. R. Murty, Graph theory with applications. Elsevier: New York, 1976
  5. Sung, C. S. and S. H. Song, 'Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network,' Journal of the Operational Research Society 54 (2003), 72-82 https://doi.org/10.1057/palgrave.jors.2601479
  6. Charikar, M. et al., Approximation algorithms for directed Steiner problems. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
  7. Cohen, R. and G. Kaempfer, 'On the cost of virtual private networks,' IEEE/ACM Transactions on Networking 8, 6 (2000), 775-784 https://doi.org/10.1109/90.893873
  8. Dahl, G., A. Martin, and M. Stoer, 'Routing through virtual paths in layered telecommunications networks,' Operations Research 47, 5 (1999), 693-702 https://doi.org/10.1287/opre.47.5.693
  9. Davie, B. and Y. Rekhter, 'MPLS Technology and Applications,' Morgan Kaufmann: San Mateo, CA, 2000
  10. Duffield, N. G. et al., 'Resource management with hoses: Point-to-cloud services for virtual private networks,' IEEE/ACM Transactions on Networking 10, 5 (2002), 679-692 https://doi.org/10.1109/TNET.2002.803918
  11. Gertstel, O., I. Cidon, and S. Zaks, 'Efficient support for client/server applications over heterogeneous ATM networks,' IEEE/ACM Transactions on Networking 6, 4 (1998), 432-446 https://doi.org/10.1109/90.720878
  12. Gerstel, O., A. Wool, and S. Zaks, 'Optimal layouts on a chain ATM network,' Discrete Applied Mathematics 83 (1998), 157-178 https://doi.org/10.1016/S0166-218X(98)80002-4
  13. Koch, T. and A. Martin, 'Solving Steiner tree problems in graphs to opti-mality,' Networks 32 (1998), 207-232 https://doi.org/10.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O
  14. Lawler, E. L., Combinatorial optimization: Networks and matroids, Rinehart & Winston: New York, 1976
  15. Narasimhan, S., S. Soni, and S. H. Song, 'ATM network design for corporate networks,' European Journal of Operational Research 170 (2006), 644-663 https://doi.org/10.1016/j.ejor.2004.07.045
  16. Saniee, I. and J. S. Sokol, 'Virtual path design in service-specific ATM networks,' Journal of Heuristics 6, 1 (2000), 65-83 https://doi.org/10.1023/A:1009613710108
  17. Waxman, B. M., 'Routing of multipoint connections,' IEEE Journal of Selected Areas in Communication 6 (1988), 1617-1622 https://doi.org/10.1109/49.12889
  18. Hota, C., S. KumarJha, and G. Raghurama, 'Restoration of Virtual Private Networks with QoS Guarantees in the Pipe Model,' Lecture Notes in Computer Science 3326 (2004), 289-302
  19. Yang, Y., C. U. Martel, and S. F. Wu, 'On building the minimum number of tunnels: an ordered-split approach to manage IPSec/VPN policies,' Proceedings of IEEE/IFIP Conference on Network Operations and Management Symposium 1, 19-23 (2004), 277-290
  20. Saad, T. et al., 'Tunneling Techniques for End-to-End VPNs: Generic Deployment in an Optical Testbed Environment,' IEEE Communications Magazine, (2006), 124-132
  21. Chen, I.-W., Y.-D. Lin, and Y.-N. Lin, 'Tunnel Minimization and Relay for Managing Virtual Private Networks,' Proceedings of IEEE Conference on Globecom, (2004), 2128-2133