TY - GEN
T1 - Joint optimization of flow latency in routing and scheduling for software defined networks
AU - Shen, Meng
AU - Zhu, Liehuang
AU - Wei, Mingwei
AU - Zhang, Qiongyu
AU - Wang, Mingzhong
AU - Li, Fan
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/14
Y1 - 2016/9/14
N2 - Software Defined Networks (SDNs) decouple control plane from data plane and enable fine-grained traffic management by a logically centralized controller. Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficiency. However, existing studies usually consider them separately, due to the complexity of joint consideration. In this paper, we combine the routing and scheduling together and propose a latency-aware routing scheme with bandwidth assignment, which can efficiently reduce the flow latency with a moderate complexity. In the routing design, we utilize the global flow information to reduce both the latency of the newly arrived flow and its interference with existing flows in the network. Given flow forwarding paths determined by routing, the flow scheduling dynamically reallocates the bandwidth to all flows so as to further reduce the total flow latency. Experimental results show that our scheme outperforms the scheme currently available in OpenFlow, with an improvement of up to 60% on flow efficiency and a higher percentage of flows that meet their deadlines.
AB - Software Defined Networks (SDNs) decouple control plane from data plane and enable fine-grained traffic management by a logically centralized controller. Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficiency. However, existing studies usually consider them separately, due to the complexity of joint consideration. In this paper, we combine the routing and scheduling together and propose a latency-aware routing scheme with bandwidth assignment, which can efficiently reduce the flow latency with a moderate complexity. In the routing design, we utilize the global flow information to reduce both the latency of the newly arrived flow and its interference with existing flows in the network. Given flow forwarding paths determined by routing, the flow scheduling dynamically reallocates the bandwidth to all flows so as to further reduce the total flow latency. Experimental results show that our scheme outperforms the scheme currently available in OpenFlow, with an improvement of up to 60% on flow efficiency and a higher percentage of flows that meet their deadlines.
KW - Flow Scheduling
KW - Latency Reduction
KW - Routing
KW - Software Defined Networks
UR - http://www.scopus.com/inward/record.url?scp=84991798438&partnerID=8YFLogxK
U2 - 10.1109/ICCCN.2016.7568535
DO - 10.1109/ICCCN.2016.7568535
M3 - Conference contribution
AN - SCOPUS:84991798438
T3 - 2016 25th International Conference on Computer Communications and Networks, ICCCN 2016
BT - 2016 25th International Conference on Computer Communications and Networks, ICCCN 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 25th International Conference on Computer Communications and Networks, ICCCN 2016
Y2 - 1 August 2016 through 4 August 2016
ER -