Network bandwidth resource collaboration method, device, equipment and medium

Abstract

The embodiment of the invention discloses a network bandwidth resource collaboration method and device, equipment and a medium, and the method comprises the steps: determining an income attribute corresponding to each game node of each game group after game simulation based on the current state information of all game nodes contained in each game group in a bandwidth resource game model; for each neighbor node of the current game node, determining a preference attribute corresponding to the current neighbor node based on the income attribute of the current neighbor node and the income attribute of each neighbor node; determining a target neighbor node based on the preference attribute corresponding to each neighbor node, and determining target state information corresponding to the current game node based on the target neighbor node; based on the target state information of all the game nodes in the bandwidth resource game model, the device number corresponding to the network resource sharing device and the device number corresponding to the network resource occupying device are determined, the bandwidth resource allocation efficiency is optimized, the occupying behavior is reduced, and the fairness and the utilization rate of the whole network resource are improved.

Description

Technical Field

[0001] The present invention relates to the field of information technology, and in particular to a network bandwidth resource collaboration method, apparatus, device and medium. Background Art

[0002] A reasonable allocation strategy can optimize bandwidth usage, avoid congestion, and meet the differentiated quality of service requirements of different applications. Without a sound allocation mechanism, critical services may be delayed and bandwidth may be wasted. Low-priority applications may occupy excessive resources, leading to unfair competition among users, ultimately degrading overall network performance and user experience. Furthermore, a clear allocation method supports network planning, billing policy development, and troubleshooting, forming the foundation of network management. Therefore, before allocating network bandwidth resources, the allocation method must be determined to ensure efficient, fair, and reliable utilization of network resources.

[0003] Currently, before allocating network bandwidth resources, methods such as traffic measurement and quality of service demand analysis are typically used to determine allocation strategies. However, these methods have significant issues: traffic measurement can lead to data lags or excessive measurement overhead due to dynamic network environments; quality of service demand analysis methods struggle to adapt to real-time demand changes, and complex rules increase management burdens. Consequently, traditional methods suffer from uneven bandwidth resource utilization and poor fairness. Summary of the Invention

[0004] The present invention provides a network bandwidth resource collaboration method, apparatus, device and medium to optimize bandwidth resource allocation efficiency, reduce occupancy behavior, and improve the fairness and utilization of overall network resources.

[0005] In a first aspect, an embodiment of the present invention provides a method for coordinating network bandwidth resources, the method comprising:

[0006] Based on the current state information of all game nodes included in each game group in the bandwidth resource game model, determining the profit attribute corresponding to each game node of each game group after the game simulation; wherein the bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state, the cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device;

[0007] For each neighbor node of the current game node, based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node, determining the preference attribute corresponding to the current neighbor node;

[0008] Determine a target neighbor node based on the preference attributes corresponding to each of the neighbor nodes, and determine target state information corresponding to the current game node based on the target neighbor node;

[0009] Based on the target state information of all game nodes in the bandwidth resource game model, the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices are determined.

[0010] In a second aspect, an embodiment of the present invention further provides a network bandwidth resource coordination device, the device comprising:

[0011] a profit attribute determination module configured to determine, based on current state information of all game nodes included in each game group in the bandwidth resource game model, a profit attribute corresponding to each game node in each game group after game simulation; wherein the bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state, wherein the cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device;

[0012] A preference attribute determination module is used to determine the preference attribute corresponding to each neighbor node of the current game node based on the profit attribute of the current neighbor node and the profit attributes of each neighbor node;

[0013] A state information updating module is used to determine a target neighbor node based on the preference attributes corresponding to each of the neighbor nodes, so as to determine the target state information corresponding to the current game node based on the target neighbor node;

[0014] The bandwidth resource coordination module is used to determine the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices based on the target state information of all game nodes in the bandwidth resource game model.

[0015] In a third aspect, an embodiment of the present invention further provides an electronic device, the electronic device comprising:

[0016] one or more processors;

[0017] a storage device for storing one or more programs,

[0018] When one or more programs are executed by one or more processors, the one or more processors implement a network bandwidth resource coordination method as described in any one of the embodiments of the present invention.

[0019] In a fourth aspect, an embodiment of the present invention further provides a storage medium comprising computer-executable instructions, which, when executed by a computer processor, are used to execute a network bandwidth resource coordination method as described in any one of the embodiments of the present invention.

[0020] The technical solution of an embodiment of the present invention is to construct a bandwidth resource game model corresponding to multiple network resource devices before allocating network bandwidth resources. In a specific application process, based on the current state information of all game nodes included in each game group in the bandwidth resource game model, the corresponding benefit attribute of each game node in each game group after the game simulation is determined. The bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state. The cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device. Therefore, for each neighbor node of the current game node, based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node, the preference attribute corresponding to the current neighbor node is determined. Furthermore, based on the preference attributes corresponding to each neighbor node, a target neighbor node is determined, and target state information corresponding to the current game node is determined based on the target neighbor node. Finally, based on the target state information of all game nodes in the bandwidth resource game model, the number of devices corresponding to the network resource sharing device and the number of devices corresponding to the network resource occupying device are determined. The technical solution of this embodiment simulates the dynamic allocation process of network bandwidth resources by constructing a bandwidth resource game model, and utilizes the state evolution mechanism of the game nodes to achieve autonomous coordination of device behavior. In particular, through the benefit comparison and preference-driven policy update rules between neighboring nodes, network devices are guided to spontaneously move towards a stable equilibrium of resource collaboration. Ultimately, by quantifying the number of sharing and occupying devices, a measurable decision-making basis is provided for resource allocation strategies, thereby optimizing bandwidth resource allocation efficiency, reducing occupation behavior, and improving the fairness and utilization of overall network resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] To more clearly illustrate the technical solutions of the exemplary embodiments of the present invention, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings introduced here only illustrate some of the embodiments to be described by the present invention, and are not exhaustive. A person skilled in the art can derive other drawings based on these drawings without inventive effort.

