Constraint-Based Rerouting mechanism to address Congestion in Software Defined Networks

Chemalamarri, VD; Braun, R; Abolhasan, M

Constraint-Based Rerouting mechanism to address Congestion in Software Defined Networks

Chemalamarri, VD Braun, R

Abolhasan, M

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: 2020 30th International Telecommunication Networks and Applications Conference (ITNAC), 2021, 00, pp. 1-6
Issue Date:: 2021-01-13

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted versionAdobe PDF (1.62 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Chemalamarri, VD
dc.contributor.author	Braun, R https://orcid.org/0000-0002-4153-8769
dc.contributor.author	Abolhasan, M https://orcid.org/0000-0002-4282-6666
dc.date	2020-11-25
dc.date.accessioned	2022-06-14T00:17:07Z
dc.date.available	2022-06-14T00:17:07Z
dc.date.issued	2021-01-13
dc.identifier.citation	2020 30th International Telecommunication Networks and Applications Conference (ITNAC), 2021, 00, pp. 1-6
dc.identifier.isbn	9781728188270
dc.identifier.uri	http://hdl.handle.net/10453/158141
dc.description.abstract	In this paper, we propose a traffic rerouting mechanism to address congestion in Software-Defined networks. We employ back-tracking and constraint propagation techniques to find alternate paths to reroute multiple active flows simultaneously. Cost function is based on standard deviation of link-loads. We then compare traffic distribution and link utilisation with and without rerouting active flows. We measure and compare network performance using parameters such as total rate of transfer, jitter, and packet loss with that of Shortest Path First with no rerouting. Our proposed solution produces lower jitter, packet drops, and higher transfer rate. We finally conclude the paper by making observations and discussing the scope of the future work.
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	2020 30th International Telecommunication Networks and Applications Conference (ITNAC)
dc.relation.ispartof	2020 30th International Telecommunication Networks and Applications Conference
dc.relation.isbasedon	10.1109/itnac50341.2020.9315183
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Constraint-Based Rerouting mechanism to address Congestion in Software Defined Networks
dc.type	Conference Proceeding
utslib.citation.volume	00
utslib.location.activity	Melbourne, VIC, Australia
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/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	open_access	*
pubs.consider-herdc	false
dc.date.updated	2022-06-14T00:17:06Z
pubs.finish-date	2020-11-27
pubs.publication-status	Published
pubs.start-date	2020-11-25
pubs.volume	00

Abstract:

In this paper, we propose a traffic rerouting mechanism to address congestion in Software-Defined networks. We employ back-tracking and constraint propagation techniques to find alternate paths to reroute multiple active flows simultaneously. Cost function is based on standard deviation of link-loads. We then compare traffic distribution and link utilisation with and without rerouting active flows. We measure and compare network performance using parameters such as total rate of transfer, jitter, and packet loss with that of Shortest Path First with no rerouting. Our proposed solution produces lower jitter, packet drops, and higher transfer rate. We finally conclude the paper by making observations and discussing the scope of the future work.

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

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