WO2023039965A1 - Cloud-edge computing network computational resource balancing and scheduling method for traffic grooming, and system - Google Patents

Cloud-edge computing network computational resource balancing and scheduling method for traffic grooming, and system Download PDF

Info

Publication number
WO2023039965A1
WO2023039965A1 PCT/CN2021/123183 CN2021123183W WO2023039965A1 WO 2023039965 A1 WO2023039965 A1 WO 2023039965A1 CN 2021123183 W CN2021123183 W CN 2021123183W WO 2023039965 A1 WO2023039965 A1 WO 2023039965A1
Authority
WO
WIPO (PCT)
Prior art keywords
connection request
computing
network
spectrum
resource
Prior art date
Application number
PCT/CN2021/123183
Other languages
French (fr)
Chinese (zh)
Inventor
陈伯文
梁瑞鑫
王守翠
刘玲
郑雯雯
高明义
陈虹
邵卫东
沈纲祥
Original Assignee
苏州大学
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 苏州大学 filed Critical 苏州大学
Publication of WO2023039965A1 publication Critical patent/WO2023039965A1/en

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5072Grid computing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/48Indexing scheme relating to G06F9/48
    • G06F2209/484Precedence
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5021Priority

Definitions

  • the present invention relates to the technical field of cloud-edge computing, in particular to a cloud-edge computing network computing resource balance scheduling method for flow grooming.
  • the cloud server cannot process the computing tasks achieved in a short time, and some computing tasks cannot be processed in real time, resulting in business congestion.
  • transmitting computing tasks to cloud servers will bring problems such as high latency, additional transmission energy consumption, and data leakage.
  • ETSI European Telecommunications Standards Institute
  • MEC Mobile Edge Computing MEC
  • the MEC system allows devices to offload computing tasks to network edge nodes, such as base stations, wireless access points, etc., which not only meets the expansion requirements of computing capabilities of terminal devices, but also makes up for the long delay of cloud computing.
  • MEC technology helps to achieve key technical indicators such as ultra-low latency, ultra-high energy efficiency, and ultra-high reliability of 5G services.
  • a high-performance, low-latency, and high-bandwidth telecom service environment is provided to accelerate the distribution and download of various content, services, and applications in the network, allowing consumers to enjoy higher Quality web experience.
  • MEC can shorten task execution delay.
  • Mobile application task processing delay includes transmission delay, calculation delay and communication delay.
  • information needs to go through the wireless access network and backhaul link to reach the cloud server located in the core network.
  • MEC deploys edge servers on the radio access network side, shortening the distance between computing servers and mobile devices.
  • MEC task offloading does not need to go through the backhaul link and core network, which reduces the delay overhead.
  • the computing and processing power of edge servers is much greater than that of mobile devices, which greatly reduces task computing delays. Therefore, MEC has the characteristics of short transmission distance and flat protocol, so that it can meet the ultra-low latency requirements of 5G networks.
  • MEC can greatly improve network energy efficiency.
  • IoT devices can be widely used in various scenarios such as environmental monitoring, crowd sensing, and intelligent agriculture.
  • most of the deployed IoT devices cannot be powered by the power grid.
  • MEC shortens the distance between edge servers and mobile devices, greatly saves task offloading and energy consumption for wireless transmission, and prolongs the life of IoT devices. Use cycle.
  • MEC can provide higher service reliability.
  • the servers of MEC adopt distributed deployment, and the service scale of a single server is small, so it cannot store too much valuable information. Therefore, compared with the data center of mobile cloud computing, it is less likely to be attacked and can provide more reliable services.
  • most mobile edge cloud servers are private clouds, with low risk of information leakage and higher security.
  • the software-defined network technology based on the OpenFlow extension protocol has also developed rapidly in recent years. It is designed for software-defined edge server and switch networking problems and the establishment of end-to-end business data transmission required by application services.
  • OpenFlow extension protocol Through the mechanism of open flow extension protocol of software-defined network, it has the ability of intelligent integrated communication transmission and exchange, forms unified control and management function, dynamic changes of real-time scheduling strategy, and enhances the rapid response speed of edge computing network service request access.
  • Programming networking technology improves the flexibility and transmission efficiency of edge computing networking.
  • the technical problem to be solved by the present invention is to overcome the problem of high service blocking rate and low utilization rate of network spectrum resources in the prior art, so as to provide a method that makes the service blocking rate as low as possible and improves the utilization rate of network spectrum resources A cloud-edge computing network computing resource balance scheduling method and system for traffic grooming.
  • a cloud-edge computing network computing resource balance scheduling method for flow grooming includes the following steps: Step S1: Obtain network topology information, initialize network parameters, and generate a set of connection request sets; Step S2: For each connection request, determine whether the source area and the destination area have computing nodes with sufficient computing resources to handle the connection request.
  • step S3 use the K shortest path algorithm to calculate K candidate paths from the source node to the destination node, and arrange them according to priority, arrange the transmission bandwidth of the connection request, and obtain the transmission bandwidth Spectrum resources are required; step S4: sequentially judge whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of the spectrum flexible optical network transmission, if satisfied, select The shortest path is used as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to step S3, if completed, the establishment of the connection request fails; step S5: update the link in the central controller Spectrum resource status information and node computing resource information to calculate the blocking rate of connection requests in the entire network.
  • initializing network parameters includes initializing computing resources of cloud servers and edge servers in the network, initializing spectrum flexible optical networks, and initializing state information stored inside an OpenFlow-based central controller.
  • the server with the most idle computing resources in the corresponding area is selected by the central controller according to the stored real-time information on the computing resource occupancy of each edge server in the source area and the destination area respectively.
  • the spectrum resource requirement of a connection request is jointly determined by the bandwidth requirement and the line rate used for traffic grooming to determine the spectrum resource required for transmission of each connection request.
  • the calculation of each edge computing server is recorded in the central controller Resources and the status information of the spectrum resources of each link are updated.
  • the occupied spectrum resources are released, and the link spectrum resources in the central controller are updated. status information; at the same time, after the edge computing server finishes processing the connection request, it releases the computing resources occupied by the edge computing server, and updates the computing resource status information of each edge computing server stored in the central controller.
  • the present invention also provides a cloud-edge computing network computing resource balance scheduling system for flow grooming, including: a network topology initialization module, used to obtain network topology information, initialize network parameters, and generate a set of connection requests; an edge computing server selection module , for each connection request, it is used to determine whether the source area and the destination area have enough computing resources to process the computing nodes of the connection request, if not, the establishment of the connection request fails; if so, select the server with the most idle computing resources in the corresponding area as the connection The source node and the destination node of the request; the working path calculation module is used to calculate the K candidate paths from the source node to the destination node with the K shortest path algorithm, and arrange them according to the priority, and transfer the connection request Broadband sorting to obtain the spectrum resources required for transmission; the spectrum resource allocation module is used to sequentially determine whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum of the spectrum flexible optical network transmission is consistent and spectrum continuity conditions, if satisfied
  • the present invention also includes a network resource release module and a blocking rate calculation module, wherein the network resource release module is used to release the spectrum resources occupied by the working path after the connection request is successfully transmitted, and at the same time, After the connection request is processed by the corresponding computing node, the computing resources of the server processing the user request are released, and finally, the information of the working path established by the connection request is cleared; the blocking rate calculation module is used for all connection requests in the network After sending, calculate the overall service blocking rate, where the number of unsuccessfully established connection requests includes the number of connection request blocking due to insufficient computing resources of the source node or destination node and the number of connection request blocking due to insufficient link spectrum resources on the transmission path quantity.
  • the present invention also includes a central controller module and a judgment and early warning module, the central controller module is used to complete network initialization, connection request edge computing server selection, transmission path calculation, spectrum resource allocation, Computing resource update, resource release, and network congestion rate calculation status monitoring functions; the judgment and early warning module is used to implement the coordination function between each module, and the judgment and early warning function of whether each module is successfully established to complete the entire network topology The goal of reducing the traffic congestion rate.
  • the cloud-edge computing network computing resource balance scheduling method and system for traffic grooming described in the present invention mainly aim at how to balance computing resources in the cloud-edge computing network, reduce the service blocking rate and improve the utilization rate of network spectrum resources, and propose a traffic grooming-based method.
  • Computing resource balancing method and system mainly aim at how to balance computing resources in the cloud-edge computing network, reduce the service blocking rate and improve the utilization rate of network spectrum resources, and propose a traffic grooming-based method.
  • For each connection request select the server with the most idle computing resources in the source area and the destination area as the source node and the destination node according to its computing resource requirements. Since the server with the most idle computing resources is selected in the corresponding area according to the computing resources required by the connection request as the source node or the destination node, the computing resources of the servers in each area in the network are balanced.
  • the K shortest path algorithm is used to calculate the candidate path between the source node and the destination node. Use the method of traffic grooming to organize the bandwidth of the connection request and obtain the spectrum resources required for the transmission of the connection request.
  • the spectrum allocation algorithm of the first hit For the K candidate paths in order of priority from high to low, use the spectrum allocation algorithm of the first hit to allocate spectrum resources for the path. If the two constraints of spectrum consistency and spectrum continuity are satisfied at the same time, this path is selected as the connection The requested work path. Then update the status of network computing resources and spectrum resources in real time. In the process of traffic grooming, select the appropriate line rate to organize the transmission bandwidth of the connection request. For the connection request whose bandwidth requirement is less than the capacity of an optical channel, the established optical channel is given priority to use, so as to make full use of the idle bandwidth of each optical channel. Improve the utilization of network spectrum resources.
  • the computing node with the highest idleness for each connection request By selecting the computing node with the highest idleness for each connection request and using the method of traffic grooming to sort out the transmission bandwidth, it can effectively balance the computing resource occupancy of each area of the cloud edge computing network and provide spectrum resource utilization. In the case of reasonable allocation of resources Reduce service congestion rate as much as possible.
  • the OpenFlow-based central controller needs to ensure the update speed of the stored network computing resources and link spectrum resources to be able to ensure the timeliness and accuracy of the network resource information required when multiple consecutive connection requests find paths and allocate spectrum resources.
  • Fig. 1 is a flowchart of a method for balanced scheduling of cloud-side computing network computing resources according to the present invention
  • Fig. 2 is a network diagram of the balanced dispatching of computing resources in the cloud-edge computing network based on traffic grooming in the present invention
  • Fig. 3 is a flowchart of the cloud-edge computing network computing resource balance scheduling system for traffic grooming according to the present invention.
  • this embodiment provides a cloud-edge computing network computing resource balance scheduling method for traffic grooming, including the following steps: Step S1: Obtain network topology information, initialize network parameters, and generate a set of connection request sets; Step S2 : For each connection request, determine whether the source area and the destination area have computing nodes with sufficient computing resources to process the connection request.
  • Step S3 Calculate and obtain K candidate paths from the source node to the destination node with the K shortest path algorithm, and arrange them according to priority, sort out the transmission bandwidth of the connection request, and obtain the transmission bandwidth Spectrum resource required;
  • Step S4 sequentially judge whether the idle spectrum resource on the candidate transmission path selected according to the priority meets the spectrum resource requirement of the connection request and the spectrum consistency and spectrum continuity conditions of spectrum flexible optical network transmission, if satisfied, Select the shortest path as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to step S3, if completed, the establishment of the connection request fails; step S5: update the chain in the central controller State information of road spectrum resources and node computing resource information to calculate the blocking rate of connection requests in the entire network.
  • the cloud-edge computing network computing resource balance scheduling method for traffic grooming described in this embodiment determines whether the source area and the destination area have enough computing resources to process the computing nodes of the connection request. If not, the connection request establishment fails; if there is, select the corresponding The server with the most idle computing resources in the area is used as the source node and the destination node of the connection request. According to the computing resource requirements of the connection request, the edge server with the most idle computing resources can be selected for the connection request in the source area and the destination area as the source node and destination node.
  • the method of traffic grooming is used to realize the sharing of optical fiber spectrum resources, thereby improving the utilization of network spectrum resources and reducing the blocking rate of connection requests;
  • the path path algorithm calculates K candidate paths from the source node to the destination node, and arranges them according to priority, which is beneficial to make the service blocking rate as low as possible, and at the same time improve the utilization rate of network spectrum resources; Whether the free spectrum resources on the candidate transmission path selected by priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of spectrum flexible optical network transmission, comprehensively considering each edge server in each edge area of the cloud edge computing network Computing resources and the spectrum resource usage of each fiber link, and selecting the optimal computing node and spectrum resource allocation method for each connection request, which is conducive to rational planning of network resource scheduling in edge areas and cloud areas to minimize The connection request blocking rate and the utilization rate of network spectrum resources are improved, thereby improving the service quality of the network.
  • initializing the network parameters includes initializing the computing resources of the cloud server and the edge server in the network, initializing the spectrum flexible optical network, and initializing the state information stored inside the central controller based on OpenFlow.
  • the computing resources of the cloud server and the edge server in the network are initialized, the spectrum flexible optical network is initialized, and the state information stored inside the OpenFlow-based central controller is initialized.
  • CR ⁇ CR1,CR2,...,CR
  • represents a group of connection requests, and
  • N e ⁇ n e1 ,n e2 ,...,n
  • means a group of edge nodes,
  • N c ⁇ n c1 ,n c2 ,...,n
  • L ⁇ l 1 ,l 2 ,...,l
  • is the set of optical fiber links in the cloud edge computing network,
  • the server with the most idle computing resources in the corresponding area is selected by the central controller according to the stored real-time information on the computing resource occupancy of each edge server in the source area and the destination area respectively. Select the server with the most idle computing resources.
  • connection request sets CR are generated, each connection request CR(s,d,BR,C s ,C d ) ⁇ CR, where s represents the source node, d represents the destination node, and s and d need to be determined by the source area R s and the computing resource occupancy in the destination area R d are determined, R s and R d are randomly generated, BR represents the bandwidth requirement of the connection request, C s represents the computing resources required by the connection request at the source node, and C d represents the connection request Computational resources required at the destination node.
  • the central controller For each connection request CR(s,d,BR,C s ,C d ), assuming that its source region R s and destination region R d have been randomly generated, the central controller first calculates the resource occupancy according to the stored edge servers The real-time information of the situation selects the server with the most idle computing resources in the source area and the destination area as the source node and the destination node of the connection request. If the computing resources of the source node or the destination node cannot meet the computing resource requirements of the connection request, the connection request will be blocked. .
  • the distance is arranged in ascending order from small to large, and the smaller the path distance, the higher the priority.
  • K candidate paths from the source node to the destination node are obtained. And in ascending order of distance from small to large, that is, the smaller the path distance, the higher the priority, that is, the higher the priority.
  • each connection request According to the bandwidth requirement BR of each connection request, it can be channeled to different optical channels with different line rates, and the optical channels with less than full capacity can continue to be used for subsequent connection requests.
  • the spectrum resources required for each connection request transmission are determined by its bandwidth requirements and the line rate used for traffic grooming. Among them, the spectrum resources required for each optical channel are established, and the spectrum allocation algorithm of the first hit is adopted. According to all links on the path Generate a spectrum resource table according to the spectrum resource status of the road, and start to search for available spectrum slots from the end with the smaller number. If an available spectrum gap is found, the spectrum resource allocation is performed and the spectrum resource status is updated; if no spectrum resource allocation is found, the spectrum resource allocation fails. Assuming that there are M connection requests sharing one optical channel, and the selected line rate is LR, the following constraints should be met:
  • the central controller judges whether the idle spectrum resources on the paths satisfy the spectrum of the connection request according to the priorities of the selected K paths from high to low. Resource requirements and spectrum consistency and spectrum continuity conditions for spectrum flexible optical network transmission, select the shortest path that satisfies each condition as the transmission path of the connection request; if none of the K paths can satisfy all the conditions at the same time, the connection request is blocked.
  • the spectrum resource requirement of a connection request is jointly determined by its bandwidth requirement and the line rate used for traffic grooming.
  • the spectrum resource required for transmission of each connection request is determined.
  • step S5 before updating the link spectrum resource status information and node computing resource information in the central controller, after the connection request successfully establishes a working path and allocates spectrum resources, record the computing resources of each edge computing server in the central controller and The status information of the spectrum resource of each link is updated.
  • the central controller records the calculation resources of each edge computing server and the spectrum resources of each link Status information is updated.
  • the edge computing server When updating the link spectrum resource status information and node computing resource information in the central controller, after the current connection request is transmitted, release the occupied spectrum resource and update the link spectrum resource status information in the central controller; at the same time, the edge computing server processes After the connection request is completed, the computing resources of the edge computing servers occupied are released, and the computing resource status information of each edge computing server stored in the central controller is updated.
  • the occupied spectrum resource is released, and the state information of the link spectrum resource in the central controller is updated; at the same time, after the edge computing server finishes processing the connection request, the occupied computing resource of the edge computing server is released , updating the computing resource status information of each edge computing server stored in the central controller, so as to provide it for subsequent service requests.
  • this network includes 1 cloud area and 3 edge areas.
  • the cloud area is composed of 3 interconnected switches, and each cloud server is connected to the switch; the edge area is composed of 3 interconnected switches. , each of which has an edge server connected to the switch; all switches in the cloud area and the edge area share a central controller.
  • the cloud area and the edge area are connected with each other through base station transmission. Assume that each edge server contains 50 computing units, the cloud server contains 1000 computing units, each link in the network contains 100 spectrum slots, and the spectrum width occupied by each spectrum slot is 12.5GHz.
  • the source of the connection request Areas, destination areas, bandwidth requirements, and computing resource requirements are randomly generated.
  • connection request is represented by CR(s, d, BR, C s , C d ), R s represents the source area of the connection request, R d represents the destination area of the connection request, BR represents the transmission bandwidth required by the connection request, and C s represents Computing resources required by the connection request in the source area, C d represents the computing resources required by the connection request in the destination area.
  • the source areas of the three connection requests are edge area 1
  • the destination areas are cloud area, edge area 2, and edge area 3 respectively.
  • the server with the most idle computing resources in the source area and the destination area as the source node and destination node of the connection request.
  • the number next to each server in Figure 2 is the current computing resource usage.
  • the final three connection requests are CR1(1,8,40G,2,30), CR2(1,4,30G, 3,9), CR3 (1,6,10G,4,12).
  • K shortest path algorithm uses the K shortest path algorithm to create K paths between node 1 to node 8, node 1 to node 4, and node 1 to node 6, and arrange them in ascending order of distance from small to large, that is, the smaller the path distance , the higher the priority.
  • the lower-priority paths are sequentially selected for spectrum resource allocation until resources are allocated successfully or all paths are blocked.
  • DP-QPSK dual polarization quadrature phase shift keying
  • the spectrum allocation algorithm of the first hit is adopted, and the spectrum resources are allocated according to the constraints of spectrum consistency and spectrum continuity.
  • the link spectrum resource status in the network all three connection requests can successfully allocate spectrum resources, and the working paths of CR1, CR2, and CR3 are path 1(1-2-7-8), path 2(1-2-7 -9-3-4), path 3 (1-2-7-9-10-5-6).
  • connection request is successfully established, and the computing resources and spectrum resource status are updated.
  • the computing resource occupancy of node 1, node 4, node 6, and node 8 are updated to 39, 34, 32, and 920 respectively, and are updated in real time
  • the computing resources of each node of the entire network topology and the spectrum resource status information of each link stored in the central controller are used to calculate the blocking rate of connection requests that fail to be successfully established using formula (4).
  • this embodiment provides a cloud-edge computing network computing resource balance scheduling system for traffic grooming.
  • the problem-solving principle is similar to the traffic grooming cloud-edge computing network computing resource balance scheduling method. No longer.
  • this embodiment provides a cloud edge computing network computing resource balance scheduling system for traffic grooming, including:
  • the network topology initialization module is used to obtain network topology information, initialize network parameters, and generate a set of connection request sets;
  • the edge computing server selection module is used for each connection request to determine whether the source area and the destination area have enough computing resources to process the computing nodes of the connection request. If not, the establishment of the connection request fails; if there is, select the idle computing resources in the corresponding area The most servers are used as the source node and destination node of the connection request;
  • the working path calculation module is used to calculate K candidate paths from the source node to the destination node with the K shortest path algorithm, and arrange them according to priority;
  • the spectrum resource allocation module is used to sequentially determine whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of the spectrum flexible optical network transmission. If satisfied, select The shortest path is used as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to the working path calculation module, if completed, the connection request establishment fails;
  • the network resource information update module is used to update link spectrum resource status information and node computing resource information in the central controller, and calculate the connection request blocking rate in the entire network.
  • the network topology initialization module in the network topology G (CR, N e , N c , L, S, C), the number of servers in the cloud area and edge area, the number of base stations, and the number of switches are configured, and the edge server and cloud server , network topology information, network link spectrum resources, and an OpenFlow-based central controller for initialization.
  • a connection request generation module is also included, which is used to generate a set of connection requests according to user requests, configure the number of connection requests, the source area and destination area of each connection request generated, and the connection request at the source Information such as the size of computing resources required by the area and destination area, and the amount of bandwidth required for connection request transmission.
  • the central controller assigns each connection request in its source area and destination area. Select the node with the largest free computing resources in the corresponding area as the source node and destination node. If the server with the largest free computing resources in the corresponding area cannot satisfy the computing resources required by the connection request in this area, the connection request will be blocked.
  • the K shortest path algorithm is used to calculate the connection request from
  • the K candidate paths from the source node to the destination node are arranged in ascending order of distance, that is, the smaller the path distance, the higher the priority.
  • the spectrum resource allocation module according to the transmission bandwidth requirement BR of the connection request CR (s, d, BR, C s , C d ), an appropriate line rate is selected to channel the bandwidth of each connection request, and the transmission bandwidth of the connection request is obtained. Spectrum resources needed.
  • the obtained K candidate paths according to the order of priority from high to low, search for the spectrum resources required to meet the connection request in the path. If the dual constraints of spectrum continuity and spectrum consistency are satisfied at the same time, the spectrum can be allocated successfully. resources; if the dual constraints of spectrum continuity and spectrum consistency cannot be satisfied at the same time, the next candidate path is judged. If none of the spectrum resources of the K candidate paths satisfies the condition, the current connection request is blocked.
  • the computing resources of the source node and the destination node should be occupied by the connection request Update in real time; at the same time, the spectrum resource of each link on the working path of the connection request should also be updated according to the size of the spectrum resource occupied by the transmission of the current connection request. And update it to the central controller information list in real time.
  • the network resource release module is used to release the spectrum resources occupied by the working path after the connection request is successfully transmitted, and at the same time, after the connection request is processed by the corresponding computing node Finally, the computing resources of the server processing the user request are released, and finally, the information of the working path established by the connection request is cleared; the blocking rate calculation module is used to calculate the overall business congestion after all the connection requests in the network are sent.
  • the number of unsuccessfully established connection requests includes the number of connection request blocking caused by insufficient computing resources of the source node or destination node and the number of connection request blocking caused by insufficient link spectrum resources on the transmission path.
  • the network resource release module after the connection request is successfully transmitted, the spectrum resources occupied by the working path are released. At the same time, after the connection request is processed by the corresponding computing node, the computing resource of the server processing the user request is released. Finally, the information of the working path established by the connection request is cleared.
  • the overall service blocking rate is calculated according to formula (4), wherein the number of connection requests that have not been successfully established includes those caused by insufficient computing resources of the source node or the destination node The number of connection requests blocked and the number of connection requests blocked due to insufficient link spectrum resources on the transmission path.
  • the central controller module is used to complete network initialization, connection request edge computing server selection, transmission path calculation, spectrum resource allocation, computing resource update, resource release, and network congestion.
  • the status monitoring function of rate calculation; the judgment and early warning module is used to implement the coordination function between each module, and the judgment and early warning function of whether each module is successfully established, so as to complete the goal of reducing the traffic blocking rate in the entire network topology.
  • the central controller module it mainly completes the state monitoring functions of network initialization, connection request edge computing server selection, transmission path calculation, spectrum resource allocation, computing resource update, resource release, and network blocking rate calculation, so as to realize the status monitoring functions in all Minimize the blocking rate of the network during connection request transmission.
  • the coordination function between each module is executed, and the judgment and early warning function of whether each module is successfully established, and the goal of reducing the service blocking rate in the entire network topology is completed.
  • the embodiments of the present application may be provided as methods, systems, or computer program products. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions
  • the device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