[0022] Figure 1 A schematic diagram of a flow chart of a network bandwidth resource coordination method provided by an embodiment of the present invention;

[0023] Figure 2 A flowchart of another network bandwidth resource coordination method provided by an embodiment of the present invention;

[0024] Figure 3 A schematic diagram of the system architecture of the network bandwidth resource coordination method provided in this embodiment;

[0025] Figure 4 A schematic diagram of a specific execution flow of the network bandwidth resource coordination method provided in this embodiment;

[0026] Figure 5 A schematic diagram of the structure of a network bandwidth resource coordination device provided by an embodiment of the present invention;

[0027] Figure 6 The present invention provides a schematic structural diagram of an electronic device. DETAILED DESCRIPTION

[0028] The present invention will be further described in detail below with reference to the accompanying drawings and examples. It will be understood that the specific embodiments described herein are intended only to illustrate the present invention and are not intended to limit the present invention. It should also be noted that, for ease of description, the accompanying drawings only illustrate portions relevant to the present invention, not all structures.

[0029] It should be noted that similar reference numerals and letters represent similar items in the following figures. Therefore, once an item is defined in one figure, it does not need to be further defined or explained in subsequent figures. Furthermore, in the description of the present invention, the terms "first," "second," etc. are used only to distinguish descriptions and should not be understood to indicate or imply relative importance. The acquisition, storage, use, and processing of data in the technical solution of this application comply with the relevant provisions of national laws and regulations.

[0030] It should be noted that in the embodiments of the present application, certain software, components, models and other existing solutions in the industry may be mentioned. They should be regarded as exemplary. Their purpose is only to illustrate the feasibility of implementing the technical solution of the present application, but it does not mean that the applicant has or will necessarily use the solution.

[0031] The acquisition, storage, use, and processing of data in this application's technical solution comply with relevant national laws and regulations.

[0032] Below, the present application is further described in conjunction with the accompanying drawings and specific implementation methods. It should be noted that, under the premise of no conflict, the various embodiments or technical features described below can be arbitrarily combined to form new embodiments.

[0033] Example 1

[0034] Figure 1This is a flow chart of a network bandwidth resource collaboration method provided by an embodiment of the present invention. This embodiment is applicable to situations where it is necessary to determine the bandwidth resource allocation method before allocating network bandwidth resources to ensure efficient, fair and reliable utilization of network resources. The method can be executed by a network bandwidth resource collaboration device, which can be implemented in the form of software and / or hardware. The hardware can be an electronic device, such as a mobile terminal, PC or server.

[0035] like Figure 1 As shown, the network bandwidth resource coordination method includes:

[0036] S110 , based on the current state information of all game nodes included in each game group in the bandwidth resource game model, determine the corresponding benefit attribute of each game node of each game group after the game simulation.

[0037] In this embodiment, the bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state. The cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device.

[0038] The bandwidth resource game model is used to study the cooperative and competitive behavior of individuals within a group of network resource devices in contributing to public resources. Game nodes represent network resource devices, such as routers, servers, and base stations, and their states are categorized as either cooperators or defectors. The so-called cooperator state refers to actively sharing resources, thereby increasing the total benefits of public goods. The so-called defector state refers to selfishly occupying resources without contributing, which may result in short-term gains but harm overall efficiency. Current state information specifically refers to the behavioral strategy of a game node at a specific moment. A game group refers to an interacting group of multiple game nodes. Network resource-sharing devices specifically refer to those that choose a cooperative strategy. Network resource-occupying devices refer to those that choose a defector strategy.

[0039] Each group consists of several game nodes, each in either a cooperator or defector state. Groups can be defined by physical topology, such as devices within a local area network, or logically by service type. It's important to note that a single game node can belong to multiple different groups.

[0040] The benefit attribute refers to the quantified rewards a node receives after participating in the resource game. The essence of the benefit attribute is numerical feedback, representing the actual benefits a node receives within the current gaming group due to its own behavior and the group's overall performance.

[0041] Specifically, in the bandwidth resource game model, each game group consists of multiple game nodes representing different network resource devices. The current state of each node is labeled as either a "cooperator state" or a "defector state." The "cooperator state" can be understood as a state in which the node actively shares resources, while the "defector state" refers to a state in which the node occupies resources without contributing. During game simulation, the current state information of all nodes in the game group is integrated. Pre-set payoff calculation rules, such as cooperators bearing costs but sharing group benefits, and defectors receiving benefits for free but potentially facing penalties, ultimately assign each node a post-game payoff attribute. For example, if a group has more cooperators, the total amount of resources in the group increases, and cooperators may receive higher net benefits. Defectors, on the other hand, may benefit in the short term, but their long-term benefits may decline if group cooperation collapses. Payoff attributes reflect the direct impact of a node's strategic choices in the game on its own and the group's resource allocation.

[0042] Optionally, based on the current state information of all game nodes included in each game group in the bandwidth resource game model, a specific implementation method for determining the corresponding benefit attribute of each game node in each game group after the game simulation may include:

[0043] For each game group in the bandwidth resource game model, determine the first target game node whose current state information is a cooperator state and the second target game node whose current state information is a betrayer state in the current game group; based on the number of first target game nodes, the investment value corresponding to each first target game node and the preset coordination parameters, determine the first benefit attribute of each first target game node in the current game group; based on the benefit attribute of each first target game node in the current game group, determine the first benefit attribute of the second target game node in the current game group; for each game node in the bandwidth resource game model, determine the benefit attribute corresponding to the current game node based on the first benefit attribute of the current game node in each game group.

