Dimensioning transport networks for VPNs over capacities with stepwise costs

T. Cinkler, András Kern, István Moldován, Gyula Sallai

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

1 Citation (Scopus)

Abstract

The Virtual Private Network (VPN) services have become widespread and many of research activities aim to provide efficient methods for VPN design. However, only a few discrete bandwidths at different prices are available resulting in stepwise Capacity Cost Functions (CCFs). Although numerous general heuristics are proposed for VPN design, they cannot deal with stepwise CCFs. This paper proposes a three step heuristic: first it "smooths" the stepwise CCFs, then it solves the modified problem using Simulated Allocation and finally it rounds either up or down the capacity steps via rerouting some of the traffic demands. As a reference we present the Integer Linear Program (ILP) formulation of the considered problem and we also use a three-phase heuristic where we first smooth the stepwise CCF, then we configure the VPN (by e.g., Simulated Allocation) and then we round up the capacity values. We conduct simulations to evaluate the proposed methods and we show that enabling rerouting instead of always rounding up significantly increases performance. In the last section we illustrate the applicability of the method on a case study.

Original languageEnglish
Title of host publicationNetworks 2006: 12th International Telecommunications Network Strategy and Planning Symposium
DOIs
Publication statusPublished - 2007
EventNetworks 2006: 12th International Telecommunications Network Strategy and Planning Symposium - New Delhi, India
Duration: Nov 6 2006Nov 9 2006

Other

OtherNetworks 2006: 12th International Telecommunications Network Strategy and Planning Symposium
CountryIndia
CityNew Delhi
Period11/6/0611/9/06

Fingerprint

Virtual private networks
Cost functions
Costs
Bandwidth

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Cinkler, T., Kern, A., Moldován, I., & Sallai, G. (2007). Dimensioning transport networks for VPNs over capacities with stepwise costs. In Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium [4082439] https://doi.org/10.1109/NETWKS.2006.300404

Dimensioning transport networks for VPNs over capacities with stepwise costs. / Cinkler, T.; Kern, András; Moldován, István; Sallai, Gyula.

Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium. 2007. 4082439.

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

Cinkler, T, Kern, A, Moldován, I & Sallai, G 2007, Dimensioning transport networks for VPNs over capacities with stepwise costs. in Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium., 4082439, Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium, New Delhi, India, 11/6/06. https://doi.org/10.1109/NETWKS.2006.300404
Cinkler T, Kern A, Moldován I, Sallai G. Dimensioning transport networks for VPNs over capacities with stepwise costs. In Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium. 2007. 4082439 https://doi.org/10.1109/NETWKS.2006.300404
Cinkler, T. ; Kern, András ; Moldován, István ; Sallai, Gyula. / Dimensioning transport networks for VPNs over capacities with stepwise costs. Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium. 2007.
@inproceedings{f03a9c727638401394f7bfd386866c40,
title = "Dimensioning transport networks for VPNs over capacities with stepwise costs",
abstract = "The Virtual Private Network (VPN) services have become widespread and many of research activities aim to provide efficient methods for VPN design. However, only a few discrete bandwidths at different prices are available resulting in stepwise Capacity Cost Functions (CCFs). Although numerous general heuristics are proposed for VPN design, they cannot deal with stepwise CCFs. This paper proposes a three step heuristic: first it {"}smooths{"} the stepwise CCFs, then it solves the modified problem using Simulated Allocation and finally it rounds either up or down the capacity steps via rerouting some of the traffic demands. As a reference we present the Integer Linear Program (ILP) formulation of the considered problem and we also use a three-phase heuristic where we first smooth the stepwise CCF, then we configure the VPN (by e.g., Simulated Allocation) and then we round up the capacity values. We conduct simulations to evaluate the proposed methods and we show that enabling rerouting instead of always rounding up significantly increases performance. In the last section we illustrate the applicability of the method on a case study.",
author = "T. Cinkler and Andr{\'a}s Kern and Istv{\'a}n Moldov{\'a}n and Gyula Sallai",
year = "2007",
doi = "10.1109/NETWKS.2006.300404",
language = "English",
isbn = "3800729997",
booktitle = "Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium",

}

TY - GEN

T1 - Dimensioning transport networks for VPNs over capacities with stepwise costs

AU - Cinkler, T.

AU - Kern, András

AU - Moldován, István

AU - Sallai, Gyula

PY - 2007

Y1 - 2007

N2 - The Virtual Private Network (VPN) services have become widespread and many of research activities aim to provide efficient methods for VPN design. However, only a few discrete bandwidths at different prices are available resulting in stepwise Capacity Cost Functions (CCFs). Although numerous general heuristics are proposed for VPN design, they cannot deal with stepwise CCFs. This paper proposes a three step heuristic: first it "smooths" the stepwise CCFs, then it solves the modified problem using Simulated Allocation and finally it rounds either up or down the capacity steps via rerouting some of the traffic demands. As a reference we present the Integer Linear Program (ILP) formulation of the considered problem and we also use a three-phase heuristic where we first smooth the stepwise CCF, then we configure the VPN (by e.g., Simulated Allocation) and then we round up the capacity values. We conduct simulations to evaluate the proposed methods and we show that enabling rerouting instead of always rounding up significantly increases performance. In the last section we illustrate the applicability of the method on a case study.

AB - The Virtual Private Network (VPN) services have become widespread and many of research activities aim to provide efficient methods for VPN design. However, only a few discrete bandwidths at different prices are available resulting in stepwise Capacity Cost Functions (CCFs). Although numerous general heuristics are proposed for VPN design, they cannot deal with stepwise CCFs. This paper proposes a three step heuristic: first it "smooths" the stepwise CCFs, then it solves the modified problem using Simulated Allocation and finally it rounds either up or down the capacity steps via rerouting some of the traffic demands. As a reference we present the Integer Linear Program (ILP) formulation of the considered problem and we also use a three-phase heuristic where we first smooth the stepwise CCF, then we configure the VPN (by e.g., Simulated Allocation) and then we round up the capacity values. We conduct simulations to evaluate the proposed methods and we show that enabling rerouting instead of always rounding up significantly increases performance. In the last section we illustrate the applicability of the method on a case study.

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

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

U2 - 10.1109/NETWKS.2006.300404

DO - 10.1109/NETWKS.2006.300404

M3 - Conference contribution

SN - 3800729997

SN - 9783800729999

BT - Networks 2006: 12th International Telecommunications Network Strategy and Planning Symposium

ER -