Segment Routing Optimization for VNF Chaining

Wang, Y; Zhang, X; Fan, L; Yu, S; Lin, R

Segment Routing Optimization for VNF Chaining

Wang, Y Zhang, X Fan, L Yu, S

Lin, R

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Conference on Communications, 2019, 2019-May
Issue Date:: 2019-05-01

Closed Access

	Filename	Description	Size
	08761103.pdf	Published version	1.11 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Wang, Y	en_US
dc.contributor.author	Zhang, X	en_US
dc.contributor.author	Fan, L	en_US
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743	en_US
dc.contributor.author	Lin, R	en_US
dc.date.accessioned	2020-03-17T22:50:57Z
dc.date.available	2020-03-17T22:50:57Z
dc.date.issued	2019-05-01	en_US
dc.identifier.citation	IEEE International Conference on Communications, 2019, 2019-May	en_US
dc.identifier.isbn	9781538680889	en_US
dc.identifier.issn	1550-3607	en_US
dc.identifier.uri	http://hdl.handle.net/10453/139371
dc.description.abstract	© 2019 IEEE. Segment Routing (SR) is an emerging source routing based tunneling technique, which allows source router to steer traffic by encoding segment list in the packet header. Due to its fine-grained control of routing path, SR can be leveraged to facilitate the deployment of Service Function Chains (SFCs). Using SR, multiple segments compose a specific path delivering traffic along a set of ordered Virtual Network Function (VNF) instances. However, when introducing SR into VNF chaining, the segment list depth of SR may face the scalability problem since traffic flows must be steered to traverse a serial of ordered VNFs. To address this problem, we study on segment routing optimization for VNF chaining. Our objective is to minimize the packet overhead of SR for all SFC demands, which indicates the scalability performance of SR. We first formulate the problem as an Integer Linear Programming (ILP) model. Since the ILP model is NP-hard, we then propose a heuristic algorithm named Segment Routing for SFC Steering (SR-SFCS), which is based on the method of backtracking and dynamic programming. Extensive simulation results show that compared with the benchmark algorithms, SR-SFCS can reduce the packet overhead by 23.77% in average.	en_US
dc.relation.ispartof	IEEE International Conference on Communications	en_US
dc.relation.isbasedon	10.1109/ICC.2019.8761103	en_US
dc.title	Segment Routing Optimization for VNF Chaining	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2019-May	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	2019-May	en_US

Abstract:

© 2019 IEEE. Segment Routing (SR) is an emerging source routing based tunneling technique, which allows source router to steer traffic by encoding segment list in the packet header. Due to its fine-grained control of routing path, SR can be leveraged to facilitate the deployment of Service Function Chains (SFCs). Using SR, multiple segments compose a specific path delivering traffic along a set of ordered Virtual Network Function (VNF) instances. However, when introducing SR into VNF chaining, the segment list depth of SR may face the scalability problem since traffic flows must be steered to traverse a serial of ordered VNFs. To address this problem, we study on segment routing optimization for VNF chaining. Our objective is to minimize the packet overhead of SR for all SFC demands, which indicates the scalability performance of SR. We first formulate the problem as an Integer Linear Programming (ILP) model. Since the ILP model is NP-hard, we then propose a heuristic algorithm named Segment Routing for SFC Steering (SR-SFCS), which is based on the method of backtracking and dynamic programming. Extensive simulation results show that compared with the benchmark algorithms, SR-SFCS can reduce the packet overhead by 23.77% in average.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/139371