[0044] The current game group refers to the game group currently being processed. The first target game node refers to the node in the current game group that is in the cooperator state, i.e., a device that actively contributes resources, such as investment or bandwidth sharing. The second target game node refers to the node in the defector state, i.e., a device that does not contribute resources and only consumes the group's public benefits. The investment value refers to the amount of resources or costs that a game node actively contributes to the current game group when in the cooperator state. It is a key parameter that quantifies the degree of cooperator participation in the construction or sharing of public resources and directly affects the generation and distribution of the group's total benefits. The preset coordination parameter is used to quantify the amplifying effect of the collective investment of the cooperator group on the benefits of public resources. It determines how the total contribution of the cooperators in the group is "amplified" into greater public benefits, thereby affecting the final distribution of benefits among all members. The first benefit attribute refers to the temporary benefit value obtained by the game node through the current round of game in a specific game group. This benefit is a local, preliminary calculation based on the results of interactions within a single group and does not yet incorporate the node's overall benefits across all groups to which it belongs.

[0045] More specifically, the current game group consists of several game nodes, and the node states are divided into cooperator state and defector state. First, within the current game group, all game nodes corresponding to the cooperator state are marked as the first target game node, and the game nodes corresponding to the defector state are marked as the second target game node. Furthermore, the cooperator benefit calculation can be performed based on the number of cooperators in the current game group, the investment value of each cooperator, and the preset coordination parameters. The first benefit attribute of the first target game node can be calculated, which can be expressed as:

[0046]

[0047] Where, represents the first benefit attribute of any first target game node in the current game group, r represents the preset coordination parameter, G represents the number of first target game nodes in the current game group, S x Represents the investment value of each first target game node.

[0048] In the current game group, based on the calculated benefit attribute of each first target game node in the current game group, the first benefit attribute corresponding to any second target game node can be expressed as

[0049] Finally, global benefits are integrated: Each game node may belong to multiple groups, and the final benefit attribute of each game node is the cumulative or weighted average of the primary benefit attributes of all its affiliated game groups. This can be understood as the primary benefit attribute representing the temporary benefit of a game node within a single group, while the final benefit attribute is the comprehensive result across all groups, reflecting the global impact of the node's strategy.

[0050] S120 . For each neighbor node of the current game node, determine a preference attribute corresponding to the current neighbor node based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node.

[0051] The current game node refers to any game node in the bandwidth resource game model. Neighbor nodes refer to other nodes directly connected to the current game node in the network topology, typically defined by physical connection, communication range, or logical relationship. The current neighbor node refers to the neighbor node currently being processed. The preference attribute is a quantitative value indicating the current game node's tendency to select a strategy for a neighbor node, reflecting the degree to which the current game node is inclined to imitate or reference the behavior of that neighbor node when updating its strategy. The core logic is to dynamically adjust the preference weight for neighbor nodes by comparing their payoff performance, thereby guiding the evolution of its own strategy.

[0052] In this embodiment, the processing process for each game node in the bandwidth resource game model is the same. Here, any one of the game nodes is used as the current game node, and the current game node is used as an example for illustration. The current game node dynamically evaluates its strategic preference for each neighbor by analyzing the revenue performance of all its neighboring nodes. Specifically, the current revenue attributes of each neighbor node are first collected, that is, the specific return value they obtained in this round of the game. Then, by comparing these revenue data, if a neighbor's revenue is significantly higher than that of other neighbors, a quantified preference attribute value is assigned to each neighbor node using a predefined preference calculation rule. This preference attribute essentially reflects which high-return neighbor's behavior the current game node is more inclined to imitate when updating its strategy.

[0053] S130. Determine a target neighbor node based on the preference attributes corresponding to each neighbor node, and determine target state information corresponding to the current game node based on the target neighbor node.

[0054] The target neighbor node refers to a specific neighbor node selected by the current game node based on its preference attributes, which has a direct impact on its strategy update. Its core function is to provide a reference for the current node to mimic its strategy or adjust its state. The target state information refers to the state the current game node will adopt in the next round of the game, namely, the choice of "cooperation" or "defection," determined by the behavior of the target neighbor node during the strategy update phase. This state is the result of the current game node's dynamic adjustment based on the neighbor's payoff performance and preference attributes, and directly affects resource allocation and payoffs in the game.

[0055] Specifically, the neighbor node with the highest preference attribute value can be identified as the target neighbor node, that is, the node with the best profit performance. Alternatively, probabilistic sampling, such as a roulette wheel selection decision-making method, can be used to determine the target neighbor node, ensuring that highly preferred neighbors are more likely to be selected. Ultimately, the current game node directly uses the current state information of the target neighbor node as its own target state information, completing the strategy update. This mechanism enables nodes to dynamically adjust their strategies, tending to imitate the behavior of neighbors with higher profits, thereby promoting the evolution of group strategies.

[0056] For example, if a cooperative neighbor stands out due to its high group payoff, its preference attribute value will increase accordingly, making the current game node more likely to learn from its cooperative strategy in the game; conversely, the preference attribute of a low-payoff neighbor will be reduced. Ultimately, these preference attributes will serve as the core basis for the current game node to adjust its own strategy (maintain cooperation or turn to defection), driving the dynamic evolution of network group behavior.

[0057] S140: Determine the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices based on the target state information of all game nodes in the bandwidth resource game model.

