What is it about?
In the software-defined heterogeneous networks, we study a weighted cost minimization problem, in which the control-plane traffic load balancing and control-channel setup cost are jointly considered when selecting the protection paths for control channels. Since the multiple resource constrained routing is proved to be NP-complete, we propose a near-optimal algorithm, using the Markov approximation technique. Particularly, we extend our solution to an online case that can handle the dynamic single-link failure one a time. The incurred performance fluctuation is also theoretically analyzed.
Featured Image
Photo by Thomas Jensen on Unsplash
Why is it important?
Even though SDN brings quantities of advantages to software-defined heterogeneous network (HetNet), it comes with many challenges. One particular concern is the resilience of the control traffic, i.e., the communications between data-plane and control-plane. In an in-band fashioned software-defined heterogeneous network, where control-plane traffic shares medium with the data plane traffic, even a single link failure may disconnect a large number of packet-switching devices from their controllers, resulting in much worse damages than those of the out-of-band fashion. For example, in case of failures caused by disaster scenarios such as earthquake and tsunami, the core network links between switches and controllers may be disconnected. That would result in severe performance degradation, including packet loss, loop routing, suboptimal or infeasible routing actions, high network latency and even service unavailability. The consequence becomes even worse in wide-area software-defined HetNets. Therefore, to deal with routing protection at the control plane for in-band HetNets is a fundamental issue.
Perspectives
Read the Original
This page is a summary of: Near-Optimal Routing Protection for In-Band Software-Defined Heterogeneous Networks, IEEE Journal on Selected Areas in Communications, November 2016, Institute of Electrical & Electronics Engineers (IEEE),
DOI: 10.1109/jsac.2016.2615184.
You can read the full text:
Resources
The formal published version of this article.
Via this URL, you can find the formal published version of this article. Please feel free to download this article in PDF.
Resilient Traffic engineering for Software-Defined Networks
For the resilient traffic engineering in both control plane and data plane of Software-defined Networks, the performance-guaranteed approaches which can handle the trade-off between the traffic resilience and the corresponding overhead have not been well studied so far. To fill this gap, we strive to find a fine-balanced trade-off between resilient traffic engineering and resource consumption by discovering theoretical insights and designing sophisticated algorithms.
Contributors
The following have contributed to this page