Abstract

The present invention relates to a cloud-edge computing network computational resource balancing and scheduling method for traffic grooming, and a system. An embodiment comprises: obtaining network topology information, initializing a network parameter, and generating a connection request set; determining for each connection request whether a source region and a destination region have nodes with sufficient computational resources to process the connection request; using a k shortest paths algorithm and calculating K candidate paths from a source node to a destination node, performing sorting according to priority levels, and organizing transmission bandwidths of the connection requests; determining in order whether an available spectrum resource on a candidate transmission path selected according to priority level satisfies a spectrum resource requirement of a connection request as well as spectral consistency and spectral continuity conditions for spectrum-flexible optical network transmission; updating link spectrum resource state information and node computational resource information in a central processor, and calculating a connection request blocking rate in the entire network. The present invention facilitates reduction of the blocking rate of a service and improves network spectrum resource utilization.

Description

流量疏导的云边计算网络计算资源均衡调度方法及系统Cloud edge computing network computing resource balance scheduling method and system for traffic grooming 技术领域technical field
本发明涉及云边计算的技术领域,尤其是指一种流量疏导的云边计算网络计算资源均衡调度方法。The present invention relates to the technical field of cloud-edge computing, in particular to a cloud-edge computing network computing resource balance scheduling method for flow grooming.
背景技术Background technique
近年来,随着物联网(IoT)的高速发展和大数据应用的广泛使用,用户对于网络计算资源的需求量急剧增长。此外,智能手机、笔记本电脑和平板电脑的技术进步,使得新的高要求服务和应用得以出现。尽管新的移动设备在中央处理器(CPU)方面越来越强大,但可能无法在短时间内处理业务量大的应用程序。云计算具有强大的计算能力,设备可以通过计算资源卸载,将计算任务传输到远端云服务器执行,从而能够有效缓解计算资源需求量较大的问题。然而,云计算资源也是有限的,当计算任务数量过多时,云端服务器无法在短时间内处理达到的计算任务,部分计算任务无法被实时处理进而导致业务阻塞。此外,将计算任务传输到云端服务器会带来较高的时延、增加额外传输能量消耗和数据泄露等问题。In recent years, with the rapid development of the Internet of Things (IoT) and the widespread use of big data applications, users' demand for network computing resources has increased dramatically. In addition, technological advances in smartphones, laptops and tablets have enabled the emergence of new demanding services and applications. Although new mobile devices are becoming more and more powerful in terms of central processing units (CPUs), they may not be able to process heavy-duty applications in a short period of time. Cloud computing has powerful computing capabilities. Devices can offload computing resources and transmit computing tasks to remote cloud servers for execution, which can effectively alleviate the problem of large demand for computing resources. However, cloud computing resources are also limited. When the number of computing tasks is too large, the cloud server cannot process the computing tasks achieved in a short time, and some computing tasks cannot be processed in real time, resulting in business congestion. In addition, transmitting computing tasks to cloud servers will bring problems such as high latency, additional transmission energy consumption, and data leakage.
为了解决云计算卸载过程中面临的高时延等问题,欧洲电信标准协会(ETSI)于2014年率先提出移动边缘计算MEC的概念:一种在靠近用户的无线接入网提供IT及云计算的平台,被认为是第五代移动通信的关键技术之一。MEC系统允许设备将计算任务卸载到网络边缘节点处,如基站、无线接入点等,既满足了终端设备计算能力的扩展需求,同时弥补了云计算时延较长的缺点。MEC技术有助于达到5G业务超低时延、超高能效、超高可靠性等关键技术指标。通过将云计算和云存储部署到网络边缘,提供一个具备高性能、低时延与高带宽的电信服务环境,加速网络中各项内容、服 务以及应用的分发和下载,让消费者享有更高质量网络体验。In order to solve the problems of high latency in the process of offloading cloud computing, the European Telecommunications Standards Institute (ETSI) first proposed the concept of Mobile Edge Computing MEC in 2014: a wireless access network close to users that provides IT and cloud computing platform, is considered to be one of the key technologies of the fifth generation mobile communication. The MEC system allows devices to offload computing tasks to network edge nodes, such as base stations, wireless access points, etc., which not only meets the expansion requirements of computing capabilities of terminal devices, but also makes up for the long delay of cloud computing. MEC technology helps to achieve key technical indicators such as ultra-low latency, ultra-high energy efficiency, and ultra-high reliability of 5G services. By deploying cloud computing and cloud storage to the edge of the network, a high-performance, low-latency, and high-bandwidth telecom service environment is provided to accelerate the distribution and download of various content, services, and applications in the network, allowing consumers to enjoy higher Quality web experience.
首先,MEC能缩短任务执行时延。移动应用任务处理时延包括传输时延、计算时延和通信时延。传统的移动云计算中,信息需要经过无线接入网、回传链路到达位于核心网的云服务器。MEC将边缘服务器部署在无线接入网侧,缩短了计算服务器与移动设备之间的距离。一方面,由于传输距离的缩短,MEC的任务卸载不需要经过回传链路和核心网,减少了时延开销。另一方面,边缘服务器的计算处理能力远大于移动设备,从而大幅降低任务计算时延。因此,MEC传输距离短、协议扁平化的特点使其能够满足5G网络的超低时延需求。First, MEC can shorten task execution delay. Mobile application task processing delay includes transmission delay, calculation delay and communication delay. In traditional mobile cloud computing, information needs to go through the wireless access network and backhaul link to reach the cloud server located in the core network. MEC deploys edge servers on the radio access network side, shortening the distance between computing servers and mobile devices. On the one hand, due to the shortened transmission distance, MEC task offloading does not need to go through the backhaul link and core network, which reduces the delay overhead. On the other hand, the computing and processing power of edge servers is much greater than that of mobile devices, which greatly reduces task computing delays. Therefore, MEC has the characteristics of short transmission distance and flat protocol, so that it can meet the ultra-low latency requirements of 5G networks.
其次,MEC能大幅提升网络能效。物联网设备可广泛应用到环境监测、人群感知、智能农业等各种场景。但部署的物联网设备大多无法通过电网供电,在设备电池能量有限的情况下,MEC缩短了边缘服务器与移动设备的距离,大幅节约了任务卸载、无线传输所耗能量,延长了物联网设备的使用周期。Second, MEC can greatly improve network energy efficiency. IoT devices can be widely used in various scenarios such as environmental monitoring, crowd sensing, and intelligent agriculture. However, most of the deployed IoT devices cannot be powered by the power grid. In the case of limited battery energy, MEC shortens the distance between edge servers and mobile devices, greatly saves task offloading and energy consumption for wireless transmission, and prolongs the life of IoT devices. Use cycle.
此外,MEC能提供更高的服务可靠性。MEC的服务器采用分布式部署,单个服务器服务规模小,不可存储过多的有价值信息。因此,相较于移动云计算的数据中心,不易成为被攻击的目标,可以提供更可靠的服务。同时,多数移动边缘云服务器属于私有云,信息泄露风险低,也具有更高的安全性。In addition, MEC can provide higher service reliability. The servers of MEC adopt distributed deployment, and the service scale of a single server is small, so it cannot store too much valuable information. Therefore, compared with the data center of mobile cloud computing, it is less likely to be attacked and can provide more reliable services. At the same time, most mobile edge cloud servers are private clouds, with low risk of information leakage and higher security.
最后,基于开放流(OpenFlow)扩展协议的软件定义网络的技术在近年来也得到了迅速发展,为了软件定义边缘服务器与交换机组网问题,建立应用服务需求的端到端业务数据传输而设计。可通过软件定义网络的开放流扩展协议的机制,具备智能化集成通信传输交换能力,形成统一控管功能、实时调度策略的动态变化、增强边缘计算网络业务请求接入快速响应速度,结合运用可编程组网技术,提高边缘计算组网灵活性与传输效率。Finally, the software-defined network technology based on the OpenFlow extension protocol has also developed rapidly in recent years. It is designed for software-defined edge server and switch networking problems and the establishment of end-to-end business data transmission required by application services. Through the mechanism of open flow extension protocol of software-defined network, it has the ability of intelligent integrated communication transmission and exchange, forms unified control and management function, dynamic changes of real-time scheduling strategy, and enhances the rapid response speed of edge computing network service request access. Programming networking technology improves the flexibility and transmission efficiency of edge computing networking.
目前,在云计算与边缘计算的研究中,有仅考虑优化计算资源选择的业务卸载方法和仅考虑优化链路频谱资源分配的业务卸载方法,然而,这两种分配方法都是仅仅针对一个优化目标而设计的资源分配方法。计算资源优化 分配方法能够有效降低业务的计算时延,但却不能提高网络链路传输业务的能力,业务传输时延仍然可进一步优化处理;链路频谱资源优化分配方法可以提高节点处理业务的速度,但是网络中各边缘节点的计算资源利用率仍可进一步优化。At present, in the research of cloud computing and edge computing, there are business offloading methods that only consider optimizing the selection of computing resources and business offloading methods that only consider optimizing the allocation of link spectrum resources. However, these two allocation methods are only for an optimized A resource allocation method designed for the purpose. The optimal allocation method of computing resources can effectively reduce the computing delay of services, but it cannot improve the ability of network links to transmit services, and the service transmission delay can still be further optimized; the optimal allocation method of link spectrum resources can improve the speed of node processing services , but the computing resource utilization of each edge node in the network can still be further optimized.
发明内容Contents of the invention
为此,本发明所要解决的技术问题在于克服现有技术中业务阻塞率高,同时网络频谱资源利用率低的问题,从而提供一种使得业务阻塞率尽可能低,同时提高网络频谱资源利用率的流量疏导的云边计算网络计算资源均衡调度方法及系统。Therefore, the technical problem to be solved by the present invention is to overcome the problem of high service blocking rate and low utilization rate of network spectrum resources in the prior art, so as to provide a method that makes the service blocking rate as low as possible and improves the utilization rate of network spectrum resources A cloud-edge computing network computing resource balance scheduling method and system for traffic grooming.
为解决上述技术问题,本发明的一种流量疏导的云边计算网络计算资源均衡调度方法,包括如下步骤:步骤S1:获取网络拓扑信息,初始化网络参数,生成一组连接请求集合;步骤S2:对于每一个连接请求,判断源区域和目的区域是否有足够计算资源处理连接请求的计算节点,若没有,则连接请求建立失败;若有,选取相应区域空闲计算资源最多的服务器作为连接请求的源节点和目的节点;步骤S3:用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径,并按优先级进行排列,对连接请求的传输宽带进行整理,得到传输所需频谱资源;步骤S4:依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连续性条件,若满足,选择最短路径作为连接请求的传输路径;若不满足,继续判断K条候选路径是否完成,若没完成,则返回步骤S3,若完成,则连接请求建立失败;步骤S5:更新中央控制器中链路频谱资源状态信息和节点计算资源信息,计算整个网络中连接请求阻塞率。In order to solve the above-mentioned technical problems, a cloud-edge computing network computing resource balance scheduling method for flow grooming according to the present invention includes the following steps: Step S1: Obtain network topology information, initialize network parameters, and generate a set of connection request sets; Step S2: For each connection request, determine whether the source area and the destination area have computing nodes with sufficient computing resources to handle the connection request. If not, the establishment of the connection request fails; if so, select the server with the most idle computing resources in the corresponding area as the source of the connection request node and destination node; step S3: use the K shortest path algorithm to calculate K candidate paths from the source node to the destination node, and arrange them according to priority, arrange the transmission bandwidth of the connection request, and obtain the transmission bandwidth Spectrum resources are required; step S4: sequentially judge whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of the spectrum flexible optical network transmission, if satisfied, select The shortest path is used as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to step S3, if completed, the establishment of the connection request fails; step S5: update the link in the central controller Spectrum resource status information and node computing resource information to calculate the blocking rate of connection requests in the entire network.
在本发明的一个实施例中,初始化网络参数包括对网络中的云服务器和边缘服务器的计算资源进行初始化,频谱灵活光网络初始化,以及基于OpenFlow的中央控制器内部存储的状态信息初始化。In one embodiment of the present invention, initializing network parameters includes initializing computing resources of cloud servers and edge servers in the network, initializing spectrum flexible optical networks, and initializing state information stored inside an OpenFlow-based central controller.
在本发明的一个实施例中,选取相应区域空闲计算资源最多的服务器是 由中央控制器根据所存储的各边缘服务器计算资源占用情况实时信息分别在源区域和目的区域选择空闲计算资源最多的服务器。In one embodiment of the present invention, the server with the most idle computing resources in the corresponding area is selected by the central controller according to the stored real-time information on the computing resource occupancy of each edge server in the source area and the destination area respectively. .
在本发明的一个实施例中,按优先级进行排列时,按距离由小到大升序排列,路径距离越小,优先级越高。In an embodiment of the present invention, when arranging by priority, they are arranged in ascending order of distance from small to large, and the smaller the path distance, the higher the priority.
在本发明的一个实施例中,连接请求的频谱资源需求是由其带宽要求与流量疏导使用的线速率大小共同决定每一个连接请求传输所需要的频谱资源。In an embodiment of the present invention, the spectrum resource requirement of a connection request is jointly determined by the bandwidth requirement and the line rate used for traffic grooming to determine the spectrum resource required for transmission of each connection request.
在本发明的一个实施例中,更新中央控制器中链路频谱资源状态信息和频谱资源信息前,连接请求成功建立工作路径并分配频谱资源后,对中央控制器中记录各边缘计算服务器的计算资源以及各链路的频谱资源的状态信息进行更新。In one embodiment of the present invention, before updating the link spectrum resource status information and spectrum resource information in the central controller, after the connection request successfully establishes a working path and allocates spectrum resources, the calculation of each edge computing server is recorded in the central controller Resources and the status information of the spectrum resources of each link are updated.
在本发明的一个实施例中,更新中央控制器中链路频谱资源状态信息和节点计算资源信息时,当前连接请求传输完毕后,释放所占用的频谱资源,更新中央控制器中链路频谱资源状态信息;同时在边缘计算服务器处理完连接请求后,释放所占用的边缘计算服务器的计算资源,更新中央控制器中存储各边缘计算服务器计算资源状态信息。In one embodiment of the present invention, when updating link spectrum resource status information and node computing resource information in the central controller, after the current connection request is transmitted, the occupied spectrum resources are released, and the link spectrum resources in the central controller are updated. status information; at the same time, after the edge computing server finishes processing the connection request, it releases the computing resources occupied by the edge computing server, and updates the computing resource status information of each edge computing server stored in the central controller.
本发明还提供了一种流量疏导的云边计算网络计算资源均衡调度系统,包括:网络拓扑初始化模块,用于获取网络拓扑信息,初始化网络参数,生成一组连接请求集合;边缘计算服务器选择模块,用于对于每一个连接请求,判断源区域和目的区域是否有足够计算资源处理连接请求的计算节点,若没有,则连接请求建立失败;若有,选取相应区域空闲计算资源最多的服务器作为连接请求的源节点和目的节点;工作路径计算模块,用于用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径,并按优先级进行排列,对连接请求的传输宽带进行整理,得到传输所需频谱资源;频谱资源分配模块,用于依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连续性条件,若满足,选择最短路径作为连接请求的传输路径;若 不满足,继续判断K条候选路径是否完成,若没完成,则返回工作路径计算模块,若完成,则连接请求建立失败;网络资源信息更新模块,用于更新中央控制器中链路频谱资源状态信息和节点计算资源信息,计算整个网络中连接请求阻塞率。The present invention also provides a cloud-edge computing network computing resource balance scheduling system for flow grooming, including: a network topology initialization module, used to obtain network topology information, initialize network parameters, and generate a set of connection requests; an edge computing server selection module , for each connection request, it is used to determine whether the source area and the destination area have enough computing resources to process the computing nodes of the connection request, if not, the establishment of the connection request fails; if so, select the server with the most idle computing resources in the corresponding area as the connection The source node and the destination node of the request; the working path calculation module is used to calculate the K candidate paths from the source node to the destination node with the K shortest path algorithm, and arrange them according to the priority, and transfer the connection request Broadband sorting to obtain the spectrum resources required for transmission; the spectrum resource allocation module is used to sequentially determine whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum of the spectrum flexible optical network transmission is consistent and spectrum continuity conditions, if satisfied, select the shortest path as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not completed, return to the working path calculation module, if completed, the connection request The establishment fails; the network resource information update module is used to update the link spectrum resource status information and node computing resource information in the central controller, and calculate the connection request blocking rate in the entire network.
在本发明的一个实施例中,还包括网络资源释放模块和阻塞率计算模块,其中所述网络资源释放模块用于在连接请求成功传输后,对工作路径占用的频谱资源进行资源释放,同时,在连接请求被相应计算节点处理完成后,对处理用户请求的服务器的计算资源进行释放,最后,将连接请求建立的工作路径进行信息清除;所述阻塞率计算模块用于在网络中所有连接请求发送完毕后,计算整体的业务阻塞率,其中未成功建立的连接请求数包含由于源节点或目的节点计算资源不足导致的连接请求阻塞数量与由于传输路径上链路频谱资源不足导致的连接请求阻塞数量。In one embodiment of the present invention, it also includes a network resource release module and a blocking rate calculation module, wherein the network resource release module is used to release the spectrum resources occupied by the working path after the connection request is successfully transmitted, and at the same time, After the connection request is processed by the corresponding computing node, the computing resources of the server processing the user request are released, and finally, the information of the working path established by the connection request is cleared; the blocking rate calculation module is used for all connection requests in the network After sending, calculate the overall service blocking rate, where the number of unsuccessfully established connection requests includes the number of connection request blocking due to insufficient computing resources of the source node or destination node and the number of connection request blocking due to insufficient link spectrum resources on the transmission path quantity.
在本发明的一个实施例中,还包括中央控制器模块和判决和预警模块,所述中央控制器模块用于完成对网络进行初始化、连接请求边缘计算服务器选择、传输路径计算、频谱资源分配、计算资源更新、资源释放、网络阻塞率计算的状态监控功能;所述判决和预警模块用于执行各个模块之间的协调功能,以及每个模块是否建立成功的判决与预警功能,完成整个网络拓扑中降低业务阻塞率的目标。In one embodiment of the present invention, it also includes a central controller module and a judgment and early warning module, the central controller module is used to complete network initialization, connection request edge computing server selection, transmission path calculation, spectrum resource allocation, Computing resource update, resource release, and network congestion rate calculation status monitoring functions; the judgment and early warning module is used to implement the coordination function between each module, and the judgment and early warning function of whether each module is successfully established to complete the entire network topology The goal of reducing the traffic congestion rate.
本发明的上述技术方案相比现有技术具有以下优点:The above technical solution of the present invention has the following advantages compared with the prior art:
本发明所述的流量疏导的云边计算网络计算资源均衡调度方法及系统,主要针对云边计算网络中如何平衡计算资源、降低业务阻塞率与提高网络频谱资源利用率问题,提出基于流量疏导的计算资源均衡方法和系统。The cloud-edge computing network computing resource balance scheduling method and system for traffic grooming described in the present invention mainly aim at how to balance computing resources in the cloud-edge computing network, reduce the service blocking rate and improve the utilization rate of network spectrum resources, and propose a traffic grooming-based method. Computing resource balancing method and system.
对每一个连接请求,根据其计算资源需求分别在源区域和目的区域选择空闲计算资源最多的服务器作为源节点和目的节点。由于根据连接请求所要求的计算资源在相应区域选择空闲计算资源最多的服务器作为源节点或目的节点,从而达到网络中各区域服务器计算资源的均衡。For each connection request, select the server with the most idle computing resources in the source area and the destination area as the source node and the destination node according to its computing resource requirements. Since the server with the most idle computing resources is selected in the corresponding area according to the computing resources required by the connection request as the source node or the destination node, the computing resources of the servers in each area in the network are balanced.
采用K条最短路径算法计算源节点到目的节点之间的候选路径。使用流 量疏导的方法对连接请求的带宽进行整理并得到连接请求传输所需的频谱资源。The K shortest path algorithm is used to calculate the candidate path between the source node and the destination node. Use the method of traffic grooming to organize the bandwidth of the connection request and obtain the spectrum resources required for the transmission of the connection request.
对K条候选路径按优先级从高到低顺序,采用首次命中的频谱分配算法对路径进行频谱资源分配,若同时满足频谱一致性和频谱连续性两个约束条件,则选用该条路径作为连接请求的工作路径。然后对网络计算资源和频谱资源状态进行实时更新。在流量疏导过程中选用合适大小的线速率对连接请求传输带宽进行整理,对于带宽需求小于一个光通道容量的连接请求,优先考虑使用已建立的光通道,从而充分利用各光通道的空闲带宽,提高网路频谱资源利用率。For the K candidate paths in order of priority from high to low, use the spectrum allocation algorithm of the first hit to allocate spectrum resources for the path. If the two constraints of spectrum consistency and spectrum continuity are satisfied at the same time, this path is selected as the connection The requested work path. Then update the status of network computing resources and spectrum resources in real time. In the process of traffic grooming, select the appropriate line rate to organize the transmission bandwidth of the connection request. For the connection request whose bandwidth requirement is less than the capacity of an optical channel, the established optical channel is given priority to use, so as to make full use of the idle bandwidth of each optical channel. Improve the utilization of network spectrum resources.
通过为每个连接请求选择空闲度最高的计算节点并使用流量疏导的方法对传输带宽进行整理,有效平衡云边计算网络各区域计算资源占用和提供频谱资源利用率,在合理分配资源的情况下尽可能降低业务阻塞率。By selecting the computing node with the highest idleness for each connection request and using the method of traffic grooming to sort out the transmission bandwidth, it can effectively balance the computing resource occupancy of each area of the cloud edge computing network and provide spectrum resource utilization. In the case of reasonable allocation of resources Reduce service congestion rate as much as possible.
基于OpenFlow的中央控制器需要保证所存储的网络计算资源与链路频谱资源更新速度要能够保证在连续多个连接请求寻找路径与分配频谱资源时所需网络资源信息的及时性与准确性。The OpenFlow-based central controller needs to ensure the update speed of the stored network computing resources and link spectrum resources to be able to ensure the timeliness and accuracy of the network resource information required when multiple consecutive connection requests find paths and allocate spectrum resources.
附图说明Description of drawings
为了使本发明的内容更容易被清楚的理解,下面根据本发明的具体实施例并结合附图,对本发明作进一步详细的说明,其中In order to make the content of the present invention more easily understood, the present invention will be described in further detail below according to specific embodiments of the present invention in conjunction with the accompanying drawings, wherein
图1是本发明流量疏导的云边计算网络计算资源均衡调度方法流程图;Fig. 1 is a flowchart of a method for balanced scheduling of cloud-side computing network computing resources according to the present invention;
图2是本发明基于流量疏导的云边计算网络计算资源均衡调度网络图;Fig. 2 is a network diagram of the balanced dispatching of computing resources in the cloud-edge computing network based on traffic grooming in the present invention;
图3是本发明流量疏导的云边计算网络计算资源均衡调度系统流程图。Fig. 3 is a flowchart of the cloud-edge computing network computing resource balance scheduling system for traffic grooming according to the present invention.
具体实施方式Detailed ways
实施例一Embodiment one
如图1所示,本实施例提供一种流量疏导的云边计算网络计算资源均衡调度方法,包括如下步骤:步骤S1:获取网络拓扑信息,初始化网络参数,生成一组连接请求集合;步骤S2:对于每一个连接请求,判断源区域和目 的区域是否有足够计算资源处理连接请求的计算节点,若没有,则连接请求建立失败;若有,选取相应区域空闲计算资源最多的服务器作为连接请求的源节点和目的节点;步骤S3:用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径,并按优先级进行排列,对连接请求的传输宽带进行整理,得到传输所需频谱资源;步骤S4:依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连续性条件,若满足,选择最短路径作为连接请求的传输路径;若不满足,继续判断K条候选路径是否完成,若没完成,则返回步骤S3,若完成,则连接请求建立失败;步骤S5:更新中央控制器中链路频谱资源状态信息和节点计算资源信息,计算整个网络中连接请求阻塞率。As shown in FIG. 1 , this embodiment provides a cloud-edge computing network computing resource balance scheduling method for traffic grooming, including the following steps: Step S1: Obtain network topology information, initialize network parameters, and generate a set of connection request sets; Step S2 : For each connection request, determine whether the source area and the destination area have computing nodes with sufficient computing resources to process the connection request. If not, the establishment of the connection request fails; if yes, select the server with the most idle computing resources in the corresponding area as the connection request Source node and destination node; Step S3: Calculate and obtain K candidate paths from the source node to the destination node with the K shortest path algorithm, and arrange them according to priority, sort out the transmission bandwidth of the connection request, and obtain the transmission bandwidth Spectrum resource required; Step S4: sequentially judge whether the idle spectrum resource on the candidate transmission path selected according to the priority meets the spectrum resource requirement of the connection request and the spectrum consistency and spectrum continuity conditions of spectrum flexible optical network transmission, if satisfied, Select the shortest path as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to step S3, if completed, the establishment of the connection request fails; step S5: update the chain in the central controller State information of road spectrum resources and node computing resource information to calculate the blocking rate of connection requests in the entire network.
本实施例所述流量疏导的云边计算网络计算资源均衡调度方法,判断源区域和目的区域是否有足够计算资源处理连接请求的计算节点,若没有,则连接请求建立失败;若有,选取相应区域空闲计算资源最多的服务器作为连接请求的源节点和目的节点,由于可根据连接请求的计算资源需求,分别在源区域与目的区域为连接请求选择空闲计算资源最多的边缘服务器作为源节点和目的节点,同时在连接请求传输过程中,根据各连接请求的传输带宽需求,使用流量疏导的方法,实现光纤频谱资源的共用,从而提高网络频谱资源利用率并降低连接请求阻塞率;用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径,并按优先级进行排列,有利于使得业务阻塞率尽可能低,同时提高网络频谱资源的利用率;另外,依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连续性条件,综合考虑云边计算网络中各边缘区域每个边缘服务器计算资源与每段光纤链路频谱资源使用情况,为每个连接请求选择最优的计算节点与频谱资源分配方式,这样有利于合理规划边缘区域与云区域的网络资源调度,以最大程度地减少连接请求阻塞率并提高网络频谱资源利用率,进而改善网络的服务质量。The cloud-edge computing network computing resource balance scheduling method for traffic grooming described in this embodiment determines whether the source area and the destination area have enough computing resources to process the computing nodes of the connection request. If not, the connection request establishment fails; if there is, select the corresponding The server with the most idle computing resources in the area is used as the source node and the destination node of the connection request. According to the computing resource requirements of the connection request, the edge server with the most idle computing resources can be selected for the connection request in the source area and the destination area as the source node and destination node. At the same time, during the connection request transmission process, according to the transmission bandwidth requirements of each connection request, the method of traffic grooming is used to realize the sharing of optical fiber spectrum resources, thereby improving the utilization of network spectrum resources and reducing the blocking rate of connection requests; The path path algorithm calculates K candidate paths from the source node to the destination node, and arranges them according to priority, which is beneficial to make the service blocking rate as low as possible, and at the same time improve the utilization rate of network spectrum resources; Whether the free spectrum resources on the candidate transmission path selected by priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of spectrum flexible optical network transmission, comprehensively considering each edge server in each edge area of the cloud edge computing network Computing resources and the spectrum resource usage of each fiber link, and selecting the optimal computing node and spectrum resource allocation method for each connection request, which is conducive to rational planning of network resource scheduling in edge areas and cloud areas to minimize The connection request blocking rate and the utilization rate of network spectrum resources are improved, thereby improving the service quality of the network.
所述步骤S1中,初始化网络参数包括对网络中的云服务器和边缘服务 器的计算资源进行初始化,频谱灵活光网络初始化,以及基于OpenFlow的中央控制器内部存储的状态信息初始化。In the step S1, initializing the network parameters includes initializing the computing resources of the cloud server and the edge server in the network, initializing the spectrum flexible optical network, and initializing the state information stored inside the central controller based on OpenFlow.
具体地,对网络中的云服务器和边缘服务器的计算资源进行初始化,频谱灵活光网络初始化,以及基于OpenFlow的中央控制器内部存储的状态信息初始化。在云边计算网络G(CR,N e,N c,L,S,C),CR={CR1,CR2,…,CR |CR|}表示一组连接请求,|CR|为连接请求数量;N e={n e1,n e2,…,n |Ne|}表示一组边缘节点,|N e|为边缘节点数量;N c={n c1,n c2,…,n |Nc|}表示一组云节点,|N c|为云节点数量;L={l 1,l 2,…,l |L|}为云边计算网络的光纤链路集合,|L|为网络拓扑中光纤链路总数量;S={s 1,s 2,…,s |S|}表示光纤链路中的频谱隙集合,|S|为光纤链路中频谱隙总数量;C表示中央控制器,所有交换机共享一个控制器,控制器可实时监控交换机相连的各服务器计算资源以及与各链路频谱资源占用情况。 Specifically, the computing resources of the cloud server and the edge server in the network are initialized, the spectrum flexible optical network is initialized, and the state information stored inside the OpenFlow-based central controller is initialized. In the cloud-edge computing network G(CR,N e ,N c ,L,S,C), CR={CR1,CR2,...,CR |CR| } represents a group of connection requests, and |CR| is the number of connection requests; N e ={n e1 ,n e2 ,…,n |Ne| } means a group of edge nodes, |N e | is the number of edge nodes; N c ={n c1 ,n c2 ,…,n |Nc| } means A group of cloud nodes, |N c | is the number of cloud nodes; L={l 1 ,l 2 ,…,l |L| } is the set of optical fiber links in the cloud edge computing network, |L| is the optical fiber link in the network topology The total number of channels; S={s 1 ,s 2 ,…,s |S| } represents the set of spectrum slots in the fiber link, |S| is the total number of spectrum slots in the fiber link; C represents the central controller, all The switch shares a controller, and the controller can monitor the computing resources of each server connected to the switch and the spectrum resource occupancy of each link in real time.
所述步骤S2中,选取相应区域空闲计算资源最多的服务器是由中央控制器根据所存储的各边缘服务器计算资源占用情况实时信息分别在源区域和目的区域选择空闲计算资源最多的服务器。In the step S2, the server with the most idle computing resources in the corresponding area is selected by the central controller according to the stored real-time information on the computing resource occupancy of each edge server in the source area and the destination area respectively. Select the server with the most idle computing resources.
具体地,生成一组连接请求集合CR,每一个连接请求CR(s,d,BR,C s,C d)∈CR,其中s表示源节点,d表示目的节点,s和d需要由源区域R s与目的区域R d内的计算资源占用情况确定,R s与R d随机生成,BR表示连接请求的带宽需求,C s表示连接请求在源节点处所要求的计算资源,C d表示连接请求在目的节点处所要求的计算资源。 Specifically, a set of connection request sets CR is generated, each connection request CR(s,d,BR,C s ,C d )∈CR, where s represents the source node, d represents the destination node, and s and d need to be determined by the source area R s and the computing resource occupancy in the destination area R d are determined, R s and R d are randomly generated, BR represents the bandwidth requirement of the connection request, C s represents the computing resources required by the connection request at the source node, and C d represents the connection request Computational resources required at the destination node.
对于每一个连接请求CR(s,d,BR,C s,C d),假定其源区域R s与目的区域R d已随机生成,首先由中央控制器根据所存储的各边缘服务器计算资源占用情况实时信息分别在源区域和目的区域选择空闲计算资源最多的服务器作为连接请求的源节点和目的节点,如果源节点或目的节点存在计算资源无法满足连接请求的计算资源需求的情况,连接请求阻塞。 For each connection request CR(s,d,BR,C s ,C d ), assuming that its source region R s and destination region R d have been randomly generated, the central controller first calculates the resource occupancy according to the stored edge servers The real-time information of the situation selects the server with the most idle computing resources in the source area and the destination area as the source node and the destination node of the connection request. If the computing resources of the source node or the destination node cannot meet the computing resource requirements of the connection request, the connection request will be blocked. .
Figure PCTCN2021123183-appb-000001
Figure PCTCN2021123183-appb-000001
Figure PCTCN2021123183-appb-000002
Figure PCTCN2021123183-appb-000002
所述步骤S3中,按优先级进行排列时,按距离由小到大升序排列,路径距离越小,优先级越高。In the step S3, when arranging by priority, the distance is arranged in ascending order from small to large, and the smaller the path distance, the higher the priority.
根据在网络拓扑中用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径。并按距离由小到大升序排列,即路径距离越小,优先选择权就越高,即其优先级越高。According to the K shortest path algorithm in the network topology, K candidate paths from the source node to the destination node are obtained. And in ascending order of distance from small to large, that is, the smaller the path distance, the higher the priority, that is, the higher the priority.
根据每一个连接请求的带宽要求BR,可用不同大小的线速率将其疏导至不同的光通道之中,对于容量未满的光通道,可继续供后续连接请求使用。由其带宽要求与流量疏导使用的线速率大小共同决定每一个连接请求传输所需要的频谱资源,其中每个光通道建立所需的频谱资源,采用首次命中的频谱分配算法,根据路径上所有链路的频谱资源状态生成一张频谱资源表进行编号,从标号小的一端开始查找可用的频谱间隙。如果找到可用的频谱间隙则进行频谱资源分配并进行频谱资源状态更新;如果没有找到则频谱资源分配失败。假定有M个连接请求共用一个光通道,选用线速率大小为LR,则应满足以下约束:According to the bandwidth requirement BR of each connection request, it can be channeled to different optical channels with different line rates, and the optical channels with less than full capacity can continue to be used for subsequent connection requests. The spectrum resources required for each connection request transmission are determined by its bandwidth requirements and the line rate used for traffic grooming. Among them, the spectrum resources required for each optical channel are established, and the spectrum allocation algorithm of the first hit is adopted. According to all links on the path Generate a spectrum resource table according to the spectrum resource status of the road, and start to search for available spectrum slots from the end with the smaller number. If an available spectrum gap is found, the spectrum resource allocation is performed and the spectrum resource status is updated; if no spectrum resource allocation is found, the spectrum resource allocation fails. Assuming that there are M connection requests sharing one optical channel, and the selected line rate is LR, the following constraints should be met:
Figure PCTCN2021123183-appb-000003
Figure PCTCN2021123183-appb-000003
所述步骤S4中,在找出连接请求的候选传输路径后,由中央控制器在所选的K条路径按照优先级由高到低依次判断路径上的空闲频谱资源在是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连续性条件,选择满足各项条件的最短路径作为连接请求的传输路径;如果K条路径都无法同时满足全部条件,连接请求阻塞。In the step S4, after finding out the candidate transmission path of the connection request, the central controller judges whether the idle spectrum resources on the paths satisfy the spectrum of the connection request according to the priorities of the selected K paths from high to low. Resource requirements and spectrum consistency and spectrum continuity conditions for spectrum flexible optical network transmission, select the shortest path that satisfies each condition as the transmission path of the connection request; if none of the K paths can satisfy all the conditions at the same time, the connection request is blocked.
连接请求的频谱资源需求是由其带宽要求与流量疏导使用的线速率大小共同决定每一个连接请求传输所需要的频谱资源。The spectrum resource requirement of a connection request is jointly determined by its bandwidth requirement and the line rate used for traffic grooming. The spectrum resource required for transmission of each connection request is determined.
依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连 续性条件,若不满足,返回步骤S3,根据公式(4)计算整个网络中连接请求阻塞率BP,其中F CRc表示由于边缘计算服务器计算资源不足所导致的连接请求阻塞数量,F CRl表示由于K条候选传输路径上的频谱资源无法满足传输需求导致的连接请求阻塞数量。 Determine in turn whether the idle spectrum resource on the candidate transmission path selected according to the priority meets the spectrum resource requirement of the connection request and the spectrum consistency and spectrum continuity conditions of spectrum flexible optical network transmission, if not satisfied, return to step S3, according to the formula ( 4) Calculate the connection request blocking rate BP in the entire network, where F CRc represents the number of connection request blocks caused by insufficient computing resources of the edge computing server, and F CR1 represents the number of connection requests blocked due to the inability of the spectrum resources on the K candidate transmission paths to meet the transmission requirements. The number of blocked connection requests.
BP=(F CRl+F CRc)/|CR|         (4) BP=(F CRl +F CRc )/|CR| (4)
所述步骤S5中,更新中央控制器中链路频谱资源状态信息和节点计算资源信息前,连接请求成功建立工作路径并分配频谱资源后,对中央控制器中记录各边缘计算服务器的计算资源以及各链路的频谱资源的状态信息进行更新。In the step S5, before updating the link spectrum resource status information and node computing resource information in the central controller, after the connection request successfully establishes a working path and allocates spectrum resources, record the computing resources of each edge computing server in the central controller and The status information of the spectrum resource of each link is updated.
具体地,连接请求CR(s,d,BR,C s,C d)成功建立工作路径并分配频谱资源后,对中央控制器中记录各边缘计算服务器的计算资源以及各链路的频谱资源的状态信息进行更新。 Specifically, after the connection request CR(s,d,BR,C s ,C d ) successfully establishes a working path and allocates spectrum resources, the central controller records the calculation resources of each edge computing server and the spectrum resources of each link Status information is updated.
更新中央控制器中链路频谱资源状态信息和节点计算资源信息时,当前连接请求传输完毕后,释放所占用的频谱资源,更新中央控制器中链路频谱资源状态信息;同时在边缘计算服务器处理完连接请求后,释放所占用的边缘计算服务器的计算资源,更新中央控制器中存储各边缘计算服务器计算资源状态信息。When updating the link spectrum resource status information and node computing resource information in the central controller, after the current connection request is transmitted, release the occupied spectrum resource and update the link spectrum resource status information in the central controller; at the same time, the edge computing server processes After the connection request is completed, the computing resources of the edge computing servers occupied are released, and the computing resource status information of each edge computing server stored in the central controller is updated.
具体地,当前连接请求传输完毕后,释放所占用的频谱资源,更新中央控制器中链路频谱资源状态信息;同时在边缘计算服务器处理完连接请求后,释放所占用的边缘计算服务器的计算资源,更新中央控制器中存储各边缘计算服务器计算资源状态信息,以便提供给后续业务请求使用。Specifically, after the current connection request is transmitted, the occupied spectrum resource is released, and the state information of the link spectrum resource in the central controller is updated; at the same time, after the edge computing server finishes processing the connection request, the occupied computing resource of the edge computing server is released , updating the computing resource status information of each edge computing server stored in the central controller, so as to provide it for subsequent service requests.
下面结合附图详细说明流量疏导的云边计算网络计算资源均衡调度方法:The following is a detailed description of the cloud edge computing network computing resource balance scheduling method for traffic grooming in combination with the accompanying drawings:
如图2所示,此网络包含1个云区域和3个边缘区域,云区域由3台相互连接的交换机构成,各有1台云服务器与交换机相连;边缘区域由3台相互连接的交换机构成,各有1台边缘服务器与交换机相连;云区域和边缘区域的所有交换机共用一台中央控制器。云区域与边缘区域之间通过基站传输 方式相互联系。假设各边缘服务器包含50个计算单元,云服务器包含1000个计算单元,网络中的每段链路中所含100个频谱隙,每个频谱隙所占用的频谱宽度为12.5GHz,连接请求的源区域、目的区域、带宽需求、计算资源需求随机生成。As shown in Figure 2, this network includes 1 cloud area and 3 edge areas. The cloud area is composed of 3 interconnected switches, and each cloud server is connected to the switch; the edge area is composed of 3 interconnected switches. , each of which has an edge server connected to the switch; all switches in the cloud area and the edge area share a central controller. The cloud area and the edge area are connected with each other through base station transmission. Assume that each edge server contains 50 computing units, the cloud server contains 1000 computing units, each link in the network contains 100 spectrum slots, and the spectrum width occupied by each spectrum slot is 12.5GHz. The source of the connection request Areas, destination areas, bandwidth requirements, and computing resource requirements are randomly generated.
首先,对频谱灵活光网络G(CR,N e,N c,L,S,C)进行初始化,包括连接请求、基站、交换机、各服务器的计算资源、各链路段的频谱资源、中央控制器中存储的状态信息。连接请求用CR(s,d,BR,C s,C d)表示,R s表示连接请求的源区域,R d表示连接请求的目的区域,BR表示连接请求所需要的传输带宽,C s表示连接请求在源区域所需计算资源,C d表示连接请求在目的区域所需计算资源。假定在图2的区域1中生成3个待处理的连接请求CR1(s,d,40G,2,30)、CR2(s,d,30G,3,9)、CR3(s,d,10G,4,12),3个连接请求的源区域均为边缘区域1,目的区域分别为云区域、边缘区域2、边缘区域3。 First, initialize the spectrum flexible optical network G(CR,N e ,N c ,L,S,C), including connection requests, base stations, switches, computing resources of each server, spectrum resources of each link segment, central control Status information stored in the memory. The connection request is represented by CR(s, d, BR, C s , C d ), R s represents the source area of the connection request, R d represents the destination area of the connection request, BR represents the transmission bandwidth required by the connection request, and C s represents Computing resources required by the connection request in the source area, C d represents the computing resources required by the connection request in the destination area. Assume that three pending connection requests CR1(s,d,40G,2,30), CR2(s,d,30G,3,9), CR3(s,d,10G, 4, 12), the source areas of the three connection requests are edge area 1, and the destination areas are cloud area, edge area 2, and edge area 3 respectively.
第二,根据各区域每个服务器的空闲计算资源量,分别选择源区域和目的区域中空闲计算资源最多的服务器作为连接请求的源节点和目的节点。图2中各服务器旁的数字为当前计算资源占用量,依照此计算节点选择原则,最终3个连接请求分别为CR1(1,8,40G,2,30)、CR2(1,4,30G,3,9)、CR3(1,6,10G,4,12)。Second, according to the amount of idle computing resources of each server in each area, select the server with the most idle computing resources in the source area and the destination area as the source node and destination node of the connection request. The number next to each server in Figure 2 is the current computing resource usage. According to this calculation node selection principle, the final three connection requests are CR1(1,8,40G,2,30), CR2(1,4,30G, 3,9), CR3 (1,6,10G,4,12).
第三,使用K条最短路径算法分别为节点1到节点8、节点1到节点4、节点1到节点6之间的K条路径,并按距离由小到大升序排列,即路径距离越小,优先选择权就越高。当具有高优先级的路径在某一段链路上发生阻塞时,就依次选取较低优先级的路径进行频谱资源分配,直到分配资源成功或所有路径全都阻塞。Thirdly, use the K shortest path algorithm to create K paths between node 1 to node 8, node 1 to node 4, and node 1 to node 6, and arrange them in ascending order of distance from small to large, that is, the smaller the path distance , the higher the priority. When a high-priority path is blocked on a certain link, the lower-priority paths are sequentially selected for spectrum resource allocation until resources are allocated successfully or all paths are blocked.
第四,使用双偏振正交相移键控(DP-QPSK)的40Gbps线速率对各连接请求的带宽进行流量疏导,该线速率条件下每建立一个光通道的所占用的频谱宽度为25GHz。根据各连接请求的传输带宽需求,CR1单独使用一个光通道,CR2与CR3可共用一个光通道,故CR1需要2个频谱隙,CR2和CR3共需2个频谱隙。Fourth, use the 40Gbps line rate of dual polarization quadrature phase shift keying (DP-QPSK) to conduct traffic grooming for the bandwidth requested by each connection. Under this line rate condition, the spectrum width occupied by each optical channel is 25GHz. According to the transmission bandwidth requirements of each connection request, CR1 uses one optical channel alone, and CR2 and CR3 can share one optical channel, so CR1 needs 2 spectrum slots, and CR2 and CR3 need 2 spectrum slots in total.
第五,按照K条候选路径的优先级由高到低顺序,采用首次命中的频谱分配算法,根据频谱一致性和频谱连续性的约束条件进行频谱资源分配。由网络中链路频谱资源状态,3个连接请求均可成功分配频谱资源,CR1、CR2、CR3的工作路径分别为路径①(1-2-7-8)、路径②(1-2-7-9-3-4)、路径③(1-2-7-9-10-5-6)。Fifth, according to the priority order of the K candidate paths from high to low, the spectrum allocation algorithm of the first hit is adopted, and the spectrum resources are allocated according to the constraints of spectrum consistency and spectrum continuity. According to the link spectrum resource status in the network, all three connection requests can successfully allocate spectrum resources, and the working paths of CR1, CR2, and CR3 are path ①(1-2-7-8), path ②(1-2-7 -9-3-4), path ③ (1-2-7-9-10-5-6).
最后,频谱资源分配后,连接请求成功建立,对计算资源和频谱资源状态进行更新,节点1、节点4、节点6、节点8计算资源占用分别更新为39、34、32、920,并实时更新中央控制器中存储的整个网络拓扑各节点计算资源和各链路的频谱资源状态信息,用公式(4)计算连接请求未能成功建立的阻塞率。Finally, after the spectrum resources are allocated, the connection request is successfully established, and the computing resources and spectrum resource status are updated. The computing resource occupancy of node 1, node 4, node 6, and node 8 are updated to 39, 34, 32, and 920 respectively, and are updated in real time The computing resources of each node of the entire network topology and the spectrum resource status information of each link stored in the central controller are used to calculate the blocking rate of connection requests that fail to be successfully established using formula (4).
实施例二Embodiment two
基于同一发明构思,本实施例提供了一种流量疏导的云边计算网络计算资源均衡调度系统,其解决问题的原理与所述流量疏导的云边计算网络计算资源均衡调度方法类似,重复之处不再赘述。Based on the same inventive concept, this embodiment provides a cloud-edge computing network computing resource balance scheduling system for traffic grooming. The problem-solving principle is similar to the traffic grooming cloud-edge computing network computing resource balance scheduling method. No longer.
如图3所示,本实施例提供一种流量疏导的云边计算网络计算资源均衡调度系统,包括:As shown in FIG. 3 , this embodiment provides a cloud edge computing network computing resource balance scheduling system for traffic grooming, including:
网络拓扑初始化模块,用于获取网络拓扑信息,初始化网络参数,生成一组连接请求集合;The network topology initialization module is used to obtain network topology information, initialize network parameters, and generate a set of connection request sets;
边缘计算服务器选择模块,用于对于每一个连接请求,判断源区域和目的区域是否有足够计算资源处理连接请求的计算节点,若没有,则连接请求建立失败;若有,选取相应区域空闲计算资源最多的服务器作为连接请求的源节点和目的节点;The edge computing server selection module is used for each connection request to determine whether the source area and the destination area have enough computing resources to process the computing nodes of the connection request. If not, the establishment of the connection request fails; if there is, select the idle computing resources in the corresponding area The most servers are used as the source node and destination node of the connection request;
工作路径计算模块,用于用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径,并按优先级进行排列;The working path calculation module is used to calculate K candidate paths from the source node to the destination node with the K shortest path algorithm, and arrange them according to priority;
频谱资源分配模块,用于依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输 的频谱一致性和频谱连续性条件,若满足,选择最短路径作为连接请求的传输路径;若不满足,继续判断K条候选路径是否完成,若没完成,则返回工作路径计算模块,若完成,则连接请求建立失败;The spectrum resource allocation module is used to sequentially determine whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of the spectrum flexible optical network transmission. If satisfied, select The shortest path is used as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to the working path calculation module, if completed, the connection request establishment fails;
网络资源信息更新模块,用于更新中央控制器中链路频谱资源状态信息和节点计算资源信息,计算整个网络中连接请求阻塞率。The network resource information update module is used to update link spectrum resource status information and node computing resource information in the central controller, and calculate the connection request blocking rate in the entire network.
所述网络拓扑初始化模块中,在网络拓扑G(CR,N e,N c,L,S,C)中,配置云区域和边缘区域服务器数目、基站数目、交换机数目,对边缘服务器、云服务器、网络拓扑信息、网络链路频谱资源以及基于OpenFlow的中央控制器进行初始化。 In the network topology initialization module, in the network topology G (CR, N e , N c , L, S, C), the number of servers in the cloud area and edge area, the number of base stations, and the number of switches are configured, and the edge server and cloud server , network topology information, network link spectrum resources, and an OpenFlow-based central controller for initialization.
所述边缘计算服务器选择模块中,还包括连接请求生成模块,用于根据用户请求生成一组连接请求,配置连接请求数目、所生成每个连接请求传输的源区域与目的区域、连接请求在源区域和目的区域所需的计算资源大小、连接请求传输所需的带宽大小等信息。In the edge computing server selection module, a connection request generation module is also included, which is used to generate a set of connection requests according to user requests, configure the number of connection requests, the source area and destination area of each connection request generated, and the connection request at the source Information such as the size of computing resources required by the area and destination area, and the amount of bandwidth required for connection request transmission.
所述边缘计算服务器选择模块中,中央控制器根据网络拓扑中各计算节点的空闲计算资源大小,在满足连接请求所需计算资源的前提下,为每个连接请求在其源区域和目的区域均选择相应区域空闲计算资源最大的节点作为源节点和目的节点。若相应区域空闲计算资源最大的服务器也无法满足连接请求在该区域所需的计算资源,则连接请求阻塞。In the edge computing server selection module, the central controller, according to the size of the idle computing resources of each computing node in the network topology, and on the premise of satisfying the computing resources required by the connection request, assigns each connection request in its source area and destination area. Select the node with the largest free computing resources in the corresponding area as the source node and destination node. If the server with the largest free computing resources in the corresponding area cannot satisfy the computing resources required by the connection request in this area, the connection request will be blocked.
所述工作路径计算模块中,根据连接请求CR(s,d,BR,C s,C d)经计算节点选择模块所得的源节点和目的节点,采用K条最短路径算法,计算出连接请求从源节点到目的节点的K条候选路径,并按距离由小到大升序排列,即路径距离越小,优先级越高。 In the working path calculation module, according to the connection request CR (s, d, BR, C s , C d ), the source node and the destination node obtained by the calculation node selection module, the K shortest path algorithm is used to calculate the connection request from The K candidate paths from the source node to the destination node are arranged in ascending order of distance, that is, the smaller the path distance, the higher the priority.
所述频谱资源分配模块中,根据连接请求CR(s,d,BR,C s,C d)的传输带宽需求BR,选用大小合适的线速率来疏导各连接请求的带宽,得到连接请求传输所需的频谱资源。在所得到的K条候选路径中按照优先级由高到低顺序,在路径中查找满足连接请求所需的频谱资源,若同时满足频谱连续性与频谱一致性双重约束条件,则可成功分配频谱资源;若不能同时满足频谱连续性 与频谱一致性双重约束条件,则进行下一条候选路径的判断。若K条候选路径的频谱资源均不满足条件,则当前连接请求阻塞。 In the spectrum resource allocation module, according to the transmission bandwidth requirement BR of the connection request CR (s, d, BR, C s , C d ), an appropriate line rate is selected to channel the bandwidth of each connection request, and the transmission bandwidth of the connection request is obtained. Spectrum resources needed. In the obtained K candidate paths, according to the order of priority from high to low, search for the spectrum resources required to meet the connection request in the path. If the dual constraints of spectrum continuity and spectrum consistency are satisfied at the same time, the spectrum can be allocated successfully. resources; if the dual constraints of spectrum continuity and spectrum consistency cannot be satisfied at the same time, the next candidate path is judged. If none of the spectrum resources of the K candidate paths satisfies the condition, the current connection request is blocked.
所述网络资源信息更新模块中,当一个连接请求CR(s,d,BR,C s,C d)的工作路径成功建立之后,其源节点与目的节点的计算资源应由连接请求的实际占用进行实时更新;同时该连接请求工作路径上的每段链路的频谱资源也应根据当前连接请求传输所需占用的频谱资源大小进行更新。并实时更新至中央控制器信息列表中。 In the network resource information updating module, when a working path of a connection request CR(s, d, BR, C s , C d ) is successfully established, the computing resources of the source node and the destination node should be occupied by the connection request Update in real time; at the same time, the spectrum resource of each link on the working path of the connection request should also be updated according to the size of the spectrum resource occupied by the transmission of the current connection request. And update it to the central controller information list in real time.
还包括网络资源释放模块和阻塞率计算模块,其中所述网络资源释放模块用于在连接请求成功传输后,对工作路径占用的频谱资源进行资源释放,同时,在连接请求被相应计算节点处理完成后,对处理用户请求的服务器的计算资源进行释放,最后,将连接请求建立的工作路径进行信息清除;所述阻塞率计算模块用于在网络中所有连接请求发送完毕后,计算整体的业务阻塞率,其中未成功建立的连接请求数包含由于源节点或目的节点计算资源不足导致的连接请求阻塞数量与由于传输路径上链路频谱资源不足导致的连接请求阻塞数量。It also includes a network resource release module and a blocking rate calculation module, wherein the network resource release module is used to release the spectrum resources occupied by the working path after the connection request is successfully transmitted, and at the same time, after the connection request is processed by the corresponding computing node Finally, the computing resources of the server processing the user request are released, and finally, the information of the working path established by the connection request is cleared; the blocking rate calculation module is used to calculate the overall business congestion after all the connection requests in the network are sent. The number of unsuccessfully established connection requests includes the number of connection request blocking caused by insufficient computing resources of the source node or destination node and the number of connection request blocking caused by insufficient link spectrum resources on the transmission path.
具体地,所述网络资源释放模块中,在连接请求成功传输后,对工作路径占用的频谱资源进行资源释放。同时,在连接请求被相应计算节点处理完成后,对处理用户请求的服务器的计算资源进行释放。最后,将连接请求建立的工作路径进行信息清除。Specifically, in the network resource release module, after the connection request is successfully transmitted, the spectrum resources occupied by the working path are released. At the same time, after the connection request is processed by the corresponding computing node, the computing resource of the server processing the user request is released. Finally, the information of the working path established by the connection request is cleared.
所述阻塞率计算模块中,在网络中所有连接请求发送完毕后,根据公式(4)计算整体的业务阻塞率,其中未成功建立的连接请求数包含由于源节点或目的节点计算资源不足导致的连接请求阻塞数量与由于传输路径上链路频谱资源不足导致的连接请求阻塞数量。In the blocking rate calculation module, after all connection requests in the network are sent, the overall service blocking rate is calculated according to formula (4), wherein the number of connection requests that have not been successfully established includes those caused by insufficient computing resources of the source node or the destination node The number of connection requests blocked and the number of connection requests blocked due to insufficient link spectrum resources on the transmission path.
还包括中央控制器模块和判决和预警模块,所述中央控制器模块用于完成对网络进行初始化、连接请求边缘计算服务器选择、传输路径计算、频谱资源分配、计算资源更新、资源释放、网络阻塞率计算的状态监控功能;所述判决和预警模块用于执行各个模块之间的协调功能,以及每个模块是否建 立成功的判决与预警功能,完成整个网络拓扑中降低业务阻塞率的目标。It also includes a central controller module and a judgment and early warning module. The central controller module is used to complete network initialization, connection request edge computing server selection, transmission path calculation, spectrum resource allocation, computing resource update, resource release, and network congestion. The status monitoring function of rate calculation; the judgment and early warning module is used to implement the coordination function between each module, and the judgment and early warning function of whether each module is successfully established, so as to complete the goal of reducing the traffic blocking rate in the entire network topology.
所述中央控制器模块中,主要完成对网络进行初始化、连接请求边缘计算服务器选择、传输路径计算、频谱资源分配、计算资源更新、资源释放、网络阻塞率计算的状态监控功能,以实现在所有连接请求传输过程中尽可能减小网络的阻塞率。In the central controller module, it mainly completes the state monitoring functions of network initialization, connection request edge computing server selection, transmission path calculation, spectrum resource allocation, computing resource update, resource release, and network blocking rate calculation, so as to realize the status monitoring functions in all Minimize the blocking rate of the network during connection request transmission.
所述判决和预警模块中,执行各个模块之间的协调功能,以及每个模块是否建立成功的判决与预警功能,完成整个网络拓扑中降低业务阻塞率的目标。In the judgment and early warning module, the coordination function between each module is executed, and the judgment and early warning function of whether each module is successfully established, and the goal of reducing the service blocking rate in the entire network topology is completed.
本领域内的技术人员应明白,本申请的实施例可提供为方法、系统、或计算机程序产品。因此,本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且,本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。Those skilled in the art should understand that the embodiments of the present application may be provided as methods, systems, or computer program products. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。The present application is described with reference to flowcharts and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present application. It should be understood that each procedure and/or block in the flowchart and/or block diagram, and a combination of procedures and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions may be provided to a general purpose computer, special purpose computer, embedded processor, or processor of other programmable data processing equipment to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing equipment produce a An apparatus for realizing the functions specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中,使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions The device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现 的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。These computer program instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby The instructions provide steps for implementing the functions specified in the flow chart or blocks of the flowchart and/or the block or blocks of the block diagrams.
显然,上述实施例仅仅是为清楚地说明所作的举例,并非对实施方式的限定。对于所属领域的普通技术人员来说,在上述说明的基础上还可以做出其它不同形式变化或变动。这里无需也无法对所有的实施方式予以穷举。而由此所引伸出的显而易见的变化或变动仍处于本发明创造的保护范围之中。Apparently, the above-mentioned embodiments are only examples for clear description, and are not intended to limit the implementation. For those of ordinary skill in the art, on the basis of the above description, other changes or changes in various forms can also be made. It is not necessary and impossible to exhaustively list all the implementation manners here. And the obvious changes or changes derived therefrom are still within the scope of protection of the present invention.

