CN112804162B - Scheduling method, scheduling device, terminal equipment and storage medium - Google Patents
Scheduling method, scheduling device, terminal equipment and storage medium Download PDFInfo
- Publication number
- CN112804162B CN112804162B CN201911106118.1A CN201911106118A CN112804162B CN 112804162 B CN112804162 B CN 112804162B CN 201911106118 A CN201911106118 A CN 201911106118A CN 112804162 B CN112804162 B CN 112804162B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- message
- basic unit
- service
- scheduling basic
- 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 59
- 238000013507 mapping Methods 0.000 claims description 23
- 238000004590 computer program Methods 0.000 claims description 8
- 238000007726 management method Methods 0.000 description 12
- 238000004891 communication Methods 0.000 description 8
- 238000012545 processing Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 241000422846 Sequoiadendron giganteum Species 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000019800 disodium phosphate Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000007711 solidification Methods 0.000 description 1
- 230000008023 solidification Effects 0.000 description 1
- 230000001960 triggered effect Effects 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/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/627—Queue scheduling characterised by scheduling criteria for service slots or service orders policing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
Abstract
The application provides a scheduling method, a scheduling device, terminal equipment and a storage medium, wherein the method comprises the steps of obtaining a message; configuring a scheduling basic unit strategy group; and scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue. The method can realize flexible dispatching of the messages.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a scheduling method, a scheduling device, a terminal device, and a storage medium.
Background
In a communication network, in order to realize the fine distinction between different users and various services, a hierarchical scheduling management mode is required. In order to support different demands of users on different services such as voice, video and data, the network is required to distinguish different services corresponding to the messages corresponding to the users, so as to provide corresponding services for the users. With the rapid development of networks and the greater demands of users for network traffic and its quality of service, the future division of network traffic will be finer.
However, the current hierarchical scheduling method mainly adopts solidified hierarchical service quality (Hierarchical Quality of Service, HQoS), and the method can divide the scheduling queue into a plurality of levels, but the levels are all fixed, namely, a pseudo-wire level, a tunnel level, a VLAN sub-interface level, a port level and the like, so that the requirement of the existing user on finer granularity of service requirements cannot be met, and the scheduling flexibility of messages corresponding to the user is poor.
Disclosure of Invention
The application provides a scheduling method, a scheduling device, terminal equipment and a storage medium, which can realize flexible scheduling of messages.
The embodiment of the application provides a scheduling method, which comprises the following steps:
obtaining a message;
configuring a scheduling basic unit strategy group;
and scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue.
Optionally, the configuring the scheduling basic unit policy group includes:
determining service information corresponding to the message, wherein the service information comprises service types and service layer times;
selecting scheduling basic units corresponding to the service types, wherein the number of selected scheduling basic units is determined by the service hierarchy number;
based on the mapping relation between the selected scheduling basic units, the selected scheduling basic units are connected in series to obtain a scheduling basic unit strategy group.
Optionally, the method further comprises:
determining the level information corresponding to the selected scheduling basic unit;
determining a mapping relation among the selected scheduling basic units based on the information of each level;
wherein the hierarchy information identifies at least one of the following information: hierarchical information; identification information of a scheduling basic unit corresponding to the father node; identification information of the scheduling basic unit corresponding to the child node.
Optionally, the number of the selected service layers is greater than or equal to the number of service layers.
Optionally, the scheduling the packet based on the scheduling basic unit policy group, the port corresponding to the packet, and the flow queue includes:
and after the scheduling basic unit strategy group is connected in series to the port and the flow queue corresponding to the message, scheduling the message.
Optionally, the number of the scheduling basic unit policy groups is at least one.
Optionally, the number of the scheduling basic unit policy groups is the same as the number of the service information included in the message.
The embodiment of the application provides a scheduling device, which comprises:
the acquisition module is used for acquiring the message;
the configuration module is set to configure the scheduling basic unit strategy group;
and the scheduling module is used for scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue.
The embodiment of the application provides a terminal device, which comprises:
one or more processors;
a storage means for storing one or more programs;
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement any of the methods of the embodiments of the present application.
The present embodiments provide a storage medium storing a computer program that, when executed by a processor, implements any of the methods of the embodiments of the present application.
With respect to the above examples and other aspects of the present application and their implementation, further description is provided in the accompanying description, detailed description and claims.
Drawings
Fig. 1 is a flow chart of a scheduling method according to a first embodiment of the present application;
fig. 2 is a flow chart of a scheduling method according to a second embodiment of the present application;
fig. 2a is a flow chart of yet another scheduling method according to the second embodiment provided in the present application;
fig. 3 is a schematic structural diagram of a scheduling device according to a third embodiment of the present application;
fig. 4 is a schematic structural diagram of a terminal device according to a fourth embodiment of the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the present application more apparent, embodiments of the present application will be described in detail hereinafter with reference to the accompanying drawings. It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be arbitrarily combined with each other.
The steps illustrated in the flowchart of the figures may be performed in a computer system, such as a set of computer-executable instructions. Also, while a logical order is depicted in the flowchart, in some cases, the steps depicted or described may be performed in a different order than presented herein.
Example 1
Fig. 1 is a flow chart of a scheduling method provided in the first embodiment of the present application, where the method may be suitable for a case of scheduling a packet, and the method may be performed by a scheduling device, where the device may be implemented by software and/or hardware and is integrated on a terminal device.
The present application may be considered to relate to the field of packet switched transmission communication, and the scheduling method provided by the present application may be considered to be a flexible hierarchical scheduling method, and relates to a hierarchical scheduling queue in an ethernet switching device, so as to implement that multi-user multi-service bandwidth can be ensured.
In the related art, in order to achieve the purpose of hierarchical scheduling, an HQoS method is mainly adopted, and the HQoS is based on a hierarchical tree structure. The tree structure is called because the mapping relation of each level is like a big tree from bottom to top, the child node scheduling queue is the lower part of the big tree, and the father node scheduling queue is the upper part of the big tree. The parent node is a convergence point of a plurality of child nodes, and therefore the parent node can distribute traffic to scheduling queues on the child nodes according to a certain scheduling algorithm. The more services the user needs, the more scheduling queues on the child nodes are embodied; the finer the granularity of traffic for the user needs, the more scheduling levels on the child nodes. Conventional HQoS has an advantage of realizing multi-level traffic management by management of different scheduling queues, but there is also a disadvantage of supporting limited scheduling levels and not supporting finer granularity of traffic division in the current application.
In future traffic management of networks, there is an increasing demand for increased granularity of traffic divisions. However, the conventional HQoS is limited by the solidification of service hierarchy, and cannot meet the requirement of the existing user on finer granularity of service requirements.
In order to overcome the defect of insufficient granularity of the existing hierarchical scheduling, the application provides a flexible hierarchical scheduling method, the relation between each hierarchy is not a solidified father-son node, each scheduling basic unit between a port hierarchy and a message queue (namely a flow queue) is a parallel and equivalent relation, and resources of each scheduling basic unit are uniformly managed. The up-down mapping relation between each level can be embodied by sequentially superposing each scheduling basic unit, so that the purpose of finer service management granularity is realized. Different scheduling basic units can correspondingly have different scheduling algorithms, and are not limited herein, and the different scheduling basic units can realize scheduling of different services.
Specifically, as shown in fig. 1, the scheduling method provided in the present application includes S110, S120, and S130.
S110, obtaining the message.
The message may be information sent by the user through the user equipment and received through the ethernet port. The port and the flow queue corresponding to the message can be determined by analyzing the message, and the port receives the message for scheduling processing and then transmits the message to the corresponding flow queue.
For example, the header of the message may be parsed to determine the corresponding port and flow queue; the message flow consumption can also be judged to determine the corresponding port and flow queue. If the messages with the same flow consumption correspond to the same port and flow queue. Different traffic may correspond to different flow queues. After the message is scheduled, the data corresponding to different services can be transmitted to the corresponding flow queues for processing.
S120, configuring a scheduling basic unit strategy group.
The method and the device can flexibly configure and schedule the basic unit policy group. Wherein the scheduling base unit policy group may be a link consisting of at least one scheduling base unit. The scheduling basic unit policy group can realize hierarchical scheduling of the messages.
In one example, the present application may configure a scheduling base unit policy group receiving a user-triggered configuration instruction. Wherein the configuration instructions may be for configuring at least one of: the scheduling basic unit policy group comprises identification information of the scheduling basic units, the number of the included scheduling basic units, the number of business layers and the link relation among the scheduling basic units. The configuration instructions may correspond to respective triggering methods in the case of including different information, which is not limited herein. The link relation between the scheduling basic units can be a parent-child relation between the scheduling basic units, namely, the scheduling basic unit included in a parent node of one scheduling basic unit and the scheduling basic unit included in a child node of the one scheduling basic unit.
The method and the device can select the corresponding scheduling basic unit based on the identification information in the configuration instruction; and then linking the dispatching basic units based on the linking relation of the dispatching basic units to obtain a dispatching basic unit policy group. The number of layers formed by the links may be indicated by the number of service levels in the configuration instruction. The number of service layers may be the number of levels included in the scheduling base unit policy group when implementing scheduling of the message. Based on different link relations among different scheduling basic units, each scheduling basic unit is linked so as to ensure that the number of layers formed after linking is the same as the number of business layers.
In one example, the present application may configure a scheduling base unit policy group based on messages, and different messages may correspond to different scheduling base unit policy groups.
Specifically, the service information of the message can be analyzed to determine the corresponding scheduling basic unit, and then the determined scheduling basic units are linked to form a scheduling basic unit policy group. The service information may represent the service types and service layer times contained in the message, that is, the message contains which service types and service layer times required by the user. The number of layer levels of the scheduling base unit policy group may be determined by the number of service layers.
In one embodiment, the link relation between the scheduling basic units may be stored in advance in the terminal device implementing the method of the present application. Specifically, each scheduling basic unit may store a scheduling basic unit included in a parent node thereof, such as a scheduling basic unit included in a previous level; a scheduling basic unit included in its child node may also be stored, as is a scheduling basic unit included in the next level.
The link relation of each scheduling basic unit in the present application may be determined based on a scheduling algorithm corresponding to each scheduling basic unit, which is not limited herein.
It should be noted that, in the case of configuring the scheduling basic unit policy group, the scheduling basic unit included in the scheduling basic unit policy group may be determined according to the service included in the packet. And selecting a scheduling basic unit corresponding to the service after determining the service included in the message, and obtaining a scheduling basic unit policy group by linking. In the case of configuring the scheduling base unit by the user, the user may directly select the corresponding scheduling base unit based on his desired service. The method and the device can receive the configuration instruction, analyze the identification information of the scheduling basic units contained in the configuration instruction, and select the corresponding scheduling basic units based on the identification information to obtain the scheduling basic unit policy group. The identification information and the scheduling basic unit can be in one-to-one correspondence.
By analyzing the message, the method and the device determine the corresponding scheduling basic unit strategy group, so that the scheduling is more flexible.
S130, scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue.
After the scheduling basic unit policy group is configured, the method and the device can schedule the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue corresponding to the message. The message is transmitted to the scheduling basic unit policy group through the port to perform hierarchical scheduling, and the scheduled data is subjected to subsequent processing through the flow queue, so that the subsequent processing of the scheduled data after the flow queue is not limited.
The application provides a scheduling method, firstly, a message is acquired; then configuring a scheduling basic unit strategy group; and finally, scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue, and using the method to solve the hierarchical limitation between the flow queue and the port, so that the message can be flexibly scheduled.
On the basis of the above embodiments, modified embodiments of the above embodiments are proposed, and it is to be noted here that only the differences from the above embodiments are described in the modified embodiments for the sake of brevity of description.
In one embodiment, the number of the scheduling basic unit policy groups is at least one; the number of the scheduling basic unit strategy groups is determined by the message.
The number of the required scheduling basic unit groups can be carried in the message, the carrying mode is not limited, the number of the required scheduling basic unit groups can be directly carried, and other information indication such as service information can be also carried.
In one embodiment, the number of the scheduling basic unit policy groups is the same as the number of the service information included in the message.
After the message is analyzed, the number of the scheduling basic unit policy groups required by scheduling the message can be determined. The number of layers per schedule base unit policy group may be different.
The number of service layers and the corresponding service type required by the message can be determined by analyzing the message, and one service layer number and the corresponding service type can be one service information. Different service information may indicate different service layer times and corresponding service types. One service information may correspond to one scheduling basic unit policy group.
In one example, the message includes two service information, the number of service layers in one service information is 3, and the corresponding service types include voice, video and data. The number of service layers in the other service information is 2, and the corresponding service types comprise voice and video. The method and the device can form corresponding scheduling basic unit strategy groups based on different service information, and the number of the scheduling basic unit strategy groups can be the same as the number of the service information.
Example 2
Fig. 2 is a flow chart of a scheduling method according to a second embodiment of the present application, where the second embodiment is optimized based on the foregoing embodiments. In this embodiment, the configuration scheduling basic unit policy group is further specified as: determining service information corresponding to the message, wherein the service information comprises service types and service layer times; selecting scheduling basic units corresponding to the service types, wherein the number of selected scheduling basic units is determined by the service hierarchy number; based on the mapping relation between the selected scheduling basic units, the selected scheduling basic units are connected in series to obtain a scheduling basic unit strategy group.
Further, in this embodiment, the scheduling of the packet is further specified based on the scheduling basic unit policy group, the port corresponding to the packet, and the flow queue, which is further specified as: and after the scheduling basic unit strategy group is connected in series to the port and the flow queue corresponding to the message, scheduling the message. For details not yet described in detail in this embodiment, refer to embodiment one.
As shown in fig. 2, a scheduling method provided in a second embodiment of the present application includes the following steps:
s210, acquiring a message.
S220, determining service information corresponding to the message, wherein the service information comprises service types and service layer times.
The service information can be carried in a message, the message is analyzed to obtain the service information, and the position of the service information in the message is not limited. Traffic information may be understood as information indicating the configuration of a scheduling base unit policy group. The service type may be understood as the type of service that the message includes. The number of business layers can be the level occupied by the scheduling basic unit policy group
S230, selecting the dispatching basic units corresponding to the service types, wherein the number of the selected dispatching basic units is determined by the service hierarchy number.
S240, based on the mapping relation among the selected scheduling basic units, the selected scheduling basic units are connected in series to obtain a scheduling basic unit strategy group.
S250, after the scheduling basic unit strategy group is connected in series to the port and the flow queue corresponding to the message, the message is scheduled.
The following describes an exemplary scheduling method provided in the embodiments of the present application:
the scheduling method provided by the application can be regarded as a flexible hierarchical scheduling method, and comprises the following steps:
the first step: any scheduling basic unit is selected from the scheduling basic unit resource pool, the relation between the flow queue and the father-son node of the scheduling basic unit is determined, the relation between the flow queue and the father-son node of the flow queue can be determined based on a scheduling algorithm corresponding to the scheduling basic unit, and the father-son node relation can be configured by a user.
The scheduling basic unit resource pool can comprise at least one scheduling basic unit, and can meet the requirements of all users.
And a second step of: and determining the port number to be mapped by the message scheduling queue according to the configured port attribute of the message. The message, the port and the flow queue have corresponding relation. The corresponding relation can be configured by a user, and can also analyze and determine the business information of the message. The port number to be mapped by the message scheduling queue may be considered as the port corresponding to the message. The message scheduling queue is a stream queue.
And a third step of: according to the user service requirement, one, two or more scheduling basic units can be selected from the scheduling basic unit resource pool to carry out the concatenation of the mapping relation, and the concatenation combination of different scheduling basic units forms a scheduling basic unit strategy group.
The selected dispatching basic unit corresponds to the service requirement of the user and can complete corresponding service distribution.
Fourth step: and flexibly selecting a scheduling strategy from the scheduling basic unit strategy groups according to the service demands of the users.
And thirdly, selecting a plurality of scheduling basic unit strategy groups according to the user service demands, wherein the step can flexibly select a scheduling strategy from the formed scheduling basic unit strategy groups according to the user service demands to finish scheduling the message. Different scheduling primitives may correspond to different scheduling policies.
Fifth step: and respectively determining the serial connection relation between the ports analyzed by the flow queues and the scheduling policy groups by the selected scheduling basic unit policy groups, thereby realizing the aim of finer hierarchical scheduling management division between the flow queues and the port hierarchy.
After the scheduling basic unit strategy group is selected, the scheduling basic unit strategy group is connected in series between the port and the flow queue based on the series connection relation so as to schedule the message. The tandem relationship may be user configurable.
The message in the application can be transmitted to the scheduling basic unit policy group through the port and then transmitted to the flow queue to complete the scheduling. Compared with the related technology, the method has better flexibility, and simultaneously solves the level limitation of the virtual queues between the flow queues and the ports, and theoretically, the basic scheduling unit resources can realize the serial connection of the levels, namely the scheduling of the levels can be realized, so that the scheduling management granularity of the messages is finer.
Fig. 2a is a flow chart of yet another scheduling method according to the second embodiment provided in the present application. Referring to fig. 2a, before scheduling, a mapping relationship module may be configured by a user, and the mapping relationship module may be used to configure a flow queue, a port, and a link relationship between individual scheduling base units. The scheduling base unit policy group may be formed by linking individual scheduling base units to form a link. At least one scheduling base unit policy group may be included between the port and the flow queue according to user traffic demand. The scheduling basic unit management module can allocate and manage resources for all scheduling basic units. Specifically, a mapping relation between a flow queue and a port is obtained, a link relation among the flow queue, a scheduling basic unit and the port is configured according to the mapping relation, and the scheduling basic unit is selected from a scheduling basic unit resource management module to form a link from the flow queue to the port. The scheduling base unit resource pool may be included in a scheduling base unit resource management module.
The number of the dispatching basic units can directly determine the number of dispatching layers from the flow queue to the port, namely the number of service layers, and the flexible quantity configuration enables the layers to be more flexible.
The scheduling method specifically comprises the following steps:
step 001, a user configures a message port mapping from a standard Ethernet port, namely firstly, the number of an outgoing port pointed by a flow queue corresponding to the message, such as a port A, is defined;
step 002, according to the output port number pointed by the flow queue configured by the user, determining the port to be connected in series by the flow queue through the configuration mapping relation module;
more specifically, the correspondence between the packet, the port, and the flow queue may be configured by the user.
Step 003, the user can flexibly configure the service layer times, and select a corresponding number of scheduling basic units from the scheduling basic unit resource management module according to the service layer times, wherein each scheduling basic unit is mutually independent and is only distinguished by a number, and the service layer times of the user configuration are read from the configuration mapping relation module;
step 004, according to the read configuration mapping relation of the dispatching basic units, each dispatching basic unit is connected in series according to the form of father-son nodes to form a dispatching basic unit strategy group;
the mapping may be stored in a mapping module, determined by the user.
And 005, connecting the scheduling basic unit strategy group in series between the flow queue and the corresponding port to form hierarchical scheduling management of the virtual queue.
The virtual queues may be queues between scheduling base unit policy groups.
The scheduling method provided by the second embodiment of the application embodies the operation of configuring the scheduling basic unit policy group and scheduling the message, and by using the method, flexible hierarchical scheduling of the message can be effectively realized, and the scheduling efficiency is improved.
On the basis of the above embodiments, modified embodiments of the above embodiments are proposed, and it is to be noted here that only the differences from the above embodiments are described in the modified embodiments for the sake of brevity of description.
In one embodiment, the method further comprises:
determining the level information corresponding to the selected scheduling basic unit;
determining a mapping relation among the selected scheduling basic units based on the information of each level;
wherein the hierarchy information identifies at least one of the following information: hierarchical information; identification information of a scheduling basic unit corresponding to the father node; identification information of the scheduling basic unit corresponding to the child node.
When the link between the scheduling base units is performed, the link may be implemented based on hierarchical information of each scheduling base unit.
The hierarchy information may represent information of a scheduling base unit hierarchy. The hierarchy information may be information of a hierarchy where the corresponding scheduling basic unit is located. Such as scheduling the base unit to layer 3. The identification information of the scheduling basic unit corresponding to the parent node may be information identifying the scheduling basic unit included in the parent node. The identification information of the scheduling basic unit corresponding to the child node may be information for identifying the scheduling basic unit included in the child node. Each scheduling base unit may have a corresponding identification information. Such as scheduling base unit 1, scheduling base unit 2 and scheduling base unit 3. The scheduling basic unit corresponding to the parent node of the scheduling basic unit 1 includes the scheduling basic unit 2 and the scheduling basic unit 3, so the hierarchy information includes identification information of the scheduling basic unit 2 and the scheduling basic unit 3.
In one example, the scheduling base units may be linked based on the hierarchy information to obtain a scheduling base unit policy group.
In one example, the identification information of the scheduling basic unit corresponding to the parent node is based; the identification information of the scheduling basic units corresponding to the child nodes can link the scheduling basic units to obtain a scheduling basic unit policy group.
In one embodiment, the number of choices is greater than or equal to the number of service layers.
The number of the selected dispatching basic units is larger than or equal to the number of service layers, so that the dispatching can be realized more rapidly on the premise of meeting the number of service layers.
Example III
Fig. 3 is a schematic structural diagram of a scheduling apparatus according to a third embodiment of the present application, where the apparatus may be integrated on a terminal device, as shown in fig. 3, and the apparatus includes: an acquisition module 31 configured to acquire a message; a configuration module 32 arranged to configure a scheduling base unit policy group; the scheduling module 33 is configured to schedule the packet based on the scheduling basic unit policy group, the port corresponding to the packet, and the flow queue.
The scheduling device provided in this embodiment is used to implement the scheduling method in this embodiment, and the implementation principle and technical effects of the scheduling device provided in this embodiment are similar to those of the scheduling method in this embodiment, and are not described herein again.
On the basis of the above embodiments, modified embodiments of the above embodiments are proposed, and it is to be noted here that only the differences from the above embodiments are described in the modified embodiments for the sake of brevity of description.
In one embodiment, the configuration module 32 specifically includes:
determining service information corresponding to the message, wherein the service information comprises service types and service layer times;
selecting scheduling basic units corresponding to the service types, wherein the number of selected scheduling basic units is determined by the service hierarchy number;
based on the mapping relation between the selected scheduling basic units, the selected scheduling basic units are connected in series to obtain a scheduling basic unit strategy group.
In one embodiment, the apparatus further comprises: a determining module configured to: determining the level information corresponding to the selected scheduling basic unit; determining a mapping relation among the selected scheduling basic units based on the information of each level;
wherein the hierarchy information identifies at least one of the following information: hierarchical information; identification information of a scheduling basic unit corresponding to the father node; identification information of the scheduling basic unit corresponding to the child node.
In one embodiment, the number of choices is greater than or equal to the number of service layers.
In one embodiment, the scheduling module 33 specifically includes:
and after the scheduling basic unit strategy group is connected in series to the port and the flow queue corresponding to the message, scheduling the message.
In one embodiment, the number of the scheduling basic unit policy groups is at least one.
In one embodiment, the number of the scheduling basic unit policy groups is the same as the number of the service information included in the message.
Example IV
Fig. 4 is a schematic structural diagram of a terminal device according to a fourth embodiment of the present application, and as shown in fig. 4, the terminal device provided in the present application includes one or more processors 41 and a storage device 42; the number of processors 41 in the terminal device may be one or more, one processor 41 being taken as an example in fig. 4; the storage device 42 is used for storing one or more programs; the one or more programs are executed by the one or more processors 41, causing the one or more processors 41 to implement the methods as described in embodiments of the present application.
The terminal device further includes: a communication means 43, an input means 44 and an output means 45.
The processor 41, the storage means 42, the communication means 43, the input means 44 and the output means 45 in the terminal device may be connected by a bus or other means, in fig. 4 by way of example.
The input means 44 may be used to receive entered numeric or character information and to generate key signal inputs related to user settings and function control of the terminal device. The output means 45 may comprise a display device such as a display screen.
The communication device 43 may include a receiver and a transmitter. The communication device 43 is provided to perform information transmission and reception communication according to the control of the processor 41. The information includes, but is not limited to, messages.
The storage device 42, which is a computer readable storage medium, may be configured to store a software program, a computer executable program, and program instructions/modules (e.g., the acquisition module 31, the configuration module 32, and the scheduling module 33 in the scheduling device) corresponding to the method according to the embodiments of the present application. The storage device 42 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, at least one application program required for a function; the storage data area may store data created according to the use of the terminal device, etc. In addition, the storage 42 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, the storage 42 may further include memory remotely located with respect to the processor 41, which may be connected to the terminal device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
Example five
The fifth embodiment of the present application further provides a storage medium, where a computer program is stored, where the computer program is executed by a processor to implement the method of any one of the embodiments of the present application. The method comprises the following steps: obtaining a message; configuring a scheduling basic unit strategy group; and scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue.
Any combination of one or more computer readable media may be employed as the computer storage media of the embodiments herein. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access Memory (Random Access Memory, RAM), a Read-Only Memory (ROM), an erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), a flash Memory, an optical fiber, a portable CD-ROM, an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. A computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to: electromagnetic signals, optical signals, or any suitable combination of the preceding. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, radio Frequency (RF), and the like, or any suitable combination of the foregoing.
Computer program code for carrying out operations of the present application may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The foregoing is merely exemplary embodiments of the present application and is not intended to limit the scope of the present application.
It will be appreciated by those skilled in the art that the term terminal device encompasses any suitable type of user equipment, such as a mobile telephone, a portable data processing device, a portable web browser or a car mobile station.
In general, the various embodiments of the application may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the application is not limited thereto.
Embodiments of the present application may be implemented by a data processor of a mobile device executing computer program instructions, e.g. in a processor entity, either in hardware, or in a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (Instruction Set Architecture, ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages.
The block diagrams of any logic flow in the figures of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored on a memory. The Memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), optical Memory devices and systems (digital versatile Disk (Digital Video Disc, DVD) or Compact Disk (CD)), and the like. The computer readable medium may include a non-transitory storage medium. The data processor may be of any type suitable to the local technical environment, such as, but not limited to, general purpose computers, special purpose computers, microprocessors, digital signal processors (Digital Signal Processing, DSPs), application specific integrated circuits (Application Specific Integrated Circuit, ASICs), programmable logic devices (Field-Programmable Gate Array, FGPA), and processors based on a multi-core processor architecture.
By way of exemplary and non-limiting example, a detailed description of exemplary embodiments of the present application has been provided above. Various modifications and adaptations to the above embodiments may become apparent to those skilled in the art without departing from the scope of the present application, as considered in conjunction with the accompanying drawings and claims. Accordingly, the proper scope of the present application is to be determined according to the claims.
Claims (9)
1. A scheduling method, comprising:
obtaining a message;
configuring a scheduling basic unit strategy group;
scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue;
the configuration scheduling basic unit policy group comprises:
determining service information corresponding to the message, wherein the service information comprises service types and service layer times;
selecting scheduling basic units corresponding to the service types, wherein the number of selected scheduling basic units is determined by the service hierarchy number;
based on the mapping relation between the selected scheduling basic units, the selected scheduling basic units are connected in series to obtain a scheduling basic unit strategy group.
2. The method as recited in claim 1, further comprising:
determining the level information corresponding to the selected scheduling basic unit;
determining a mapping relation among the selected scheduling basic units based on the information of each level;
wherein the hierarchy information identifies at least one of the following information: hierarchical information; identification information of a scheduling basic unit corresponding to the father node; identification information of the scheduling basic unit corresponding to the child node.
3. The method of claim 1, wherein the number of selections is greater than or equal to the number of service layers.
4. The method of claim 1, wherein the scheduling the packet based on the scheduling base unit policy group, the port corresponding to the packet, and the flow queue comprises:
and after the scheduling basic unit strategy group is connected in series to the port and the flow queue corresponding to the message, scheduling the message.
5. The method of claim 1, wherein the number of scheduling base unit policy groups is at least one.
6. The method of claim 1, wherein the number of scheduling base unit policy groups is the same as the number of service information included in the message.
7. A scheduling apparatus, comprising:
the acquisition module is used for acquiring the message;
the configuration module is set to configure the scheduling basic unit strategy group;
the scheduling module is arranged for scheduling the message based on the scheduling basic unit policy group, the port corresponding to the message and the flow queue;
the configuration module specifically comprises:
determining service information corresponding to the message, wherein the service information comprises service types and service layer times;
selecting scheduling basic units corresponding to the service types, wherein the number of selected scheduling basic units is determined by the service hierarchy number;
based on the mapping relation between the selected scheduling basic units, the selected scheduling basic units are connected in series to obtain a scheduling basic unit strategy group.
8. A terminal device, comprising:
one or more processors;
a storage means for storing one or more programs;
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-6.
9. A storage medium storing a computer program which, when executed by a processor, implements the method of any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911106118.1A CN112804162B (en) | 2019-11-13 | 2019-11-13 | Scheduling method, scheduling device, terminal equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911106118.1A CN112804162B (en) | 2019-11-13 | 2019-11-13 | Scheduling method, scheduling device, terminal equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112804162A CN112804162A (en) | 2021-05-14 |
| CN112804162B true CN112804162B (en) | 2024-04-09 |
Family
ID=75803140
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911106118.1A Active CN112804162B (en) | 2019-11-13 | 2019-11-13 | Scheduling method, scheduling device, terminal equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112804162B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114513464B (en) * | 2021-12-31 | 2024-03-29 | 深圳市联洲国际技术有限公司 | Traffic load balancing scheduling method, device, equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102594654A (en) * | 2011-01-17 | 2012-07-18 | 中兴通讯股份有限公司 | Method and device for queue scheduling |
| CN103152289A (en) * | 2013-01-28 | 2013-06-12 | 中兴通讯股份有限公司 | Hierarchical service quality scheduling method and device |
| CN105634983A (en) * | 2014-10-30 | 2016-06-01 | 中兴通讯股份有限公司 | Queue dispatching method and device |
| WO2017045501A1 (en) * | 2015-09-15 | 2017-03-23 | 深圳市中兴微电子技术有限公司 | Packet scheduling method and apparatus, and storage medium |
| CN107483361A (en) * | 2016-06-08 | 2017-12-15 | 中兴通讯股份有限公司 | A kind of scheduling model construction method and device |
| WO2018149102A1 (en) * | 2017-02-20 | 2018-08-23 | 深圳市中兴微电子技术有限公司 | Method and device for reducing transmission latency of high-priority data, and storage medium |
| CN108696456A (en) * | 2017-04-12 | 2018-10-23 | 中兴通讯股份有限公司 | A kind of HQoS resource regulating methods, equipment and system |
| CN109768927A (en) * | 2019-01-31 | 2019-05-17 | 新华三技术有限公司 | A kind of HQoS implementation method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8848723B2 (en) * | 2010-05-18 | 2014-09-30 | Lsi Corporation | Scheduling hierarchy in a traffic manager of a network processor |
| WO2013113396A1 (en) * | 2012-02-02 | 2013-08-08 | Huawei Technologies Co., Ltd. | Traffic scheduling device |
-
2019
- 2019-11-13 CN CN201911106118.1A patent/CN112804162B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102594654A (en) * | 2011-01-17 | 2012-07-18 | 中兴通讯股份有限公司 | Method and device for queue scheduling |
| CN103152289A (en) * | 2013-01-28 | 2013-06-12 | 中兴通讯股份有限公司 | Hierarchical service quality scheduling method and device |
| CN105634983A (en) * | 2014-10-30 | 2016-06-01 | 中兴通讯股份有限公司 | Queue dispatching method and device |
| WO2017045501A1 (en) * | 2015-09-15 | 2017-03-23 | 深圳市中兴微电子技术有限公司 | Packet scheduling method and apparatus, and storage medium |
| CN107483361A (en) * | 2016-06-08 | 2017-12-15 | 中兴通讯股份有限公司 | A kind of scheduling model construction method and device |
| WO2018149102A1 (en) * | 2017-02-20 | 2018-08-23 | 深圳市中兴微电子技术有限公司 | Method and device for reducing transmission latency of high-priority data, and storage medium |
| CN108696456A (en) * | 2017-04-12 | 2018-10-23 | 中兴通讯股份有限公司 | A kind of HQoS resource regulating methods, equipment and system |
| CN109768927A (en) * | 2019-01-31 | 2019-05-17 | 新华三技术有限公司 | A kind of HQoS implementation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112804162A (en) | 2021-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109845303B (en) | Management method and management unit for network slices | |
| CN110896355B (en) | Network slice selection method and device | |
| US10034222B2 (en) | System and method for mapping a service-level topology to a service-specific data plane logical topology | |
| CN109906585B (en) | Network slice management method, management unit and system | |
| CN111010702B (en) | Time delay sensitive network communication method and device thereof | |
| CN113037657B (en) | Traffic scheduling method and device, electronic equipment and computer readable medium | |
| CN104104620A (en) | Virtual enhanced transmission selection (VETS) for lossless ethernet | |
| CN112039796B (en) | Data packet transmission method and device, storage medium and electronic equipment | |
| CN112019363B (en) | Method, device and system for determining service transmission requirement | |
| CN112003787A (en) | Routing path determining method, device, control equipment and storage medium | |
| CN110390493B (en) | Task management method and device, storage medium and electronic equipment | |
| CN114466226B (en) | Bandwidth duration duty cycle determination method, device, equipment and computer readable medium | |
| CN112583734A (en) | Burst flow control method and device, electronic equipment and storage medium | |
| CN112804162B (en) | Scheduling method, scheduling device, terminal equipment and storage medium | |
| CN110768903A (en) | Method, device, terminal and storage medium for optimizing network connection | |
| CN108604996B (en) | Strategy transmission method and device in NFV system | |
| Kljaić et al. | The challenge of cellular cooperative ITS services based on 5G communications technology | |
| CN115426320B (en) | Secure resource scheduling method and device, electronic equipment and storage medium | |
| CN115226195A (en) | Communication method, device and system | |
| CN114079634B (en) | Message forwarding method and device and computer readable storage medium | |
| CN116074784A (en) | Vehicle-mounted data transmission method and device and storage medium | |
| CN112231096A (en) | Method, system, equipment and medium for task balancing of FPGA (field programmable Gate array) pooled resources | |
| CN116436806B (en) | Method and device for arranging computing network resources, electronic equipment and computer storage medium | |
| US11757707B2 (en) | Network assurance for 5G enterprise networks | |
| CN114050966B (en) | Method, device and equipment for generating service template and storage medium |
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 |