Nowadays network virtualization is utterly popular.As a result,how to protect the virtual networks from attacking on the link is increasingly important.Existing schemes are mainly backup-based,which suffer from data l...Nowadays network virtualization is utterly popular.As a result,how to protect the virtual networks from attacking on the link is increasingly important.Existing schemes are mainly backup-based,which suffer from data loss and are helpless to such attacks like data tampering.To offer high security level,in this paper,we first propose a multipath and decision-making(MD) scheme which applies multipath simultaneously delivery and decision-making for protecting the virtual network.Considering different security requirement for virtual link,we devise a hybrid scheme to protect the virtual links.For the critical links,MD scheme is adopted.For the other links,we adopt the Shared Backup Scheme.Our simulation results indicate the proposed scheme can significantly increase the security level of the critical link high in the loss of less acceptance ratio.展开更多
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.展开更多
为了解决虚拟网络映射光路太长和频谱碎片化的问题,论文提出一种基于邻居链路碎片感知的虚拟网络映射算法(Virtual Optical Network Embedding based on Adjacency Link Fragmentation Awareness, ALFA-VONE).设计考虑虚拟节点资源需求...为了解决虚拟网络映射光路太长和频谱碎片化的问题,论文提出一种基于邻居链路碎片感知的虚拟网络映射算法(Virtual Optical Network Embedding based on Adjacency Link Fragmentation Awareness, ALFA-VONE).设计考虑虚拟节点资源需求和邻居节点映射状态的权值计算方法,提高虚拟节点映射的成功率;使用相邻虚拟节点-虚拟链路协同映射方法,缩短映射光路长度和减少所需频隙数目;设计光路可用资源评估方法,以提高虚拟链路映射成功率;考虑拟分配频谱块对光路以及邻居链路造成的频谱碎片影响,设计频谱碎片影响值评估法,以提高频谱资源利用率.仿真结果表明:当网络负载为130 Erlang时,所设计算法的平均映射光路跳数减少28.4%,带宽利用率提高4.56%.展开更多
An operational backbone network is connected with many routers and other devices. Identifying faults in the network is very difficult, so a fault localization mechanism is necessary to identify fault and alleviate it ...An operational backbone network is connected with many routers and other devices. Identifying faults in the network is very difficult, so a fault localization mechanism is necessary to identify fault and alleviate it and correct the faults in order to reduce the network performance degradation. A risk model needs to be devised based on the dynamic database by creating alternate path and the network is reconfigured by identifying dynamic paths. In this paper, an on-demand link state routing approach is used for handling failures in IP backbone networks and a localization algorithm is used to improve QOS parameters based on threshold value of gateway. It is proved that on-demand link state routing guarantees loop-free forwarding to reachable destinations regardless of the number of failures in the network, and in case of localization algorithm using modification process packet loss is avoided based on threshold value of gateway. Heuristic algorithm is also used for reconfiguration of dynamic path for effective fault localization. In this paper, in order to change the traffic condition, reconfiguration strategic is dynamically used. Dijikstra’s shortest path algorithm has been used to determine the shortest path between node pairs. Using risk modeling mechanism, a small set of candidate faults is identified. The concept of Fault Localization is used to minimize the fault occurring in the node and sends original path to node pairs. The localization algorithm based on MODIFICATION PROCESS, packet loss is avoided in the network by checking threshold value of gateway. If the threshold value is maximum, router directly forwards the packet to destination through gateway and if the threshold value is minimum, router compresses the packet and forwards the packet to destination with notification via gateway.展开更多
基金supported by Foundation for Innovative Research Groups of the National Natural Science Foundation of China(61521003)National Key Research and Development Plan(2016YFB0800101)National Natural Science Foundation of China(61602509)
文摘Nowadays network virtualization is utterly popular.As a result,how to protect the virtual networks from attacking on the link is increasingly important.Existing schemes are mainly backup-based,which suffer from data loss and are helpless to such attacks like data tampering.To offer high security level,in this paper,we first propose a multipath and decision-making(MD) scheme which applies multipath simultaneously delivery and decision-making for protecting the virtual network.Considering different security requirement for virtual link,we devise a hybrid scheme to protect the virtual links.For the critical links,MD scheme is adopted.For the other links,we adopt the Shared Backup Scheme.Our simulation results indicate the proposed scheme can significantly increase the security level of the critical link high in the loss of less acceptance ratio.
基金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.
文摘为了解决虚拟网络映射光路太长和频谱碎片化的问题,论文提出一种基于邻居链路碎片感知的虚拟网络映射算法(Virtual Optical Network Embedding based on Adjacency Link Fragmentation Awareness, ALFA-VONE).设计考虑虚拟节点资源需求和邻居节点映射状态的权值计算方法,提高虚拟节点映射的成功率;使用相邻虚拟节点-虚拟链路协同映射方法,缩短映射光路长度和减少所需频隙数目;设计光路可用资源评估方法,以提高虚拟链路映射成功率;考虑拟分配频谱块对光路以及邻居链路造成的频谱碎片影响,设计频谱碎片影响值评估法,以提高频谱资源利用率.仿真结果表明:当网络负载为130 Erlang时,所设计算法的平均映射光路跳数减少28.4%,带宽利用率提高4.56%.
文摘An operational backbone network is connected with many routers and other devices. Identifying faults in the network is very difficult, so a fault localization mechanism is necessary to identify fault and alleviate it and correct the faults in order to reduce the network performance degradation. A risk model needs to be devised based on the dynamic database by creating alternate path and the network is reconfigured by identifying dynamic paths. In this paper, an on-demand link state routing approach is used for handling failures in IP backbone networks and a localization algorithm is used to improve QOS parameters based on threshold value of gateway. It is proved that on-demand link state routing guarantees loop-free forwarding to reachable destinations regardless of the number of failures in the network, and in case of localization algorithm using modification process packet loss is avoided based on threshold value of gateway. Heuristic algorithm is also used for reconfiguration of dynamic path for effective fault localization. In this paper, in order to change the traffic condition, reconfiguration strategic is dynamically used. Dijikstra’s shortest path algorithm has been used to determine the shortest path between node pairs. Using risk modeling mechanism, a small set of candidate faults is identified. The concept of Fault Localization is used to minimize the fault occurring in the node and sends original path to node pairs. The localization algorithm based on MODIFICATION PROCESS, packet loss is avoided in the network by checking threshold value of gateway. If the threshold value is maximum, router directly forwards the packet to destination through gateway and if the threshold value is minimum, router compresses the packet and forwards the packet to destination with notification via gateway.
