Flow Entry Sharing in Protection Design for Software Defined Networks

Zhang, X; Yu, S; Xu, Z; Li, Y; Cheng, Z; Zhou, W

Flow Entry Sharing in Protection Design for Software Defined Networks

Zhang, X Yu, S

Xu, Z Li, Y Cheng, Z Zhou, W

Permalink

Publication Type:: Conference Proceeding
Citation:: 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings, 2017, 2018-January pp. 1 - 7
Issue Date:: 2017-07-01

Closed Access

	Filename	Description	Size
	08254024.pdf	Published version	310 kB	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	Zhang, X	en_US
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743	en_US
dc.contributor.author	Xu, Z	en_US
dc.contributor.author	Li, Y	en_US
dc.contributor.author	Cheng, Z	en_US
dc.contributor.author	Zhou, W https://orcid.org/0000-0002-1680-2521	en_US
dc.date.issued	2017-07-01	en_US
dc.identifier.citation	2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings, 2017, 2018-January pp. 1 - 7	en_US
dc.identifier.isbn	9781509050192	en_US
dc.identifier.uri	http://hdl.handle.net/10453/133523
dc.description.abstract	© 2017 IEEE. In Software Defined Networks (SDN), though we can design protection mechanism to enable fast recovery against a single link failure, it requires proactively installing a large number of flow entries in switches on working paths and backup paths. However, these additional flow entries in a SDN switch may exhaust Ternary Content Addressable Memory (TCAM) which is limited in size since it is expensive and power hungry. Accordingly, it is emergent to design a new protection technology to minimize flow entry occupation. To this end, we leverage flow entry sharing in SDN protection to solve this problem. We first present the problem as an ILP (Integer Linear Programming) model, and then design a greedy based heuristic algorithm named Flow Entry Sharing Protection (FESP). Extensive simulation results show that compared with the previous SDN protection algorithms, FESP reduces 28.31% flow entries and 27.65% link bandwidth in average.	en_US
dc.relation.ispartof	2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2017.8254024	en_US
dc.title	Flow Entry Sharing in Protection Design for Software Defined Networks	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2018-January	en_US
utslib.for	0805 Distributed Computing	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
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	2018-January	en_US

Abstract:

© 2017 IEEE. In Software Defined Networks (SDN), though we can design protection mechanism to enable fast recovery against a single link failure, it requires proactively installing a large number of flow entries in switches on working paths and backup paths. However, these additional flow entries in a SDN switch may exhaust Ternary Content Addressable Memory (TCAM) which is limited in size since it is expensive and power hungry. Accordingly, it is emergent to design a new protection technology to minimize flow entry occupation. To this end, we leverage flow entry sharing in SDN protection to solve this problem. We first present the problem as an ILP (Integer Linear Programming) model, and then design a greedy based heuristic algorithm named Flow Entry Sharing Protection (FESP). Extensive simulation results show that compared with the previous SDN protection algorithms, FESP reduces 28.31% flow entries and 27.65% link bandwidth in average.

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

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