Service Slice Resource Allocation Algorithm Based on Node Capability in Power Communication Network

In the context of service slicing, network resource allocation has become a research focus. To reduce the energy consumption of power communication networks, this paper proposes a service slice resource allocation algorithm based on node capability in power communication network. This algorithm adopts a strategy of simultaneous node mapping and link mapping for resource allocation. Use breadth first algorithm for each virtual node to allocate resources for the virtual node and its connected links. When allocating resources to virtual nodes, based on the historical mapping experience of the underlying network, priority is given to opening the underlying node that has been mapped the most times. When allocating resources for virtual links, the shortest path algorithm is used to select the underlying links that have already been mapped to the underlying links from multiple paths, thereby reducing the energy consumption of the underlying link resources. By comparing existing algorithms, it has been verified that this algorithm saves energy consumption on underlying network resources and improves the success rate of virtual network mapping.