Virtual Private/Overlay Network Design With Traffic Concentration and Shared Protection

In this paper different algorithms are presented and evaluated for designing Virtual Private/Overlay Network (VPNs/VONs) over any network that supports resource partitioning e.g. ATM (Asynchronous Transfer Mode), MPLS (Multi Protocol Label Switching), or SDH/SONET (Synchronous Digital Hierarchy/Synchronous Optical Networking). All algorithms incorporate protection as well. The VPNs/VONs are formed by full mesh demand sets between VPN/VON endpoints. The service demands of VPNs/VONs are characterized by the bandwidth requirements of node-pairs (pipe-model).We investigated four design modes with three pro-active path based shared protection path algorithms and four heuristics to calculate the pairs of paths. The design mode determines the means of traffic concentration. The protection path algorithms use Dijkstra’s shortest path calculation 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 three heuristics (simulated allocation, simulated annealing, threshold accepting). We present numerical results obtained by simulation regarding the required total amount of capacity, the number of reserved edges, and the average length of paths.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..

[3]  H. T. Mouftah,et al.  Allocation of protection domains in dynamic WDM mesh networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[4]  Jason P. Jue,et al.  Heuristic routing algorithm for shared protection in connection-oriented networks , 2001, OptiComm: Optical Networking and Communications Conference.

[5]  H. Christiansen,et al.  Design Problems in Robust Optical Networks DESIGN PROBLEMS IN ROBUST OPTICAL NETWORKS , 2000 .

[6]  Tibor Cinkler,et al.  Configuration of Protected Virtual Private Networks , 2001 .

[7]  Daniel Orincsay,et al.  Shared Backup Path Optimization in Telecommunication Networks , 2001, DRCN.

[8]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Oliver Paridaens,et al.  Scalability implications of virtual private networks , 2002, IEEE Commun. Mag..

[11]  Villy Bæk Iversen,et al.  Optimised Design and Analysis of All-Optical Networks , 2002 .

[12]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[13]  Yu Liu,et al.  Spare Capacity Planning for Survivable Mesh Networks , 2000, NETWORKING.