Gradual Switch Clustering Based Virtual Middlebox Placement for Improving Service Chain Performance

Duc-Tiep VU; Kyungbaek KIM

doi:10.1587/transinf.2018EDL8240

IEICE TRANSACTIONS on Information

Open Access
Gradual Switch Clustering Based Virtual Middlebox Placement for Improving Service Chain Performance

Duc-Tiep VU, Kyungbaek KIM

Full Text Views

29

Cite this

Free PDF (482.4KB)

Summary :

Recently, Network Function Virtualization (NFV) has drawn attentions of many network researchers with great deal of flexibilities, and various network service chains can be used in an SDN/NFV environment. With the flexibility of virtual middlebox placement, how to place virtual middleboxes in order to optimize the performance of service chains becomes essential. Some past studies focused on placement problem of consolidated middleboxes which combine multiple functions into a virtual middlebox. However, when a virtual middlebox providing only a single function is considered, the placement problem becomes much more complex. In this paper, we propose a new heuristic method, the gradual switch clustering based virtual middlebox placement method, in order to improve the performance of service chains, with the constraints of end-to-end delay, bandwidth, and operation cost of deploying a virtual middlebox on a switch. The proposed method gradually finds candidate places for each type of virtual middlebox along with the sequential order of service chains, by clustering candidate switches which satisfy the constraints. Finally, among candidate places for each type of virtual middlebox, the best places are selected in order to minimize the end-to-end delays of service chains. The evaluation results, which are obtained through Mininet based extensive emulations, show that the proposed method outperforms than other methods, and specifically it achieves around 25% less end-to-end delay than other methods.

Publication: IEICE TRANSACTIONS on Information Vol.E102-D No.9 pp.1878-1881

Publication Date: 2019/09/01

Publicized: 2019/06/05

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2018EDL8240

Type of Manuscript: LETTER

Category: Information Network

Authors

Duc-Tiep VU
Chonnam National University
Kyungbaek KIM
Chonnam National University

Keyword

middlebox, placement problem, gradual switch clustering, service chain, NFV, SDN

Cite this

Copy

Duc-Tiep VU, Kyungbaek KIM, "Gradual Switch Clustering Based Virtual Middlebox Placement for Improving Service Chain Performance" in IEICE TRANSACTIONS on Information, vol. E102-D, no. 9, pp. 1878-1881, September 2019, doi: 10.1587/transinf.2018EDL8240.
Abstract: Recently, Network Function Virtualization (NFV) has drawn attentions of many network researchers with great deal of flexibilities, and various network service chains can be used in an SDN/NFV environment. With the flexibility of virtual middlebox placement, how to place virtual middleboxes in order to optimize the performance of service chains becomes essential. Some past studies focused on placement problem of consolidated middleboxes which combine multiple functions into a virtual middlebox. However, when a virtual middlebox providing only a single function is considered, the placement problem becomes much more complex. In this paper, we propose a new heuristic method, the gradual switch clustering based virtual middlebox placement method, in order to improve the performance of service chains, with the constraints of end-to-end delay, bandwidth, and operation cost of deploying a virtual middlebox on a switch. The proposed method gradually finds candidate places for each type of virtual middlebox along with the sequential order of service chains, by clustering candidate switches which satisfy the constraints. Finally, among candidate places for each type of virtual middlebox, the best places are selected in order to minimize the end-to-end delays of service chains. The evaluation results, which are obtained through Mininet based extensive emulations, show that the proposed method outperforms than other methods, and specifically it achieves around 25% less end-to-end delay than other methods.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018EDL8240/_p

Copy

@ARTICLE{e102-d_9_1878,
author={Duc-Tiep VU, Kyungbaek KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Gradual Switch Clustering Based Virtual Middlebox Placement for Improving Service Chain Performance},
year={2019},
volume={E102-D},
number={9},
pages={1878-1881},
abstract={Recently, Network Function Virtualization (NFV) has drawn attentions of many network researchers with great deal of flexibilities, and various network service chains can be used in an SDN/NFV environment. With the flexibility of virtual middlebox placement, how to place virtual middleboxes in order to optimize the performance of service chains becomes essential. Some past studies focused on placement problem of consolidated middleboxes which combine multiple functions into a virtual middlebox. However, when a virtual middlebox providing only a single function is considered, the placement problem becomes much more complex. In this paper, we propose a new heuristic method, the gradual switch clustering based virtual middlebox placement method, in order to improve the performance of service chains, with the constraints of end-to-end delay, bandwidth, and operation cost of deploying a virtual middlebox on a switch. The proposed method gradually finds candidate places for each type of virtual middlebox along with the sequential order of service chains, by clustering candidate switches which satisfy the constraints. Finally, among candidate places for each type of virtual middlebox, the best places are selected in order to minimize the end-to-end delays of service chains. The evaluation results, which are obtained through Mininet based extensive emulations, show that the proposed method outperforms than other methods, and specifically it achieves around 25% less end-to-end delay than other methods.},
keywords={},
doi={10.1587/transinf.2018EDL8240},
ISSN={1745-1361},
month={September},}

Copy

TY - JOUR
TI - Gradual Switch Clustering Based Virtual Middlebox Placement for Improving Service Chain Performance
T2 - IEICE TRANSACTIONS on Information
SP - 1878
EP - 1881
AU - Duc-Tiep VU
AU - Kyungbaek KIM
PY - 2019
DO - 10.1587/transinf.2018EDL8240
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2019
AB - Recently, Network Function Virtualization (NFV) has drawn attentions of many network researchers with great deal of flexibilities, and various network service chains can be used in an SDN/NFV environment. With the flexibility of virtual middlebox placement, how to place virtual middleboxes in order to optimize the performance of service chains becomes essential. Some past studies focused on placement problem of consolidated middleboxes which combine multiple functions into a virtual middlebox. However, when a virtual middlebox providing only a single function is considered, the placement problem becomes much more complex. In this paper, we propose a new heuristic method, the gradual switch clustering based virtual middlebox placement method, in order to improve the performance of service chains, with the constraints of end-to-end delay, bandwidth, and operation cost of deploying a virtual middlebox on a switch. The proposed method gradually finds candidate places for each type of virtual middlebox along with the sequential order of service chains, by clustering candidate switches which satisfy the constraints. Finally, among candidate places for each type of virtual middlebox, the best places are selected in order to minimize the end-to-end delays of service chains. The evaluation results, which are obtained through Mininet based extensive emulations, show that the proposed method outperforms than other methods, and specifically it achieves around 25% less end-to-end delay than other methods.
ER -

IEICE TRANSACTIONS on Information