Skip to main content
SpringerLink
Log in

Exact approach for the optimal design of virtual private network trees assuming a hose workload

  • Published:
Annals of Telecommunications Aims and scope Submit manuscript

Abstract

Virtual private network (VPN) design according to a tree topology has been the subject of numerous research papers. Two workload models are commonly used to allow VPN clients to specify the communication capacity they need, the hose and the pipe workload models. As opposed to the pipe model, where bandwidth needs between every pair of endpoints must be specified as a matrix, the hose model has the advantage of simple specification where only one ingress and egress bandwidths per hose endpoint are specified. However, the tree bandwidth costs obtained with the hose workload model are higher by a factor of as much as 2.5 compared to those obtained with pipe workloads Duffield et al. (SIGCOMM Comput Commun Rev 29(4):95108, 1999). In this work, we propose a two-step exact approach to design a VPN tree with minimum bandwidth cost. The first step derives a pipe workload from the user specified hose workload using an exact algorithm. The second step formulates the pipe-based VPN tree bandwidth minimization as a 0–1 integer linear program, which is solved using the exact approach proposed in Thabti et al. (1–6, 2012). The bandwidth costs of VPN trees obtained using this two-step approach are lower by a factor varying between 1.31 and 2.23 compared to VPN trees obtained using the original hose workload. Furthermore, we show that tree solutions obtained using the derived pipe workload satisfy the original hose workload.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Diarrassouba I, Lourimi A, Mahjoub AR, Youssef H (2013) Hose workload based exact algorithm for the optimal design of virtual private networks. Comput Netw 57(14):2766–2774

    Article  Google Scholar 

  2. Thabti B, Lourimi A, Youssef H, Mahjoub AR, Meddeb A (2012) From constant traffic matrices to hose workload model for VPN tree design. In: Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2012 XVth International, Rome-Italy, pp 1–6

  3. Chowdhury NMMK, Boutaba R (2009) Network virtualization: state of the art and research challenges. IEEE Commun Mag 47(7):20–26. ISSN: 0163-6804

    Article  Google Scholar 

  4. Shashank S, Hamzah A-A, Michael W, Faruk C, Gokhale A, Xenofon K (2015) A simulation as a service cloud middleware. Ann Telecommun, Springer Paris:1–16. ISSN: 0003– 4347

  5. Coutinho EF, de Carvalho SFR, Rego PAL, Gomes DG, de Souza JN (2015) Elasticity in cloud computing: a survey. Ann Telecommun, Springer Paris 70(7–8):289–309. ISSN: 0003- 4347

    Article  Google Scholar 

  6. Abdelhak F, Nadjib A, Khaled B (2015) WLAN planning: separate and joint optimization of both access point placement and channel assignment. Ann Telecommun, Springer Paris 70(5–6):263–274. ISSN: 0003-4347

    Google Scholar 

  7. Mohammad A, Eui-Nam H (2013) Impact of ipv4-ipv6 coexistence in cloud virtualization environment. Ann Telecommun 69(9):485–496

    Google Scholar 

  8. Chowdhury NMMK, Boutaba R (2010) A survey of network virtualization. Comput Netw 54(5):862–876

    Article  MATH  Google Scholar 

  9. Chowdhury M, Rahman MR, Boutaba R (2012) ViNEYard: virtual network embedding algorithms with coordinated node and link mapping. IEEE/ACM Trans Networking 20(1):206– 219

    Article  Google Scholar 

  10. Jüttner A, Szabó I, Szentesi Á (2003) On bandwidth efficiency of the hose resource management model in virtual private networks. In: Proceedings of the IEEE INFOCOM 2003, San Francisco, pp 386–395

  11. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New Jersey

    MATH  Google Scholar 

  12. Cohen R (2003) On the establishment of an access VPN in broadband access networks. IEEE Commun Mag:156–163

  13. Fingerhut JA, Suri S, Turner JS (1997) Designing least-cost nonblocking broadband networks. Journal of Algorithms 24(2):287–309

    Article  MathSciNet  MATH  Google Scholar 

  14. STP Library, http:\\steinlib.zib.de\steinlib.php

  15. de Clerq J, Parideans O (2002) Scalability implications of virtual private networks. IEEE Commun Mag:151–157

  16. Duffield NG, Goyal P, Greenberg A, Mishra P, Ramakrishnan KK, van der Merwe JE (1999) A flexible model for resource management in virtual private networks. SIGCOMM Comput Commun Rev 29(4):95–108

    Article  Google Scholar 

  17. Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:70–89

    Article  MathSciNet  MATH  Google Scholar 

  18. Kumar A, Rastogi R, Silberschatz A, Yener B (2002) Algorithms for provisionning virtual private networks in the hose model. IEEE/ACM Trans Networking 10(4):565–578

    Article  Google Scholar 

  19. Korte B, Vygen J (2006) Combinatorial Optimization: Theory and Algorithms, Ed. Springer 3rd Edition

  20. Khachian LG (1979) A polynomial algorithm in linear programming. Soviet Mathematics Doklady:191–194

  21. Mahjoub AR (2010) Polyhedral approaches. In: Paschos V (ed) Concepts of combinatorial optimization, Iste-Wiely, pp 261– 324

  22. Medina A, Lakhina A, Matta I, Byers J (2001) BRITE: an approach to universal topology generation. IEEE/ACM Mascots:346–356

  23. Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6(9):1617–1622

    Article  Google Scholar 

  24. Woolsey L (1998) Integer programming, Ed. Wiley-Interscience

  25. Lemon Graph Library, http://lemon.cs.elte.hu

Download references

Author information

Authors and Affiliations

  1. PRINCE Research Unit, ISITCom Hammam Sousse, University of Sousse, Sousse, Tunisia

    Ali Lourimi, Boulbaba Thabti & Habib Youssef

Authors
  1. Ali Lourimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boulbaba Thabti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Habib Youssef
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Lourimi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lourimi, A., Thabti, B. & Youssef, H. Exact approach for the optimal design of virtual private network trees assuming a hose workload. Ann. Telecommun. 71, 353–367 (2016). https://doi.org/10.1007/s12243-016-0512-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12243-016-0512-0

Keywords

Search

Navigation