[0058] In this embodiment, based on the updated target state information of all game nodes—that is, each game node's final decision to become a "cooperator" or "defector" in the game—the number of two types of devices can be counted separately. Specifically, network resource-sharing devices correspond to game nodes in the "cooperator state" and actively contribute resources; network resource-consuming devices correspond to game nodes in the "defector state" and only consume resources without contributing. In a specific application, the target state information of all game nodes can be traversed, and the number of cooperators can be accumulated to obtain the number of network resource-sharing devices, while the number of defectors can be accumulated to obtain the number of network resource-consuming devices. These two values together reflect the resource allocation pattern and cooperation level of the cluster network in the next stage, and are important indicators for evaluating system efficiency and formulating resource management strategies.

[0059] The technical solution of an embodiment of the present invention is to construct a bandwidth resource game model corresponding to multiple network resource devices before allocating network bandwidth resources. In a specific application process, based on the current state information of all game nodes included in each game group in the bandwidth resource game model, the corresponding benefit attribute of each game node in each game group after the game simulation is determined. The bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state. The cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device. Therefore, for each neighbor node of the current game node, based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node, the preference attribute corresponding to the current neighbor node is determined. Furthermore, based on the preference attributes corresponding to each neighbor node, a target neighbor node is determined, and target state information corresponding to the current game node is determined based on the target neighbor node. Finally, based on the target state information of all game nodes in the bandwidth resource game model, the number of devices corresponding to the network resource sharing device and the number of devices corresponding to the network resource occupying device are determined. The technical solution of this embodiment simulates the dynamic allocation process of network bandwidth resources by constructing a bandwidth resource game model, and utilizes the state evolution mechanism of the game nodes to achieve autonomous coordination of device behavior. In particular, through the benefit comparison and preference-driven policy update rules between neighboring nodes, network devices are guided to spontaneously move towards a stable equilibrium of resource collaboration. Ultimately, by quantifying the number of sharing and occupying devices, a measurable decision-making basis is provided for resource allocation strategies, thereby optimizing bandwidth resource allocation efficiency, reducing occupation behavior, and improving the fairness and utilization of overall network resources.

[0060] Example 2

[0061] Figure 2 This is a schematic diagram of a network bandwidth resource coordination method provided by an embodiment of the present invention. Based on the aforementioned embodiment, S120 and S140 are further refined. For specific implementations, please refer to the technical solution of this embodiment. Technical terms that are identical or corresponding to those in the aforementioned embodiment are not repeated here.

[0062] like Figure 2 As shown, the method specifically includes the following steps:

[0063] S210 : Based on the current state information of all game nodes included in each game group in the bandwidth resource game model, determine the profit attribute corresponding to each game node of each game group after the game simulation.

[0064] The bandwidth resource game model includes multiple game nodes, each of which corresponds to a network resource device. The current status information includes a cooperator state or a defector state. The cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device.

[0065] S220: For each game node, determine the game group with the current game node as the center node as the target game group.

[0066] Among them, the target game group refers to a small-scale game unit formed with the current node as the center and including all its neighboring nodes.

[0067] In this embodiment, for each game node, it can be used as the central node, and the group of neighbors with which it directly interacts can be defined as the target game group of the node, that is, the local game scope of the game node.

[0068] S230. For each neighbor node relative to the current game node in the target game group, determine the preference attribute corresponding to the current neighbor node based on the preset group preference parameter, the benefit attribute of the current neighbor node, and the benefit attribute of each neighbor node.

[0069] The current neighbor node can be any neighbor node in the target game group relative to the current game node. The preset group preference parameter refers to a predefined quantitative indicator that reflects the group's common tendency or decision-making preference. The preset group preference parameter is a value in the range of [-1, 1]. When the preset group preference parameter is zero, the preference selection is random, that is, all neighbors of the game node x are randomly selected; when the preset group preference parameter is greater than zero, the game node tends to select neighbors with high benefits when selecting neighbors. In other words, in the strategy transfer during the game process, more successful neighbors are more favored; when the preset group preference parameter is less than zero, low-benefit neighbors are more likely to be selected.

[0070] In this embodiment, the processing process for each neighbor node in the target gaming group is identical. Here, any one of the neighbor nodes is used as the current neighbor node, and the current neighbor node is used as an example for illustrative purposes. Optionally, a specific implementation method for determining the preference attribute corresponding to the current neighbor node based on a preset group preference parameter, the benefit attribute of the neighbor node, and the benefit attribute of each neighbor node may include: determining the preference attribute corresponding to the current neighbor node based on a preset preference calculation function, a preset group preference parameter, the benefit attribute of the current neighbor node, and the benefit attribute of each neighbor node.

[0071] The preset preference calculation function is a predefined mathematical function or algorithmic rule that integrates multiple group preference parameters, node benefit attributes, and other factors to ultimately calculate the preference attributes of the current neighbor node. Its core function is to transform abstract preference logic into a concrete and computable form. The preset preference calculation function can include:

[0072]

[0073] Where Πy represents the preference attribute corresponding to the current neighbor node; w represents the preset group preference parameter; N x Represents each neighbor node relative to the current game node; P y Represents the benefit attribute of the current neighbor node; P i Represents the benefit attribute of the i-th neighbor node.

[0074] In this embodiment, for any current neighbor node of the current game node, the preset group preference parameters, the benefit attributes of the current neighbor node, and the benefit attributes of each neighbor node can be brought into the above-mentioned preset preference calculation function for calculation to obtain the corresponding preference attributes.

[0075] S240: Determine the neighbor node corresponding to the maximum preference attribute value as the target neighbor node.

[0076] In this embodiment, based on the calculated preference attribute corresponding to each neighbor node, the neighbor node with the largest preference attribute value may be determined as the target neighbor node.

