Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Software-defined network (SDN) is one of the important technologies to achieve the customization of network services. The key to realize a highly adaptive SDN, which can respond to the changing demands or recover after network failure in a short period of time, is to update the configuration effectively. However, the inconsistent configuration update may lead to transient and incorrect network behaviors and long reconfiguration time between current configuration and target configuration may degrade undesired network performance. Most of the existing works to reduce the network reconfiguration time focus on the consistent update between current configuration and target configuration, and ignore the impact of different target configurations on network reconfiguration time. Therefore, reducing the network reconfiguration time needs to consider not only the consistent update between current configuration and target configuration, but also the impact of different target configurations. In this paper, we first analyze the impact of different target configuration of the control plane on the update operation in the forwarding rules of the data plane. Then, we formulate the shortest configuration path (SCP) problem to get the path with the shortest configuration time and propose the shortest deployment time path selection (SPS) algorithm to obtain the target configuration in the light of different rules deployment time. Subsequently, we propose the consistent scheduling update (CSU) algorithm to solve the consistency conversion from the current configuration to the target configuration. Finally, experimental results demonstrate that our algorithms can reduce the network reconfiguration time up to 39% compared with previous SDN consistent update methods while keeping the similar consistency.