We propose a novel distributed leader election algorithm to deal with the controller and control service availability issues in programmable networks, such as Software Defined Networks (SDN) or programmable Radio Access Network (RAN). Our approach can deal with a wide range of network failures, especially intermittent network partitions, where splitting and merging of a network repeatedly occur. In contrast to traditional leader election algorithms that mainly focus on the (eventual) consensus on one leader, the proposed algorithm aims at optimizing control service availability, stability and reducing the controller state synchronization effort during intermittent network partitioning situations. To this end, we design a new framework that enables dynamic leader election based on real-time estimates acquired from statistical monitoring. With this framework, the proposed leader election algorithm has the capability of being flexibly configured to achieve different optimization objectives, while adapting to various failure patterns. Compared with two existing algorithms, our approach can significantly reduce the synchronization overhead (up to 12x) due to controller state updates, and maintain up to twice more nodes under a controller.
Control under Intermittent Network Partitions
2018-01-01
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
British Library Online Contents | 2010
|British Library Online Contents | 2005
|POWER INTERMITTENT CONTROL DEVICE AND POWER INTERMITTENT CONTROL SYSTEM
Europäisches Patentamt | 2017
|British Library Conference Proceedings | 2015
|Column-to-row operations on partitions: Garden of Eden partitions
British Library Online Contents | 2010
|