[0077] S250: Determine a state adjustment probability value based on the benefit attribute of the target neighbor node, the benefit attribute of the current game node, and the adjustment probability function.

[0078] The state adjustment probability value represents the probability that the current game node will adopt the state of its target neighbor node during the game strategy update phase. The adjustment probability function calculates the specific probability value for the current game node's decision to adopt the state of its target neighbor node. This function takes the target neighbor node's payoff, the current node's payoff, and other possible parameters as input and outputs a probability value between 0 and 1 to guide the dynamic evolution of the node state.

[0079] In this embodiment, adjusting the probability function may include:

[0080]

[0081] Where, prob(s x ←s y ) represents the state adjustment probability value, P x Indicates the profit attribute of the current game node, P yrepresents the benefit attribute of the target neighbor node, and K represents the preset noise factor.

[0082] In this embodiment, the benefit attribute of the target neighbor node and the benefit attribute of the current game node can be brought into the above-mentioned adjustment probability function for calculation to obtain the state adjustment probability value.

[0083] S260: Adjust the state of the current game node to the state of the target neighbor node based on the state adjustment probability value, and obtain target state information corresponding to the current game node.

[0084] In this embodiment, the calculated state can be used to adjust the probability value. A random or deterministic rule is used to determine whether to change the state of the current game node to the state of the target neighbor node. This generates the new state information for the current node in the next round of the game, namely the target state information. This step is the core mechanism of strategy diffusion in the evolution of the game network and directly affects the final distribution of group behavior.

[0085] S270: Determine the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices based on the target state information of all game nodes in the bandwidth resource game model.

[0086] Based on the above embodiment, when the number of devices corresponding to network resource sharing devices and network resource occupying devices is calculated in the current round, this result can be directly used as the resource allocation pattern of the cluster network in the next stage. In addition, in order to further improve the rationality of the resource allocation pattern, the above steps S210-S270 can be executed repeatedly until the number of cycles reaches a preset iteration threshold, or when the proportion of partners in the bandwidth resource game model reaches a stable threshold, the number of devices corresponding to network resource sharing devices and network resource occupying devices can be obtained, and then used as the basis for the resource allocation pattern of the cluster network in the next stage. The specific implementation method may include:

[0087] For each game node in the bandwidth resource game model, the benefit attribute of each game node is set to zero, and the target state information of each game node is updated to the current state information; the steps of determining the benefit attribute corresponding to each game node, determining the preference attribute corresponding to the current neighbor node, and determining the target state information corresponding to the current game node are repeatedly performed until the model stability attribute determined according to the target state information of all game nodes meets the preset conditions, and the device numbers corresponding to the network resource sharing devices and the network resource occupying devices are obtained.

[0088] Among them, the model stability property refers to the quantitative characteristics presented by a certain stable state reached by the system after the iterative game process, which is used to determine whether the game evolution converges.

[0089] In this embodiment, a payoff operation is first performed on all game nodes: the historical payoff attributes of each game node are reset to zero. The target state information determined in the previous round is then reset to the current state information, i.e., the initial strategy. The game then enters an iterative process: in each round, the system sequentially calculates each node's payoff attribute based on group interactions, evaluates its preference attributes based on the payoff performance of its neighbors, and updates each node's target state information. This process repeats until the model stabilizes, such as when the change in the proportion of cooperators is less than 5% over multiple consecutive rounds, or when the strategy combination remains unchanged, or when the number of iterations reaches a preset threshold, indicating that the network strategy distribution has reached equilibrium. Finally, the number of game nodes that choose to cooperate when reaching a stable state is counted, corresponding to network resource sharing devices, and the number of nodes that choose to defect, corresponding to network resource occupiers, are counted. These two values represent the steady-state resource allocation results after the game evolves, reflecting the system's level of spontaneous cooperation.

[0090] Next, a specific example is used to illustrate the network bandwidth resource coordination method provided by this embodiment. For example, Figure 3 This is a schematic diagram of the system architecture of the network bandwidth resource collaboration method provided in this embodiment. The network bandwidth resource collaboration system includes an initialization unit, an execution unit, a clearing unit and a stabilization unit; wherein the initialization unit includes a model initializer, a position initializer and a state initializer; the execution unit includes a node selector, a preference calculator, a resource calculator and a policy updater; the clearing unit mainly includes a resource resetter; and the stabilization unit mainly includes a shared resource calculator.

[0091] Based on the above system architecture, the specific execution flow diagram of the network bandwidth resource coordination method provided in this embodiment is shown in FIG. Figure 4 .like Figure 4As shown, the initialization unit performs initialization operations, using the model initializer to initialize the bandwidth resource game model and node size. The position initializer randomly assigns network resource devices to corresponding game node positions in the bandwidth resource game model, ensuring that each node in the model has a corresponding network resource device. The state initializer assigns an initial state to each game node. Furthermore, during each round of execution, the execution unit selects nodes to participate in the game, adds a preference selection mechanism to the nodes, calculates payoffs, and updates policies based on a certain probability. The node selector randomly selects a game node from the bandwidth resource game model as the focal node, which then participates in the game with neighboring nodes to obtain payoffs. The resource calculator calculates the node's payoff attributes. The preference calculator calculates the preference values of participating nodes based on the payoff attributes of the game nodes and selects the target for policy update based on the preference values. The policy updater updates the focal node's policy to either a cooperative or defecting state. Subsequently, the resource resetter in the zeroing unit resets the node's payoff to zero for each round. Finally, the shared resource calculator in the stabilization unit can count and record the number of partners in the bandwidth resource game model after each round of game simulation, and calculate the system cooperation ratio. The calculation method of the system cooperation ratio is as follows:

