The budgeted maximum coverage problem in partially deployed software defined networks

发布时间:2017-12-12 

报告题目:The budgeted maximum coverage problem in partially deployed software defined networks
报告地点:遗传学楼308
报告时间:12月12日 (周二) 上午10:00
邀请人:叶士青 (微纳中心)

Due to the large installed base of distributed legacy networks, software defined networking (SDN) nodes may be required to coexist with legacy nodes to form hybrid networks. It has been shown that such a hybrid network has better performance than a pure legacy network due to smarter transmission scheduling. Despite such advantages, limited budgets continue to hinder the rapid adaptation of SDNs. Only a part of the network can be upgraded at a time especially for large-scale networks. In this paper, we define the minimum percentage of SDN nodes in a path, and paths with at least one SDN node, as the hop coverage and path coverage, respectively. We intend to evaluate the relationship between cost and coverage in the partially deployed SDNs. We formulate SDN node selection as four optimization problems with hop/path coverage and cost as objectives and constraints, respectively, and vice-versa. We propose two heuristic solutions: 1) maximum number of uncovered path first (MUcPF) and 2) maximum number of minimum hop covered path first (MMHcPF), to these NP-hard problems. Through a MATLAB experiment, we show that MUcPF is significantly better in terms of economy and efficiency to establish a hybrid path between every pair of hosts in the network. In particular, it required 5%–15% less investment to achieve 100% path coverage compared to other algorithms. The results show the coverage consistency of MMHcPF on each individual path along with gains in terms of cost and efficiency. It takes 5%–20% less investment to achieve certain hop coverage target compared to other existing algorithms.

 

吴晓光教授 简介:        
                                                               
Eric Hsiao-Kuang Wu received his B.S. degree in computer science and information engineering from National Taiwan University in 1989. He received his Masters and Ph.D. in computer science from University of California, Los Angeles (UCLA) in 1993 and 1997, respectively. He is a professor of Computer Science and Information Engineering at National Central University, Taiwan. His primary research interests include wireless networks, mobile computing and broadband networks. He is a member of the Institute of Information and Computing Machinery (IICM) and IEEE.