A traffic engineering algorithm for provisioning virtual private networks in the enhanced hose model

Yu Liang Liu, Der Jiunn Deng

Research output: Contribution to journalArticle

Abstract

A Virtual Private Network is a logical network established on top of a public packet switched network. To guarantee that quality of service requirements, specified by customers, can be met, the network service provider needs to reserve enough resources on the network and allocate/manage them in an optimal way. Traffic engineering algorithms can be used by the Network Service Provider to establish multiple Virtual Private Networks in an optimal way, while meeting customers' Quality of Service requirements. For delay sensitive network applications, it is critical to meet both bandwidth and delay requirements. In contrast to traditional Virtual Private Network Quality of Service models (customer-pipe model and hose model), which focused only on bandwidth requirements, a new model called the enhanced hose model has been proposed, which considers both bandwidth and delay requirements. However, to the best of our knowledge, thus far, traffic engineering problems associated with establishing multiple enhanced hose model Virtual Private Networks have not been investigated. In this paper, we proposed a novel Virtual Private Network traffic engineering algorithm, called the minimum bandwidth-delay cost tree algorithm to address these problems. According to experimental simulations conducted and reported in our paper, the minimum bandwidth-delay cost tree algorithm can indeed achieved better performance (lower rejection ratios) compared to previous algorithms.

Original languageEnglish
JournalApplied Mathematics and Information Sciences
Volume6
Issue number2 SUPPL.
Publication statusPublished - 2012 Apr 1

Fingerprint

Virtual private networks
Traffic Engineering
Hose
Bandwidth
Quality of service
Requirements
Quality of Service
Model
Customers
Tree Algorithms
Packet networks
Trees (mathematics)
Telecommunication traffic
Costs
Pipe
Network Traffic
Rejection

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Numerical Analysis
  • Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

@article{401c191f7def4d48bd72dd16b6bc4f65,
title = "A traffic engineering algorithm for provisioning virtual private networks in the enhanced hose model",
abstract = "A Virtual Private Network is a logical network established on top of a public packet switched network. To guarantee that quality of service requirements, specified by customers, can be met, the network service provider needs to reserve enough resources on the network and allocate/manage them in an optimal way. Traffic engineering algorithms can be used by the Network Service Provider to establish multiple Virtual Private Networks in an optimal way, while meeting customers' Quality of Service requirements. For delay sensitive network applications, it is critical to meet both bandwidth and delay requirements. In contrast to traditional Virtual Private Network Quality of Service models (customer-pipe model and hose model), which focused only on bandwidth requirements, a new model called the enhanced hose model has been proposed, which considers both bandwidth and delay requirements. However, to the best of our knowledge, thus far, traffic engineering problems associated with establishing multiple enhanced hose model Virtual Private Networks have not been investigated. In this paper, we proposed a novel Virtual Private Network traffic engineering algorithm, called the minimum bandwidth-delay cost tree algorithm to address these problems. According to experimental simulations conducted and reported in our paper, the minimum bandwidth-delay cost tree algorithm can indeed achieved better performance (lower rejection ratios) compared to previous algorithms.",
author = "Liu, {Yu Liang} and Deng, {Der Jiunn}",
year = "2012",
month = "4",
day = "1",
language = "English",
volume = "6",
journal = "Applied Mathematics and Information Sciences",
issn = "1935-0090",
publisher = "Natural Sciences Publishing Corporation",
number = "2 SUPPL.",

}

A traffic engineering algorithm for provisioning virtual private networks in the enhanced hose model. / Liu, Yu Liang; Deng, Der Jiunn.

In: Applied Mathematics and Information Sciences, Vol. 6, No. 2 SUPPL., 01.04.2012.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A traffic engineering algorithm for provisioning virtual private networks in the enhanced hose model

AU - Liu, Yu Liang

AU - Deng, Der Jiunn

PY - 2012/4/1

Y1 - 2012/4/1

N2 - A Virtual Private Network is a logical network established on top of a public packet switched network. To guarantee that quality of service requirements, specified by customers, can be met, the network service provider needs to reserve enough resources on the network and allocate/manage them in an optimal way. Traffic engineering algorithms can be used by the Network Service Provider to establish multiple Virtual Private Networks in an optimal way, while meeting customers' Quality of Service requirements. For delay sensitive network applications, it is critical to meet both bandwidth and delay requirements. In contrast to traditional Virtual Private Network Quality of Service models (customer-pipe model and hose model), which focused only on bandwidth requirements, a new model called the enhanced hose model has been proposed, which considers both bandwidth and delay requirements. However, to the best of our knowledge, thus far, traffic engineering problems associated with establishing multiple enhanced hose model Virtual Private Networks have not been investigated. In this paper, we proposed a novel Virtual Private Network traffic engineering algorithm, called the minimum bandwidth-delay cost tree algorithm to address these problems. According to experimental simulations conducted and reported in our paper, the minimum bandwidth-delay cost tree algorithm can indeed achieved better performance (lower rejection ratios) compared to previous algorithms.

AB - A Virtual Private Network is a logical network established on top of a public packet switched network. To guarantee that quality of service requirements, specified by customers, can be met, the network service provider needs to reserve enough resources on the network and allocate/manage them in an optimal way. Traffic engineering algorithms can be used by the Network Service Provider to establish multiple Virtual Private Networks in an optimal way, while meeting customers' Quality of Service requirements. For delay sensitive network applications, it is critical to meet both bandwidth and delay requirements. In contrast to traditional Virtual Private Network Quality of Service models (customer-pipe model and hose model), which focused only on bandwidth requirements, a new model called the enhanced hose model has been proposed, which considers both bandwidth and delay requirements. However, to the best of our knowledge, thus far, traffic engineering problems associated with establishing multiple enhanced hose model Virtual Private Networks have not been investigated. In this paper, we proposed a novel Virtual Private Network traffic engineering algorithm, called the minimum bandwidth-delay cost tree algorithm to address these problems. According to experimental simulations conducted and reported in our paper, the minimum bandwidth-delay cost tree algorithm can indeed achieved better performance (lower rejection ratios) compared to previous algorithms.

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

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

M3 - Article

VL - 6

JO - Applied Mathematics and Information Sciences

JF - Applied Mathematics and Information Sciences

SN - 1935-0090

IS - 2 SUPPL.

ER -