TY - GEN
T1 - Advance bandwidth scheduling in software-defined networks
AU - Dharam, Poonam
AU - Wu, Chase Q.
AU - Rao, Nageswara S.V.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - In software-defined networks (SDNs) with multiple logically centralized controllers, it is challenging to maintain accurate link-state information, perceived as a global network view (GNV), at every controller in a consistent manner. Since online bandwidth scheduling, where every successful reservation triggers a GNV update at the controller, is expensive in terms of overhead, most networks adopt periodic scheduling with infrequent link-state information update, which, however, is the main cause of such inaccuracy/inconsistency. Even if up-to-date information is available, a controller does not always make frequent updates as it may cause network convergence issues. Consequently, bandwidth scheduling in such environments may lead to blocking or rejection of reservation requests, which deteriorates as the level of inaccuracy/inconsistency increases. To minimize such service disruptions, we formulate bandwidth scheduling in SDNs as an optimization problem and propose a randomization-based routing scheme to schedule bandwidth reservation requests such that the total number of blocked requests due to the inaccurate/inconsistent GNV is minimized. Simulation results show that the proposed solution exhibits a superior performance over existing methods.
AB - In software-defined networks (SDNs) with multiple logically centralized controllers, it is challenging to maintain accurate link-state information, perceived as a global network view (GNV), at every controller in a consistent manner. Since online bandwidth scheduling, where every successful reservation triggers a GNV update at the controller, is expensive in terms of overhead, most networks adopt periodic scheduling with infrequent link-state information update, which, however, is the main cause of such inaccuracy/inconsistency. Even if up-to-date information is available, a controller does not always make frequent updates as it may cause network convergence issues. Consequently, bandwidth scheduling in such environments may lead to blocking or rejection of reservation requests, which deteriorates as the level of inaccuracy/inconsistency increases. To minimize such service disruptions, we formulate bandwidth scheduling in SDNs as an optimization problem and propose a randomization-based routing scheme to schedule bandwidth reservation requests such that the total number of blocked requests due to the inaccurate/inconsistent GNV is minimized. Simulation results show that the proposed solution exhibits a superior performance over existing methods.
KW - Bandwidth scheduling
KW - Path computation
KW - Software-defined networks
UR - http://www.scopus.com/inward/record.url?scp=84964806081&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964806081&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2014.7416950
DO - 10.1109/GLOCOM.2014.7416950
M3 - Conference contribution
AN - SCOPUS:84964806081
T3 - 2015 IEEE Global Communications Conference, GLOBECOM 2015
BT - 2015 IEEE Global Communications Conference, GLOBECOM 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 58th IEEE Global Communications Conference, GLOBECOM 2015
Y2 - 6 December 2015 through 10 December 2015
ER -