A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the ex...A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.展开更多
This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then...This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.展开更多
The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex vi...The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.展开更多
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.展开更多
The heterogeneity of applications and their divergent resource requirements lead to uneven traffic distribution and imbalanced resource utilization across data center networks(DCNs).We propose a fine-grained baseband ...The heterogeneity of applications and their divergent resource requirements lead to uneven traffic distribution and imbalanced resource utilization across data center networks(DCNs).We propose a fine-grained baseband function reallocation scheme in heterogeneous optical switching-based DCNs.A deep reinforcement learning-based functional split and resource mapping approach(DRL-BFM)is proposed to maximize throughput in high-load server racks by implementing load balancing in DCNs.The results demonstrate that DRL-BFM improves the throughput by 20.8%,22.8%,and 29.8%on average compared to existing algorithms under different computational capacities,bandwidth constraints,and latency conditions,respectively.展开更多
Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual ne...Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).展开更多
基金Sponsored by the Funds for Creative Research Groups of China(Grant No. 60821001)National Natural Science Foundation of China(Grant No.60973108 and 60902050)973 Project of China (Grant No.2007CB310703)
文摘A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.
基金supported by "the Fundamental Research Funds for the Central Universities" of China University of Petroleum (East China) (Grant No. 18CX02139A)the National Natural Science Foundation of China (Grant No. 61471056)
文摘This paper proposed a multi-domain virtual network embedding algorithm based on multi-controller SDN architecture. The local controller first selects candidate substrate nodes for each virtual node in the domain. Then the global controller abstracts substrate network topology based on the candidate nodes and boundary nodes of each domain, and applies Particle Swarm Optimization Algorithm on it to divide virtual network requests. Each local controller then embeds the virtual nodes of the divided single-domain virtual network requests in the domain, and cooperates with other local controllers to embed the inter-domain virtual links. Simulation experimental results show that the proposed algorithm has good performance in reducing embedding cost with good stability and scalability.
基金supported in part by Open Foundation of State Key Laboratory of Information Photonics and Optical Communications (Grant No. IPOC2014B009)Fundamental Research Funds for the Central Universities (Grant Nos. N130817002, N150401002)+1 种基金Foundation of the Education Department of Liaoning Province (Grant No. L2014089)National Natural Science Foundation of China (Grant Nos. 61302070, 61401082, 61471109, 61502075, 91438110)
文摘The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.
基金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.
基金supported by the National Key R&D Program of China(Nos.2023YFB2905500 and 2023YFB2805302)the National Natural Science Foundation of China(No.62205026)the Beijing Institute of Technology Research Fund Program for Young Scholars,and the Open Fund of IPOC(BUPT)。
文摘The heterogeneity of applications and their divergent resource requirements lead to uneven traffic distribution and imbalanced resource utilization across data center networks(DCNs).We propose a fine-grained baseband function reallocation scheme in heterogeneous optical switching-based DCNs.A deep reinforcement learning-based functional split and resource mapping approach(DRL-BFM)is proposed to maximize throughput in high-load server racks by implementing load balancing in DCNs.The results demonstrate that DRL-BFM improves the throughput by 20.8%,22.8%,and 29.8%on average compared to existing algorithms under different computational capacities,bandwidth constraints,and latency conditions,respectively.
基金supported by the National Basic Research Program (973) of China (No. 2011CB302601)the National Natural Science Foundation of China (No. 90818028)the National High-Tech R&D Program (863) of China (No. 2007AA010301)
文摘Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).