[0092] Rc=Nc / (Nc+Nd)

[0093] Where Rc represents the system cooperation ratio, Nc represents the number of game nodes that choose the cooperation strategy, and Nd represents the number of game nodes that choose the defection strategy.

[0094] If the relative error of the system cooperation ratio is within the preset error range after multiple consecutive cycles, the number of devices corresponding to the network resource sharing devices and the network resource occupying devices can be determined based on the target state information of all game nodes in the final bandwidth resource game model.

[0095] The technical solution of the embodiment of the present invention is as follows: when determining the preference attributes corresponding to the current neighbor node, for each game node, the game group with the current game node as the center node is determined as the target game group; for each neighbor node relative to the current game node in the target game group, the preference attributes corresponding to the current neighbor node are determined based on preset group preference parameters, the benefit attributes of the neighbor node and the benefit attributes of each neighbor node. By introducing group preference parameters, the traditional benefit-driven strategy is corrected to make the node decision closer to the collaborative characteristics of the equipment in the real network environment, thereby achieving more reasonable neighbor selection in the network resource allocation game, avoiding the imbalance of resource competition caused by pure profit-seeking, and promoting the spread of cooperative behavior through preference guidance, and ultimately improving the stability of network resource allocation and the overall efficiency of the system. When determining the target state information corresponding to the current game node based on the target neighbor node, the state adjustment probability value is determined based on the benefit attributes of the target neighbor node, the benefit attributes of the current game node, and the adjustment probability function; based on the state adjustment probability value, the state of the current game node is adjusted to the state of the target neighbor node to obtain the target state information corresponding to the current game node. Through probabilistic state adjustment, the system rigidity caused by mechanical imitation is avoided, and the natural selection pressure of high-yield strategies is retained, so that network devices can achieve progressive strategy optimization in resource games. Ultimately, while maintaining system stability, the nodes are prompted to intelligently evolve to more efficient resource sharing or occupation strategies, thereby achieving a dynamic balance of network resource allocation and overall performance improvement.

[0096] Example 3

[0097] Figure 5 This is a schematic diagram of the structure of a network bandwidth resource collaboration device provided by an embodiment of the present invention. The device includes: a benefit attribute determination module 310 , a preference attribute determination module 320 , a state information update module 330 and a bandwidth resource collaboration module 340 .

[0098] The profit attribute determination module 310 is configured to determine the profit attribute corresponding to each game node of each game group after the game simulation based on the current state information of all game nodes included in each game group in the bandwidth resource game model. The bandwidth resource game model includes multiple game nodes, each of which corresponds to a network resource device. The current state information includes a cooperator state or a defector state. The cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device.

[0099] The preference attribute determination module 320 is used to determine the preference attribute corresponding to each neighbor node of the current game node based on the profit attribute of the current neighbor node and the profit attributes of each neighbor node;

[0100] The state information updating module 330 is used to determine a target neighbor node based on the preference attributes corresponding to each neighbor node, so as to determine the target state information corresponding to the current game node based on the target neighbor node;

[0101] The bandwidth resource coordination module 340 is configured to determine the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices based on the target state information of all the game nodes in the bandwidth resource game model.

[0102] The technical solution of an embodiment of the present invention is to construct a bandwidth resource game model corresponding to multiple network resource devices before allocating network bandwidth resources. In a specific application process, based on the current state information of all game nodes included in each game group in the bandwidth resource game model, the corresponding benefit attribute of each game node in each game group after the game simulation is determined. The bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state. The cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device. Therefore, for each neighbor node of the current game node, based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node, the preference attribute corresponding to the current neighbor node is determined. Furthermore, based on the preference attributes corresponding to each neighbor node, a target neighbor node is determined, and target state information corresponding to the current game node is determined based on the target neighbor node. Finally, based on the target state information of all game nodes in the bandwidth resource game model, the number of devices corresponding to the network resource sharing device and the number of devices corresponding to the network resource occupying device are determined. The technical solution of this embodiment simulates the dynamic allocation process of network bandwidth resources by constructing a bandwidth resource game model, and utilizes the state evolution mechanism of the game nodes to achieve autonomous coordination of device behavior. In particular, through the benefit comparison and preference-driven policy update rules between neighboring nodes, network devices are guided to spontaneously move towards a stable equilibrium of resource collaboration. Ultimately, by quantifying the number of sharing and occupying devices, a measurable decision-making basis is provided for resource allocation strategies, thereby optimizing bandwidth resource allocation efficiency, reducing occupation behavior, and improving the fairness and utilization of overall network resources.

[0103] Based on the above device, optionally, the network bandwidth resource coordination device further includes: a repeated execution module;

[0104] The repeated execution module is used to set the profit attribute of each game node in the bandwidth resource game model to zero and update the target state information of each game node to the current state information; repeatedly execute the steps of determining the profit attribute corresponding to each game node, determining the preference attribute corresponding to the current neighbor node, and determining the target state information corresponding to the current game node until the model stability attribute determined according to the target state information of all game nodes meets the preset conditions, and obtain the target number of devices corresponding to the network resource sharing device.

[0105] Based on the above device, optionally, the income attribute determination module 310 includes:

[0106] a node distinguishing unit, configured to determine, for each game group in the bandwidth resource game model, a first target game node whose current state information in the current game group is the cooperator state, and a second target game node whose current state information in the current game group is the betrayer state;

[0107] a collaborator benefit determination unit, configured to determine a first benefit attribute of each first target game node in the current game group based on the number of the first target game nodes, the investment value corresponding to each first target game node, and a preset collaboration parameter;

