Design and modeling of survivable network planning for software‐defined data center networks in smart city. (16th January 2018)

• Record Type: Journal Article
• Authors: Peng, Yuhuai; Wang, Xiaojie; Shen, Dawei; Yan, Wei; Fu, Yanhua; Deng, Qingxu
• Other Names: Chen Zhikui guestEditor.; Yang Laurence T. guestEditor.; Nicopolitidis Petros guestEditor.
• Is Part Of: International journal of communication systems. Volume 31:Number 16(2018)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-01-16
• Subjects: data center networks (DCN) -- K‐means clustering -- Lagrangian relaxation -- network planning -- software‐defined networking (SDN); Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.3509
• Languages: English
• ISSNs: 1074-5351

Abstract

Summary: Smart city can integrate cloud computing, big data, Internet of Things, edge computing, and other modern information technologies, which focuses on integration, sharing, utilization, and service of information resources, and emphasizes the cooperation and coordination of urban management, to achieve deep integration of industrialization and informatization. Data center network planning based on big data is involved in rational deployment and interconnection of network infrastructures, which can improve the network survivability, energy‐efficiency, flexibility, etc. Therefore, a survivable network planning model based on software‐defined networking is presented in this paper. The elastic network planning problem is formulated as a mixed‐integer optimization whose objective is to minimize the number of unprotected nodes. Then, 3 effective schemes including K‐means clustering algorithm based on simulated annealing, greedy routing algorithm, and Lagrangian relaxation algorithm are proposed for feasible solutions. Numerical results on practical network topology reveals that (1) K‐means clustering algorithm based on simulated annealing can make effective classification of different scale topologies; (2) compared with the traditional random deployment method, the greedy routing algorithm and Lagrangian relaxation algorithm can generate the controller deployment strategy more reasonably, and thus improve network survivability and deployment cost‐benefit. Abstract : We present a survivable network planning model based on SDN The elastic network planning problem is formulated as a mixed ILP problem to minimize the number of unprotected nodes Three effective schemes including K‐means clustering algorithm based on simulated annealing, greedy routing algorithm, and Lagrangian relaxation algorithm are proposed for feasible solutions.