Virtual Private/Overlay Network Design with Traffic Concentration and Shared Protection
P. Hegyi
High Speed Networks Laboratory
Department of Telecommunications and Media Informatics
Budapest University of Technology and Economics
Magyar tudósok krt. 2., Budapest 1117, Hungary
Email: hegyi_AT_tmit.bme.hu
M. Maliosz
High Speed Networks Laboratory
Department of Telecommunications and Media Informatics
Budapest University of Technology and Economics
Magyar tudósok krt. 2., Budapest 1117, Hungary
Email: maliosz_AT_tmit.bme.hu
Á. Ladányi
High Speed Networks Laboratory
Department of Telecommunications and Media Informatics
Budapest University of Technology and Economics
Magyar tudósok krt. 2., Budapest 1117, Hungary
Email: ladanyi_AT_tmit.bme.hu
T. Cinkler
High Speed Networks Laboratory
Department of Telecommunications and Media Informatics
Budapest University of Technology and Economics
Magyar tudósok krt. 2., Budapest 1117, Hungary
Email: cinkler_AT_tmit.bme.hu
Abstract
In this paper different algorithms are presented and evaluated for designing Virtual Private/Overlay Networks (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.
Keywords: heuristic algorithms, Dijkstra's algorithm, edge weight calculation, simulated allocation, network configuration
JNSM: Vol. 13, No. 1, 2005
Virtual Private/Overlay Network Design with Traffic Concentration and Shared Protection [Vol. 13, No. 1, 2005]
NOTE: only abstract of paper available on-line; please contact your library or the authors for the full paper
Back to JNSM main page