Virtual private/overlay network design with traffic concentration and shared protection

Péter Hegyi, Markosz Maliosz, Ákos Ladányi, T. Cinkler

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)119-138
Number of pages20
JournalJournal of Network and Systems Management
Volume13
Issue number1
DOIs
Publication statusPublished - Mar 2005

Fingerprint

Virtual private networks
Overlay networks
Asynchronous transfer mode
Simulated annealing
Pipe
Bandwidth
Network design
Heuristics

Keywords

  • Dijkstra's algorithm
  • Edge weight calculation
  • Heuristic algorithms
  • Network configuration
  • Simulated allocation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Virtual private/overlay network design with traffic concentration and shared protection. / Hegyi, Péter; Maliosz, Markosz; Ladányi, Ákos; Cinkler, T.

In: Journal of Network and Systems Management, Vol. 13, No. 1, 03.2005, p. 119-138.

Research output: Contribution to journalArticle

Hegyi, Péter ; Maliosz, Markosz ; Ladányi, Ákos ; Cinkler, T. / Virtual private/overlay network design with traffic concentration and shared protection. In: Journal of Network and Systems Management. 2005 ; Vol. 13, No. 1. pp. 119-138.
@article{0c0e091941b849759a5b4778c6a00596,
title = "Virtual private/overlay network design with traffic concentration and shared protection",
abstract = "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.",
keywords = "Dijkstra's algorithm, Edge weight calculation, Heuristic algorithms, Network configuration, Simulated allocation",
author = "P{\'e}ter Hegyi and Markosz Maliosz and {\'A}kos Lad{\'a}nyi and T. Cinkler",
year = "2005",
month = "3",
doi = "10.1007/s10922-005-1865-2",
language = "English",
volume = "13",
pages = "119--138",
journal = "Journal of Network and Systems Management",
issn = "1064-7570",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Virtual private/overlay network design with traffic concentration and shared protection

AU - Hegyi, Péter

AU - Maliosz, Markosz

AU - Ladányi, Ákos

AU - Cinkler, T.

PY - 2005/3

Y1 - 2005/3

N2 - 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.

AB - 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.

KW - Dijkstra's algorithm

KW - Edge weight calculation

KW - Heuristic algorithms

KW - Network configuration

KW - Simulated allocation

UR - http://www.scopus.com/inward/record.url?scp=18244380818&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18244380818&partnerID=8YFLogxK

U2 - 10.1007/s10922-005-1865-2

DO - 10.1007/s10922-005-1865-2

M3 - Article

AN - SCOPUS:18244380818

VL - 13

SP - 119

EP - 138

JO - Journal of Network and Systems Management

JF - Journal of Network and Systems Management

SN - 1064-7570

IS - 1

ER -