Claims (10)

  1. 一种流量疏导的云边计算网络计算资源均衡调度方法,其特征在于,包括如下步骤:A cloud edge computing network computing resource balance scheduling method for flow grooming, characterized in that it includes the following steps:
    步骤S1:获取网络拓扑信息,初始化网络参数,生成一组连接请求集合;Step S1: Obtain network topology information, initialize network parameters, and generate a set of connection request sets;
    步骤S2:对于每一个连接请求,判断源区域和目的区域是否有足够计算资源处理连接请求的计算节点,若没有,则连接请求建立失败;若有,选取相应区域空闲计算资源最多的服务器作为连接请求的源节点和目的节点;Step S2: For each connection request, determine whether the source area and the destination area have computing nodes with sufficient computing resources to process the connection request. If not, the establishment of the connection request fails; if yes, select the server with the most idle computing resources in the corresponding area as the connection The source node and destination node of the request;
    步骤S3:用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径,并按优先级进行排列,对连接请求的传输宽带进行整理,得到传输所需频谱资源;Step S3: Calculate and obtain K candidate paths from the source node to the destination node by using the K shortest path algorithm, and arrange them according to priority, sort out the transmission bandwidth of the connection request, and obtain the spectrum resources required for transmission;
    步骤S4:依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连续性条件,若满足,选择最短路径作为连接请求的传输路径;若不满足,继续判断K条候选路径是否完成,若没完成,则返回步骤S3,若完成,则连接请求建立失败;Step S4: Determine in turn whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of the spectrum flexible optical network transmission. If so, select the shortest path as the connection The requested transmission path; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to step S3, if completed, the establishment of the connection request fails;
    步骤S5:更新中央控制器中链路频谱资源状态信息和节点计算资源信息,计算整个网络中连接请求阻塞率。Step S5: Update link spectrum resource status information and node computing resource information in the central controller, and calculate the connection request blocking rate in the entire network.
  2. 根据权利要求1所述的流量疏导的云边计算网络计算资源均衡调度方法,其特征在于:初始化网络参数包括对网络中的云服务器和边缘服务器的计算资源进行初始化,频谱灵活光网络初始化,以及基于OpenFlow的中央控制器内部存储的状态信息初始化。The cloud-edge computing network computing resource balance scheduling method for traffic grooming according to claim 1, characterized in that: initializing network parameters includes initializing computing resources of cloud servers and edge servers in the network, initializing spectrum flexible optical networks, and The state information stored inside the OpenFlow-based central controller is initialized.
  3. 根据权利要求1所述的流量疏导的云边计算网络计算资源均衡调度方法,其特征在于:选取相应区域空闲计算资源最多的服务器是由中央控制器根据所存储的各边缘服务器计算资源占用情况实时信息分别在源区域和目的区 域选择空闲计算资源最多的服务器。The cloud-edge computing network computing resource balance scheduling method for flow grooming according to claim 1, characterized in that: selecting the server with the most idle computing resources in the corresponding area is performed by the central controller in real time according to the stored computing resource occupancy of each edge server The information selects the server with the most idle computing resources in the source area and the destination area respectively.
  4. 根据权利要求1所述的流量疏导的云边计算网络计算资源均衡调度方法,其特征在于:按优先级进行排列时,按距离由小到大升序排列,路径距离越小,优先级越高。The cloud-edge computing network computing resource balance scheduling method for traffic grooming according to claim 1, wherein when the priority is arranged, the distance is arranged in ascending order from small to large, and the smaller the path distance, the higher the priority.
  5. 根据权利要求1所述的流量疏导的云边计算网络计算资源均衡调度方法,其特征在于:连接请求的频谱资源需求是由其带宽要求与流量疏导使用的线速率大小共同决定每一个连接请求传输所需要的频谱资源。The cloud-edge computing network computing resource balance scheduling method for traffic grooming according to claim 1, characterized in that: the spectrum resource requirement of a connection request is jointly determined by the bandwidth requirement and the line rate used for traffic grooming to transmit each connection request Spectrum resources needed.
  6. 根据权利要求1所述的流量疏导的云边计算网络计算资源均衡调度方法,其特征在于:更新中央控制器中链路频谱资源状态信息和节点计算资源信息前,连接请求成功建立工作路径并分配频谱资源后,对中央控制器中记录各边缘计算服务器的计算资源以及各链路的频谱资源的状态信息进行更新。The cloud-edge computing network computing resource balance scheduling method for traffic grooming according to claim 1, characterized in that: before updating the link spectrum resource status information and node computing resource information in the central controller, the connection request successfully establishes a working path and allocates After obtaining the spectrum resources, the central controller records the computing resources of each edge computing server and the state information of the spectrum resources of each link to be updated.
  7. 根据权利要求1或6所述的流量疏导的云边计算网络计算资源均衡调度方法,其特征在于:更新中央控制器中链路频谱资源状态信息和节点计算资源信息时,当前连接请求传输完毕后,释放所占用的频谱资源,更新中央控制器中链路频谱资源状态信息;同时在边缘计算服务器处理完连接请求后,释放所占用的边缘计算服务器的计算资源,更新中央控制器中存储各边缘计算服务器计算资源状态信息。According to claim 1 or 6, the cloud-edge computing network computing resource balance scheduling method for flow grooming is characterized in that: when updating the link spectrum resource status information and node computing resource information in the central controller, after the current connection request is transmitted , to release the occupied spectrum resources, and update the state information of the link spectrum resources in the central controller; at the same time, after the edge computing server finishes processing the connection request, release the occupied computing resources of the edge computing server, and update the edge computing resources stored in the central controller. Computing server computing resource status information.
  8. 一种流量疏导的云边计算网络计算资源均衡调度系统,其特征在于,包括:A cloud-edge computing network computing resource balance scheduling system for flow grooming, characterized in that it includes:
    网络拓扑初始化模块,用于获取网络拓扑信息,初始化网络参数,生成一组连接请求集合;The network topology initialization module is used to obtain network topology information, initialize network parameters, and generate a set of connection request sets;
    边缘计算服务器选择模块,用于对于每一个连接请求,判断源区域和目的区域是否有足够计算资源处理连接请求的计算节点,若没有,则连接请求建立失败;若有,选取相应区域空闲计算资源最多的服务器作为连接请求的源节点和目的节点;The edge computing server selection module is used for each connection request to determine whether the source area and the destination area have enough computing resources to process the computing nodes of the connection request. If not, the establishment of the connection request fails; if there is, select the idle computing resources in the corresponding area The most servers are used as the source node and destination node of the connection request;
    工作路径计算模块,用于用K条最短路径路算法计算得到从源节点到目的节点之间的K条候选路径,并按优先级进行排列,对连接请求的传输宽带进行整理,得到传输所需频谱资源;The working path calculation module is used to use the K shortest path algorithm to calculate K candidate paths from the source node to the destination node, and arrange them according to priority, sort out the transmission bandwidth of the connection request, and obtain the required transmission bandwidth. Spectrum resources;
    频谱资源分配模块,用于依次判断根据优先级选取的候选传输路径上的空闲频谱资源是否满足连接请求的频谱资源需求以及频谱灵活光网络传输的频谱一致性和频谱连续性条件,若满足,选择最短路径作为连接请求的传输路径;若不满足,继续判断K条候选路径是否完成,若没完成,则返回工作路径计算模块,若完成,则连接请求建立失败;The spectrum resource allocation module is used to sequentially determine whether the idle spectrum resources on the candidate transmission path selected according to the priority meet the spectrum resource requirements of the connection request and the spectrum consistency and spectrum continuity conditions of the spectrum flexible optical network transmission. If satisfied, select The shortest path is used as the transmission path of the connection request; if not satisfied, continue to judge whether the K candidate paths are completed, if not, return to the working path calculation module, if completed, the connection request establishment fails;
    网络资源信息更新模块,用于更新中央控制器中链路频谱资源状态信息和节点计算资源信息,计算整个网络中连接请求阻塞率。The network resource information update module is used to update link spectrum resource status information and node computing resource information in the central controller, and calculate the connection request blocking rate in the entire network.
  9. 根据权利要求8所述的流量疏导的云边计算网络计算资源均衡调度系统,其特征在于:还包括网络资源释放模块和阻塞率计算模块,其中所述网络资源释放模块用于在连接请求成功传输后,对工作路径占用的频谱资源进行资源释放,同时,在连接请求被相应计算节点处理完成后,对处理用户请求的服务器的计算资源进行释放,最后,将连接请求建立的工作路径进行信息清除;所述阻塞率计算模块用于在网络中所有连接请求发送完毕后,计算整体的业务阻塞率,其中未成功建立的连接请求数包含由于源节点或目的节点计算资源不足导致的连接请求阻塞数量与由于传输路径上链路频谱资源不足导致的连接请求阻塞数量。The cloud-edge computing network computing resource balance scheduling system for traffic grooming according to claim 8, characterized in that: it also includes a network resource release module and a blocking rate calculation module, wherein the network resource release module is used for successful transmission of the connection request Finally, release the spectrum resources occupied by the working path. At the same time, after the connection request is processed by the corresponding computing node, release the computing resources of the server processing the user request. Finally, clear the information of the working path established by the connection request ; The blocking rate calculation module is used to calculate the overall service blocking rate after all connection requests in the network are sent, wherein the number of connection requests that are not successfully established includes the number of connection request blocks caused by insufficient computing resources of the source node or the destination node and the number of connection request blocks caused by insufficient link spectrum resources on the transmission path.
  10. 根据权利要求8所述的流量疏导的云边计算网络计算资源均衡调度系统,其特征在于:还包括中央控制器模块和判决和预警模块,所述中央控制器模块用于完成对网络进行初始化、连接请求边缘计算服务器选择、传输路径计算、频谱资源分配、计算资源更新、资源释放、网络阻塞率计算的状态监控功能;所述判决和预警模块用于执行各个模块之间的协调功能,以及每个模块是否建立成功的判决与预警功能,完成整个网络拓扑中降低业务阻塞率的目标。The cloud-edge computing network computing resource balance scheduling system for traffic grooming according to claim 8, characterized in that: it also includes a central controller module and a judgment and early warning module, and the central controller module is used to complete the initialization of the network, The status monitoring functions of connection request edge computing server selection, transmission path calculation, spectrum resource allocation, computing resource update, resource release, and network congestion rate calculation; the judgment and early warning module is used to perform the coordination function between various modules, and Whether a module has successfully established the judgment and early warning function, and completed the goal of reducing the service blocking rate in the entire network topology.
