Joint allocation and scheduling of network resource for multiple control applications in SDN

The network resource allocation in SDN for control applications is becoming a key problem in the near future because of the conflict between the need of the flow-level flexibility control and the limited capacity of flow table. Based on the analysis of the difference of the definition of network resource between SDN and traditional IP network, the idea of the integrated allocation of link bandwidth and flow table for multiple control applications in SDN is proposed in this paper. Furthermore, a price-based joint allocation model of network resource in SDN is built by introducing the price for each of the resources, which can get the proportional fair allocation of link bandwidth and the minimum global delay at the same time. We have also designed a popular flow scheduling policy based on the proportional fair allocation of link bandwidth in order to achieve the minimum global delay. A flow scheduling module has been implemented and evaluated in Floodlight, named virtual forwarding space (VFS). VFS can not only implement the fair allocation of link bandwidth and minimum delay flow scheduling in data plane but also accelerate packet forwarding by looking up flow cache in control plane.

[1]  Rob Sherwood,et al.  Can the Production Network Be the Testbed? , 2010, OSDI.

[2]  J. S. Marron,et al.  Long-range dependence in a changing Internet traffic mix , 2005, Comput. Networks.

[3]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[4]  Eddie Kohler,et al.  Observed structure of addresses in IP traffic , 2006, TNET.

[5]  Amin Vahdat,et al.  Hedera: Dynamic Flow Scheduling for Data Center Networks , 2010, NSDI.

[6]  Srikanth Kandula,et al.  Achieving high utilization with software-driven WAN , 2013, SIGCOMM.

[7]  Carey L. Williamson,et al.  Internet Web servers: workload characterization and performance implications , 1997, TNET.

[8]  Boris Nechaev,et al.  Demand-aware flow allocation in data center networks , 2012, CSWS '12.

[9]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[10]  Richard Wang,et al.  OpenFlow-Based Server Load Balancing Gone Wild , 2011, Hot-ICE.

[11]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[12]  A. Mahanti.  Internet Traffic Measurement , 2005 .

[13]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Rastin Pries,et al.  An OpenFlow-based energy-efficient data center approach , 2012, SIGCOMM '12.

[15]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[16]  Hai Jin,et al.  Falloc: Fair network bandwidth allocation in IaaS datacenters via a bargaining game approach , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[17]  Jun Bi,et al.  TUNOS: A novel SDN-oriented networking operating system , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[18]  Sujata Banerjee,et al.  DevoFlow: cost-effective flow management for high performance enterprise networks , 2010, Hotnets-IX.

[19]  Larry Peterson,et al.  Inter-AS traffic patterns and their implications , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[20]  Russell J. Clark,et al.  Resonance: dynamic access control for enterprise networks , 2009, WREN '09.