To ensure flight safety,the complex network method is used to study the influence and invulnerability of air traffic cyber physical system(CPS)nodes.According to the rules of air traffic management,the logical couplin...To ensure flight safety,the complex network method is used to study the influence and invulnerability of air traffic cyber physical system(CPS)nodes.According to the rules of air traffic management,the logical coupling relationship between routes and sectors is analyzed,an air traffic CPS network model is constructed,and the indicators of node influence and invulnerability are established.The K-shell algorithm is improved to identify node influence,and the invulnerability is analyzed under random and selective attacks.Taking Airspace in Eastern China as an example,its influential nodes are sorted by degree,namely,K-shell,the improved K-shell(IKS)and betweenness centrality.The invulnerability of air traffic CPS under different attacks is analyzed.Results show that IKS can effectively identify the influential nodes in the air traffic CPS network,and IKS and betweenness centrality are the two key indicators that affect the invulnerability of air traffic CPS.展开更多
Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been w...Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.展开更多
The ranking of network node importance is one of the most essential problems in the field of network science.Node ranking algorithms serve as an essential part in many application scenarios such as search engine,socia...The ranking of network node importance is one of the most essential problems in the field of network science.Node ranking algorithms serve as an essential part in many application scenarios such as search engine,social networks,and recommendation systems.This paper presents a systematic review on three representative methods:node ranking based on centralities,Page Rank algorithm,and HITS algorithm.Furthermore,we investigate the latest extensions and improvements of these representative methods,provided with several main application fields.Inspired by the survey of current literature,we attempt to propose promising directions for future research.The conclusions of this paper are enlightening and beneficial to both the academic and industrial communities.展开更多
In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual ne...In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.展开更多
基金This work was supported by the Fundamental Research Funds for the Central Universities(No.3122019191).
文摘To ensure flight safety,the complex network method is used to study the influence and invulnerability of air traffic cyber physical system(CPS)nodes.According to the rules of air traffic management,the logical coupling relationship between routes and sectors is analyzed,an air traffic CPS network model is constructed,and the indicators of node influence and invulnerability are established.The K-shell algorithm is improved to identify node influence,and the invulnerability is analyzed under random and selective attacks.Taking Airspace in Eastern China as an example,its influential nodes are sorted by degree,namely,K-shell,the improved K-shell(IKS)and betweenness centrality.The invulnerability of air traffic CPS under different attacks is analyzed.Results show that IKS can effectively identify the influential nodes in the air traffic CPS network,and IKS and betweenness centrality are the two key indicators that affect the invulnerability of air traffic CPS.
基金The authors would like to thank the reviewers for their detailed reviews and constructive comments,which have helped improve the quality of this paper.This work was supported by National Science Foundation of China under Grants 6187144。
文摘Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.
基金the National Natural Science Foundation of China(Grant No.71901205)。
文摘The ranking of network node importance is one of the most essential problems in the field of network science.Node ranking algorithms serve as an essential part in many application scenarios such as search engine,social networks,and recommendation systems.This paper presents a systematic review on three representative methods:node ranking based on centralities,Page Rank algorithm,and HITS algorithm.Furthermore,we investigate the latest extensions and improvements of these representative methods,provided with several main application fields.Inspired by the survey of current literature,we attempt to propose promising directions for future research.The conclusions of this paper are enlightening and beneficial to both the academic and industrial communities.
基金supported by "the Fundamental Research Funds for the Central Universities" of China University of Petroleum(East China)(Grant No.18CX02139A)the Shandong Provincial Natural Science Foundation,China(Grant No.ZR2014FQ018)+3 种基金the National Natural Science Foundation of China(Grant No.61471056)the National Basic Research Program(973)of China(Grant No.2012CB315801)the Research on coordinated management and control technology of network and satellite multi-domain network resources(Grant No.17-H863-01-ZT-001-001-02)the China research project on key technology strategy of infrastructure security for information network development
文摘In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.
