Shared protection of virtual private networks with traffic concentration

P. Hegyi, M. Maliosz, Ladányi, T. Cinkler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages448-454
Number of pages7
ISBN (Print)0780381181, 9780780381186
DOIs
Publication statusPublished - 2003
Event4th International Workshop on Design of Reliable Communication Networks, DRCN 2003 - Banff, Canada
Duration: Oct 19 2003Oct 22 2003

Other

Other4th International Workshop on Design of Reliable Communication Networks, DRCN 2003
CountryCanada
CityBanff
Period10/19/0310/22/03

Fingerprint

Virtual private networks
Asynchronous transfer mode
Heuristic algorithms
Pipe
Bandwidth

Keywords

  • Algorithm design and analysis
  • Bandwidth
  • Cryptography
  • Data security
  • Heuristic algorithms
  • Protection
  • Student members
  • Switches
  • Telecommunication traffic
  • Virtual private networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Hegyi, P., Maliosz, M., Ladányi, & Cinkler, T. (2003). Shared protection of virtual private networks with traffic concentration. In Proceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003 (pp. 448-454). [1275389] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DRCN.2003.1275389

Shared protection of virtual private networks with traffic concentration. / Hegyi, P.; Maliosz, M.; Ladányi, ; Cinkler, T.

Proceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 448-454 1275389.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hegyi, P, Maliosz, M, Ladányi, & Cinkler, T 2003, Shared protection of virtual private networks with traffic concentration. in Proceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003., 1275389, Institute of Electrical and Electronics Engineers Inc., pp. 448-454, 4th International Workshop on Design of Reliable Communication Networks, DRCN 2003, Banff, Canada, 10/19/03. https://doi.org/10.1109/DRCN.2003.1275389
Hegyi P, Maliosz M, Ladányi , Cinkler T. Shared protection of virtual private networks with traffic concentration. In Proceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 448-454. 1275389 https://doi.org/10.1109/DRCN.2003.1275389
Hegyi, P. ; Maliosz, M. ; Ladányi, ; Cinkler, T. / Shared protection of virtual private networks with traffic concentration. Proceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 448-454
@inproceedings{8899be1d436244759970a9b0aa551d68,
title = "Shared protection of virtual private networks with traffic concentration",
abstract = "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.",
keywords = "Algorithm design and analysis, Bandwidth, Cryptography, Data security, Heuristic algorithms, Protection, Student members, Switches, Telecommunication traffic, Virtual private networks",
author = "P. Hegyi and M. Maliosz and Lad{\'a}nyi and T. Cinkler",
year = "2003",
doi = "10.1109/DRCN.2003.1275389",
language = "English",
isbn = "0780381181",
pages = "448--454",
booktitle = "Proceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Shared protection of virtual private networks with traffic concentration

AU - Hegyi, P.

AU - Maliosz, M.

AU - Ladányi,

AU - Cinkler, T.

PY - 2003

Y1 - 2003

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

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

KW - Algorithm design and analysis

KW - Bandwidth

KW - Cryptography

KW - Data security

KW - Heuristic algorithms

KW - Protection

KW - Student members

KW - Switches

KW - Telecommunication traffic

KW - Virtual private networks

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

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

U2 - 10.1109/DRCN.2003.1275389

DO - 10.1109/DRCN.2003.1275389

M3 - Conference contribution

AN - SCOPUS:84945963735

SN - 0780381181

SN - 9780780381186

SP - 448

EP - 454

BT - Proceedings - 4th International Workshop on Design of Reliable Communication Networks: Design and Management of Highly Reliable Networks and Services, DRCN 2003

PB - Institute of Electrical and Electronics Engineers Inc.

ER -