Bandwidth scheduling for big data transfer with two variable node-disjoint paths

Hou, Aiqin; Wu, Chase Q.; Zuo, Liudong; Zhang, Xiaoyang; Wang, Tao; Fang, Dingyi

doi:10.1109/jcn.2020.000004

Cited by 5 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specifically, a classical max-flow-min-cut optimization cannot account for the interdependence between power and communication network and thus, is not readily useful in finding power-disjoint routes. Apart from classical network flow optimization, node-disjoint routing has been studied in [38]- [40] but not in the context of smart grid communication networks. For smart grid, [41] has proposed a heuristic algorithm to find a maximally disjoint backup route for a primary communication route.…”

Section: Related Workmentioning

confidence: 99%

VNF Orchestration and Power-Disjoint Traffic Flow Routing for Optimal Communication Robustness in Smart Grid With Cyber-Physical Interdependence

Kong

Jiang

2022

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

We explore the use of software-defined networking (SDN) technology in building a communication network for smart grid. With cyber-physical interdependence, such communication network may suffer from cross-network cascading failures. To prevent the failures, we perform virtual network function (VNF) orchestration jointly with power-disjoint routing. Our work is novel in proposing an efficient scheme to find power-disjoint routes at the same time of performing VNF orchestration. We formulate an optimization to maximize the ratio of power-disjoint route count to VNF orchestration cost. The optimization has a non-linear non-convex objective function. We propose a twolevel hierarchical solution approach. At higher level, the scheme converts the problem into a fractional maximum flow circulation, which can be solved using simplex method to find the maximum number of power-disjoint routes. Given a higher level solution, the lower level aims to minimize the VNF orchestration cost while satisfying VNF chaining and placement requirements. This lower level hierarchy uses the Dijkstra's algorithm in building a sequence of minimum spanning trees, each roots at the current VNF hosting node in a VNF chain. Extensive simulation results confirm that the proposed scheme can find the maximum number of power-disjoint routes and minimize the cost within a second, for a system with 120 communication nodes. The results show that the number of power-disjoint routes can be increased by increasing either the number of nodes or node degree, but only the node degree can keep the cost flat. Therefore, one should build a robust software-defined smart grid communication network by enhancing node connectivity.

show abstract

Section: Related Workmentioning

confidence: 99%