PCT/CN2021/123183 2021-09-17 2021-10-12 Cloud-edge computing network computational resource balancing and scheduling method for traffic grooming, and system WO2023039965A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111094802.XA CN113742046A (en) 2021-09-17 2021-09-17 Flow grooming cloud-side computing network computing resource balanced scheduling method and system
CN202111094802.X 2021-09-17

Publications (1)

Publication Number Publication Date
WO2023039965A1 true WO2023039965A1 (en) 2023-03-23

Family

ID=78739721

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/123183 WO2023039965A1 (en) 2021-09-17 2021-10-12 Cloud-edge computing network computational resource balancing and scheduling method for traffic grooming, and system

Country Status (2)

Country Link
CN (1) CN113742046A (en)
WO (1) WO2023039965A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116208970A (en) * 2023-04-18 2023-06-02 山东科技大学 Air-ground collaboration unloading and content acquisition method based on knowledge-graph perception
CN116627618A (en) * 2023-07-21 2023-08-22 北京万界数据科技有限责任公司 Computing resource pre-scheduling method and system
CN117172721A (en) * 2023-10-31 2023-12-05 深圳薪汇科技有限公司 Data flow supervision early warning method and system for financing service

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114302267B (en) * 2021-12-14 2022-10-18 苏州大学 Special protection spectrum allocation method and system for space division multiplexing optical network of data center
CN114363984B (en) * 2021-12-16 2022-11-25 苏州大学 Cloud edge collaborative optical carrier network spectrum resource allocation method and system
CN115499882A (en) * 2022-11-16 2022-12-20 之江实验室 Edge node spectrum and computing resource joint allocation method, device and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140098685A1 (en) * 2004-08-02 2014-04-10 Steve J. Shattil Content Delivery in Wireless Wide Area Networks
CN107426110A (en) * 2017-09-22 2017-12-01 苏州大学 Adaptive load balancing energy consumption optimization method and system in the flexible optical-fiber network of frequency spectrum
CN111901424A (en) * 2020-07-28 2020-11-06 苏州大学 Cloud edge cooperative network resource smooth migration and reconstruction method and system
CN113364850A (en) * 2021-06-01 2021-09-07 苏州路之遥科技股份有限公司 Software-defined cloud-edge collaborative network energy consumption optimization method and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140098685A1 (en) * 2004-08-02 2014-04-10 Steve J. Shattil Content Delivery in Wireless Wide Area Networks
CN107426110A (en) * 2017-09-22 2017-12-01 苏州大学 Adaptive load balancing energy consumption optimization method and system in the flexible optical-fiber network of frequency spectrum
CN111901424A (en) * 2020-07-28 2020-11-06 苏州大学 Cloud edge cooperative network resource smooth migration and reconstruction method and system
CN113364850A (en) * 2021-06-01 2021-09-07 苏州路之遥科技股份有限公司 Software-defined cloud-edge collaborative network energy consumption optimization method and system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
MAN JUNFENG; ZHAO LONGGAN; PENG CHENG; LI QIANQIAN: "Task Scheduling Method for Large-scale Factory Access in Cloud and Edge Collaborative Computing Architecture", COMPUTER INTEGRATED MANUFACTURING SYSTEMS, BEIJING ADVANCED MANUFACTURING TECHNOLOGY CONSULTATION CENTER, CN, vol. 27, no. 8, 1 August 2020 (2020-08-01), CN , pages 2282 - 2294, XP009534058, ISSN: 1006-5911, DOI: 10.13196/j.cims.2021.08.011 *
ZHU LEILEI; FENG JIAHUI; LIU DAN; YANG HONGWEI; BAI ZHENGQI; SONG XIAOLONG; LI LI: "Balanced Cloud Edge Resource Allocation Based on Conflict Conditions", IEEE ACCESS, IEEE, USA, vol. 8, 20 October 2020 (2020-10-20), USA , pages 193449 - 193461, XP011818553, DOI: 10.1109/ACCESS.2020.3032428 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116208970A (en) * 2023-04-18 2023-06-02 山东科技大学 Air-ground collaboration unloading and content acquisition method based on knowledge-graph perception
CN116627618A (en) * 2023-07-21 2023-08-22 北京万界数据科技有限责任公司 Computing resource pre-scheduling method and system
CN116627618B (en) * 2023-07-21 2023-09-19 北京万界数据科技有限责任公司 Computing resource pre-scheduling method and system
CN117172721A (en) * 2023-10-31 2023-12-05 深圳薪汇科技有限公司 Data flow supervision early warning method and system for financing service
CN117172721B (en) * 2023-10-31 2024-02-20 深圳薪汇科技有限公司 Data flow supervision early warning method and system for financing service

