Priority based scheduling in network controller using graph theoretic method

摘要

Certain embodiments described herein are generally directed to determining efficient update schedules for logical networks based on a graph representing the priority of features supported by the network, and a graph representing the priority of logical entities within the logical network. By building a graph of the logical network using directed edges to represent the update priority of one logical entity over another, an ordering, or a set of possible orderings, may be obtained. A topological sort of the graph may obtain such an ordering. Alternative orderings may indicate opportunities for parallel updating, which may result in a more efficient process for updating the logical network.