[0108] a defector benefit determination unit, configured to determine a first benefit attribute of the second target game node in the current game group based on the benefit attribute of the first target game node in the current game group;

[0109] The profit attribute determining unit is configured to determine, for each of the game nodes in the bandwidth resource game model, a profit attribute corresponding to the current game node based on the first profit attribute of the current game node in each of the game groups.

[0110] Based on the above apparatus, optionally, the receiving preference attribute determination module 320 includes:

[0111] a target group determination unit, configured to determine, for each of the game nodes, a game group with the current game node as a central node as a target game group;

[0112] The preference attribute determination unit is used to determine the preference attribute corresponding to the current neighbor node for each neighbor node relative to the current game node in the target game group based on a preset group preference parameter, the profit attribute of the current neighbor node and the profit attribute of each neighbor node.

[0113] On the basis of the above device, optionally, the preference attribute determination unit is specifically used to determine the preference attribute corresponding to the current neighbor node based on a preset preference calculation function, a preset group preference parameter, the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node;

[0114] The preset preference calculation function includes:

[0115]

[0116] Where Πy represents the preference attribute corresponding to the current neighbor node; w represents the preset group preference parameter; N x Represents each neighbor node relative to the current game node; P y Represents the benefit attribute of the current neighbor node; P i Represents the benefit attribute of the i-th neighbor node.

[0117] Based on the above device, optionally, the status information updating module 330 includes:

[0118] The target neighbor node determination unit is used to determine the neighbor node corresponding to the maximum preference attribute value as the target neighbor node.

[0119] a target state determining unit, configured to determine a state adjustment probability value based on the benefit attribute of the target neighbor node, the benefit attribute of the current game node, and an adjustment probability function;

[0120] Adjusting the state of the current game node to the state of the target neighbor node based on the state adjustment probability value, and obtaining target state information corresponding to the current game node;

[0121] Wherein, the adjustment probability function includes:

[0122]

[0123] Where, prob(s x ←s y ) represents the state adjustment probability value, P x Indicates the profit attribute of the current game node, P y represents the benefit attribute of the target neighbor node, and K represents the preset noise factor.

[0124] The network bandwidth resource collaboration device provided in the embodiment of the present invention can execute the network bandwidth resource collaboration method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0125] It is worth noting that the various units and modules included in the above system are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the embodiments of the present invention.

[0126] Example 4

[0127] Figure 6 The present invention provides a schematic structural diagram of an electronic device. Figure 6 A block diagram of an exemplary electronic device 40 suitable for implementing exemplary embodiments of the present invention is shown. Figure 6 The electronic device 40 shown is only an example and should not limit the functionality and scope of use of the embodiments of the present invention.

[0128] like Figure 6 As shown, electronic device 40 is a general-purpose computing device. Components of electronic device 40 may include, but are not limited to, one or more processors or processing units 401, system memory 402, and a bus 403 connecting various system components (including system memory 402 and processing unit 401).

[0129] Bus 403 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures. Examples of these architectures include, but are not limited to, the Industry Standard Architecture (ISA) bus, the Micro Channel Architecture (MAC) bus, the Enhanced ISA bus, the Video Electronics Standards Association (VESA) local bus, and the Peripheral Component Interconnect (PCI) bus.

[0130] The electronic device 40 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the electronic device 40, including volatile and non-volatile media, removable and non-removable media.

[0131] System memory 402 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 404 and / or cache memory 405. Electronic device 40 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, storage system 406 may be used to read and write non-removable, non-volatile magnetic media ( Figure 6 Not shown, often called a "hard drive"). Although Figure 6Not shown, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to bus 403 via one or more data medium interfaces. Memory 402 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of various embodiments of the present invention.

[0132] A program / utility 408 having a set (at least one) of program modules 407 may be stored, for example, in memory 402. Such program modules 407 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may include an implementation of a network environment. Program modules 407 generally perform the functions and / or methods of the embodiments described herein.

[0133] The electronic device 40 may also communicate with one or more external devices 409 (e.g., keyboard, pointing device, display 810, etc.), and may also communicate with one or more devices that enable a user to interact with the electronic device 40, and / or communicate with any device that enables the electronic device 40 to communicate with one or more other computing devices (e.g., network card, modem, etc.). Such communication may be performed through an input / output (I / O) interface 411. Furthermore, the electronic device 40 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 412. As shown, the network adapter 412 communicates with other modules of the electronic device 40 via the bus 403. It should be understood that although Figure 6 Not shown, other hardware and / or software modules may be used in conjunction with the electronic device 40, including but not limited to microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0134] The processing unit 401 executes various functional applications and page processing by running programs stored in the system memory 402, such as implementing the network bandwidth resource coordination method provided in the embodiment of the present invention.

[0135] Example 5

[0136] An embodiment of the present invention further provides a storage medium containing computer-executable instructions. When the computer-executable instructions are executed by a computer processor, they are used to perform a network bandwidth resource coordination method. The method includes:

[0137] Based on the current state information of all game nodes included in each game group in the bandwidth resource game model, determining the profit attribute corresponding to each game node of each game group after the game simulation; wherein the bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state, the cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device;

[0138] For each neighbor node of the current game node, based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node, determining the preference attribute corresponding to the current neighbor node;

[0139] Determine a target neighbor node based on the preference attributes corresponding to each of the neighbor nodes, and determine target state information corresponding to the current game node based on the target neighbor node;

[0140] Based on the target state information of all game nodes in the bandwidth resource game model, the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices are determined.

[0141] The computer storage medium of the embodiment of the present invention may adopt any combination of one or more computer-readable media. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or component, or any combination thereof. More specific examples (a non-exhaustive list) of computer-readable storage media include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In this document, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device.

