A Migration-Based Approach for the SDN Controller Placement Problem in Tree Topologies (bibtex)
by Alexandros Zervopoulos, Konstantinos Oikonomou
Abstract:
The advent of Software-Defined Networking (SDN) brings about a major shift in network management but also introduces various challenges, like scalability, giving rise to physically distributed approaches towards a logically centralized controller. When deploying multiple controllers, where to place them in the network in order to minimize response times and overhead is an issue that naturally arises. This has been termed as the Controller Placement Problem (CPP). The CPP can be viewed as an extension of the k-median problem, if the number of controllers is known. However, unlike the k-median problem, assigning switches to the available controllers is a challenging task, as even the reassignment of a single switch can affect the performance of others. In this work, the CPP is studied in the context of tree topologies, where it is shown that reassigning a switch only affects its directly adjacent switches. Additionally, a migration-based approach for solving the CPP is considered, consisting of two parts: (i) the controller migration policy; and (ii) the switch migration policy. The controller migration policy is based on an existing service migration approach, whereas two different switch migration policies are proposed and studied in this paper. Simulation results demonstrate that in tree topologies, switch migrations offer limited benefit. This is attributed to the limited opportunities for switch migration that arise because of the topological aspects of trees. On the other hand, the controller migration policy suffices to closely approximate optimal solutions.
Reference:
Alexandros Zervopoulos, Konstantinos Oikonomou, "A Migration-Based Approach for the SDN Controller Placement Problem in Tree Topologies", In Fourth International Balkan Conference on Communications and Networking 2021 (BalkanCom'21), Novi Sad, Serbia, 2021.
Bibtex Entry:
@inproceedings{zervopoulos2021software,
	abstract = {The advent of Software-Defined Networking (SDN) brings about a major shift
in network management but also introduces various challenges, like
scalability, giving rise to physically distributed approaches towards a
logically centralized controller. When deploying multiple controllers,
where to place them in the network in order to minimize response times and
overhead is an issue that naturally arises.
This has been termed as the Controller Placement Problem (CPP). The CPP can
be viewed as an extension of the k-median problem, if the number of
controllers is known. However, unlike the k-median problem, assigning
switches to the available controllers is a challenging task, as even the
reassignment of a single switch can affect the performance of others. In
this work, the CPP is studied in the context of tree topologies, where it
is shown that reassigning a switch only affects its directly adjacent
switches. Additionally, a migration-based approach for solving the CPP is
considered, consisting of two parts: (i) the controller migration policy;
and (ii) the switch migration policy. The controller migration policy is
based on an existing service migration approach, whereas two different
switch migration policies are proposed and studied in this paper.
Simulation results demonstrate that in tree topologies, switch migrations
offer limited benefit. This is attributed to the limited opportunities for
switch migration that arise because of the topological aspects of trees. On
the other hand, the controller migration policy suffices to closely
approximate optimal solutions.},
	address = {Novi Sad, Serbia},
	author = {Alexandros Zervopoulos and Konstantinos Oikonomou},
	booktitle = {Fourth International Balkan Conference on Communications and Networking 2021 (BalkanCom'21)},
	date-added = {2021-08-31 16:44:35 +0300},
	date-modified = {2021-08-31 16:44:55 +0300},
	days = 19,
	keywords = {own, refereed, v-corfu, accepted},
	month = sep,
	title = {A {Migration-Based} Approach for the {SDN} Controller Placement Problem in Tree Topologies},
	year = 2021}
Powered by bibtexbrowser