Cart (Loading....) | Create Account
Close category search window

Shared protection of virtual private networks with traffic concentration

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hegyi, P. ; High Speed Networks Lab., Budapest Univ. of Tech. & Econ., Hungary ; Maliosz, M. ; Ladanyi, A. ; Cinkler, T.

In our paper we analyse algorithms that solve the optimal path search problem including the protection as well. We investigated the special case when multiple full mesh demand sets (forming VPNs) have to be built. We addressed the pro-active path based shared protection scheme and investigated heuristic algorithms to calculate the pair of paths. We formulated the problem generally without specialising to any particular network technology, i.e. the proposed methods can be used for various networks (e.g. ATM, MPLS, GMPLS, etc.). The service demands of VPNs are characterised by the bandwidth requirements of node-pairs (pipe-model). The input is the capacity matrix of the physical network and the traffic demand matrices of the VPNs. Our aim was to find efficient ways to protect the working paths. We analysed three different shared protection algorithms. All of them use Dijkstra's shortest path calculation, but with different edge weights. The demands are routed one-by-one, therefore the order in which they are processed matters. To eliminate this factor we used the simulated allocation scheme. We present numerical results from simulations on sample networks regarding the reserved capacity, the number of reserved edges, and the average path lengths.

Published in:

Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings. Fourth International Workshop on

Date of Conference:

19-22 Oct. 2003

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.