[0142] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0143] Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0144] Computer program code for performing the operations of embodiments of the present invention can be written in one or more programming languages, or a combination thereof, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0145] Note that the above are only preferred embodiments of the present invention and the technical principles employed. Those skilled in the art will appreciate that the present invention is not limited to the specific embodiments herein, and that various obvious changes, readjustments, and substitutions are possible for those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in detail through the above embodiments, the present invention is not limited to the above embodiments and may include many other equivalent embodiments without departing from the scope of the present invention. The scope of the present invention is determined by the scope of the appended claims.

Claims

1. A network bandwidth resource coordination method, characterized in that: include: Based on the current state information of all game nodes included in each game group in the bandwidth resource game model, determining the profit attribute corresponding to each game node of each game group after the game simulation; wherein the bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state, the cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device; For each neighbor node of the current game node, based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node, determining the preference attribute corresponding to the current neighbor node; Determine a target neighbor node based on the preference attributes corresponding to each of the neighbor nodes, and determine target state information corresponding to the current game node based on the target neighbor node; Based on the target state information of all game nodes in the bandwidth resource game model, the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices are determined.

2. The method according to claim 1, characterized in that The method further comprises: For each game node in the bandwidth resource game model, the benefit attribute of each game node is set to zero, and the target state information of each game node is updated to the current state information; Repeat the steps of determining the benefit attribute corresponding to each of the game nodes, determining the preference attribute corresponding to the current neighbor node, and determining the target state information corresponding to the current game node, until the model stability attribute determined according to the target state information of all the game nodes meets the preset conditions, and obtain the number of devices corresponding to the network resource sharing device and the network resource occupying device respectively.

3. The method according to claim 1, characterized in that The method of determining the profit attribute corresponding to each game node of each game group after the game simulation based on the current state information of all game nodes included in each game group in the bandwidth resource game model includes: For each game group in the bandwidth resource game model, determining a first target game node in the current game group whose current state information is the cooperator state, and a second target game node whose current state information is the betrayer state; Determining a first profit attribute of each of the first target game nodes in the current game group based on the number of the first target game nodes, the investment value corresponding to each of the first target game nodes, and a preset coordination parameter; Determining a first profit attribute of the second target game node in the current game group based on the profit attribute of the first target game node in the current game group; For each of the game nodes in the bandwidth resource game model, a profit attribute corresponding to the current game node is determined based on the first profit attribute of the current game node in each of the game groups.

4. The method according to claim 1, wherein The step of determining, for each neighbor node of the current game node, based on the benefit attribute of the current neighbor node and the benefit attributes of each neighbor node, the preference attribute corresponding to the current neighbor node, includes: For each of the game nodes, determining a game group with the current game node as a central node as a target game group; For each neighbor node relative to the current game node in the target game group, a preference attribute corresponding to the current neighbor node is determined based on a preset group preference parameter, a benefit attribute of the current neighbor node, and the benefit attributes of each neighbor node.

5. The method according to claim 4, characterized in that The determining of the preference attribute corresponding to the current neighbor node based on the preset group preference parameter, the benefit attribute of the neighbor node, and the benefit attribute of each neighbor node includes: Determine the preference attribute corresponding to the current neighbor node based on a preset preference calculation function, a preset group preference parameter, the benefit attribute of the current neighbor node, and the benefit attributes of each neighbor node; The preset preference calculation function includes: Where Πy represents the preference attribute corresponding to the current neighbor node; w represents the preset group preference parameter; N x Represents each neighbor node relative to the current game node; P y Represents the benefit attribute of the current neighbor node; P i Represents the benefit attribute of the i-th neighbor node.

6. The method according to claim 1, characterized in that The determining of the target neighbor node based on the preference attributes corresponding to the neighbor nodes includes: The neighbor node with the largest preference attribute value is determined as the target neighbor node.

7. The method according to claim 1, characterized in that The determining the target state information corresponding to the current game node based on the target neighbor node includes: Determine a state adjustment probability value based on the benefit attribute of the target neighbor node, the benefit attribute of the current game node, and an adjustment probability function; wherein the adjustment probability function includes: Where, prob(s x ←s y ) represents the state adjustment probability value, P x Indicates the profit attribute of the current game node, P y represents the benefit attribute of the target neighbor node, and K represents the preset noise factor; The state of the current game node is adjusted to the state of the target neighbor node based on the state adjustment probability value, and target state information corresponding to the current game node is obtained.

8. A network bandwidth resource coordination device, characterized in that: The device includes: a profit attribute determination module configured to determine, based on current state information of all game nodes included in each game group in the bandwidth resource game model, a profit attribute corresponding to each game node in each game group after game simulation; wherein the bandwidth resource game model includes multiple game nodes, each game node corresponds to a network resource device, and the current state information includes a cooperator state or a defector state, wherein the cooperator state corresponds to a network resource sharing device, and the defector state corresponds to a network resource occupying device; A preference attribute determination module is used to determine the preference attribute corresponding to each neighbor node of the current game node based on the profit attribute of the current neighbor node and the profit attributes of each neighbor node; A state information updating module is used to determine a target neighbor node based on the preference attributes corresponding to each of the neighbor nodes, so as to determine the target state information corresponding to the current game node based on the target neighbor node; The bandwidth resource coordination module is used to determine the number of devices corresponding to the network resource sharing devices and the number of devices corresponding to the network resource occupying devices based on the target state information of all game nodes in the bandwidth resource game model.

9. An electronic device, characterized in that: The electronic device comprises: at least one processor; and a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the network bandwidth resource coordination method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the network bandwidth resource coordination method according to any one of claims 1 to 7 when executed.

Images