20 research outputs found

    A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks

    No full text
    <div><p>This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.</p></div

    Motivation Example (b).

    No full text
    <p>The alternative shortest paths of flows with flexible routing. The optimal solution is polling the flow information on switches <i>S</i><sub>3</sub> and <i>S</i><sub>6</sub>.</p

    Performance on General Topologies vs. Switch Capacity Constraint.

    No full text
    <p>The simulation result with different switch capacities. The number of flows is set to a value in range of 128 to 1024. The number of nodes is 200.</p

    The PortLand Topology.

    No full text
    <p>The Portland topology with <i>k</i> = 4. The parameter <i>k</i> is the number of switch port which is the only factor that determines the network size of Portland.</p

    Communication Cost vs. Number of Flows with No Capacity Constraint.

    No full text
    <p>The simulation result with different number of flows on a <i>k</i> = 16 PortLand topology. The flow table capacity is unlimited in this scenario.</p

    Communication Cost vs. Number of Flows on General Topologies with No Capacity Constraint.

    No full text
    <p>The simulation result with 200 nodes and different number of flows. The switch capacity is unlimited in this scenario.</p

    Resource Utilization.

    No full text
    <p>The resources consumed by different measurement primitives and the interactive process between switches and controllers.</p

    Communication Cost vs. Portland Parameter with No Capacity Constraint.

    No full text
    <p>The simulation result with 512 flows and different network size. The flow table capacity is unlimited in this scenario.</p

    Communication Cost on PortLand vs. Switch Capacity.

    No full text
    <p>The simulation result with different switch capacities. The number of flows is set to a value in range of 128 to 1024. The Portland parameter <i>k</i> is 16.</p

    Voltage Constraint.

    No full text
    <p>The voltage constraint to solve the disjointed route problem and ensure the valid route in SDN.</p
    corecore