Discrete Particle Swarm Optimization Algorithm for Virtual Network Reconfiguration
Network virtualization allows multiple virtual networks (VNs) to coexist on a shared physical substrate infrastructure.Efficient network resource utilization is crucial for such problem.Most of the current researches focus on algorithms to allocate resources to VNs in mapping.However.reconfiguration problem of running VNs is relatively less explored.Aiming at dynamic scheduling of running VNs, this paper introduces a virtual network reconfiguration model to achieve more substrate network resource utilization.We formulate the virtual network reconfiguration problem as a multi object optimal problem and use discrete particle swarm optimization (DPSO) algorithm to search optimal solution.Experimental results show that by rescheduling the running VNs on substrate network according to the optimal reconfiguration solution our approach can observably reduce the biggest load in both physical node and link load, balance average load and avoid bottlenecks in substrate network so as to gain high VNs accept ratio.
network virtualization reconfiguration algorithm load balancing discrete particle swarm optimization
Ying Yuan Cuirong Wang Cong Wang Shiming Zhu Siwei Zhao
School of Information Science and Engineering, Northeastern University,Shenyang, 11004, China School of Northeastern University at Qinhuangdao, Qinhuangdao, 066004, China School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, 100044, Chin
国际会议
4th international Conference,ICSI2013(第4届群体智能国际会议)
哈尔滨
英文
250-257
2013-06-12(万方平台首次上网日期,不代表论文的发表时间)