Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Load balancing in the provisioning of hose model virtual private networks with multi-path routing

Load balancing in the provisioning of hose model virtual private networks with multi-path routing

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Load balancing in the provisioning of virtual private network (VPN) service in the hose model is studied. Single-path routing and tree routing for the hose model tend to aggregate bandwidth reservations on a small number of links, thus leading to congestion problems in service provider networks. If the link capacity is depleted as a result of improper routing, all future non-VPN traffic will be blocked. We propose a novel multi-objective multi-path (MOMP) routing linear program with the maximum fraction of traffic on a path (MFTP) constraint to solve the problem. The MOMP routing algorithm is able to reduce the bandwidth reservation on the most loaded link by as much as 50%, thus effectively alleviating the potential congestion problems in service provider network. The MFTP constraint provides a guarantee of the availability of multiple paths for each VPN endpoint pair. Further reduction of the bandwidth reservation can be achieved depending on the MFTP value. This is highly significant.

References

    1. 1)
      • Song, J., Kim, S., Lee, M., Lee, H., Suda, T.: `Adaptive load distribution over multipath in MPLS networks', Proc. IEEE Int. Conf. Comm. (ICC), May 2003, Anchorage, Alaska, p. 233–237.
    2. 2)
      • Gupta, A., Kumar, A., Roughgarden, T.: `Simpler and better approximation algorithms for network design', Proc. ACM Symp. Theory Comp. (STOC), June 2003, San Diego, California, USA, p. 365–372.
    3. 3)
      • R.K. Ahuia , T.L. Magnanti , J.B. Orlin . (1993) Network Flows: Theory, Algorithms, and Applications.
    4. 4)
      • Prommak, C., Tipper, D.: `Load distribution survivable lightpath routing for optical virtual private network', Proc. IEEE Workshop on High Perf. Switch. Rout. (HPSR), May 2002, Kobe, Japan, p. 278–282.
    5. 5)
      • Zhao, Z., Shu, Y., Zhang, L., Wang, H., Yang, O.W.W.: `Flow-level multipath load balancing in MPLS network', Proc. IEEE Int. Conf. Comm. (ICC), June 2004, Paris, France, p. 1222–1226.
    6. 6)
      • Awduche, D., Malcolm, J., Agogbua, J., McManus, J.: `Requirements for Traffic Engineering over MPLS', RFC 2702, IETF, September 1999.
    7. 7)
      • Cao, Z., Wang, Z., Zegura, E.: `Performance of hashing-based schemes for Internet load balancing', Proc. IEEE INFOCOM, 2000, Tel Aviv, Israel, p. 332–341.
    8. 8)
      • Elwalid, A., Jin, C., Low, S., Widiaja, I.: `MATE: MPLS adaptive traffic engineering', Proc. IEEE INFOCOM, April 2001, Anchorage, Alaska, USA, p. 1300–1309.
    9. 9)
      • Rosen, E., Viswanathan, A., Callon, R.: `Multiprotocol Label Switching Architecture', RFC 3031, IETF, January 2001.
    10. 10)
      • Erlebach, T., Rüegg, M.: `Optimal bandwidth reservation in hose-model VPNs with multi-path routing', Proc. IEEE INFOCOM, March 2004, Hong Kong, p. 2275–2282.
    11. 11)
      • Andersson, L., Doolan, P., Feldman, N., Fredette, A., Thomas, B.: `LDP specification', RFC 3036, IETF, January 2001.
    12. 12)
      • Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K., van der Merwe, J.E.: `A flexible model for resource management in virtual private networks', Proc. ACM SIGCOMM, San Diego, California, USA, p. 95–108.
    13. 13)
      • Seok, Y., Lee, Y., Choi, Y., Kim, C.: `Dynamic constrained multipath routing for MPLS networks', Proc. IEEE Int. Conf. Comp. Comm. Netw. (ICCCN), October 2001, Scottsdale, Arizona, USA, p. 348–353.
    14. 14)
      • Wang, Y., Wang, Z.: `Explicit routing algorithms for Internet traffic engineering', Proc. IEEE Int. Conf. Comp. Comm. Netw. (ICCCN), October 1999, Boston, USA, p. 582–588.
    15. 15)
      • Dinan, E., Awduche, D., Jabbari, B.: `Analytical framework for dynmaic traffic partitioning in MPLS networks', Proc. IEEE Int. Conf. Comm. (ICC), June 2000, New Orleans, Louisiana, USA, p. 1604–1608.
    16. 16)
      • A. Kumar , R. Rastogi , A. Silberschatz , B. Yener . Algorithms for provisioning virtual private networks in the hose model. IEEE/ACM Trans. Netw. , 4 , 565 - 578
    17. 17)
      • B. Davie , Y. Rekhter . (2000) MPLS Technology and Applications.
    18. 18)
      • Seok, Y., Lee, Y., Choi, Y., Kim, C.: `A constrained multipath traffic engineering scheme for MPLS networks', Proc. IEEE Int. Conf. Comm. (ICC), April 2002, New York City, USA, p. 2431–2436.
    19. 19)
      • Jüttner, A., Szabó, I., Szentesi, Á.: `On bandwidth efficiency of the hose resource management model in virtual private networks', Proc. IEEE INFOCOM, March 2003, San Francisco, California, USA, p. 386–395.
    20. 20)
      • Poo, G.-S., Wang, H.: `Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model', Internal Report, NTU, .
    21. 21)
      • Wang, H., Poo, G.-S.: `Availability guaranteed serivce provisioning in hose model VPNs with multi-path routing', Proc. IEEE Int. Conf. Comm. (ICC), June 2006, Istanbul, Turkey.
    22. 22)
      • D. Fowler . (1999) Virtual Private Networks.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20060300
Loading

Related content

content/journals/10.1049/iet-com_20060300
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address