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

Péter Hegyi, Markosz Maliosz, Ákos Ladányi, Tibor 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 1 2005

    Fingerprint

Keywords

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

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications
  • Strategy and Management

Cite this