Also Published As

Publication number Publication date
CN113742046A (en) 2021-12-03

Similar Documents

Publication Publication Date Title
WO2023039965A1 (en) Cloud-edge computing network computational resource balancing and scheduling method for traffic grooming, and system
WO2022021176A1 (en) Cloud-edge collaborative network resource smooth migration and restructuring method and system
US11516146B2 (en) Method and system to allocate bandwidth based on task deadline in cloud computing networks
CN108260169B (en) QoS guarantee-based dynamic service function chain deployment method
CN108566659B (en) 5G network slice online mapping method based on reliability
CN113364850B (en) Software-defined cloud-edge collaborative network energy consumption optimization method and system
WO2023024219A1 (en) Joint optimization method and system for delay and spectrum occupancy in cloud-edge collaborative network
WO2019072162A1 (en) Virtual network mapping method, device and storage medium
Li et al. Capacity-aware edge caching in fog computing networks
CN105391651B (en) Virtual optical network multi-layer resource convergence method and system
CN107196806B (en) Topological proximity matching virtual network mapping method based on sub-graph radiation
CN114363984B (en) Cloud edge collaborative optical carrier network spectrum resource allocation method and system
Yan et al. A survey of low-latency transmission strategies in software defined networking
CN105338435A (en) Virtual optical network cooperation mapping method and apparatus
CN116389365B (en) Switch data processing method and system
CN107113188A (en) Access network based on cloud
Mharsi et al. Scalable and cost-efficient algorithms for baseband unit (BBU) function split placement
CN111092779B (en) Network resource configuration method and device, computer equipment and readable storage medium
Gatzianas et al. Energy-efficient joint computational and network resource planning in Beyond 5G networks
Cucinotta et al. Data centre optimisation enhanced by software defined networking
CN113630792B (en) Traffic load balancing breadth-first search optimization method, system and equipment
CN114116211B (en) Service flow distribution optimization method and system for mobile edge calculation
Guo et al. Distributed Caching and Lightpath Provisioning in Multi-access Edge Computing based Elastic Optical Networks
Guan et al. Multidimensional Resource Fragmentation-Aware Virtual Network Embedding for IoT Applications in MEC Networks
Li et al. Deadline Constrained Computation Offloading Strategy in Cloud-Edge Collaborative Environments

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21957234

Country of ref document: EP

Kind code of ref document: A1