Search

Distributed multi-controller deployment is a key issue in the innovative Software Defined Network (SDN) to scale network while improving performance and reliability. It is interesting to know how many controllers should be deployed and where to locate under a wide range of performance sensitive and completive constraints, including latency, fair load distribution as well as cost. We solve this problem by minimizing propagation latency and controller cost. The required number of controllers is determined based on requests and controller capacity. Due to the uneven distribution of network load, it is more likely to deploy controllers on nodes with high request density. A clustering algorithm NWDP (Node Weight Deployment Policy) is thus proposed based on node weight to choose location of multi-controller. To achieve effectively, autonomous and dynamic deployment in large-scale networks, we further propose a supervised graph convolution network model with fusion features(FF-GCN). The open network database Internet Topology Zoo is adopted to evaluate the effectiveness of our algorithms. Simulation results show that NWDP efficiently outperforms traditional algorithms in medium-sized topology, and the trained FF-GCN can figure out the deployment in a 702 nodes large-scale topology with an average prediction accuracy of 90%.

We study server consolidation problem in clouds under simultaneous failures of multiple servers, where consolidation means that cloud providers put tenants on shared servers to improve resource utilization and thus reduce operation and maintenance costs. With replicas of each tenant put on multiple servers, our objective is to minimize the total number of opened servers and ensure that a particular failure will not result in overload on any remaining server. In this paper, we propose Rotation algorithm. It packs comparable sizes replicas into the same type of servers and adopts a cyclic shift method to quickly reuse those already-opened servers without the need of new ones for new tenants. Through experimental evaluations, we show that the proposed algorithms can achieve a better performance than existing works and produce near-optimal replications allocation.