CN113132175B - Network resource scheduling method and device - Google Patents
Network resource scheduling method and device Download PDFInfo
- Publication number
- CN113132175B CN113132175B CN201911422173.1A CN201911422173A CN113132175B CN 113132175 B CN113132175 B CN 113132175B CN 201911422173 A CN201911422173 A CN 201911422173A CN 113132175 B CN113132175 B CN 113132175B
- Authority
- CN
- China
- Prior art keywords
- network
- path
- network path
- resource scheduling
- odu
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000015654 memory Effects 0.000 claims description 24
- 230000003287 optical effect Effects 0.000 claims description 18
- 238000004422 calculation algorithm Methods 0.000 claims description 12
- 238000013473 artificial intelligence Methods 0.000 claims description 4
- 238000013528 artificial neural network Methods 0.000 claims description 4
- 238000012545 processing Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 11
- 238000007726 management method Methods 0.000 description 11
- 238000010586 diagram Methods 0.000 description 10
- 230000005540 biological transmission Effects 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 6
- 230000003068 static effect Effects 0.000 description 6
- 101150042248 Mgmt gene Proteins 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 4
- 238000005859 coupling reaction Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000009467 reduction Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 230000000903 blocking effect Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000003321 amplification Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008602 contraction Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003199 nucleic acid amplification method Methods 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 239000005022 packaging material Substances 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/83—Admission control; Resource allocation based on usage prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
Abstract
The embodiment of the application discloses a network resource scheduling method and device, which are used for predicting network traffic, realizing the coordinated scheduling of the network traffic and network resources and achieving the maximization of network resource utilization. It comprises the following steps: the network resource scheduling device collects network flow information of each network path in the network topology; then the network resource scheduling device predicts the flow demand of each network path in a future period according to the network flow information; determining network resource scheduling information of each network path in a future period according to the flow demand, namely determining network resources which need to be scheduled in each time period of each network path in a future period according to the flow demand; and finally, if the network resource scheduling information determines that at least two network paths exist in the network paths and the network resource requirements are opposite in the same time period, multiplexing the network resources between the at least two network paths in a time division manner.
Description
Technical Field
The present disclosure relates to the field of communications, and in particular, to a method and an apparatus for scheduling network resources.
Background
The software defined network (Software Defined Network, SDN) is a new network innovation architecture, which is one implementation of network virtualization. On the basis of SDN, the network is controlled in a layering way, and the control modules comprise an Internet protocol (Internet Protocol, IP) Domain management control module (IP Domain for short), a transport Domain management control module (T Domain for short) and a cross-layer management module (Mulite-layer Mgmt for short). The IP Domain is responsible for the management and monitoring of an IP network, such as the creation and management of IP business and the like; t Domain is responsible for management and monitoring of transport networks, such as creation and management of transport services, etc.; the Mulite-layer Mgmt is responsible for coordinating the coordination of the IP Domain and the T Domain for the two-layer cooperative processing.
Currently, link scheduling of an SDN is usually manually scheduled, and the scheduling flow is shown in fig. 1. When the link bandwidth is insufficient, and the link is congested, the link-related routing equipment feeds back information to a controller in the SDN, then the SDN controller feeds back information to an operator, and then the operator reconfigures the link in the SDN. If the bandwidth of the link one is insufficient, the route equipment related to the link one sends feedback information (the feedback information is used for explaining that the bandwidth of the link one is insufficient) to the controller in the SDN, and then the controller in the SDN resends the feedback information to the user side, and the user side displays the feedback information so that an operator perceives the feedback information; then the operator reconfigures network resources in the network topology and then issues configuration operation to a controller in the SDN; and finally, the controller in the SDN sends configuration operation to the relevant routing equipment of the link.
This way of adjustment allows the operator to know only the current demand of the problematic link and not the demand of the link for a period of time in the future; meanwhile, the operator can only schedule the link at the IP layer, and the allocation of network resources cannot be realized accurately.
Disclosure of Invention
The embodiment of the application provides a network resource scheduling method and device, which are used for predicting network traffic, realizing the coordinated scheduling of the network traffic and network resources and achieving the maximization of network resource utilization.
In a first aspect, an embodiment of the present application provides a network resource scheduling method, which is applied to an SDN, where a specific execution body is a network resource scheduling device in the SDN, where the network resource scheduling device includes a traffic acquisition module, a traffic prediction module, a cross-layer calculation module, and a network resource scheduling module. The embodiment of the application comprises the following steps: the network resource scheduling device collects network flow information of each network path in the network topology through a data collection module; then the flow prediction module predicts the flow demand of each network path in a future period according to the network flow information; determining network resource scheduling information of each network path in a future period according to the flow demand, namely determining network resources which need to be scheduled in each time period of each network path in a future period according to the flow demand; and finally, if the network resource scheduling information determines that at least two network paths exist in the network paths and the network resource requirements are opposite in the same time period, multiplexing the network resources between the at least two network paths in a time division manner.
In the technical scheme provided by the embodiment, the network resource scheduling device predicts the flow demand of each network path in the network topology in a future period according to the network flow information, determines the network resource scheduling information of each network path according to the flow demand, and time-multiplexes the network resources of the network path when determining that the network path capable of time-multiplexing exists according to the network resource scheduling information, thereby realizing the coordinated scheduling of the network flow and the network resources and achieving the maximization of the network resource utilization.
Optionally, the following technical solution may be specifically adopted when the network resource scheduling device predicts the traffic demand of each network path according to the network traffic information: the network resource scheduling device predicts the traffic demand of each network path using a neural network artificial intelligence (Artificial Intelligence, AI) algorithm based on the network traffic information. It can be understood that the network resource scheduling device may also use other algorithm models to predict the flow demand, so long as an accurate prediction result can be obtained, and the specific algorithm model is not limited herein.
Optionally, assuming that the at least two network paths are a first network path and a second network path, predicting according to the network traffic information to obtain that in a first period of time, the network traffic demand of the first network path increases, that is, the network resource of the first network path needs to be expanded, and the network traffic demand of the second network path decreases, that is, the network resource of the second network path can be contracted, where the network resource scheduling device time-division multiplexes the network resources of the first network path and the second network path, the specific operations are as follows: the network resource scheduling device performs network adjustment in a cross-layer manner, and releases optical channel data units (Optical channel Data Unit, ODU) occupied by the second network path, so as to implement network resource capacity reduction of the second network path (i.e., reduce network bandwidth of the second network path); and then the network resource scheduling device adds an ODU to the first network path, where the added ODU is an ODU released by the second network path, so as to implement expansion of network resources of the first network path (i.e. increase network bandwidth of the first network path).
Optionally, assuming that the at least two network paths are a first network path and a second network path, predicting according to the network traffic information to obtain that in a second period of time, the network traffic demand of the second network path is increased, that is, the network resource of the second network path needs to be expanded, the network traffic demand of the first network path is reduced, that is, the network resource of the first network path can be contracted, and then the network resource scheduling device time-division multiplexes the network resources of the first network path and the second network path, which specifically includes the following operations: the network resource scheduling device performs network adjustment in a cross-layer manner, and releases an optical channel data unit (Optical channel Data Unit, ODU) occupied by the first network path, so as to implement network resource capacity reduction of the first network path (i.e., reduce network bandwidth of the first network path); and then the network resource scheduling device adds an ODU to the second network path, where the added ODU is an ODU released by the first network path, so as to implement expansion of network resources of the second network path (i.e. increase network bandwidth of the second network path).
It can be understood that, in the technical solution provided in this embodiment, only the time division multiplexing of the network resources by the first network path and the second network path in the first time period and the second time period is shown by way of example, in practical application, the time division multiplexing of the network resources by the first network path and the third network path in the second time period may be shown by way of example, and the time division multiplexing of the network resources by the second network path and the fourth network path may be shown by way of example. That is, as long as time-division multiplexing scheduling of network resources can be realized, the scheduling object is not limited to a fixed network path.
Optionally, if it is known according to the service arrangement that the traffic of the first service in the network topology increases beyond a first preset threshold in a first preset period, the network resource scheduling device may create a first target network path in the network topology; then the network resource scheduling device allocates a corresponding ODU for the first target network path; and adjusting the first service to the first target network path; and simultaneously, after the first preset time period is overtime (i.e. when the traffic of the target service reaches a normal state), the network resource scheduling device deletes the first target network path and releases the ODU occupied by the first target network path. Therefore, a path can be re-planned for the service according to the flow demand of the actual service, thereby avoiding the problem of network blocking caused by overlarge service flow increase and achieving the maximization of network resource utilization.
Optionally, if the network resource scheduling device obtains network traffic information in a second preset time period, where the second preset time period is greater than a second preset threshold (it can be understood that the second preset time period is a time period with a longer duration, for example, greater than or equal to three months, etc., where the second preset threshold can be set by a user himself), and then the network resource scheduling device determines, according to the network traffic information, that a network path including a routing node useless for the first service exists in the network topology, and the network resource scheduling device reprograms the network path in the network topology to obtain a second target network path; and then the network resource scheduling device feeds back the second target network path to the user side. When the network resource scheduling device determines that the network path bearing service has network resource waste, the network topology can be re-planned, the newly planned network path is fed back to the user end, and the user end displays the newly planned network path to the operator, so that the operator determines whether to establish the new network path and adjusts the service to the network path.
Optionally, based on the re-planning of the network topology, after receiving the indication information of the user side for indicating to establish the second target network path, the network resource scheduling device establishes the second target network path according to the indication information; and allocating an ODU for the second target network path; and finally, the first service is adjusted to the second target network path.
It can be understood that, based on the above scheme, the network resource scheduling device needs to consider a configuration policy when scheduling the network resources of the network topology, where the network resource scheduling device determines a scheduling result according to the configuration policy and the network resource scheduling information, and then adjusts the network resources of the entire network topology according to the scheduling result. The configuration policy may be used to instruct, but is not limited to, instruct the network resource scheduling device to adjust the network resource according to the network resource scheduling information at the target time, instruct the network resource scheduling device to calculate the constraint condition of the optimal path, instruct the network resource scheduling device to adjust the period of the network resource according to the network resource scheduling information, and so on.
The configuration policy includes the network resource scheduling time, the network path calculation policy, and the like.
In a second aspect, an embodiment of the present application provides a network resource scheduling device, where the device has a function of implementing the controller behavior of the first aspect. The functions may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the functions described above.
In a possible implementation manner, the apparatus includes a unit or a module for performing the steps of the above first aspect. For example, the apparatus includes: the acquisition module is used for acquiring network flow information of each network path in the network topology; the processing module is used for predicting the flow demand of each network path according to the network flow information; determining network resource scheduling information of each network path according to the traffic demand, wherein the network resource scheduling information is used for indicating network resources required by each network path in each time period; and if the network resource scheduling information indicates that at least two network paths exist in the network paths and the network resource requirements are opposite in the same time period, multiplexing the network resources between the at least two network paths in a time division mode.
Optionally, a storage module is further included for storing program instructions and data necessary for the controller.
In one possible implementation, the apparatus includes: a processor and a transceiver, the processor being configured to support the controller to perform the corresponding functions of the method provided in the first aspect. The transceiver is used for indicating the communication between the controller and the user terminal and between the controller and the network equipment, sending the information or instructions related to the method to the user terminal, and receiving the network flow information fed back by the network equipment. Optionally, the apparatus may further comprise a memory for coupling with the processor, which holds the program instructions and data necessary for the controller.
In one possible implementation, when the device is a chip within the controller, the chip includes: the processing module and the transceiver module can be, for example, an input/output interface, a pin, a circuit or the like on the chip, and transmit the acquired network traffic information of each network path in the network topology to other chips or modules coupled with the chip. The processing module may be, for example, a processor, where the processor is configured to predict a traffic demand of each network path according to the network traffic information; determining network resource scheduling information of each network path according to the traffic demand, wherein the network resource scheduling information is used for indicating network resources required by each network path in each time period; and if the network resource scheduling information indicates that at least two network paths exist in the network paths and the network resource requirements are opposite in the same time period, multiplexing the network resources between the at least two network paths in a time division mode. The processing module may execute computer-executable instructions stored by the storage unit to support the controller to perform the method provided in the first aspect. Alternatively, the storage unit may be a storage unit in the chip, such as a register, a cache, or the like, and the storage unit may also be a storage unit located outside the chip, such as a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a random access memory (random access memory, RAM), or the like.
In one possible implementation, the apparatus includes: the device comprises a processor, a baseband circuit, a radio frequency circuit and an antenna. The processor is used for controlling the functions of each circuit part, the baseband circuit is used for generating a data packet containing signaling information, and the data packet is transmitted to the user terminal or the network equipment through the antenna after being subjected to analog conversion, filtering, amplification, up-conversion and other processes by the radio frequency circuit. Optionally, the apparatus further comprises a memory holding program instructions and data necessary for the controller.
The processor mentioned in any of the above may be a general purpose central processing unit (Central Processing Unit, CPU for short), a microprocessor, an application-specific integrated circuit (ASIC for short), or one or more integrated circuits for controlling the execution of the program of the method for channel resource coordination allocation in the above aspects.
In a third aspect, embodiments of the present application provide a computer-readable storage medium storing computer instructions for performing the method of the first aspect.
In a fourth aspect, embodiments of the present application provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of the first aspect described above.
From the above technical solutions, the embodiments of the present application have the following advantages: the network resource scheduling device predicts the flow demand of each network path in the network topology in a future period according to the network flow information, determines the network resource scheduling information of each network path according to the flow demand, and time-multiplexes the network resources of the network path when the network path capable of time-multiplexing is determined to exist according to the network resource scheduling information, thereby realizing the coordinated scheduling of the network flow and the network resources and maximizing the utilization of the network resources.
Drawings
FIG. 1 is a flow chart of a method for manual scheduling of network resources;
fig. 2 is a network system architecture diagram of an SDN in an embodiment of the present application;
FIG. 3 is a schematic diagram illustrating an exemplary architecture of a network resource scheduling device according to an embodiment of the present application;
FIG. 4 is a schematic diagram of an embodiment of a network resource scheduling method according to an embodiment of the present application;
FIG. 5 is an exemplary schematic diagram of a network topology in an embodiment of the present application;
FIG. 6 is an exemplary diagram of cross-layer scheduling in an embodiment of the present application;
FIG. 7 is an exemplary diagram of network topology and network resource scheduling in an embodiment of the present application;
FIG. 8 is another exemplary diagram of network topology and network resource scheduling in an embodiment of the present application;
FIG. 9 is a schematic diagram of an embodiment of a network resource scheduling device according to an embodiment of the present application;
fig. 10 is a schematic diagram of another embodiment of a network resource scheduling apparatus according to an embodiment of the present application.
Detailed Description
The embodiment of the application provides a network resource scheduling method and device, which are used for predicting network traffic, realizing the coordinated scheduling of the network traffic and network resources and achieving the maximization of network resource utilization.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims of this application and in the above-described figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments described herein may be implemented in other sequences than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
SDN is a novel network innovation architecture, and is an implementation mode of network virtualization. On the basis of the SDN, the network is controlled in a layering manner, and as shown in fig. 2, a control module of the SDN comprises IP Domain, T Domain and Mulite-layer Mgmt. The IP Domain is responsible for the management and monitoring of an IP network, such as the creation and management of IP business and the like; t Domain is responsible for management and monitoring of transport networks, such as creation and management of transport services, etc.; the Mulite-layer Mgmt is responsible for coordinating the coordination of the IP Domain and the T Domain for the two-layer cooperative processing. Currently, link scheduling of an SDN is usually manually scheduled, and the scheduling flow is shown in fig. 1. When the link bandwidth is insufficient, and the link is congested, the link feedback information is fed back to a controller in the SDN, then the SDN controller feeds back the information to an operator, and then the operator reconfigures the link in the SDN. The adjustment mode enables an operator to only know the requirements of the links with problems at present, the requirements of other links are not known, and the allocation of network resources cannot be accurately realized.
In order to solve the problem, an embodiment of the present application provides a network resource scheduling device as shown in fig. 3, where the network resource scheduling device includes a traffic acquisition module, a traffic prediction module, a cross-layer calculation module, and a network resource scheduling module; the technical scheme provided by the embodiment of the application is as follows: the flow acquisition module acquires network flow information of each network path in the network topology; then the flow prediction module predicts the flow demand of each network path in a future period according to the network flow information; the cross-layer computing module determines network resource scheduling information of each network path in a future period according to the traffic demand, namely determines network resources which need to be scheduled in each time period of each network path in a future period according to the traffic demand; and finally, when the network resource scheduling module determines that at least two network paths exist in each network path according to the network resource scheduling information and the network resource requirements of the network paths are opposite in the same time period, the network resource scheduling module time-division multiplexes the network resources between the at least two network paths.
Referring specifically to fig. 4, an embodiment of a method for scheduling network resources in an embodiment of the present application includes:
401. the network resource scheduling device acquires network flow information of each network path in the network topology.
The network resource scheduling device acquires the network flow information of each routing node in the network topology through the flow acquisition module, so as to determine the network flow information of each network path in the network topology.
Specifically, the network resource scheduling device needs to collect information such as neighbor states, routing information, link information and the like of each routing node in the network through various routing protocols, so as to determine the network topology of the whole network; and then the flow acquisition module acquires the flow state of each routing node in real time to obtain the network flow information of each network path in the network topology. In the network topology shown in fig. 5, 7 routing nodes are included, which are respectively: PE2 residential area 1, PE3 residential area 2, PE4 residential area 3, P2, P1, PE1 office area 1, and PE5 some cloud center. The network path comprises: PE2 through P2 to PE5, PE3 through P2 to PE5, PE1 through P1 to PE5, and PE4 through P1 to PE5. Therefore, the traffic acquisition module can acquire the traffic states of the PE1 to PE5 and the P1 and P2 respectively, and then determine the network traffic information of the network paths P2 to PE5, P3 to PE5, P1 to PE5 and P4 to PE5.
402. The network resource scheduling device predicts the flow demand of each network path according to the network flow information.
A flow prediction module in the network resource scheduling device predicts flow demands of each network path in a future period of time by utilizing an algorithm model according to the network flow information. Specifically, the algorithm model may be a neural network AI algorithm or other possible algorithm models, so long as a flow prediction may be performed, and a specific algorithm model is defined herein. Based on the network topology shown in fig. 5, assuming that the collection period of the network traffic information is one week, two network paths of PE2 through P2 to PE5 and PE1 through P1 to PE5 are taken as an example to illustrate the traffic demand predicted by the traffic prediction module in the network resource scheduling device. The flow prediction module in the network resource scheduling device predicts that the PE2 needs 10G network resource to bear corresponding service from 8 in the morning to 7 in the evening, needs 20G network resource to bear corresponding service from 7 in the evening to 12 in the evening and needs 5G network resource to bear corresponding service from 12 in the evening to 8 in the morning in the future in a week; PE1 needs 20G network resource to bear corresponding service in the future week from 8 in the morning to 7 in the evening, needs 10G network resource to bear corresponding service in the evening from 7 in the evening to 12 in the evening, and needs 5G network resource to bear corresponding service in the evening from 12 in the evening to 8 in the morning via the network path from P1 to PE 5.
403. The network resource scheduling device determines network resource scheduling information of each network path according to the traffic demand, wherein the network resource scheduling information is used for indicating network resources required by each network path in each time period.
And a cross-layer calculation module in the network resource scheduling device calculates and obtains the network resource scheduling information of each network path according to the flow demand, wherein the network resource scheduling information is used for indicating the network resources required by each network path in the network topology in each time period. Specifically, the network resource scheduling information calculates the network resource scheduling information of the network path in a future period according to the traffic demand and the configured network resources of the network path. Based on the network topology shown in fig. 5, two network paths of PE2 through P2 to PE5 and PE1 through P1 to PE5 are taken as an example to illustrate the network resource scheduling information calculated by the cross-layer calculation module in the network resource scheduling device. In this embodiment, assuming that the network resources configured by the two network paths P2 to PE5 and PE1 to PE5 are 10G, the network resource scheduling information calculated by the cross-layer calculation module is as follows: PE2 via the network path P2-PE 5 does not need to reconfigure network resources from 8 a.m. to 7 a.m. (i.e. the network resource scheduling information may indicate that the network resource scheduling value of the network path is 0), from 7 a.m. to 12 a.m. to expand the network resources from 10G to 20G (i.e. the network resource scheduling information may indicate that the network resource scheduling value of the network path is 10G), and from 12 a.m. to 8 a.m. to shrink the network resources from 10G to 5G (i.e. the network resource scheduling information may indicate that the network resource scheduling value of the network path is-5G); whereas PE1 via the network path P1-PE 5 requires expansion of network resources from 10G to 20G between 8G in the morning and 7G in the evening (i.e., the network resource scheduling information may indicate that the network resource scheduling value of the network path is 10G), no reconfiguration of network resources is required between 7G in the evening and 12G in the evening (i.e., the network resource scheduling information may indicate that the network resource scheduling value of the network path is 0), and contraction of network resources from 10G to 5G between 12G in the evening and 8G in the morning (i.e., the network resource scheduling information may indicate that the network resource scheduling value of the network path is-5G).
404. If the network resource scheduling information indicates that there are at least two network paths in the network paths and the network resource requirements are opposite in the same time period, the network resource scheduling device time-division multiplexes the network resources between the at least two network paths.
If the network resource scheduling information indicates that at least two network paths exist in the network paths and the network resource demands of the at least two network paths are opposite in the same time period, the network resource scheduling device time-division multiplexes the network resources between the at least two network paths. The specific operation is as follows:
in an exemplary scheme, assuming that the at least two network paths are a first network path and a second network path, according to the network traffic information, predicting that the network traffic demand of the first network path is increased, that is, the network resource of the first network path needs to be expanded, and the network traffic demand of the second network path is reduced, that is, the network resource of the second network path may be contracted, where the network resource scheduling device time-division multiplexes the network resources of the first network path and the second network path, the specific operations are as follows: the network resource scheduling device performs network adjustment in a cross-layer manner, and releases optical channel data units (Optical channel Data Unit, ODU) occupied by the second network path, so as to implement network resource capacity reduction of the second network path (i.e., reduce network bandwidth of the second network path); and then the network resource scheduling device adds an ODU to the first network path, where the added ODU is an ODU released by the second network path, so as to implement expansion of network resources of the first network path (i.e. increase network bandwidth of the first network path).
In another exemplary scenario, assuming that the at least two network paths are a first network path and a second network path, according to the network traffic information, it is predicted that in a second period of time, a network traffic demand of the second network path increases, that is, a network resource of the second network path needs to be expanded, a network traffic demand of the first network path decreases, that is, a network resource of the first network path may be contracted, where the network resource scheduling device time-division multiplexes the network resources of the first network path and the second network path, and the specific operations are as follows: the network resource scheduling device performs network adjustment in a cross-layer manner, and releases an optical channel data unit (Optical channel Data Unit, ODU) occupied by the first network path, so as to implement network resource capacity reduction of the first network path (i.e., reduce network bandwidth of the first network path); and then the network resource scheduling device adds an ODU to the second network path, where the added ODU is an ODU released by the first network path, so as to implement expansion of network resources of the second network path (i.e. increase network bandwidth of the second network path).
It can be understood that, in the technical solution provided in this embodiment, only the time division multiplexing of the network resources by the first network path and the second network path in the first time period and the second time period is shown by way of example, in practical application, the time division multiplexing of the network resources by the first network path and the third network path in the second time period may be shown by way of example, and the time division multiplexing of the network resources by the second network path and the fourth network path may be shown by way of example. That is, as long as time-division multiplexing scheduling of network resources can be realized, the scheduling object is not limited to a fixed network path.
Based on the network topology shown in fig. 5, two network paths, i.e., PE2 through P2 to PE5 and PE1 through P1 to PE5, are taken as an example. The PE2 needs to expand the network resources from 10G to 20G through the P2 to PE5 network path between 7 pm and 12 pm; the network resources of the PE1 through the P1 to PE5 network path are configured to be 20G in the period from 8 a.m. to 7 a.m. and the PE1 can bear corresponding service through the network resources of the P1 to PE5 network path 10G between 7 a.m. to 12 a.m. when the PE1 can shrink through the network resources of the P1 to PE5 network path. As shown in fig. 6, the PE2 performs data transmission through the transmission unit 1 (i.e. O1 in fig. 6) and the transmission unit 4 (i.e. O4 in fig. 6) via the P2-PE 5 network paths in the network topology; whereas PE1 performs data transmission via the P1 to PE5 network paths through the transmission unit 6 (i.e. O6 as in fig. 6). The network resource scheduling device controls to release the ODU occupied by the P1 through PE5 network paths in the optical layer link, and then adds an ODU for the P2 through PE5 network paths in the optical layer link (the added ODU is the ODU released by the PE1 through P1 through PE5 network paths).
Optionally, the collection period of the network traffic information may be set by the user, for example, setting the collection period to be day or week; the acquisition period may also be set to a month. The network traffic information also includes historical network traffic information for a particular service, such as a double eleven payment service or a double eleven web browsing service, and so on.
If the network resource scheduling device predicts that the network flow of the specific service (i.e. the first service) increases beyond a first preset threshold value in a first preset time period according to the historical network flow information of the specific service, the network resource scheduling device can newly establish a first target network path in the network topology; then the network resource scheduling device allocates a corresponding ODU for the first target network path; and adjusting the first service to the first target network path; and simultaneously, after the first preset time period is overtime (i.e. when the traffic of the target service reaches a normal state), the network resource scheduling device deletes the first target network path and releases the ODU occupied by the first target network path. Therefore, a path can be re-planned for the service according to the flow demand of the actual service, thereby avoiding the problem of network blocking caused by overlarge service flow increase and achieving the maximization of network resource utilization. The specific operation of the method can be shown in fig. 7, in the network topology, the method comprises 8 routing nodes, which are respectively: PE1 residential area 1, P2, P3, P4, PE3 office area 1, PE5 cloud center 1 and PE4 cloud center 2. The network path comprises: PE1-P1-P3-PE4, PE1-P2-PE5, PE1-P1-P2-PE5, etc. Taking a PE1-P3-PE4 network path as an example, assuming that during the double eleven periods, the traffic on the network path is suddenly increased, in order to ensure the quality of service, the network resource scheduling device directly bypasses the PE1-P3-PE4 network path (i.e. newly builds the PE1-P3-PE4 network path), allocates an ODU to the current network path of the PE1-P3-PE4 from the optical layer link, and then migrates the traffic during the double eleven periods to the network path. Then after twenty-one, the traffic flow during PE1 to PE4 resumes a flat constant, the network resource scheduling device may release the ODU allocated to PE1-P3-PE4 in the optical layer link, and then delete the PE1-P3-PE4 network path, so that the network topology resumes as it is.
If the network resource scheduling device obtains network traffic information of a second preset time period, wherein the second preset time period is greater than a second preset threshold (the second preset time period can be understood to be a time period with longer duration, such as greater than or equal to three months, etc., wherein the second preset threshold can be set by a user himself), then the network resource scheduling device determines that a network path including a routing node useless for the first service exists in the network topology according to the network traffic information, and the network resource scheduling device re-plans the network path in the network topology to obtain a second target network path; and then the network resource scheduling device feeds back the second target network path to the user side. When the network resource scheduling device determines that the network path bearing service has network resource waste, the network topology can be re-planned, the newly planned network path is fed back to the user end, and the user end displays the newly planned network path to the operator, so that the operator determines whether to establish the new network path and adjusts the service to the network path. Referring specifically to fig. 8, in the network topology, the network topology includes 11 routing nodes, which are respectively: PE1 residential area 1, P2, P3, P4, PE3 office area 1, PE5 cloud center 1 and PE4 cloud center 2, and CE1, CE2, and CE3. The network path includes PE1-P1-P3-PE4, PE1-P2-PE5, PE1-P1-P2-PE5, and the like. Taking a network path of PE1-P1-P3-PE4 as an example, assuming that the network flow information acquisition time of the network path is three months, and predicting that the network flow of the network path is steadily increased between the three months, and when the flow bypasses P1, the P1 is useless for the service on the network path, the network resource scheduling device can re-plan the network path of PE1-P3-PE4, so that the service flows of the original PE1 to PE4 can directly pass through the PE1-P3-PE4. After planning the network path, the network resource scheduling device may not newly establish the network path first, and feed back the network path information to the user end, where the user end decides whether to newly establish the network path. After receiving the information of the re-planned network path, the user terminal can firstly judge whether the network resource of the current network topology meets the requirement of newly establishing the network path, and if so, the user terminal can directly send indication information to the network resource scheduling device, wherein the indication information is used for indicating the newly establishing network path; if not, the user terminal may send the indication information to the network resource scheduling device after the user increases the network resources of the network topology. If the network resource scheduling device receives the indication information sent by the user end and used for indicating to newly establish the network path, the network resource scheduling device newly establishes the network path, allocates a corresponding ODU for the network path in the optical layer link, and finally adjusts the services of the PE1 to the PE4 to the network path.
It can be understood that, based on the above scheme, the network resource scheduling device needs to consider a configuration policy when scheduling the network resources of the network topology, where the network resource scheduling device determines a scheduling result according to the configuration policy and the network resource scheduling information, and then adjusts the network resources of the entire network topology according to the scheduling result. The configuration policy may be used to instruct, but is not limited to, instruct the network resource scheduling device to adjust the network resource according to the network resource scheduling information at the target time, instruct the network resource scheduling device to calculate the constraint condition of the optimal path, instruct the network resource scheduling device to adjust the period of the network resource according to the network resource scheduling information, and so on. For example, the configuration policy indicates that the network resource indicates that an optimal network path is calculated according to a shortest delay for the service 1, and when the network resource utilization reaches fifty percent, the network resource of the optimal network path corresponding to the service 1 can be adjusted.
In the embodiment of the application, the network resource scheduling device predicts the flow demand of each network path in the network topology in a future period according to the network flow information, determines the network resource scheduling information of each network path according to the flow demand, and time-multiplexes the network resources of the network path when determining that the network path capable of time-multiplexing exists according to the network resource scheduling information, thereby realizing the coordinated scheduling of the network flow and the network resources and maximizing the utilization of the network resources. Meanwhile, the flow demand of the network topology is predicted according to the algorithm model, and the network topology is correspondingly re-planned, so that the network resource adjustment can be more effective.
Having described the network resource scheduling method in the embodiment of the present application, the following describes the network resource scheduling apparatus in the embodiment of the present application, and referring specifically to fig. 9, the network resource scheduling apparatus 900 in the embodiment of the present application includes: traffic acquisition module 901, traffic prediction module 902, cross-layer computation module 903, network resource scheduling module 904. The network resource scheduling device 900 may be a network resource scheduling device in the above method embodiment, or may be one or more chips in the network resource scheduling device. The network resource scheduling device 900 may be configured to perform some or all of the functions of the network resource scheduling device in the above-described method embodiments.
For example, the traffic collection module 901 is configured to obtain network traffic information of each network path in the network topology. The flow prediction module 902 is configured to predict a flow requirement of each network path according to the network flow information; a cross-layer computing module 903, configured to determine, according to the traffic demand, network resource scheduling information of each network path, where the network resource scheduling information is used to indicate network resources required by each network path in each time period; the network resource scheduling module 904 is configured to time-division multiplex network resources between at least two network paths if the network resource scheduling information indicates that there are at least two network paths in the network paths and network resource requirements are opposite in the same time period.
Optionally, the network resource scheduling apparatus 900 may further include: the sending module 905 may be configured to perform the steps of sending information or instructions in the foregoing method embodiments. For example, the sending module 905 is configured to feed back the second target network path to the user side.
Optionally, the network resource scheduling apparatus 900 may further include: the receiving module 906 may be configured to perform the steps of receiving information or instructions in the foregoing method embodiments. For example, the receiving module 906 is configured to receive the indication information fed back by the user side.
Optionally, the network resource scheduling device 900 further includes a storage module, where the storage module is coupled to the processing module, so that the processing module can execute the computer execution instructions stored in the storage module to implement the functions of the network resource scheduling device in the foregoing method embodiment. In one example, the storage module optionally included in the network resource scheduling apparatus 900 may be a storage unit in a chip, such as a register, a cache, or the like, and the storage module may also be a storage unit located outside the chip, such as a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a random access memory (random access memory, RAM), or the like.
It should be understood that the flow executed between the modules of the network resource scheduling device in the foregoing embodiment of fig. 9 is similar to the flow executed by the network resource scheduling device in the foregoing embodiment of the corresponding method in fig. 4 to 8, and detailed descriptions thereof are omitted herein.
Fig. 10 shows a schematic diagram of a possible configuration of the network resource scheduling device 1000 in the above embodiment, and the network resource scheduling device 1000 may be configured as the foregoing network resource scheduling device. The network resource scheduling apparatus 1000 may include: a processor 1002, computer-readable storage media/memory 1003, a transceiver 1004, input devices 1005 and output devices 1006, and a bus 1001. Wherein the processor, transceiver, computer readable storage medium, etc. are connected by a bus. The embodiments of the present application are not limited to the specific connection media between the components described above.
In one example, the transceiver 1004 obtains network traffic information for each network path in the network topology; the processor 1002 predicts traffic demands for the network paths based on the network traffic information; determining network resource scheduling information of each network path according to the traffic demand, wherein the network resource scheduling information is used for indicating network resources required by each network path in each time period; and if the network resource scheduling information indicates that at least two network paths exist in the network paths and the network resource requirements are opposite in the same time period, multiplexing the network resources between the at least two network paths in a time division mode.
In one example, the processor 1002 may include baseband circuitry, for example, may data encapsulate, encode, etc. information of the planned second target network path according to a protocol to generate a data packet. The transceiver 1004 may include radio frequency circuits to modulate and amplify the data packets for transmission to the user terminal.
In yet another example, the processor 1002 may run an operating system that controls functions between various devices and means. The transceiver 1004 may include baseband circuitry and radio frequency circuitry, for example, through which data packets may be processed and transmitted to a customer premises or routing node.
The transceiver 1004 and the processor 1002 may implement the corresponding steps in any of the embodiments of fig. 4 to 8, which are not described herein.
It will be appreciated that the network resource scheduling device shown in fig. 10 is simply designed, and in practical application, the network resource scheduling device may include any number of transceivers, processors, memories, etc., and all network resource scheduling devices that may implement the present application are within the scope of protection of the present application.
The processor 1002 in the network resource scheduling device 1000 may be a general-purpose processor, such as a general-purpose Central Processing Unit (CPU), a network processor (network processor, NP), a microprocessor, etc., or may be an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the programs of the present application. But also digital signal processors (digital signal processor, DSP), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The controller/processor may also be a combination that performs the function of a computation, e.g., a combination comprising one or more microprocessors, a combination of a DSP and a microprocessor, etc. Processors typically perform logical and arithmetic operations based on program instructions stored in memory.
The bus 1001 may be a peripheral component interconnect standard (peripheral component interconnect, PCI) bus, an extended industry standard architecture (extended industry standard architecture, EISA) bus, or the like. The bus may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in fig. 10, but not only one bus or one type of bus.
The computer-readable storage media/memory 1003 referred to above may also hold an operating system and other application programs. In particular, the program may include program code including computer-operating instructions. More specifically, the memory may be a read-only memory (ROM), other types of static storage devices that can store static information and instructions, random access memory (random access memory, RAM), other types of dynamic storage devices that can store information and instructions, disk storage, and the like. The memory 1003 may be a combination of the above memory types. And the computer readable storage medium/memory described above may be in the processor, or may be external to the processor, or distributed across multiple entities including the processor or processing circuitry. The above-described computer-readable storage medium/memory may be embodied in a computer program product. For example, the computer program product may include a computer readable medium in a packaging material.
Alternatively, embodiments of the present application also provide a general-purpose processing system, such as a so-called chip, that includes one or more microprocessors that provide processor functions; and an external memory providing at least a portion of the storage medium, all of which are coupled to the other support circuits via an external bus architecture. The instructions stored by the memory, when executed by the processor, cause the processor to perform some or all of the steps of the network resource scheduling apparatus in the network resource scheduling method in the embodiments described in fig. 4-8, and/or other processes for the techniques described herein.
The steps of a method or algorithm described in connection with the disclosure herein may be embodied in hardware, or may be embodied in software instructions executed by a processor. The software instructions may be comprised of corresponding software modules that may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. In addition, the ASIC may reside in a user device. The processor and the storage medium may reside as discrete components in a user device.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The above embodiments are merely for illustrating the technical solution of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions.
Claims (16)
1. A method for scheduling network resources, comprising:
acquiring network flow information of each network path in the network topology;
predicting the flow demand of each network path according to the network flow information;
determining network resource scheduling information of each network path according to the traffic demand, wherein the network resource scheduling information is used for indicating network resources required by each network path in each time period;
and if the network resource scheduling information indicates that at least two network paths exist in the network paths and the network resource requirements are opposite in the same time period, carrying out time division multiplexing on the network resources between the at least two network paths.
2. The method of claim 1, wherein predicting traffic demand for each network path based on the network traffic information comprises:
and predicting the flow demand of each network path by utilizing a neural network artificial intelligence AI algorithm according to the network flow information.
3. The method of claim 1, wherein the at least two network paths are a first network path and a second network path, wherein during a first period of time, network resources of the first network path are expanded, network resources of the second network path are contracted, and wherein time multiplexing network resources between the at least two network paths comprises:
releasing an optical channel data unit ODU occupied by the second network path, and shrinking network resources of the second network path;
and adding an ODU for the first network path, wherein the newly added ODU is the ODU released by the second network path, and expanding network resources of the first network path.
4. The method of claim 1, wherein the at least two network paths are a first network path and a second network path, wherein during a second time period, network resources of the first network path are scaled, network resources of the second network path are scaled, and wherein time multiplexing network resources between the at least two network paths comprises:
Releasing an optical channel data unit ODU occupied by the first network path, and shrinking network resources of the first network path;
and adding an ODU for the second network path, wherein the newly added ODU is the ODU released by the first network path, and expanding network resources of the second network path.
5. The method according to any one of claims 1 to 4, further comprising:
if the flow rate of the first service in the network topology within a first preset time period increases beyond a first preset threshold value, a first target network path is newly built in the network topology;
allocating an ODU for the first target network path;
adjusting the first service to the first target network path;
and deleting the first target network path after the first preset time period is overtime, and releasing the ODU occupied by the first target network path.
6. The method of any of claims 1-4, wherein if the network traffic information is collected network traffic information for a second preset time period, the second preset time period is greater than a second preset threshold, the method further comprising:
if the network path including the routing node useless for the second service exists in the network topology according to the network flow information, re-planning the network path in the network topology to obtain a second target network path;
And feeding back the second target network path to the user terminal.
7. The method of claim 6, wherein the method further comprises:
receiving indication information sent by the user side;
the second target network path is newly established according to the indication information;
allocating an ODU for the second target network path;
and adjusting the second service to the second target network path.
8. A network resource scheduling apparatus, comprising:
the flow acquisition module is used for acquiring network flow information of each network path in the network topology;
the flow prediction module is used for predicting the flow demand of each network path according to the network flow information;
the cross-layer computing module is used for determining network resource scheduling information of each network path according to the traffic demand, wherein the network resource scheduling information is used for indicating network resources required by each network path in each time period;
and the network resource scheduling module is used for carrying out time division multiplexing on network resources between at least two network paths if the network resource scheduling information indicates that the network resource requirements of at least two network paths exist in the network paths within the same time period.
9. The apparatus of claim 8, wherein the traffic prediction module is configured to predict traffic demands of the network paths using a neural network artificial intelligence AI algorithm based on the network traffic information.
10. The apparatus of claim 8, wherein the at least two network paths are a first network path and a second network path, and wherein in a first period of time, network resources of the first network path are expanded, network resources of the second network path are contracted, and the network resource scheduling module is specifically configured to release an optical channel data unit ODU occupied by the second network path, and contract network resources of the second network path;
and adding an ODU for the first network path, wherein the newly added ODU is the ODU released by the second network path, and expanding network resources of the first network path.
11. The apparatus of claim 8, wherein the at least two network paths are a first network path and a second network path, and wherein in a second period of time, network resources of the first network path are scaled, network resources of the second network path are scaled, and the network resource scheduling module is specifically configured to release an optical channel data unit ODU occupied by the first network path, and scale network resources of the first network path; and adding an ODU for the second network path, wherein the newly added ODU is the ODU released by the first network path, and expanding network resources of the second network path.
12. The apparatus according to any one of claims 8 to 11, wherein the network resource scheduling module is further configured to create a first target network path in the network topology if a traffic growth of a first service in the network topology exceeds a first preset threshold within a first preset time period; allocating an ODU for the first target network path; adjusting the first service to the first target network path; and deleting the first target network path after the first preset time period is overtime, and releasing the ODU occupied by the first target network path.
13. The apparatus according to any one of claims 8 to 11, wherein if the network traffic information is collected network traffic information within a second preset time period, the second preset time period being greater than a second preset threshold, the network resource scheduling module is further configured to reprogram the network topology to obtain a second target network path if it is determined from the network traffic information that a network path including routing nodes that are not useful for a second service exists in the network topology;
the device also comprises a sending module, which is used for feeding back the second target network path to the user terminal.
14. The apparatus of claim 13, further comprising a receiving module configured to receive indication information fed back by the user side;
the network resource scheduling module is further configured to newly establish the second target network path according to the indication information; allocating an ODU for the second target network path; and adjusting the second service to the second target network path.
15. A network resource scheduling apparatus comprising at least one processor and a memory for storing computer instructions, the processor invoking the computer instructions in the memory to perform the method of any of claims 1 to 7.
16. A computer readable storage medium storing computer instructions for performing the method of any one of the preceding claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911422173.1A CN113132175B (en) | 2019-12-31 | 2019-12-31 | Network resource scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911422173.1A CN113132175B (en) | 2019-12-31 | 2019-12-31 | Network resource scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113132175A CN113132175A (en) | 2021-07-16 |
| CN113132175B true CN113132175B (en) | 2024-03-26 |
Family
ID=76769679
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911422173.1A Active CN113132175B (en) | 2019-12-31 | 2019-12-31 | Network resource scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113132175B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116016306A (en) * | 2022-12-15 | 2023-04-25 | 中国联合网络通信集团有限公司 | Data traffic forwarding method, device, equipment and storage medium |
| CN116074261A (en) * | 2023-02-20 | 2023-05-05 | 湖北盈隆腾辉科技有限公司 | Big data network communication coordination method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107770084A (en) * | 2016-08-19 | 2018-03-06 | 华为技术有限公司 | The management method and device of a kind of data traffic |
| WO2018153218A1 (en) * | 2017-02-27 | 2018-08-30 | 腾讯科技（深圳）有限公司 | Resource processing method, related apparatus and communication system |
| WO2018210075A1 (en) * | 2017-05-18 | 2018-11-22 | 华为技术有限公司 | Network control method and apparatus, and network device |
| CN109995583A (en) * | 2019-03-15 | 2019-07-09 | 清华大学深圳研究生院 | A kind of scalable appearance method and system of NFV cloud platform dynamic of delay guaranteed |
| WO2019222954A1 (en) * | 2018-05-24 | 2019-11-28 | 华为技术有限公司 | Method for receiving signal and terminal device |
-
2019
- 2019-12-31 CN CN201911422173.1A patent/CN113132175B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107770084A (en) * | 2016-08-19 | 2018-03-06 | 华为技术有限公司 | The management method and device of a kind of data traffic |
| WO2018153218A1 (en) * | 2017-02-27 | 2018-08-30 | 腾讯科技（深圳）有限公司 | Resource processing method, related apparatus and communication system |
| WO2018210075A1 (en) * | 2017-05-18 | 2018-11-22 | 华为技术有限公司 | Network control method and apparatus, and network device |
| WO2019222954A1 (en) * | 2018-05-24 | 2019-11-28 | 华为技术有限公司 | Method for receiving signal and terminal device |
| CN109995583A (en) * | 2019-03-15 | 2019-07-09 | 清华大学深圳研究生院 | A kind of scalable appearance method and system of NFV cloud platform dynamic of delay guaranteed |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113132175A (en) | 2021-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11184289B2 (en) | Systems and methods for managing network traffic with a network operator | |
| US10021172B2 (en) | Software driven long-term-evolution core network for mobile access | |
| US10862818B2 (en) | Systems and methods for distributing network resources to network service providers | |
| US11546806B2 (en) | Communication system | |
| CN106452958B (en) | Flow control method, system and centralized controller | |
| CN110177054B (en) | Port queue scheduling method, device, network controller and storage medium | |
| EP3703316B1 (en) | Frame aggregation in a wireless network | |
| CN104902518A (en) | Devices and method using same EPS bearers in downlink and uplink | |
| Beshley et al. | Method of centralized resource allocation in virtualized small cells network with IoT overlay | |
| CN109756430A (en) | A kind of processing method and processing device of rule | |
| CN113132175B (en) | Network resource scheduling method and device | |
| CN103685072A (en) | Method for quickly distributing network flow | |
| JP2022549683A (en) | Method, device and system for determining required bandwidth for data stream transmission | |
| RU2541861C1 (en) | Method, node device and system for establishing label switched path | |
| EP3002915B1 (en) | Routing in dependence of the application | |
| CN113543210B (en) | 5G-TSN cross-domain QoS and resource mapping method, equipment and computer readable storage medium | |
| CN104753823A (en) | Service quality reservation establishing method and node | |
| CN113228592B (en) | Method and apparatus for providing transport context and on-path metadata to support 5G-enabled networks | |
| CN115714749A (en) | End-to-end data determination method, device and system and electronic equipment | |
| Rahbar | Quality of service in optical packet switched networks | |
| CN109818772B (en) | Network performance guarantee method and device | |
| KR20120055947A (en) | Method and apparatus for providing Susbscriber-aware per flow | |
| US20210351954A1 (en) | Multicast distribution tree allocation using machine learning | |
| JP5937042B2 (en) | TDM network system and scheduling method thereof | |
| EP4319225A1 (en) | Service-based clustering determination for 5g deployment in factories |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |