WO2020207469A1 - 业务处理方法及装置 - Google Patents

业务处理方法及装置 Download PDF

Info

Publication number
WO2020207469A1
WO2020207469A1 PCT/CN2020/084183 CN2020084183W WO2020207469A1 WO 2020207469 A1 WO2020207469 A1 WO 2020207469A1 CN 2020084183 W CN2020084183 W CN 2020084183W WO 2020207469 A1 WO2020207469 A1 WO 2020207469A1
Authority
WO
WIPO (PCT)
Prior art keywords
message
urgency
information
initial
node
Prior art date
Application number
PCT/CN2020/084183
Other languages
English (en)
French (fr)
Inventor
魏含宇
胡寅亮
陈昊
韩磊
邱为
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2020207469A1 publication Critical patent/WO2020207469A1/zh

Links

Images

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/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/56—Queue scheduling implementing delay-aware 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/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/6235—Variable service order
    • 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
    • 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
    • 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/74—Admission control; Resource allocation measures in reaction to resource unavailability
    • H04L47/745—Reaction in network

Definitions

  • This application relates to the field of communication technology, and in particular to a service processing method and device.
  • Time Sensitive Network can be deployed in places where there is a clear time requirement for data message forwarding, such as industrial manufacturing sites, audio and video recording sites, and inside large aircraft.
  • TSN Time Sensitive Network
  • the forwarding node needs to control the forwarding delay within a few microseconds when forwarding data packets of such services.
  • this kind of service with clear requirements for forwarding delay is called time-sensitive service.
  • the forwarding node in the TSN includes multiple forwarding queues. According to the forwarding delay required by each service and the estimated arrival time of the data message of each service, configure the corresponding start time and end time for each forwarding queue.
  • each sending node can send the data message of the corresponding service according to the sending time period allocated for the data message of each service, thereby staggering the sending time of the data message of each service.
  • the forwarding node can buffer the data message of each service in a forwarding queue that matches the arrival time of the corresponding data message and the required forwarding delay. After that, when the opening time of the forwarding queue arrives, the forwarding node can forward the data message buffered in the forwarding queue, so as to ensure that the forwarding delay of the data message of each service at the forwarding node meets the requirements.
  • each sending node in the TSN and the forwarding nodes passing by each service must perform strict cooperation and precise cooperation in each transmission cycle. In order to maintain the consistency of the configuration and actions of each node, it is difficult to implement.
  • the present application provides a service processing method and device, which can be used to solve the problem of relatively difficult implementation caused by the need to maintain consistency in configuration and action of each node in the TSN when forwarding time-sensitive services in related technologies.
  • the technical solution is as follows:
  • a service processing method comprising: receiving a first message; according to the current urgency information of the first message at the current node and the current urgency of the second message at the current node Urgency information, determining the sending order of the first message and the second message, the second message is a message that is received before the first message and has not been sent, the current The urgency information is used to indicate the urgency of forwarding the corresponding message at the current moment; the first message and the second message are sent according to the sending order of the first message and the second message.
  • the forwarding node after receiving the second message and the second message has not been sent out, if the first message is received again, the forwarding node can be based on the two messages at the current node
  • the current urgency information is used to determine the sending order of the two messages, where the current urgency information is used to indicate the urgency of forwarding the corresponding message at the current moment.
  • the forwarding node can send the two messages according to the determined sending order. It can be seen from this that the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • the first message and the second message are determined according to the current urgency information of the first message at the current node and the current urgency information of the second message at the current node
  • the initial urgency information of the first message at the current node and the initial urgency information of the second message at the current node can also be acquired;
  • the urgency calibration information at the current node use the initial urgency information of the first message at the current node as the current urgency information of the first message at the current node, according to the second message at the current node
  • the initial urgency information at the location and the urgency calibration information of the second packet at the current node determine the current urgency information of the second packet at the current node.
  • the initial urgency information of each message at the current node can actually be used as the urgency information at the moment when the corresponding message arrives at the current node.
  • the urgency information of the message at the current node will change.
  • the urgency calibration information of the message at the current node can be obtained, and the initial urgency of the message can be adjusted according to the urgency calibration information. The information is corrected to obtain current urgency information.
  • the first message and the second message both carry an urgency identification header, and the urgency identification header includes at least one initial urgency information; accordingly, the first message is acquired
  • the realization process of the initial urgency information at the current node and the initial urgency information of the second message at the current node may be: at least one initial urgency information included in the urgency identification header of the first message Obtain the initial urgency information of the first message at the current node in the, and obtain the second message at the current node from at least one initial urgency information included in the urgency identification header of the second message The initial urgency of information.
  • the initial urgency information can be carried by the urgency identification header carried by the message itself. In this way, the urgency identification header of the message can be directly obtained from the corresponding message at the current node. Initial urgency information.
  • the urgency identification header of the message carries at least one initial urgency information
  • the urgency identification header further includes the remaining hops of the corresponding message up to the current node.
  • the at least one initial urgency information refers to the initial urgency information of the message at at least one forwarding node on the transmission path, and the at least one initial urgency information is based on the at least one forwarding node in the corresponding report The order of the text on the transmission path.
  • the urgency identification header of each message may carry the initial urgency information of the message at each forwarding node through which the message passes.
  • the urgency of each message The number of remaining hops can also be included in the identification header. Among them, when a message arrives at a forwarding node, the remaining number of hops of the message is the sum of the forwarding node and the number of forwarding nodes that the message will pass through after the forwarding node. When the message leaves the forwarding node, the remaining hops The number of hops is reduced by one accordingly.
  • the initial urgency information of the first packet at the current node is acquired from at least one initial urgency information included in the urgency identification header of the first packet
  • the The realization process of acquiring the initial urgency information of the second packet at the current node from the at least one initial urgency information included in the urgency identification header may be: according to the remaining hops of the first packet and the first packet The number of forwarding nodes on the transmission path of a message, and the initial urgency information of the first message at the current node is obtained from at least one initial urgency information included in the urgency identification header of the first message According to the remaining number of hops of the second message and the number of forwarding nodes on the transmission path of the second message, from at least one initial urgency information included in the urgency identification header of the second message Acquire the initial urgency information of the second message at the current node.
  • the at least one initial urgency information includes the corresponding message at the current node.
  • the initial urgency information at each forwarding node is arranged according to the sequence of the current node and the forwarding node that the corresponding message passes after the current node on the transmission path of the corresponding message.
  • the initial urgency information of the first packet at the current node is obtained from the at least one initial urgency information included in the urgency identification header of the first packet, and the urgency of the second packet
  • the realization process of acquiring the initial urgency information of the second message at the current node in the at least one initial urgency information included in the degree identification header may be: acquiring at least one of the urgency identification headers of the first message The first initial urgency information in the initial urgency information, using the acquired initial urgency information as the initial urgency information of the first packet at the current node; acquiring the urgency identification header of the second packet The first initial urgency information included in the at least one initial urgency information, the acquired initial urgency information is used as the initial urgency information of the second message at the current node.
  • the urgency identification header of the message will carry the initial urgency information of the message at the forwarding node and the information on the way after the forwarding node.
  • the initial urgency information at each forwarding node Since each initial urgency information is arranged in the order of each forwarding node on the transmission path, the initial urgency information ranked first is the initial urgency information at the current node.
  • the implementation process of sending the first message and the second message according to the sending order of the first message and the second message may be: deleting the urgent message of the first message The initial urgency information of the first message at the current node in the degree identification header; delete the initial urgency information of the second message at the current node in the urgency identification header of the second message; The sending order of the first message and the second message is to send the first message and the second message after the initial urgency information is deleted.
  • the initial urgency information at the current node in the urgency identification header of the message can be deleted, so that when the message reaches the next forwarding node, the urgency identification header
  • the middle will only carry the initial urgency information of the message at the next forwarding node and the initial urgency information at the forwarding nodes after the next forwarding node.
  • the corresponding initial urgency information in the message can be deleted. In this way, when a message arrives at the receiving node, the message will not contain the initial urgency information, and the receiving node can directly restore the message.
  • the urgency configuration information of the first service may also be received, where the urgency configuration information includes the first The initial urgency information of each of the multiple packets of the service at each forwarding node on the transmission path of the first service; the first service is obtained from the urgency configuration information of the first service The initial urgency information of the message at each forwarding node on the transmission path of the first service; adding an urgency identification header to the first message, and the urgency identification header of the first message includes The initial urgency information of the first packet at each forwarding node on the transmission path of the first service.
  • the process of obtaining the initial urgency information of the first message at the current node and the initial urgency information of the second message at the current node may also be: from a plurality of stored initial urgency
  • the initial urgency information of the first message at the current node and the initial urgency information of the second message at the current node are acquired from the degree information, and the multiple initial urgency information includes the number of messages passing through the current node.
  • each forwarding node may also pre-store the packets of all services passing through the forwarding node in the forwarding node.
  • the initial urgency information at the node In this way, when a message is received, the initial urgency information of the first message at the current node can be directly obtained from multiple stored initial urgency information.
  • the process of obtaining the initial urgency information of the first message at the current node and the initial urgency information of the second message at the current node from a plurality of stored initial urgency information may be: Determine the position of the first message in the multiple messages of the first service, and determine the position of the second message in the multiple messages of the second service, where the first service is the first service The service to which a message belongs, and the second service is the service to which the second message belongs; according to the position of the first message in the plurality of messages of the first service, The initial urgency information includes the initial urgency information of the multiple packets of the first service at the current node to obtain the initial urgency information of the first packet at the current node; according to the second packet In the position in the multiple packets of the second service, the first urgency information of the multiple packets of the second service included in the multiple initial urgency information at the current node is obtained. 2. The initial urgency of the message at the current node.
  • the urgency calibration information of the second packet at the current node refers to the elapsed time of the second packet at the current node.
  • the initial urgency information refers to the initial tolerable delay
  • the initial tolerable delay refers to the maximum delay allowed when the corresponding forwarding node forwards the corresponding message.
  • determine the current urgency of the second message at the current node The implementation process of the degree information may be: determining the difference between the initial tolerable delay of the second message at the current node and the elapsed time of the second message at the current node as the second The remaining tolerable delay of the message at the current node; the remaining tolerable delay of the second message at the current node is used as the current urgency information of the second message at the current node.
  • the first message and the second message are determined according to the current urgency information of the first message at the current node and the current urgency information of the second message at the current node
  • the implementation process of the sending sequence of the first message may be: according to the initial tolerable delay of the first message at the current node and the remaining tolerable delay of the second message at the current node, the order of the smallest to largest
  • the first message and the second message are sorted to obtain the sending order of the first message and the second message.
  • the initial urgency information refers to the initial priority
  • the initial priority is used to indicate the lowest priority when the corresponding forwarding node forwards the corresponding message; accordingly, according to the second message
  • the initial urgency information at the current node and the urgency calibration information of the second message at the current node the realization process of determining the current urgency information of the second message at the current node may be: according to the The elapsed time of the second message at the current node, determine the priority increment of the second message; combine the initial priority of the second message at the current node and the priority of the second message The sum of the level increments is determined as the current priority of the second message at the current node; the current priority of the second message at the current node is taken as the current priority of the second message at the current node Urgency information.
  • the first message and the second message are determined according to the current urgency information of the first message at the current node and the current urgency information of the second message at the current node
  • the process of implementing the sending order of the first message may be: according to the initial priority of the first message at the current node and the current priority of the second message at the current node, the order of the highest to lowest
  • the first message and the second message are sorted to obtain the sending order of the first message and the second message.
  • the initial urgency information at the current node of multiple packets in each data period of the first service to which the first packet belongs are all different. That is, the initial urgency information of multiple packets at the same node in each data period of each service is different.
  • a service processing method comprising: obtaining time demand information of the service; according to the time demand information, determining that each packet of the service is at each forwarding node on the transmission path The tolerable delay is used to indicate the maximum delay allowed by the corresponding forwarding node when forwarding the corresponding message; according to the tolerable delay of each message at each forwarding node on the transmission path , Sending the urgency configuration information to the edge node on the network access side to instruct the edge node on the network access side to determine the sending order of the service packets in the multiple cached packets according to the urgency configuration information.
  • the embodiment of the present application can determine the tolerable delay of each packet of the service at each forwarding node on the transmission path according to the time requirement information of the service, and then according to the time delay of each packet at each forwarding node on the transmission path
  • the tolerable delay determines the urgency configuration information.
  • the urgency configuration information is delivered to the edge node on the network access side, so that the edge node on the network access side can process each message according to the urgency configuration information to ensure the forwarding of each message at each forwarding node
  • the delay does not exceed the tolerable delay, thereby ensuring that the service transmission meets the time requirement. It can be seen from this that the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • the tolerable delay of each message at each forwarding node on the transmission path refers to the maximum delay allowed by the corresponding message at each forwarding node.
  • the time requirement information includes the data period of the service, the size of each data packet in the data period, the first time interval and the second time interval.
  • the first time interval refers to the time interval between the start time of sending the first data message at the sending node in the data period and the start time of the data period;
  • the second time interval is Refers to the time between the transmission completion time of the previous data message at the sending node and the start time of the next data message at the sending node in every two adjacent data messages in the data period interval.
  • the second time interval between every two adjacent data packets in the data period may be equal or unequal.
  • the realization process of determining the tolerable delay of each packet of the service at each forwarding node on the transmission path may include: determining the time requirement information according to the time requirement information.
  • the total tolerable delay of each message of the service may include: determining the transmission path of the service; determine the tolerance of each message at each forwarding node on the transmission path according to the total tolerable delay of each message Time delay.
  • the total tolerable delay of each message refers to the maximum delay allowed for each message in the transmission process.
  • the implementation process of determining the tolerable delay of each message at each forwarding node on the transmission path may include: determining the The number of forwarding nodes; according to the total tolerable delay of each message and the number of forwarding nodes included on the transmission path, determine the tolerable delay of each message at each forwarding node on the transmission path.
  • the total tolerable delay of the corresponding message can be evenly distributed to the multiple forwarders included in the transmission path. Node.
  • the realization process of determining the tolerable delay of each message at each forwarding node on the transmission path may also be: according to the transmission path including The current traffic conditions of each forwarding node of each forwarding node to determine the proportion of delay of each message at each forwarding node; according to the total tolerable delay of each message and the proportion of delay of each message at each forwarding node , Determine the tolerable time delay of each message at each forwarding node on the transmission path.
  • the delay proportion of each forwarding node is estimated through the traffic conditions on each forwarding node, and then the tolerable delay of the message on each forwarding node is allocated according to the delay proportion, which improves the tolerance The accuracy of the delay allocation.
  • the implementation process of sending the urgency configuration information to the edge node on the network access side may be:
  • the tolerable delay of the message at each forwarding node is used as the urgency configuration information; the urgency configuration information is delivered to the edge node on the network access side.
  • the forwarding node can measure the forwarding urgency of each data message by the tolerable delay of the message of each service at that node, and then forward the datagram with a smaller tolerable delay first. Text.
  • the implementation process of sending the urgency configuration information to the edge node on the network access side may also be: obtaining the information of each forwarding node The mapping relationship between the tolerable delay interval and the priority; from the mapping relationship between the tolerable delay interval and the priority of each forwarding node, obtain the corresponding to the tolerable delay of each message at each forwarding node Priority; use the acquired priority of each message at each forwarding node as the urgency configuration information; and deliver the urgency configuration information to the edge node on the network access side.
  • the tolerable delay of each message on each forwarding node can also be converted into a corresponding priority, so that each forwarding node can forward each message according to the priority of each message.
  • the The tolerable time delay at each forwarding node on the transmission path is to detect whether each message meets the forwarding demand at each forwarding node; if each message meets the forwarding demand at each forwarding node, execute The step of delivering the urgency configuration information to the edge node on the network access side according to the tolerable delay of each message at each forwarding node on the transmission path.
  • each forwarding node on the transmission path is ok according to the tolerable delay of each message at each forwarding node on the transmission path.
  • Each message is accepted to determine whether each forwarding node on the transmission path can accept the service. If it is determined to be accepted, the urgency configuration information is issued. In this way, useless functions can be avoided due to the inability to accept the service. .
  • the implementation process of detecting whether each packet meets the forwarding requirement at each forwarding node may be: determining the first A first cache linked list of a forwarding node, where the first cache linked list refers to a queue of messages buffered by the first forwarding node at the moment when the first message arrives at the first forwarding node, and the first message is Refers to any message in the service, the first forwarding node refers to any forwarding node on the transmission path; according to the message in the first cache linked list on the first forwarding node Tolerate the delay and the tolerable delay of the first message at the first forwarding node, sort the messages in the first cache linked list and the first message in descending order, Obtain a second cache linked list; if the total time required to send all messages before the first message in the second cache linked list is less than the tolerable delay of the first message, and the second cache linked list If the tolerable delay of each message after the
  • the edge node on the network access side refers to a sending node, or the edge node on the network access side refers to the first forwarding node on the transmission path. That is, in this embodiment of the present application, the network controller may deliver the urgency configuration information to the sending node, and may also deliver the urgency configuration information to the first forwarding node on the transmission path.
  • the edge node on the network access side when the edge node on the network access side is the first forwarding node on the transmission path, it may send information other than the first forwarding node on the transmission path according to the urgency configuration information
  • Each forwarding node sends each message at the corresponding forwarding node tolerable delay or priority to indicate that each forwarding node except the first forwarding node is at the corresponding forwarding node according to each message
  • the tolerable delay or priority of processing the packets of the business that is, in the embodiment of the present application, the urgency configuration information can also be directly distributed to all forwarding nodes. In this way, in the process of message transmission, it is not necessary to carry the corresponding urgency configuration information in the message. That is, the modification of the message is avoided.
  • a service processing device in a third aspect, is provided, and the service processing device has the function of realizing the behavior of the service processing method in the first aspect or the second aspect.
  • the service processing device includes at least one module, and the at least one module is used to implement the service processing method provided in the first aspect or the second aspect.
  • a business processing device in a fourth aspect, includes a processor and a memory, and the memory is used to store and support the business processing device to perform the business processing provided in the first or second aspect.
  • the processor is configured to execute a program stored in the memory.
  • the operating device of the storage device may further include a communication bus, which is used to establish a connection between the processor and the memory.
  • a computer-readable storage medium stores instructions that, when run on a computer, cause the computer to execute the business processing described in the first or second aspect above method.
  • a computer program product containing instructions which when running on a computer, causes the computer to execute the business processing method described in the first or second aspect.
  • the forwarding node after receiving the second message and the second message has not been sent out, if the first message is received again, the forwarding node can be based on the two messages at the current node
  • the current urgency information is used to determine the sending order of the two messages, where the current urgency information is used to indicate the urgency of forwarding the corresponding message at the current moment.
  • the forwarding node can send the two messages according to the determined sending order. That is, the forwarding node in the embodiment of the present application can determine the sending order of each message according to the current urgency information of each message at the current node, so as to ensure that the transmission delay of each message at the forwarding node does not exceed The allowable delay ensures that the transmission of the service to which the message belongs can meet the time requirement. It can be seen from this that the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • Figure 1 is a system structure diagram of a service processing method provided by an embodiment of the present application.
  • Figure 2 is a structural diagram of a network device provided by an embodiment of the present application.
  • FIG. 3 is a flowchart of a service processing method provided by an embodiment of the present application.
  • FIG. 4 is a schematic diagram of a data cycle of a service provided by an embodiment of the present application.
  • FIG. 5 is a flowchart of determining the tolerable delay of each data message at each forwarding node according to an embodiment of the present application
  • FIG. 6 is an example diagram of the transmission path of the service and the current traffic conditions at each forwarding node on the transmission path provided by the embodiment of the present application;
  • FIG. 7 is a flowchart of detecting whether a first data packet meets a forwarding requirement at a first forwarding node in an embodiment of the present application
  • FIG. 8 is a flowchart of another service processing method provided by an embodiment of the present application.
  • FIG. 9 is a schematic diagram of an urgency identification header in an Ethernet packet provided by an embodiment of the present application.
  • FIG. 10 is a schematic diagram of another urgency identification header in an Ethernet packet provided by an embodiment of the present application.
  • FIG. 11 is a flowchart of another service processing method provided by an embodiment of the present application.
  • FIG. 12 is a flowchart of another service processing method provided by an embodiment of the present application.
  • FIG. 13 is a block diagram of a service processing apparatus provided by an embodiment of the present application.
  • Fig. 14 is a block diagram of another service processing apparatus provided by an embodiment of the present application.
  • the video picture and audio need to ensure strict rhythm synchronization.
  • the time difference from the change in the pronunciation of the singer (or performer or playing an instrument) to hearing the sound signal generated by the action needs to be less than 10ms.
  • This time interval also includes digital-to-analog conversion, DSP chip processing delay, and mixer Processing delay and other time, the time left for the network to transmit audio signal data is less than 2ms, so it is obvious that there is a clear transmission delay requirement for the forwarding of such services.
  • this type of business is called time-sensitive business.
  • the controller can send a control command to the actuator.
  • the actuator executes the corresponding action according to the control command, and reports the execution result and status to Controller.
  • the control, execution, and execution feedback in the above process are completed within a fixed control cycle.
  • the time consumed by the controller to issue control instructions, the actuator receives the control instructions, and the actuator executes actions and feeds back the execution results is basically fixed. Excluding this part of the time, the remaining time is the controller and The communication time of the actuator, that is, the transmission time of the control command and the execution result. Obviously, the communication time also has a very clear time requirement to ensure that all actions are executed within the control cycle.
  • the service processing method provided by the embodiments of the present application can be applied to the above-mentioned scenarios to process time-sensitive services in the above-mentioned scenarios, so as to meet the forwarding requirements of such services. It should be noted that the above application scenarios are only a few exemplary scenarios given in the embodiments of the present application. For time-sensitive services in other scenarios, the service processing methods provided in the embodiments of the present application are also applicable.
  • Fig. 1 is a network system architecture diagram of a service processing method provided by an embodiment of the present application.
  • the network system may include a sending node 10, a forwarding node 20, a receiving node 30, and a network controller 40.
  • the sending node 10 refers to a terminal that sends services.
  • the sending node 10 may report the time requirement information of the service to the network controller 40.
  • the forwarding node 20 may forward the service sent by the sending node 10 according to the service processing method provided in the embodiment of the present application. Among them, there may be multiple forwarding nodes 20.
  • the receiving node 30 refers to a terminal that receives the service sent by the sending node 10. Wherein, the receiving node 30 may receive a service packet sent by the last forwarding node in the forwarding node 20.
  • the network controller 40 can obtain the information of each device in the network system, and determine the urgency configuration information of each packet of the service sent by the sending node 10 according to the service processing method provided by the embodiment of the present application, and then use the urgency The degree of configuration information is used to control the sending node 10 and each forwarding node 20 to forward the service, so as to ensure that the service forwarding delay meets the time requirement.
  • both the sending node 10 and the receiving node 30 can be terminal devices such as industrial computers, desktop computers, and portable computers.
  • the forwarding node 20 may be a forwarding device such as a switch.
  • the network controller 40 may be a server or a server cluster, or may also be a general-purpose computer device. The embodiments of the present application do not specifically limit this.
  • the sending node 10 or the forwarding node of the forwarding node 20 that is the next hop of the sending node 10 may be referred to as a network-entry-side edge node.
  • the receiving node 30 or the forwarding node of the forwarding node 20 that is the previous hop of the receiving node 30 is called the outgoing edge node.
  • other forwarding nodes may be referred to as intermediate forwarding nodes.
  • Fig. 2 is a schematic structural diagram of a network device provided by an embodiment of the present invention.
  • the sending node, forwarding node, receiving node, and network controller in FIG. 1 can all be implemented by the network device shown in FIG. 2.
  • the network device includes at least one processor 201, a communication bus 202, a memory 203, and at least one communication interface 204.
  • the processor 201 may be a general-purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more programs for controlling the execution of the program of this application. integrated circuit.
  • CPU Central Processing Unit
  • ASIC application-specific integrated circuit
  • the communication bus 202 may include a path for transferring information between the aforementioned components.
  • the memory 203 can be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, random access memory (RAM), or other types that can store information and instructions.
  • the type of dynamic storage device can also be electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), CD-ROM (Compact Disc Read-Only Memory, CD-ROM), or other optical disk storage, optical disc Storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program codes in the form of instructions or data structures and can be used by Any other medium accessed by the computer, but not limited to this.
  • the memory 203 may exist independently and is connected to the processor 201 through a communication bus 202.
  • the memory 203 may also be integrated with the processor 201.
  • the communication interface 204 uses any device such as a transceiver to communicate with other devices or communication networks, such as Ethernet, wireless access network (RAN), wireless local area networks (Wireless Local Area Networks, WLAN), etc.
  • RAN wireless access network
  • WLAN Wireless Local Area Networks
  • the processor 201 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG. 2.
  • the network device may include multiple processors, for example, the processor 201 and the processor 205 shown in FIG. 2.
  • processors can be a single-CPU (single-CPU) processor or a multi-core (multi-CPU) processor.
  • the processor here may refer to one or more devices, circuits, and/or processing cores for processing data (for example, computer program instructions).
  • the network device may further include an output device 206 and an input device 207.
  • the output device 206 communicates with the processor 201 and can display information in a variety of ways.
  • the output device 206 may be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector (projector) Wait.
  • the input device 207 communicates with the processor 201, and can receive user input in a variety of ways.
  • the input device 207 may be a mouse, a keyboard, a touch screen device, or a sensor device.
  • the aforementioned network device can be a general-purpose computer device or a special-purpose computer device.
  • the network device may be a desktop computer, a portable computer, a network server, a mobile phone, a tablet computer, a wireless terminal device, a communication device, or an embedded device.
  • the embodiment of the present invention does not limit the type of network equipment.
  • the memory 203 is used to store program codes for executing the solutions of the present application, and the processor 201 controls the execution.
  • the processor 201 is configured to execute the program code 208 stored in the memory 203.
  • the program code 208 may include one or more software modules.
  • the sending node, forwarding node, receiving node, or network controller shown in FIG. 1 can perform corresponding operations through one or more software modules in the processor 201 and the program code 208 in the memory 203.
  • Fig. 3 is a flowchart of a service processing method provided by an embodiment of the present application. This method can be applied to the network controller in the network system shown in FIG. 1. Referring to FIG. 3, the method includes the following steps:
  • Step 301 Obtain the time requirement information of the service.
  • the sending node may first send the time requirement information of the service to the network controller before sending the message of the service.
  • the network controller can receive the time requirement information of the service sent by the sending node.
  • the time requirement information of the service may include the data period of the service, the size of each packet in the data period, the first time interval and the second time interval.
  • the first time interval refers to the time interval between the start time of the first message in the data cycle at the sending node and the start time of the data cycle; the second time interval refers to every two adjacent data cycles in the data cycle.
  • the data period of the service may also include reserved time, and the reserved time refers to the data reserved for the receiving node after all the packets in the data period are received. Processing time.
  • Fig. 4 shows a schematic diagram of a data cycle of a service.
  • the sending node will send n messages in the data cycle of the service.
  • the time difference T s_off between the start time of sending the first message and the start time of the data period of the service is the first time interval.
  • the time difference T int between the transmission completion time of each message and the start transmission time of the next message of the message is the second time interval.
  • ⁇ r is the data processing time reserved for the receiving node, that is, the reserved time.
  • the second time interval may be one, that is, the second time interval between every two adjacent packets in the data period are equal.
  • the second time interval may also be multiple, that is, the second time interval between two adjacent packets in the data period may be different.
  • the second time interval between the first message and the second message may not be equal to the second time interval between the second message and the third message.
  • Step 302 According to the time demand information, determine the tolerable time delay of each packet of the service at each forwarding node on the transmission path.
  • the network controller After receiving the time requirement information of the service, referring to Figure 5, the network controller can determine the tolerance of each packet of the service at each forwarding node on the transmission path according to the time requirement information through the following three steps Time delay.
  • 3021 Determine the total tolerable delay of each message of the service according to the time demand information.
  • the network controller can determine the total tolerable delay of each message of the service through the following calculation model (1):
  • D t (i) refers to the total tolerable delay of the i-th message
  • T cyc refers to the data period
  • T s_off refers to the first time interval
  • P size (i) refers to the size of the i-th message
  • BW refers to the current bandwidth of the sending node
  • ⁇ (P size (i)/BW) is used to represent the total time spent by the sending node to send the i-th message and all messages before the i-th message.
  • T int (i) refers to the time difference between the start time of the i-th message and the completion time of the previous message, that is, the second time between the i-th message and the previous message Interval
  • ⁇ T int (i) refers to the sum of all second time intervals before the i-th message.
  • ⁇ r refers to the reserved time.
  • the network controller may determine that the sending node sends the first packet according to the size of the first packet and the current sending node bandwidth. The time spent in a message. After that, the time taken to send the first message in the data cycle and the first time interval are eliminated, and the remaining time is the maximum forwarding delay allowed for the first message on at least one forwarding node, that is, , The total tolerable delay of the first message.
  • the network controller can determine the time it takes to send the second message according to the size of the second message and the current sending node bandwidth. After that, The time it takes to send the first message, the time it takes to send the second message, the first time interval, and the second time interval between the first message and the second message in the data cycle Excluding, the remaining time is the maximum forwarding delay allowed for the second message on at least one forwarding node, that is, the total tolerable delay of the second message.
  • the time requirement information also includes the data processing time reserved for the receiving node, when determining the total tolerable delay of each message, as shown in the calculation model (1), the The reserved time is also removed.
  • the network controller can determine the transmission path of the service.
  • the sending node may also send the source Internet protocol (Internet protocol, IP) address and destination IP address corresponding to the service.
  • the network controller can receive the source IP address and destination IP address.
  • the network controller stores topology information of the current network and resource information of each node in the network. Based on this, the network controller can select a path from the multiple paths of the network according to the source IP address, the destination IP address of the service, and the topology information of the network, and use the selected path as the transmission path of the service.
  • the service message will pass through all forwarding nodes included in the transmission path to reach the receiving node.
  • the network controller may determine multiple paths from the sending node to the receiving node according to the topology information of the network. In this case, the network controller may select one path from the multiple paths as the service transmission path according to the resource information of each forwarding node included in each path.
  • the network controller may use information about available resources at each forwarding node in the path, such as the maximum depth or average depth of the sending queue buffer of each forwarding node, etc. Analyze whether packets of the service in each data period are forwarded through the forwarding node, whether it will cause the buffer overflow of the sending queue of the forwarding node. If forwarding through the forwarding node may cause the forwarding node's sending queue buffer to overflow, it means that packets sent by the forwarding node may cause packet loss. In this case, this path may not be selected as the transmission path . In the above manner, the network controller can remove the paths that may cause packet loss when sending packets of the service among multiple paths, and select one path from the remaining paths as the transmission path of the service.
  • the network controller may also select the transmission path for the service through other methods such as load balancing.
  • the embodiments of the present application are here. Not limited.
  • step 3022 can be executed simultaneously with step 3021, or can be executed before step 3021, which is not limited in the embodiment of the present application.
  • the network controller can allocate each message to each forwarding node it passes through according to the total tolerable delay of each message Tolerate delays at the place.
  • the network controller may determine the number of forwarding nodes included on the transmission path of the service, and then, according to the total tolerable delay of each message and the transmission path included The number of forwarding nodes determines the tolerable delay of each message at each forwarding node on the transmission path.
  • the number of forwarding nodes included in the transmission path of the service is the number of forwarding nodes through which each message of the service will flow.
  • the network controller may use the ratio of the total tolerable delay of each message to the number of forwarding nodes as the tolerable delay of the corresponding message at each forwarding node. That is, in this implementation manner, the total tolerable delay of each message can be evenly distributed to each forwarding node of the transmission path, so as to obtain the tolerable delay of the corresponding message at each forwarding node. At this time, for any message, the tolerable delay of the message at each forwarding node on the transmission path is equal.
  • step 3021 for multiple packets in the same data period of the service, the total tolerable delay of the multiple packets is different.
  • the tolerable delay of each message at each forwarding node determined according to the above method is also different. It can be seen that the tolerable delays of the multiple packets at the same forwarding node are different.
  • the network controller may determine the proportion of delay of each packet at each forwarding node according to the current traffic conditions of each forwarding node included on the transmission path; The total tolerable delay of each message and the proportion of delay of each message at each forwarding node determine the tolerable delay of each message at each forwarding node on the transmission path.
  • the network controller can determine the maximum time that each message may consume at each forwarding node according to the current traffic condition of each forwarding node. After that, according to the longest time that each message may consume at each forwarding node, determine the proportion of each message's delay at each forwarding node, and the sum of the tolerable delay of each message is compared with the total delay of each forwarding node. The product of the delay proportion is used as the tolerable delay of the corresponding message at the corresponding forwarding node.
  • Fig. 6 shows the transmission path of the service and the current traffic conditions at each forwarding node on the transmission path.
  • the transmission path includes a sending node S, a forwarding node SW1, a forwarding node SW4, a forwarding node SW5, and a receiving node R.
  • the services currently carried by the forwarding node SW1 are f1
  • the services currently carried on the forwarding node SW4 are f1, f2, and f3
  • the services currently carried on the forwarding node SW5 are f1 and f4.
  • the port transmission time of each forwarding node is t, then at the first forwarding node SW1, the forwarding time is t, That is, for the current service message to be sent, in the worst case, it needs to be sent after t at the forwarding node SW1.
  • the maximum forwarding delay at the forwarding node SW1 is t.
  • the forwarding node SW4 due to the convergence of f1-f3, for the service message, in the worst case, it needs to be sent out after 3t at the forwarding node SW4, in other words, the service message
  • the maximum forwarding delay at the forwarding node SW4 is 3t.
  • the maximum forwarding delay at the forwarding node SW is 2t. It can be seen that, according to the traffic conditions of the service currently carried at each forwarding node, it is determined that the maximum possible forwarding delay of the packet of the service at each forwarding node is t, 3t, and 2t, respectively, and this can be obtained.
  • the proportion of the delay of service packets at each forwarding node is 1/6, 3/6, and 2/6 respectively.
  • the tolerable delay of the message at the forwarding node SW1 can be obtained according to the proportion of delay at each forwarding node obtained by the above determination as D t , the tolerable delay at the forwarding node SW4 is D t , the tolerable delay at SW5 is D t .
  • the tolerable time delay of the message at each forwarding node is determined by this implementation method, for multiple messages in one data cycle of the service, the multiple messages are forwarded in the same
  • the tolerable delay at the nodes may be the same or different, and the tolerable delay of the same message at different forwarding nodes may be the same or different.
  • the operation steps are simple and the amount of calculation is small.
  • the second implementation described above is used to determine the tolerable time delay of the message at each forwarding node, since the traffic conditions of the services carried on each forwarding node in the transmission path are considered, the obtained time delay is determined. The tolerable delay at each node is closer to the actual situation and more accurate.
  • Step 303 According to the tolerable time delay of each packet at each forwarding node on the transmission path, it is detected whether each packet meets the forwarding requirement at each forwarding node.
  • the network controller can also determine each message according to the tolerable delay of each message at each forwarding node. Whether the message meets the forwarding requirements at each forwarding node. Among them, the forwarding requirement is a condition that a message needs to be met to be accepted at the corresponding node. That is, the network controller can determine whether the corresponding message can be accepted at each forwarding node through this step.
  • this step is described by taking as an example to determine whether any packet of the service meets the forwarding requirement at any forwarding node.
  • the message is called the first message
  • the forwarding node is called the first forwarding node.
  • the network controller can detect whether the first packet meets the forwarding requirement at the first forwarding node through the following three steps.
  • the first cache linked list refers to a queue of messages buffered by the first forwarding node when the first message arrives at the first forwarding node.
  • the network controller can estimate each forwarding node in the network according to the received time demand information of each service, the current network topology information maintained and the resource information of each node in the network Cache linked list in each time period. Based on this, the network controller can estimate the time when the first message arrives at the first forwarding node according to the position of the first forwarding node on the transmission path, and predict the time when the first message arrives at the first forwarding node.
  • the estimated first forwarding node obtains the corresponding first cache linked list from the multiple cache linked lists corresponding to multiple time periods.
  • the network controller may determine the time when the first message is sent from the sending node according to the time demand information. After that, since it has been determined in step 302 that the tolerable time delay of the first message at each forwarding node is obtained, the network controller may determine the tolerable time delay of the first message at each forwarding node before the first forwarding node. Extend the time when the first message is sent from the sending node, and estimate the time when the first message arrives at the first forwarding node. After that, the network controller may obtain the cache linked list corresponding to the time period when the first message arrives at the first forwarding node from the estimated cache linked list corresponding to each time period, and then use the obtained cache linked list as the first Cache linked list.
  • the network controller may select a cache linked list that matches the data cycle from the estimated cache linked lists for each time period according to the data cycle of the service, and set the selected cache The linked list serves as the first cache linked list. For example, assuming that the data period of the service is t1-t4, the network controller may select a time period containing the data period from each time period, and use the cache linked list corresponding to the selected time period as the first cache linked list.
  • the network controller may obtain the tolerable delay on the first forwarding node of each message in the first cache linked list.
  • the tolerable delay of each message in the first cache linked list on the first forwarding node may be obtained and stored by the network controller using the method of determining the tolerable delay in the foregoing embodiment when processing the corresponding message.
  • the network controller may directly obtain the tolerable delay on the first forwarding node of each message in the stored first cache linked list.
  • the network controller may compare the tolerable delay of each message in the first cache linked list on the first forwarding node with the first According to the size of the tolerable delay of the message on the first forwarding node, the messages in the first cache linked list and the first message are sorted in descending order to obtain the second cache linked list.
  • the network controller can determine whether the total time required for the first forwarding node to send all messages before the first message in the second cache linked list is less than the tolerable delay of the first message, and determine Whether the tolerable delay of each message after the first message in the service is greater than the total time required by the first forwarding node to send all messages before the corresponding message.
  • the network controller can determine the ratio between the size of each packet and the port rate of the first forwarding node. This ratio is the ratio required by the first forwarding node to forward the corresponding packet. time.
  • the network controller can continue to determine whether the tolerable delay of each message after P 7 is greater than the total time required for all messages before sending. Among them, the network controller judges whether the tolerable delay of each message after P 7 is greater than the total time required for all messages before sending, you can refer to the method to judge whether the tolerable delay of P 7 is greater than the six messages before sending. The method of the total time required by the text is not repeated in the embodiment of the present application.
  • the network controller may also determine whether the tolerable delay of P 7 at the first forwarding node is greater than the total time required to send the first six messages, and at the same time determine the time after P 7 Whether the tolerable delay of each message is greater than the total time required for all messages before sending. That is, the above-mentioned judgment operations can be performed simultaneously.
  • step 3032 If it is determined in step 3032 that the tolerable delay of the first message at the first forwarding node is greater than the total time required by the first forwarding node to send all messages before the first message, and every time after the first message The tolerable delay of each message is also greater than the total time required by the first forwarding node to send all messages before the corresponding message, which means that the first forwarding node can accept the first message. That is, the first message meets the forwarding requirement at the first forwarding node.
  • the tolerable delay of the first message at the first forwarding node is not greater than the total time required by the first forwarding node to send all the messages before the first message, or if the time after the first message is The tolerable delay of each message at the first forwarding node is not greater than the total time required for all data messages before the first forwarding node sends the corresponding message, which means that the first forwarding node cannot accept the first message, That is, the first packet does not meet the forwarding requirement at the first forwarding node.
  • the network controller can refer to the processing manner of the first forwarding node to determine whether the first packet meets the forwarding requirement at each forwarding node. Further, for each packet in the service, the network controller can refer to the aforementioned processing method for the first packet to determine whether each packet meets the forwarding requirements on each forwarding node in the transmission path. . If each message satisfies the forwarding requirement at each forwarding node, it means that the transmission path can accept the message in the data period of the service. In this case, the network controller may perform step 304.
  • the network controller may send a failure notification message to the sending node to indicate that the sending node cannot accept the service packet.
  • Step 304 If each packet meets the forwarding requirements at each forwarding node, then according to the tolerable delay of each packet at each forwarding node on the transmission path, the urgency configuration is issued to the edge node on the network access side information.
  • step 303 If it is determined through step 303 that each message meets the forwarding requirement at each forwarding node, that is, the message of the service can be accepted, then the network controller can according to each forwarding of each message on the transmission path Tolerate the delay at the point, and deliver the urgency configuration information to the edge node on the network access side.
  • the network controller can directly use the tolerable delay of each message at each forwarding node as the urgency location information, and issue the urgency configuration to the edge node on the network access side information. That is, the urgency configuration information may include the tolerable delay of each packet at each forwarding node.
  • the network controller may obtain the mapping relationship between the delay tolerance interval and priority of each forwarding node; from the delay tolerance interval and priority of each forwarding node In the mapping relationship between, the priority corresponding to the tolerable delay of each message at each forwarding node is obtained.
  • the acquired priority of each message at each forwarding node is used as the urgency configuration information, and the urgency configuration information is delivered to the edge node on the network access side.
  • the network controller may divide and obtain multiple tolerable delay intervals according to the size of the tolerable delay of the message contained in the cache linked list in each time period on each forwarding node, and the respective delay tolerable intervals do not overlap. Afterwards, a corresponding priority is set for each delay tolerance interval, so as to obtain the mapping relationship between the delay tolerance interval and the priority of each forwarding node. It should be noted that the smaller the lower limit of the tolerable delay interval, the higher the corresponding priority.
  • the correspondence between the delay tolerance interval and the priority of each forwarding node may be generated and stored in advance by the network controller in the above-mentioned manner, or may be generated by the network controller at the current moment.
  • the embodiments of this application do not limit this.
  • the network controller can compare the delay tolerance interval of the first forwarding node with In the mapping relationship between priorities, determine the tolerable delay interval that contains the tolerable delay of the first packet at the first forwarding node, and then determine the priority corresponding to the determined tolerable delay interval as the first packet The priority of the text at the first forwarding node.
  • the network controller can refer to the implementation of the first message and the first node, so as to determine that each message is The priority at each forwarding node on the transmission path.
  • the network controller can issue the priority of each message at each forwarding node as the urgency configuration information of the service, that is, the urgency configuration information includes the priority of each message at each forwarding node. The priority of the place.
  • the foregoing are only two possible implementation methods for determining the urgency configuration information given in the embodiments of the present application.
  • other conversion methods can also be used to convert the tolerable delay of each message at each forwarding node into other information that can be used to indicate the urgency of forwarding corresponding messages at each forwarding node, so as to obtain urgent information.
  • Degree configuration information For example, the tolerable delay of each message at each forwarding node can be scaled according to a certain ratio, so as to obtain the time conversion value of each message at each forwarding node, and these converted values can be used as the urgency configuration information.
  • the time consumed for data forwarding with a length of 64B can be used as a unit, that is, with a unit of 64B/b, for each packet at each forwarding node
  • the time delay is tolerated for conversion, so as to obtain the time conversion value of each message at each forwarding node.
  • the urgency configuration information of a service can include the tolerable delay, priority, or other time conversion value used to identify the urgency of forwarding at each forwarding node of each packet of the service.
  • One type of information that can be used to identify the urgency of forwarding is called initial urgency information, that is, the urgency configuration information of the service may include the initial urgency information of each packet of the service at each forwarding node.
  • the urgency configuration information may not only include the initial urgency information of each message at each forwarding node, but also all or part of the five-tuple information used to identify the service. information.
  • the urgency configuration information includes partial information in the quintuple information
  • the partial information may be the source IP address and the destination IP address of the service.
  • Table 1 is an example of urgency configuration information of a service shown in an embodiment of the present application.
  • the urgency configuration information includes index information and a list of urgency information, where the index information includes the source IP address and the destination IP address of the service, and is used to identify the service.
  • the urgency information list includes the message identifier of each of the n messages of the service and the initial urgency information at each of the m forwarding nodes corresponding to the message identifier of each message .
  • P 1 -P n are respectively used to identify the 1-nth message in the service.
  • Urg nm is used to represent the initial urgency information of the nth message at the mth forwarding node.
  • Urg 11 represents the initial urgency information of the first message at the first forwarding node.
  • the network controller may deliver the urgency configuration information to the edge node on the network access side, so that the edge node on the network access side can process the service packets according to the urgency configuration information.
  • the edge node on the network access side may be a sending node, or a forwarding node located on the transmission path next to the sending node, that is, the first one on the transmission path Forwarding node.
  • the network controller can not only deliver the urgency configuration information to the first forwarding node, but also According to the urgency configuration information, the initial urgency information of each packet at the corresponding forwarding node can be sent to each forwarding node on the transmission path except the first forwarding node, so that each forwarding node receives the
  • the service message can be processed according to the initial urgency information of the service message at the forwarding node.
  • step 303 is an optional step.
  • the network controller determines the tolerable delay of each packet at each forwarding node on the transmission path. After that, the urgency configuration information can be delivered to the edge node on the network access side directly according to the tolerable delay of each data message at each forwarding node on the transmission path.
  • the network controller can determine the tolerable delay of each packet of the service at each forwarding node on the transmission path according to the time requirement information of the service, and then according to the transmission path of each packet.
  • the tolerable delay at each forwarding node determines the urgency configuration information.
  • the urgency location information is delivered to the edge node on the network access side, so that the edge node on the network access side can process each message according to the urgency configuration information to ensure the forwarding of each message at each forwarding node
  • the delay does not exceed the tolerable delay, thereby ensuring that the service transmission meets the time requirement.
  • the network controller can deliver the urgency configuration information of the service to the edge node on the network access side.
  • the edge node on the network access side is the first forwarding node on the transmission path of the service
  • the edge node on the network access side can report the service according to the urgency configuration information through the service processing method shown in FIG. The text is processed.
  • FIG. 8 is another service processing method shown in an embodiment of the present application.
  • the method can be applied to an edge node on the network access side, where the edge node on the network access side refers to the first forwarding node on a service transmission path.
  • the method includes the following steps:
  • Step 801 Receive a first message, which is a message of a first service.
  • Step 802 Receive urgency configuration information of the first service, where the urgency configuration information includes the initial urgency of each of the multiple packets of the first service at each forwarding node on the transmission path of the first service information.
  • the network controller may deliver the urgency configuration information of the first service to the edge node on the network access side.
  • the edge node on the network access side can receive the urgency configuration information of the first service.
  • Step 803 Acquire the initial urgency information of the first packet at each forwarding node on the transmission path of the first service from the urgency configuration information of the first service.
  • the network access side When receiving the first packet, the edge node may obtain the initial urgency information of the first packet at each forwarding node on the transmission path from the urgency configuration information of the first service.
  • the initial urgency information of the first message at each forwarding node may be the same or different.
  • the initial urgency information of the multiple packets at the same forwarding node on the transmission path of the first service may be different or the same.
  • the network-entry-side edge node may be the first forwarding node of multiple services
  • the network-entry-side edge node may receive and store urgency configuration information of multiple services. Based on this, when the edge node on the network access side receives the first packet, it can determine the urgency configuration of the first service from the urgency configuration information of multiple services according to the source address and destination address carried in the first packet After that, the edge node on the network access side can obtain the first packet from the urgency configuration information of the first service according to the position of the first packet in the multiple packets of the service. ⁇ Degree information.
  • the urgency configuration information may include the message identifier of each message, and the message identifier may be used to identify the corresponding message in the service The sorting of multiple messages.
  • the edge node on the network access side can determine which packet of the service the first packet is, thereby obtaining the packet identifier of the first packet .
  • the edge node on the network access side may obtain the initial urgency information at each forwarding node corresponding to the packet identifier of the first packet from the urgency configuration information of the first service.
  • Step 804 Add an urgency identification header to the first message, where the urgency identification header of the first message includes the initial urgency information of the first message at each forwarding node on the transmission path of the first service.
  • the edge node on the network access side can add an urgency identification header to the first message, and place the first message at each forwarding node
  • the initial urgency information of is carried in the urgency identification header.
  • the urgency identification header the initial urgency information of the first message at each forwarding node is arranged according to the sequence of each forwarding node on the transmission path.
  • the edge node on the network access side may also add the remaining hops of the first packet to the urgency identification header of the first packet.
  • the remaining number of hops of the first message refers to the number of remaining forwarding hops in the process of forwarding the first message along the transmission path until the current node.
  • the remaining hops of the first packet may be the remaining hops on the transmission path of the first service excluding the first forwarding node. The number of forwarding nodes.
  • the edge node on the network access side may add a "TYPE" field to the Ethernet packet to indicate that the field is followed by Urgency identification head.
  • the urgency identification header may include initial urgency information of the first message on each forwarding node, and the remaining number of hops of the first message.
  • the multiple initial urgency information is sequentially arranged according to the order of the corresponding multiple forwarding nodes on the transmission path.
  • the urgency identification header may also carry information for indicating the multiple initial urgency.
  • steps 802-804 can also be executed after step 805.
  • Step 805 Determine the sending order of the first message and the second message according to the current urgency information of the first message at the current node and the current urgency information of the second message at the current node.
  • the second message refers to a message that was received before the first message and has not been sent out.
  • the second message also carries an urgency identification header, and the urgency identification header of the second message may include at least one initial urgency information and a remaining number of hops, the at least one initial urgency The information is the initial urgency information of the second packet at the at least one forwarding node included in the transmission path, and the at least one initial urgency information is arranged according to the sequence of the at least one forwarding node on the transmission path.
  • the urgency identification header of the second message may carry the initial urgency information of the second message at all forwarding nodes that it will pass through.
  • the remaining hop count is the remaining hop count from the second message to the current node.
  • the urgency identification header of the second message may include the initial urgency information of the second message at the current node and the initial urgency information of other nodes that the second message passes after the current node, and these initial urgency information
  • the urgency information is arranged in the order of the current node and the forwarding node that the second message passes after the current node on the transmission path.
  • the urgency identification header of the second message may only include the initial urgency information of the second message at the forwarding node that has not yet passed.
  • the urgency identification header may further include an urgency information length for indicating the number of initial urgency information included.
  • the current node may not be the first forwarding node of the second message. Therefore, the urgency identification header of the second message may not be added by the current node, but by the transmission path of the second message. The first forwarding node is added.
  • the edge node on the network access side may first obtain the initial urgency information of the first message at the current node and the initial urgency information of the second message at the current node, and obtain The urgency calibration information of the second packet at the current node, the initial urgency information of the first packet at the current node is used as the current urgency information of the first packet at the current node, and the The initial urgency information at the node and the urgency calibration information of the second message at the current node determine the current urgency information of the second message at the current node.
  • the server may determine the sending order of the first message and the second message according to the determined current urgency information of the first message at the current node and the current urgency information of the second message at the current node.
  • the edge node on the network access side is the first forwarding node of the first message
  • the edge node on the network access side can directly obtain the first message from the stored urgency configuration information of the first service.
  • the initial urgency information of the message at the current node may also be obtained from the urgency identification header added for the first message in step 804, the initial urgency information of the first message at the current node.
  • the edge node on the network access side can first refer to the aforementioned related implementation methods from the urgency of the first service. Find the initial urgency information of the first packet at each forwarding node in the configuration information. After that, the edge node on the network access side can use the first initial urgency information among the multiple initial urgency information of the first packet as the first The initial urgency information of a message at the current forwarding node.
  • the initial urgency information of the first message at each forwarding node is arranged according to the sequence of each forwarding node on the transmission path.
  • the current node may The remaining hops of the message and the number of forwarding nodes on the transmission path of the first message are obtained from the at least one initial urgency information included in the urgency identification header of the first message at the current node.
  • Initial urgency information the current node can determine the position of the current node on the transmission path of the first message according to the remaining hops of the first message and the number of forwarding nodes on the transmission path of the first message, that is, the current node is The number of forwarding nodes on the transmission path of the first message.
  • the current node can use the initial urgency information included in the urgency identifier header of the first message according to its position on the transmission path of the first message Get the corresponding initial urgency information in.
  • the current node can directly obtain the first initial urgency information from the urgency identification header of the first message, and use the acquired initial urgency information As the initial urgency information of the first message at the current node.
  • the current node While acquiring the initial urgency information of the first packet at the current node, the current node can also acquire the initial urgency information of the second packet at the current node. Among them, because the current node may not be the first forwarding node of the second message, that is, the current node may not be the edge node of the network access side of the second message, therefore, the current node may not store the second message belongs to The urgency configuration information of the second business. In this case, the current node can directly obtain the initial urgency information of the second packet at the current node from the urgency identification header of the second packet.
  • the current node can refer to when the first message carries the remaining hops
  • the current node can refer to the information from the first packet when the remaining hops are not carried in the first packet.
  • the implementation manner of obtaining the initial urgency information of the first packet at the current node in the urgency identification header is to obtain the initial urgency information of the second packet at the current node, which will not be repeated in this embodiment of the application.
  • the initial urgency information of the first packet at the current node can be directly used as the current urgency information of the first packet at the current node.
  • the second message since the second message was received before the first message, the second message may have stayed on the current node for a certain period of time and consumed a certain amount of time. At this time, the second message is The forwarding urgency at the current node will change. In other words, the urgency information of any message at a node will change with the change of the time the message stays at the node.
  • the current node can determine the urgency calibration information according to the elapsed time of the second message on the current node, and then use the urgency calibration information to calibrate the initial urgency information of the second message at the current node , So as to obtain the current urgency information of the second message at the current node.
  • the current node when it receives a message, it can time the message through a timer from the moment of receiving the message. On this basis, the current node can obtain the timing duration of the second message up to the current moment, and the timing duration is the time that the second message has consumed at the current node. After that, the current node can directly use the elapsed time as the urgency calibration information to calibrate the initial urgency information, so as to obtain the current urgency information of the second message at the current node.
  • the current node may determine the current urgency information of the second packet at the current node in different ways according to the urgency calibration information of the second packet at the current node .
  • the current node can calculate the difference between the initial tolerable delay of the second message at the current node and the elapsed time of the second message at the current node The value is determined as the remaining tolerable delay of the second message at the current node, and the remaining tolerable delay is used as the current urgency information of the second message at the current node.
  • the current node may determine the priority increment of the second message according to the elapsed time of the second message at the current node, and then add the second message The sum of the initial priority of the message at the current node and the priority increment of the second message is determined as the current priority of the second message at the current node; the current priority of the second message at the current node As the current urgency information of the second message at the current node.
  • the current node can store the corresponding relationship between the time length range and the priority increment.
  • the current node can directly determine the time length range in which the elapsed time of the second message at the current node is located.
  • the priority increment corresponding to the determined duration range is used as the priority increment of the second packet.
  • the current node may store the priority increment corresponding to the unit duration, that is, the value of the priority increment corresponding to each unit duration increase.
  • the current node can determine that the elapsed time is several times the unit duration, and then determine the priority increment of the second message according to the determined multiple. For example, suppose that the priority is increased by 1 level for every additional second. If the elapsed time is 2s, the corresponding priority increment is 2 levels.
  • the urgency calibration information may also be different according to the information type of the initial urgency information.
  • the urgency calibration information is the elapsed time.
  • the elapsed time can be converted into priority increments according to the method described above, and the priority increments can be used as urgency calibration information.
  • the elapsed time can be converted into a corresponding type of change as the urgency calibration information.
  • the embodiments of this application do not limit this.
  • the current node in order to more accurately characterize the urgency of forwarding the first packet at the current node at the current moment, may not directly determine the initial urgency of the first packet at the current node.
  • the information is used as the current urgency information of the first message.
  • the urgency calibration information of the first message is obtained by referring to the aforementioned processing method for the second message, and then the urgency calibration information of the first message
  • the initial urgency information of the message at the current node is calibrated to obtain the current urgency information of the first message at the current node.
  • the current node After determining the current urgency information of the first message and the second message at the current node, the current node can compare the first message according to the current urgency information of the first message and the second message at the current node. Sort with the second message to obtain the sending order of the first message and the second message.
  • the current node can according to the current tolerable delay of the first message at the current node and the current tolerable delay of the second message at the current node, according to the Sort the first message and the second message in the largest order, so as to obtain the sending order of the first message and the second message.
  • the current tolerable delay of the first message at the current node may be the initial tolerable delay of the first message at the current node, or the remaining tolerable delay of the first message at the current node, and the first message
  • the current tolerable delay of the second message at the current node is the remaining tolerable delay of the second message at the current node determined by the foregoing method.
  • the current node may according to the current priority of the first message at the current node and the current priority of the second message at the current node, according to the highest priority. Sort the first message and the second message in the lowest order, so as to obtain the sending order of the first message and the second message.
  • the current priority of the first message at the current node can be the initial priority of the first message at the current node, or it can be the current priority calibrated according to the urgency calibration information, and the second message is currently The current priority at the node is the priority calibrated according to the urgency calibration information.
  • Step 806 Send the first message and the second message according to the sending order of the first message and the second message.
  • the urgency identification header of the first message and the second message includes the initial urgency information and the remaining hops of the corresponding message at all forwarding nodes passing through, in order to ensure that the next hop of the current node can continue Obtain the corresponding initial urgency information according to the remaining hops.
  • the current node can subtract one from the remaining hops in the urgency identification header to obtain the updated remaining hops and then send according to the first message and the second message Send the first message and the second message in sequence.
  • the current node may, before sending the first message and the second message, Delete the initial urgency information of the first packet at the current node in the urgency header of the first packet, and delete the initial urgency of the second packet at the current node in the urgency header of the second packet After the information is deleted, the first message and the second message are sent. In this way, when the first message and the second message arrive at the next forwarding node on their respective transmission paths, the next forwarding node can directly obtain the first initial urgency information from the carried at least one initial urgency information as the corresponding The initial urgency of the message at itself.
  • the last forwarding node can determine itself as the last hop of the message. In this way, the last forwarding node can delete the urgency header carried in the message to restore the result. The original message, and then send the message to the receiving node.
  • the urgency identification headers of the first message and the second message include the initial urgency information and the urgency information length of the corresponding message at the forwarding node that has not passed
  • the initial urgency is deleted hop by hop
  • the length of the urgency information can also be updated accordingly, so that the last forwarding node can determine whether it is the last forwarding node according to the length of the urgency information.
  • the current node can determine the sending order according to the corresponding initial urgency information, and then can according to the position of the message in the sending order , The size of the message, the size of other messages before the message, and the current port rate to calculate the forwarding delay of the message on the current node. After that, the current node can determine the elapsed time and the forwarding delay If the total duration is greater than the total tolerable delay, it can be determined that the forwarding of the message has failed. At this time, the current node may no longer forward the message. If the total determined duration is not greater than the total tolerable delay, the current node can update the elapsed time in the urgency header of the message to the previously determined total duration, and execute the process of sending the message according to the determined sending order step.
  • the edge node on the network access side may receive the urgency configuration information issued by the network controller, and then according to the urgency configuration information, add the urgency identifier header to the received service packet and then send the packet.
  • other forwarding nodes on the transmission path can forward the message according to the forwarding urgency indicated by the initial urgency information carried in the urgency identification header of the message. This ensures that the forwarding delay of the service can meet the time requirement. It can be seen from this that the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • the edge node on the network access side adds the urgency identification header to the message to carry the initial urgency information of the message at each forwarding node, for each subsequent forwarding node that the message passes through, the forwarding
  • a node receives a message, it can refer to step 805 and step 806 in the foregoing embodiment to send the message. The embodiments of this application will not be repeated here.
  • the foregoing embodiment describes that when the edge node on the network access side is the first forwarding node on the service transmission path, the edge node on the network access side processes the service packets according to the urgency configuration information of the service issued by the network controller.
  • the realization process If the edge node on the network access side is the sending node, the edge node on the network access side can add the corresponding message in each forwarding to each message of the service according to the relevant implementation methods introduced in steps 802-804 in the above embodiment.
  • the urgency identification header of the initial urgency information at the node, and the service message is sent strictly according to the time requirement information sent to the network controller.
  • the first forwarding node on the transmission path of the service can forward the received packet of the service through step 801, step 805, and step 806 in the foregoing embodiment.
  • the foregoing embodiment describes that when the network controller delivers the urgency configuration information to the edge node on the network access side, the edge node on the network access side carries the initial urgency information in the message according to the urgency configuration information, and each node reports The realization process of text processing. It can be seen from the embodiment described in FIG. 3 that the network controller can also issue to each forwarding node on the service transmission path the initial urgency information of multiple packets of the service at the corresponding forwarding node. In this case , The forwarding node can process the received message through the service processing method shown in FIG. 11. As shown in FIG. 11, the method includes the following steps:
  • Step 1101 Receive the first message.
  • Step 1102 Determine the sending order of the first message and the second message according to the current urgency information of the first message at the current node and the current urgency information of the second message at the current node.
  • the second message refers to a message that was received before the first message and has not been sent currently.
  • the current urgency information is used to indicate the urgency of forwarding the corresponding message at the current moment.
  • the network controller can send to each forwarding node on the transmission path of the service the initial urgency information of multiple packets of the service at the corresponding forwarding node, and accordingly, the forwarding node can receive the network The initial urgency information at the forwarding node of multiple packets of all the services that pass through the forwarding node sent by the controller and store it.
  • the current node after the current node receives the first message, it can obtain the initial urgency information of the first message at the current node and the second message at the current node from the multiple stored initial urgency information.
  • the initial urgency information at the current node where the multiple initial urgency information includes the initial urgency information at the current node of multiple packets of each of the multiple services passing through the current node.
  • the current node may determine the position of the first message among the multiple messages of the first service, and the position of the second message among the multiple messages of the second service.
  • the first service is the first service.
  • the service to which the message belongs, and the second service is the service to which the second message belongs; according to the position of the first message in the multiple messages of the first service, the number of the first service included in the multiple initial urgency information Obtain the initial urgency information of the first packet at the current node from the initial urgency information of the first packet at the current node; according to the position of the second packet in the multiple packets of the second service,
  • the initial urgency information includes the initial urgency information of multiple packets of the second service at the current node to acquire the initial urgency information of the second packet at the current node.
  • the current node since the current node stores the initial urgency information of multiple packets of each business in the multiple services at the current node, the current node can firstly obtain information from multiple sources according to the source and destination addresses of the first packet.
  • the initial urgency information corresponding to the first service to which the first packet belongs is determined in the initial urgency information of the service.
  • the current node can determine the position of the first packet in multiple packets of the first service, that is, Determine which of the multiple packets of the first service the first packet is, and according to the position of the first packet in the multiple packets of the first service, from the multiple packets of the first service Acquire the initial urgency information of the first message at the current node from the initial urgency information at the current node.
  • the current node can count the number of packets of the first service received in the data period of the first service through a counter or other implementation methods, and determine that the first packet is the first packet according to the counted number. Which message is in the data cycle of a service.
  • the current node can use the same manner to obtain the initial urgency information of the second message at the current node.
  • the current node After obtaining the initial urgency information of the first message and the second message at the current node, the current node can use the initial urgency information of the first message at the current node as the first message at the current node Current urgency information. Acquire the urgency calibration information of the second packet at the current node, and then calibrate the initial urgency information of the second packet at the current node according to the urgency calibration information of the second packet at the current node to obtain the first 2.
  • the current urgency of the message at the current node For a specific implementation manner, reference may be made to the related implementation manner in step 805 in the foregoing embodiment, and details are not described in the embodiment of the present application.
  • the current node can also obtain the urgency calibration information of the first packet at the current node, and perform the initial urgency information of the first packet at the current node according to the urgency calibration information. Calibration, thereby obtaining the current urgency information of the first message at the current node.
  • the current node After determining the current urgency information of the first message and the second message at the current node, the current node can refer to the relevant implementation in step 805 in the foregoing embodiment to determine the sending of the first message and the second message order. The embodiments of this application will not be repeated here.
  • Step 1103 Send the first message and the second message according to the sending order of the first message and the second message.
  • the current node may send the first message and the second message in the determined sending order.
  • each forwarding node can receive the initial urgency information at the corresponding forwarding node of multiple packets that the network controller sends to the service of the corresponding forwarding node according to the urgency configuration information, so that the forwarding node is receiving
  • the initial urgency information of the message at the current node can be obtained from multiple stored initial urgency information, and then the initial urgency information obtained is used to determine the urgency of forwarding the message at the current moment.
  • the message is sent according to the current urgency information to ensure that the forwarding delay of the corresponding service can meet the time requirement.
  • the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • the network controller since the network controller has issued to each forwarding node the initial urgency information of multiple packets of services passing through the corresponding forwarding node at the corresponding forwarding node, therefore, at the sending node or the first forwarding node , There is no need to add the urgency identification header in the service message, and accordingly, there is no need to delete the urgency identification header at the receiving node or the last forwarding node. That is, the embodiment of the present application may not need to modify the message.
  • the forwarding device receives two packets successively as an example to illustrate the implementation process of the forwarding device sending the packet.
  • the forwarding device takes the forwarding device receiving multiple packets and receiving the first packet when multiple packets have not been sent as an example, to implement the process of sending the multiple packets and the first packet by the forwarding device Description.
  • the method includes the following steps:
  • Step 1201 Receive the first message.
  • Step 1202 According to the current urgency information of the first packet at the current node and the current urgency information of the multiple packets at the current node, determine the sending order of the first packet and the multiple packets.
  • the multiple messages refer to messages that are received by the forwarding node before the first message and have not yet been sent.
  • the current node can refer to step 805 in the foregoing embodiment To determine the current urgency information of the first message at the current node.
  • the forwarding node can refer to the information on determining the current urgency of the second packet at the current node introduced in step 805 in the foregoing embodiment to determine each of the multiple packets. The current urgency of the message at the current node.
  • the current node can also refer to steps 802-804 in the foregoing embodiment, and add the following to the first packet: The urgency header of the initial urgency information.
  • the current node can refer to the previous embodiment
  • the relevant implementation in step 1102 determines the current urgency information of the first packet at the current node.
  • the forwarding node can refer to the information on determining the current urgency of the second packet at the current node introduced in step 1102 in the foregoing embodiment to determine each of the multiple packets. The current urgency of the message at the current node.
  • the current node After determining the current urgency information of the first message and multiple messages at the current node, if the type of the urgency information is time delay tolerant, the current node can be based on the current urgency of the first message and the multiple messages. The size of the time delay is tolerated, and the first message and the multiple messages are sorted in ascending order to obtain the sending order of the first message and the multiple messages.
  • the type of the urgency information is priority
  • the current node can compare the first message and the multiple messages in the order from high to low according to the current priorities of the first message and the multiple messages. The messages are sorted to obtain the sending order of the first message and the multiple messages.
  • Step 1203 Send the first message and the multiple messages according to the determined sending order.
  • the current node may send the first message and the multiple messages according to the determined sending order.
  • the forwarding node when the forwarding node receives the first message, if the forwarding node also buffers multiple messages received before the first message, the forwarding node may use the first message and multiple The current urgency information of each message at the current node determines the sending order of the first message and the multiple messages, where the current urgency information is used to indicate the forwarding urgency of the corresponding message at the current moment. After that, the forwarding node may send the first message and the multiple messages according to the determined sending order. It can be seen from this that the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • an embodiment of the present application provides a service processing apparatus 1300, and the apparatus 1300 includes:
  • the receiving module 1301 is configured to perform step 801 or step 1101 or step 1201 in the foregoing embodiment
  • the first determining module 1302 is configured to execute step 805 or step 1102 or step 1202 in the foregoing embodiment
  • the sending module 1303 is configured to execute step 806 or step 1103 or step 1203 in the foregoing embodiment.
  • the device 1300 further includes:
  • the first obtaining module is configured to obtain the initial urgency information of the first message at the current node and the initial urgency information of the second message at the current node;
  • the second acquiring module is configured to acquire the urgency calibration information of the second message at the current node
  • the second determining module is configured to use the initial urgency information of the first packet at the current node as the current urgency information of the first packet at the current node, and according to the initial urgency information of the second packet at the current node And the urgency calibration information of the second message at the current node to determine the current urgency information of the second message at the current node.
  • both the first message and the second message carry an urgency identification header, and the urgency identification header includes at least one initial urgency information;
  • the first acquisition module includes:
  • the first obtaining submodule is used to obtain the initial urgency information of the first message at the current node from the at least one initial urgency information included in the urgency identification header of the first message, and obtain the initial urgency information of the first message from the urgency of the second message
  • the initial urgency information of the second message at the current node is obtained from at least one initial urgency information included in the identification header.
  • the urgency identification header further includes the remaining number of hops of the corresponding message up to the current node
  • the at least one initial urgency information refers to the initial urgency information of the corresponding message at at least one forwarding node on the transmission path
  • the at least one initial urgency information is arranged according to the sequence of the at least one forwarding node on the transmission path of the corresponding message.
  • the first obtaining submodule is specifically used for:
  • the current state of the first message is obtained from at least one initial urgency information included in the urgency identification header of the first message.
  • Initial urgency information at the node is obtained from at least one initial urgency information included in the urgency identification header of the first message.
  • the current state of the second message is obtained from at least one initial urgency information included in the urgency identification header of the second message.
  • the initial urgency information at the node is obtained from at least one initial urgency information included in the urgency identification header of the second message.
  • the at least one initial urgency information includes initial urgency information of the corresponding message at the current node, and initial urgency information of each forwarding node that the corresponding message passes through after the current node;
  • the initial urgency information of the corresponding message at the current node and the initial urgency information of each forwarding node that the corresponding message passes after the current node are based on the current node and the forwarding node that the corresponding message passes after the current node.
  • the first obtaining submodule is specifically used for:
  • the sending module 1303 is specifically configured to:
  • the first message and the second message after the initial urgency information is deleted are sent.
  • the apparatus when the current node is the first forwarding node on the transmission path of the first service to which the first packet belongs, the apparatus is further configured to:
  • urgency configuration information of the first service where the urgency configuration information includes initial urgency information at each forwarding node on the transmission path of the first service for each of the multiple packets of the first service;
  • An urgency identification header is added to the first message, and the urgency identification header of the first message includes the initial urgency information of the first message at each forwarding node on the transmission path of the first service.
  • the first obtaining module includes:
  • the second acquisition sub-module is used to acquire the initial urgency information of the first message at the current node and the initial urgency information of the second message at the current node from the stored multiple initial urgency information, multiple initial urgency information
  • the urgency information includes the initial urgency information at the current node of multiple packets of each of the multiple services passing through the current node.
  • the second obtaining submodule is specifically used for:
  • the first service is the service to which the first message belongs
  • the first The second business is the business to which the second message belongs
  • the first message is obtained from the initial urgency information of the multiple messages of the first service included in the multiple initial urgency information at the current node Initial urgency information at the current node;
  • the second message is obtained from the initial urgency information of the multiple messages of the second service included in the multiple initial urgency information at the current node The initial urgency information at the current node.
  • the urgency calibration information of the second packet at the current node refers to the elapsed time of the second packet at the current node.
  • the initial urgency information refers to the initial tolerance delay
  • the initial tolerance delay refers to the maximum delay allowed when the corresponding forwarding node forwards the corresponding message
  • the second determining module is specifically used for:
  • the remaining tolerable delay of the second message at the current node is taken as the current urgency information of the second message at the current node.
  • the first determining module 1302 is specifically configured to:
  • the first message and the second message are sorted in ascending order to obtain the first message.
  • the sending order of the first message and the second message is based on the initial tolerable delay of the first message at the current node and the remaining tolerable delay of the second message at the current node.
  • the initial urgency information refers to the initial priority, and the initial priority is used to indicate the lowest priority when the corresponding forwarding node forwards the corresponding message;
  • the second determining module is specifically used for:
  • the current priority of the second message at the current node is taken as the current urgency information of the second message at the current node.
  • the first determining module 1302 is specifically configured to:
  • the first message and the second message are sorted from high to low to obtain the first The sending order of the message and the second message.
  • the initial urgency information at the current node of multiple packets in each data period of the first service to which the first packet belongs are all different.
  • the forwarding node can use these two messages.
  • the current urgency information of the message at the current node determines the sending order of the two messages, wherein the current urgency information is used to indicate the urgency of forwarding the corresponding message at the current moment.
  • the forwarding node can send the two messages according to the determined sending order. It can be seen from this that the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • an embodiment of the present application provides another service processing apparatus 1400, and the apparatus 1400 includes:
  • the obtaining module 1401 is configured to execute step 301 in the foregoing embodiment
  • the determining module 1402 is configured to execute step 302 in the foregoing embodiment
  • the sending module 1403 is configured to execute step 304 in the foregoing embodiment.
  • the time requirement information includes the data period of the service, the size of each packet in the data period, the first time interval and the second time interval;
  • the first time interval refers to the time interval between the start time of the first message in the data period at the sending node and the start time of the data period;
  • the second time interval refers to the time interval between the transmission completion time of the previous message at the sending node in every two adjacent messages in the data period to the time when the next message starts to be sent at the sending node.
  • the determining module 1402 includes:
  • the first determining sub-module is used to determine the total tolerable delay of each message of the service according to the time demand information
  • the second determining sub-module is used to determine the transmission path of the service
  • the third determining sub-module is used to determine the tolerable delay of each message at each forwarding node on the transmission path according to the total tolerable delay of each message.
  • the third determining submodule is specifically configured to:
  • the tolerable delay of each message at each forwarding node on the transmission path is determined.
  • the third determining submodule is specifically configured to:
  • the total tolerable delay of each message and the proportion of delay of each message at each forwarding node determine the tolerable delay of each message at each forwarding node on the transmission path.
  • the sending module 1403 is specifically configured to:
  • the urgency configuration information is delivered to the edge node on the network access side.
  • the sending module 1403 is specifically configured to:
  • the urgency configuration information is delivered to the edge node on the network access side.
  • the device 1400 further includes:
  • the detection module is used to detect whether each message meets the forwarding requirement at each forwarding node according to the tolerable delay of each message at each forwarding node on the transmission path;
  • the trigger module is used to trigger the sending module to send to the edge node of the network access side according to the tolerable delay of each message at each forwarding node on the transmission path if each message meets the forwarding requirements at each forwarding node Send urgency configuration information.
  • the detection module is specifically used for:
  • the first cache linked list refers to the queue of messages buffered by the first forwarding node at the moment when the first message arrives at the first forwarding node.
  • the first message refers to any service in the service.
  • the first forwarding node refers to any forwarding node on the transmission path;
  • the messages in the first cache linked list are processed in descending order Sorting with the first message to obtain the second cache linked list;
  • the total time required to send all messages before the first message in the second cache linked list is less than the tolerable delay of the first message, and the tolerable time of each message after the first message in the second cache linked list If the delay is greater than the total time required for all messages before the corresponding message is sent, it is determined that the first message meets the forwarding requirement at the first forwarding node.
  • the edge node on the network access side refers to the sending node, or the edge node on the network access side refers to the first forwarding node on the transmission path.
  • the apparatus 1400 is further configured to:
  • the tolerable delay or priority of each message at the corresponding forwarding node is sent to indicate the other than the first forwarding node.
  • Each external forwarding node processes business messages according to the tolerable delay or priority of each message at the corresponding forwarding node.
  • multiple packets in each data period of the service have different tolerable delays at the same forwarding node on the transmission path.
  • the embodiment of the present application determines the tolerable delay of each packet of the service at each forwarding node on the transmission path according to the time requirement information of the service, and then according to the time delay of each packet at each forwarding node on the transmission path
  • the tolerant delay determines the urgency configuration information.
  • the urgency location information is delivered to the edge node on the network access side, so that the edge node on the network access side can process each message according to the urgency configuration information to ensure the forwarding of each message at each forwarding node
  • the delay does not exceed the tolerable delay, thereby ensuring that the service transmission meets the time requirement. It can be seen from this that the service processing method provided by the embodiment of the present application does not require strict collaboration and precise cooperation between the sending node and the forwarding node to meet the requirements of the time-sensitive service on the forwarding delay, which reduces the difficulty of implementation.
  • the computer program product includes one or more computer instructions.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • the computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • the computer instructions may be transmitted from a website, computer, server, or data center.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or a data center integrated with one or more available media.
  • the usable medium may be a magnetic medium (for example: floppy disk, hard disk, tape), optical medium (for example: Digital Versatile Disc (DVD)), or semiconductor medium (for example: Solid State Disk (SSD) )Wait.

Abstract

本申请公开了一种业务处理方法及装置，属于通信技术领域。在本申请实施例中，在接收到第二报文之后且该第二报文还未发送出去时，如果又接收到了第一报文，则转发节点可以根据这两个报文在当前节点处的当前紧迫度信息来确定这两个报文的发送顺序，其中，当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度。之后，转发节点可以按照确定的发送顺序来发送这两个报文。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。

Description

业务处理方法及装置
本申请要求于2019年4月10日提交的申请号为201910284097.6、申请名称为“业务处理方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，特别涉及一种业务处理方法及装置。
背景技术
时间敏感网络(Time Sensitive Network，TSN)可以被部署在诸如工业制造现场、音视频录制现场、大型飞行器内部等对数据报文转发有明确时间需求的场所。在TSN中，对于某些种类的业务，转发节点在对这类业务的数据报文进行转发时，需要将转发时延控制在数微秒内。通常，将这种对转发时延有明确要求的业务称为时间敏感业务。
当前，在发送时间敏感业务的数据报文之前，首先需要对TSN中的各个节点进行精准的时钟同步。之后，对每个发送节点要发送的数据报文进行流量分析，并根据分析结果，在每个发送周期内为每个业务的数据报文分配发送时间段。其中，各业务的数据报文的发送时间段不同。与此同时，TSN中的转发节点中包括多个转发队列。根据每个业务要求的转发时延以及预估的每个业务的数据报文的到达时间，为每个转发队列配置对应的开启时间和结束时间。在配置完毕之后，各发送节点可以根据为每个业务的数据报文分配的发送时间段来发送相应业务的数据报文，从而将各业务的数据报文的发送时间错开。当各业务的数据报文到达转发节点时，转发节点可以将各业务的数据报文缓存到与相应的数据报文的到达时间和要求的转发时延相匹配的转发队列中。之后，当转发队列的开启时间到达时，转发节点则可以对该转发队列中缓存的数据报文进行转发，从而保证各业务的数据报文在该转发节点的转发时延满足要求。
由此可见，在相关技术中，为了满足时间敏感业务对转发时延的要求，在每个发送周期内，TSN中的各个发送节点以及各业务途经的转发节点要进行严格协作和精确配合，以此来保持各节点配置、动作的一致性，实施难度较大。
发明内容
本申请提供了一种业务处理方法及装置，可以用于解决相关技术中在转发时间敏感业务时，TSN中的各个节点由于需要保持配置、动作的一致性所造成的实施难度较大的问题。所述技术方案如下：
第一方面，提供了一种业务处理方法，所述方法包括：接收第一报文；根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序，所述第二报文是在所述第一报文之前接收的且还未发送的报文，所述当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度；按照所述第一报文和所述第二报文的发送顺序发送所述第一报文和所述第二报文。
在本申请实施例中，在接收到第二报文之后且该第二报文还未发送出去时，如果又接收到了第一报文，则转发节点可以根据这两个报文在当前节点处的当前紧迫度信息来确定这两个报文的发送顺序，其中，当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度。之后，转发节点可以按照确定的发送顺序来发送这两个报文。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
可选地，在根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序之前，还可以获取所述第一报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的初始紧迫度信息；获取所述第二报文在当前节点处的紧迫度校准信息；将所述第一报文在当前节点处的初始紧迫度信息作为所述第一报文在当前节点处的当前紧迫度信息，根据所述第二报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的紧迫度校准信息，确定所述第二报文在当前节点处的当前紧迫度信息。
其中，每个报文在当前节点处的初始紧迫度信息实际上可以作为相应报文到达当前节点处的时刻的紧迫度信息。而随着时间的流逝，报文在当前节点处的紧迫度信息将会发生变化，基于此，可以获取报文在当前节点处的紧迫度校准信息，并根据该紧迫度校准信息对初始紧迫度信息进行校正，从而得到当前紧迫度信息。
可选地，所述第一报文和所述第二报文均携带有紧迫度标识头，所述紧迫度标识头包括至少一个初始紧迫度信息；相应地，获取所述第一报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的初始紧迫度信息的实现过程可以为：从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
也即，在本申请实施例中，初始紧迫度信息可以由报文自身携带的紧迫度标识头来携带，这样，可以直接从报文的紧迫度标识头中获取相应报文在当前节点处的初始紧迫度信息。
可选地，当报文的紧迫度标识头中携带有至少一个初始紧迫度信息时，在一种可能的实现方式中，所述紧迫度标识头还包括到当前节点为止相应报文的剩余跳数，相应地，所述至少一个初始紧迫度信息是指报文在传输路径上的至少一个转发节点处的初始紧迫度信息，且所述至少一个初始紧迫度信息按照至少一个转发节点在相应报文的传输路径上的先后顺序排列。
也即，每个报文的紧迫度标识头中可以携带该报文在其途经的每个转发节点处的初始紧迫度信息。这样，为了使每个转发节点能够从该报文的紧迫度标识头携带的至少一个初始紧迫度信息中查找到该报文在该转发节点处的初始紧迫度信息，每个报文的紧迫度标识头中还可以包括剩余跳数。其中，报文到达一个转发节点时，该报文的剩余跳数为该转发节点与该转发节点之后该报文要途经的转发节点的数量的总和，当该报文离开该转发节点时，剩余跳数相应地减1。
可选地，从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息的实现过程可以为：根据 所述第一报文的剩余跳数以及所述第一报文的传输路径上的转发节点的数量，从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息；根据所述第二报文的剩余跳数以及所述第二报文的传输路径上的转发节点的数量，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
可选地，当报文的紧迫度标识头中携带有至少一个初始紧迫度信息时，在另一种可能的实现方式中，所述至少一个初始紧迫度信息包括相应报文在当前节点处的初始紧迫度信息，以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息；其中，相应报文在当前节点处的初始紧迫度信息以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息按照当前节点和相应报文在当前节点之后途经的转发节点在相应报文的传输路径上的先后顺序排列。
相应地，从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息的实现过程可以为：获取所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为所述第一报文在当前节点处的初始紧迫度信息；获取所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为所述第二报文在当前节点处的初始紧迫度信息。
在该种实现方式中，当一个报文到达一个转发节点时，该报文的紧迫度标识头中将携带有该报文在该转发节点处的初始紧迫度信息以及在该转发节点之后途经的每个转发节点处的初始紧迫度信息。由于各个初始紧迫度信息按照传输路径上的各个转发节点的先后顺序排列，因此，排在第一位的初始紧迫度信息即为在当前节点处初始紧迫度信息。
可选地，按照所述第一报文和所述第二报文的发送顺序发送所述第一报文和所述第二报文的实现过程可以为：删除所述第一报文的紧迫度标识头中所述第一报文在当前节点处的初始紧迫度信息；删除所述第二报文的紧迫度标识头中所述第二报文在当前节点处的初始紧迫度信息；按照所述第一报文和所述第二报文的发送顺序，发送删除初始紧迫度信息之后的第一报文和第二报文。
也即，当报文离开当前节点时，可以将该报文的紧迫度标识头中在当前节点处的初始紧迫度信息删除，这样，当该报文到达下一个转发节点时，紧迫度标识头中将只携带报文在下一个转发节点处的初始紧迫度信息以及下一个转发节点之后的转发节点处的初始紧迫度信息。换句话说，在该种实现方式中，报文每经过一跳，可以将该报文中对应的初始紧迫度信息进行删除。这样，当报文到达接收节点时，该报文中将不包含有初始紧迫度信息，接收节点可以直接对该报文进行恢复。
可选地，当当前节点为第一报文的传输路径上的第一个转发节点时，在根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序之前，还可以接收所述第一业务的紧迫度配置信息，所述紧迫度配置信息包括所述第一业务的多个报文中每个报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息；从所述第一业务的紧迫度配置信息中获取所述第一报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息；在所述第一报文中添加紧 迫度标识头，所述第一报文的紧迫度标识头包括所述第一报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息。
可选地，获取所述第一报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的初始紧迫度信息的实现过程还可以为：从存储的多个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息以及所述第二报文在当前节点处的初始紧迫度信息，所述多个初始紧迫度信息包括途经当前节点的多个业务中每个业务的多个报文在当前节点处的初始紧迫度信息。
也即，除了上述介绍的将初始紧迫度信息携带在报文中的方式，在本申请实施例中，每个转发节点中还可以预先存储有途经该转发节点的所有业务的报文在该转发节点处的初始紧迫度信息。这样，在接收到一个报文时，可以直接从存储的多个初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息。
其中，从存储的多个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息以及所述第二报文在当前节点处的初始紧迫度信息的实现过程可以为：确定所述第一报文在第一业务的多个报文中的位置，以及确定所述第二报文在第二业务的多个报文中的位置，所述第一业务是所述第一报文所属的业务，所述第二业务是所述第二报文所属的业务；根据所述第一报文在所述第一业务的多个报文中的位置，从所述多个初始紧迫度信息包括的所述第一业务的多个报文在当前节点处的初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息；根据所述第二报文在所述第二业务的多个报文中的位置，从所述多个初始紧迫度信息包括的所述第二业务的多个报文在当前节点处的初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
可选地，所述第二报文在当前节点处的紧迫度校准信息是指所述第二报文在当前节点处的已消耗时间。
可选地，所述初始紧迫度信息是指初始容忍时延，所述初始容忍时延是指相应的转发节点转发相应的报文时所允许的最大时延。相应地，根据所述第二报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的紧迫度校准信息，确定所述第二报文在当前节点处的当前紧迫度信息的实现过程可以为：将所述第二报文在当前节点处的初始容忍时延与所述第二报文在当前节点处的已消耗时间之间的差值确定为所述第二报文在当前节点处的剩余容忍时延；将所述第二报文在当前节点处的剩余容忍时延作为所述第二报文在当前节点处的当前紧迫度信息。在此基础上，根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序的实现过程可以为：根据所述第一报文在当前节点处的初始容忍时延和所述第二报文在当前节点处的剩余容忍时延，按照从小到大的顺序对所述第一报文和所述第二报文进行排序，得到所述第一报文和所述第二报文的发送顺序。
可选地，所述初始紧迫度信息是指初始优先级，所述初始优先级用于指示相应的转发节点转发相应的报文时的最低优先等级；相应地，根据所述第二报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的紧迫度校准信息，确定所述第二报文在当前节点处的当前紧迫度信息的实现过程可以为：根据所述第二报文在当前节点处的已消耗时间，确定所述第二报文的优先级增量；将所述第二报文在当前节点处的初始优先级和所述第二报文的优先级增量的总和确定为所述第二报文在当前节点处的当前优先级；将所述第二报文在当前节 点处的当前优先级作为所述第二报文在当前节点处的当前紧迫度信息。在此基础上，根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序的实现过程可以为：根据所述第一报文在当前节点处的初始优先级和所述第二报文在当前节点处的当前优先级，按照从高到低的顺序对所述第一报文和所述第二报文进行排序，得到所述第一报文和所述第二报文的发送顺序。
可选地，所述第一报文所属的第一业务的每个数据周期内的多个报文在当前节点处的初始紧迫度信息均不相同。也即，每个业务的每个数据周期内的多个报文在同一个节点处的初始紧迫度信息是不同的。
第二方面，提供了一种业务处理方法，所述方法包括：获取业务的时间需求信息；根据所述时间需求信息，确定所述业务的每个报文在传输路径上的每个转发节点处的容忍时延，所述容忍时延用于指示相应转发节点在转发相应报文时所允许的最大时延；根据每个报文在所述传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息，以指示所述入网侧边缘节点根据所述紧迫度配置信息确定所述业务的报文在缓存的多个报文中的发送顺序。
本申请实施例可以根据业务的时间需求信息来确定业务的每个报文在传输路径上的每个转发节点处的容忍时延，进而根据每个报文在传输路径上的每个转发节点处的容忍时延确定紧迫度配置信息。将该紧迫度配置信息下发至入网侧边缘节点，这样，入网侧边缘节点就可以根据该紧迫度配置信息来处理每个报文，以此来保证每个报文在各个转发节点处的转发时延不超过容忍时延，进而保证业务的传输满足时间需求。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
需要说明的是，每个报文在传输路径上的每个转发节点处的容忍时延是指相应报文在每个转发节点处所允许的最大时延。
可选地，所述时间需求信息包括所述业务的数据周期、所述数据周期内每个数据报文的大小、第一时间间隔和第二时间间隔。其中，所述第一时间间隔是指所述数据周期内第一个数据报文在发送节点处的开始发送时刻与所述数据周期的开始时刻之间的时间间隔；所述第二时间间隔是指所述数据周期内每相邻两个数据报文中前一个数据报文在所述发送节点处的发送完成时刻到下一个数据报文在所述发送节点处的开始发送时刻之间的时间间隔。
需要说明的是，数据周期内每相邻的两个数据报文之间的第二时间间隔可以相等，也可以不等。
可选地，根据所述时间需求信息，确定所述业务的每个报文在传输路径上的每个转发节点处的容忍时延的实现过程可以包括：根据所述时间需求信息，确定所述业务的每个报文的容忍时延总和；确定所述业务的传输路径；根据每个报文的容忍时延总和，确定每个报文在所述传输路径上的每个转发节点处的容忍时延。
其中，每个报文的容忍时延总和是指每个报文在传输过程中所允许的最大时延。
可选地，根据每个报文的容忍时延总和，确定每个报文在所述传输路径上的每个转发节点处的容忍时延的实现过程可以包括：确定所述传输路径上包括的转发节点的数量；根据每个报文的容忍时延总和以及所述传输路径上包括的转发节点的数量，确定每个报文在所述传 输路径上的每个转发节点处的容忍时延。
在该种实现方式中，可以根据每个报文的容忍时延总和以及传输路径上的转发节点的数量，来将相应报文的容忍时延总和平均分配到该传输路径上包括的多个转发节点上。
可选地，根据每个报文的容忍时延总和，确定每个报文在所述传输路径上的每个转发节点处的容忍时延的实现过程还可以为：根据所述传输路径上包括的各个转发节点的当前流量状况，确定每个报文在每个转发节点处的时延比重；根据每个报文的容忍时延总和以及每个报文在每个转发节点处的时延比重，确定每个报文在所述传输路径上的每个转发节点处的容忍时延。
在该种实现方式中，通过各个转发节点上的流量状况来预估各个转发节点的时延比重，进而根据该时延比重来分配报文在每个转发节点上的容忍时延，提高了容忍时延分配的准确性。
可选地，据每个报文在所述传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息的实现过程可以为：将所述业务的每个报文在每个转发节点处的容忍时延作为所述紧迫度配置信息；向所述入网侧边缘节点下发所述紧迫度配置信息。这样，在任意一个转发节点处，该转发节点均可以通过各个业务的报文在该节点处的容忍时延来衡量各个数据报文的转发紧迫度，进而优先转发容忍时延较小的数据报文。
可选地，根据每个报文在所述传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息的实现过程也可以为：获取每个转发节点的容忍时延区间与优先级之间的映射关系；从每个转发节点的容忍时延区间与优先级之间的映射关系中，获取每个报文在每个转发节点处的容忍时延对应的优先级；将获取到的每个报文在每个转发节点处的优先级作为所述紧迫度配置信息；向所述入网侧边缘节点下发所述紧迫度配置信息。
在本申请实施例中，也可以将每个报文在每个转发节点上的容忍时延折算为对应的优先级，以便每个转发节点可以根据各个报文的优先级进行转发。
可选地，在根据每个报文在所述传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息之前，还可以根据每个报文在所述传输路径上的每个转发节点处的容忍时延，检测每个报文在每个转发节点处是否满足转发需求；若每个报文在每个转发节点处均满足所述转发需求，则执行所述根据每个报文在所述传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息的步骤。
在本申请实施例中，在下发紧迫度配置信息之前，还可以根据每个报文在传输路径上的每个转发节点处的容忍时延，检测该传输路径上的每个转发节点是否均可以接纳每个报文，以此来判断该传输路径上的各个转发节点是否能够接纳该业务，如果确定能够接纳，再下发紧迫度配置信息，这样，可以避免由于无法接纳该业务而导致做无用功。
可选地，根据每个报文在所述传输路径上的每个转发节点处的容忍时延，检测每个报文在每个转发节点处是否满足转发需求的实现过程可以为：确定第一转发节点的第一缓存链表，所述第一缓存链表是指在第一报文到达所述第一转发节点的时刻所述第一转发节点缓存的报文的队列，所述第一报文是指所述业务中的任一报文，所述第一转发节点是指所述传输路径上的任一转发节点；根据所述第一缓存链表中的报文在所述第一转发节点上的容忍时延和所述第一报文在所述第一转发节点的容忍时延，按照从大到小的顺序对所述第一缓存链表中的报文和所述第一报文进行排序，得到第二缓存链表；若发送所述第二缓存链表中所述第一报 文之前的所有报文所需的总时长小于所述第一报文的容忍时延，且所述第二缓存链表中所述第一报文之后的每个报文的容忍时延均大于发送相应报文之前的所有报文所需的总时长，则确定所述第一报文在所述第一转发节点处满足转发需求。
可选地，所述入网侧边缘节点是指发送节点，或者，所述入网侧边缘节点是指所述传输路径上的第一个转发节点。也即，本申请实施例中，网络控制器可以向发送节点下发该紧迫度配置信息，也可以向传输路径上的第一个转发节点下发该紧迫度配置信息。
可选地，当所述入网侧边缘节点为所述传输路径上的第一个转发节点时，可以根据所述紧迫度配置信息，向所述传输路径上除所述第一个转发节点之外的每个转发节点发送每个报文在相应转发节点处的容忍时延或优先级，以指示除所述第一个转发节点之外的每个转发节点根据每个报文在相应转发节点处的容忍时延或优先级处理所述业务的报文。也即，在本申请实施例中，也可以直接向所有的转发节点下发该紧迫度配置信息，这样，在报文传输的过程中，可以不必在报文中携带对应的紧迫度配置信息，也即，避免了对报文的修改。
第三方面，提供了一种业务处理装置，所述业务处理装置具有实现上述第一方面或第二方面中的业务处理方法行为的功能。所述业务处理装置包括至少一个模块，该至少一个模块用于实现上述第一方面或第二方面所提供的业务处理方法。
第四方面，提供了一种业务处理装置，所述业务处理装置的结构中包括处理器和存储器，所述存储器用于存储支持业务处理装置执行上述第一方面或第二方面所提供的业务处理方法的程序，以及存储用于实现上述第一方面或第二方面所提供的业务处理方法所涉及的数据。所述处理器被配置为用于执行所述存储器中存储的程序。所述存储设备的操作装置还可以包括通信总线，该通信总线用于该处理器与存储器之间建立连接。
第五方面，提供了一种计算机可读存储介质，所述计算机可读存储介质中存储有指令，当其在计算机上运行时，使得计算机执行上述第一方面或第二方面所述的业务处理方法。
第六方面，提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述第一方面或第二方面所述的业务处理方法。
上述第三方面、第四方面、第五方面和第六方面所获得的技术效果与第一方面和第二方面中对应的技术手段获得的技术效果近似，在这里不再赘述。
本申请提供的技术方案带来的有益效果至少包括：
在本申请实施例中，在接收到第二报文之后且该第二报文还未发送出去时，如果又接收到了第一报文，则转发节点可以根据这两个报文在当前节点处的当前紧迫度信息来确定这两个报文的发送顺序，其中，当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度。之后，转发节点可以按照确定的发送顺序来发送这两个报文。也即，本申请实施例中转发节点可以通过各个报文在当前节点处的当前紧迫度信息来确定各个报文的发送顺序，以此来保证各个报文在转发节点处的传输时延不超过允许的时延，进而保证报文所属的业务的传输满足时间需求。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
附图说明
图1是本申请实施例提供的业务处理方法的系统结构图；
图2是本申请实施例提供的一种网络设备的结构图；
图3是本申请实施例提供的一种业务处理方法的流程图；
图4是本申请实施例提供的业务的数据周期的示意图；
图5是本申请实施例提供的确定每个数据报文在每个转发节点处的容忍时延的流程图；
图6是本申请实施例提供的该业务的传输路径以及该传输路径上的每个转发节点处的当前的流量状况的示例图；
图7是本申请实施例检测第一数据报文在第一转发节点处是否满足转发需求的流程图；
图8是本申请实施例提供的另一种业务处理方法的流程图；
图9是本申请实施例提供的一种以太网报文中的紧迫度标识头的示意图；
图10是本申请实施例提供的另一种以太网报文中的紧迫度标识头的示意图；
图11是本申请实施例提供的又一种业务处理方法的流程图；
图12是本申请实施例提供的又一种业务处理方法的流程图；
图13是本申请实施例提供的一种业务处理装置的框图；
图14是本申请实施例提供的另一种业务处理装置的框图。
具体实施方式
为使本申请的目的、技术方案和优点更加清楚，下面将结合附图对本申请实施方式作进一步地详细描述。
在对本申请实施例进行详细的解释说明之前，先对本申请实施例涉及的应用场景进行介绍。
伴随着各传统产业的数字化转型趋势，目前，以以太网、传输控制协议(transmission control protocol，TCP)和互联网协议(internet protocol，IP)为基础的网络技术正在大举进入各类垂直行业，例如工业制造、大型飞行器内部网络、车联网、音视频录制网络等。这些垂直行业对网络转发服务的需求有一个很重要的指标，即对数据报文转发有着明确的时间需求。
例如，以音视频录制网络场景为例，在进行现场音视频录制时，视频画面和音频需要保证严格的节奏同步。从歌唱家(或演奏家或演奏乐器)发音变化到听到由该动作相伴产生的声音信号的时间差需要小于10ms，这个时间区间还包含了数模转换、DSP芯片的处理延时，混音器处理延时等时间，留给网络用来传输音频信号数据的时间小于2ms，因此，显然对于此类业务的转发有着明确的传输时延的需求。通常，将这类业务称为时间敏感业务。
再例如，在常见的工业控制场景中，控制器可以向执行器发送控制命令，执行器在接收到控制器的控制命令之后，根据该控制命令执行相应的动作，并将执行结果和状态上报给控制器。通常，上述过程中的控制、执行以及执行反馈是在一个固定的控制周期内完成的。在这个控制周期内，控制器下发控制指令、执行器接收控制指令以及执行器执行动作并反馈执行结果所消耗的时间基本是固定的，去除上述这部分时间，剩余的时间即为控制器与执行器的通信时间，也即，控制指令与执行结果的传输时间，显然，该通信时间也有着非常明确的时间要求，以保证在该控制周期内执行完所有的动作。
本申请实施例提供的业务处理方法即可以应用于上述场景中，以对上述场景中的时间敏感业务进行处理，从而满足这类业务的转发需求。需要说明的是，上述应用场景仅是本申请实施例给出的几个示例性的场景，对于其他场景中的时间敏感业务，本申请实施例提供的业务处理方法同样适用。
接下来对本申请实施例涉及的系统架构进行介绍。
图1是本申请实施例提供的一种业务处理方法的网络系统架构图。如图1所示，该网络系统中可以包括发送节点10、转发节点20、接收节点30和网络控制器40。
其中，发送节点10是指发送业务的终端。在本申请中，在发送节点10发送业务的报文之前，可以向网络控制器40上报该业务的时间需求信息。
转发节点20可以根据本申请实施例提供的业务处理方法对发送节点10发送的业务进行转发。其中，转发节点20可以有多个。
接收节点30是指接收发送节点10发送的业务的终端。其中，接收节点30可以接收转发节点20中的最后一个转发节点发送的业务的报文。
网络控制器40可以获取该网络系统中的各个设备的信息，并根据本申请实施例提供的业务处理方法来确定发送节点10发送的业务的每个报文的紧迫度配置信息，进而通过该紧迫度配置信息来控制发送节点10和各转发节点20进行业务的转发，以此来保证业务的转发时延满足时间要求。
需要说明的是，发送节点10和接收节点30均可以为工业电脑、台式机、便携式电脑等终端设备。转发节点20可以为交换机等转发设备。网络控制器40可以为一台服务器或一个服务器集群，或者也可以为一台通用的计算机设备。本申请实施例对此不做具体限定。
另外，在本申请实施例中，可以将发送节点10或转发节点20中作为发送节点10的下一跳的转发节点称为入网侧边缘节点。将接收节点30或转发节点20中作为接收节点30的上一跳的转发节点称为出网侧边缘节点。而除上述的转发节点之外的其他转发节点可以称为中间转发节点。
图2是本发明实施例提供的一种网络设备的结构示意图。图1中的发送节点、转发节点、接收节点和网络控制器均可以通过图2所示的网络设备来实现。参见图2，该网络设备包括至少一个处理器201，通信总线202，存储器203以及至少一个通信接口204。
处理器201可以是一个通用中央处理器(Central Processing Unit，CPU)，微处理器，特定应用集成电路(application-specific integrated circuit，ASIC)，或一个或多个用于控制本申请方案程序执行的集成电路。
通信总线202可包括一通路，在上述组件之间传送信息。
存储器203可以是只读存储器(read-only memory，ROM)或可存储静态信息和指令的其它类型的静态存储设备，随机存取存储器(random access memory，RAM))或者可存储信息和指令的其它类型的动态存储设备，也可以是电可擦可编程只读存储器(Electrically Erasable Programmable Read-Only Memory，EEPROM)、只读光盘(Compact Disc Read-Only Memory，CD-ROM)或其它光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其它磁存储设备、或者能够用于携带或存储具有指令 或数据结构形式的期望的程序代码并能够由计算机存取的任何其它介质，但不限于此。存储器203可以是独立存在，通过通信总线202与处理器201相连接。存储器203也可以和处理器201集成在一起。
通信接口204，使用任何收发器一类的装置，用于与其它设备或通信网络通信，如以太网，无线接入网(RAN)，无线局域网(Wireless Local Area Networks，WLAN)等。
在具体实现中，作为一种实施例，处理器201可以包括一个或多个CPU，例如图2中所示的CPU0和CPU1。
在具体实现中，作为一种实施例，该网络设备可以包括多个处理器，例如图2中所示的处理器201和处理器205。这些处理器中的每一个可以是一个单核(single-CPU)处理器，也可以是一个多核(multi-CPU)处理器。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(例如计算机程序指令)的处理核。
在具体实现中，作为一种实施例，网络设备还可以包括输出设备206和输入设备207。输出设备206和处理器201通信，可以以多种方式来显示信息。例如，输出设备206可以是液晶显示器(liquid crystal display，LCD),发光二级管(light emitting diode，LED)显示设备，阴极射线管(cathode ray tube，CRT)显示设备，或投影仪(projector)等。输入设备207和处理器201通信，可以以多种方式接收用户的输入。例如，输入设备207可以是鼠标、键盘、触摸屏设备或传感设备等。
上述的网络设备可以是一个通用计算机设备或者是一个专用计算机设备。在具体实现中，网络设备可以是台式机、便携式电脑、网络服务器、移动手机、平板电脑、无线终端设备、通信设备或者嵌入式设备。本发明实施例不限定网络设备的类型。
其中，存储器203用于存储执行本申请方案的程序代码，并由处理器201来控制执行。处理器201用于执行存储器203中存储的程序代码208。程序代码208中可以包括一个或多个软件模块。其中，图1中所示的发送节点、转发节点、接收节点或网络控制器可以通过处理器201以及存储器203中的程序代码208中的一个或多个软件模块，来执行相应地操作。
接下来对本申请实施例提供的业务处理方法进行介绍。
图3是本申请实施例提供的一种业务处理方法的流程图。该方法可以应用于图1所示的网络系统中的网络控制器，参见图3，该方法包括以下步骤：
步骤301：获取业务的时间需求信息。
其中，发送节点在发送业务的报文之前，可以先向网络控制器发送该业务的时间需求信息。相应地，网络控制器可以接收发送节点发送的该业务的时间需求信息。其中，该业务的时间需求信息可以包括该业务的数据周期、该数据周期内每个报文的大小、第一时间间隔和第二时间间隔。第一时间间隔是指该数据周期内第一个报文在发送节点处的开始发送时刻与该数据周期的开始时刻之间的时间间隔；第二时间间隔是指该数据周期内每相邻两个报文中前一个报文在发送节点处的发送完成时刻到下一个报文在发送节点处的开始发送时刻之间的时间间隔。
可选地，在本申请实施例中，该业务的数据周期内还可以包括预留时间，该预留时间是指为接收节点预留的在接收到该数据周期内的所有报文后的数据处理时间。
示例性地，图4示出了一个业务的数据周期的示意图。如图4所示，在该业务的数据周 期内发送节点将发送n个报文。其中，第一个报文的开始发送时刻与该业务的数据周期的开始时刻之间的时间差值T s_off即为第一时间间隔。每个报文的发送完成时刻与该报文的下一个报文的开始发送时刻之间的时间差值T int为第二时间间隔。△r是为接收节点预留的数据处理时间，也即预留时间。
需要说明的是，在本申请实施例中，第二时间间隔可以为一个，也即，该数据周期内每相邻的两个报文之间的第二时间间隔均相等。当然，第二时间间隔也可以为多个，也即，该数据周期内相邻的两个报文之间的第二时间间隔可以不同。例如，第一个报文与第二个报文之间的第二时间间隔可以与第二个报文和第三个报文之间的第二时间间隔不相等。
步骤302：根据该时间需求信息，确定业务的每个报文在传输路径上的每个转发节点处的容忍时延。
在接收到业务的时间需求信息之后，参见图5，网络控制器可以通过以下三个步骤来根据该时间需求信息，确定该业务的每个报文在传输路径上的每个转发节点处的容忍时延。
3021：根据该时间需求信息，确定该业务的每个报文的容忍时延总和。
其中，网络控制器可以通过下述计算模型(1)来确定该业务的每个报文的容忍时延总和：
D t(i)＝T cyc-T s_off-∑(P size(i)/BW)-∑T int(i)-Δr    (1)
其中，D t(i)是指第i个报文的容忍时延总和，T cyc是指数据周期，T s_off是指第一时间间隔，P size(i)是指第i个报文的大小，BW是指当前的发送节点带宽，∑(P size(i)/BW)用于表示发送节点发送第i个报文和第i个报文之前的所有报文所耗费的总时间。T int(i)是指第i个报文的开始发送时刻与前一个报文的发送完成时刻之间的时间差值，也即第i个报文与前一个报文之间的第二时间间隔，∑T int(i)是指在第i个报文之前所有的第二时间间隔的总和。Δr是指预留时间。
需要说明的是，对于发送节点将在该数据周期内发送的该业务的第一个报文，网络控制器可以根据第一个报文的大小以及当前的发送节点带宽来确定发送节点发送第一个报文所耗费的时间。之后，将该数据周期内发送第一个报文所耗费的时间以及第一时间间隔刨除，剩余的时间即为第一个报文在至少一个转发节点上所允许的最大转发时延，也即，第一个报文的容忍时延总和。
对于将要在数据周期内发送的该业务的第二个报文，网络控制器可以根据第二个报文的大小以及当前的发送节点带宽来确定发送第二个报文所耗费的时间，之后，将该数据周期内发送第一个报文所耗费的时间、发送第二个报文所耗费的时间、第一时间间隔以及第一个报文与第二个报文之间的第二时间间隔刨除，剩余的时间即为第二个报文在至少一个转发节点上所允许的最大转发时延，也即，第二个报文的容忍时延总和。对于将要在该数据周期内发送的该业务的第三个报文，可以参考第二个报文的处理方式，从而确定得到第三个报文的容忍时延总和，以此类推，可以确定该业务的每个报文的容忍时延总和。
可选地，若该时间需求信息中还包括为接收节点预留的数据处理时间，则在确定每个报文的容忍时延总和时，如计算模型(1)中所示，还可以将该预留时间也去除。
3022：确定该业务的传输路径。
在确定该业务的每个报文的容忍时延总和之后，网络控制器可以确定该业务的传输路径。
其中，发送节点在向网络控制器发送时间需求信息时，还可以发送该业务对应的源互联网协议(Internet protocol，IP)地址和目的IP地址。相应地，网络控制器可以接收该源IP地 址和目的IP地址。另外，网络控制器中存储有当前网络的拓扑信息和该网络中每个节点的资源信息。基于此，网络控制器可以根据该业务的源IP地址、目的IP地址和该网络的拓扑信息，从该网络的多条路径中选择一条路径，并将选择的路径作为该业务的传输路径。该业务的报文将途经该传输路径中包含有所有转发节点，从而到达接收节点。
可选地，网络控制器根据网络的拓扑信息可能会确定得到从发送节点到接收节点的多条路径。在这种情况下，网络控制器可以根据每条路径中包含的每个转发节点的资源信息，从该多条路径中选择一条路径作为该业务的传输路径。
示例性的，对于该多条路径中的每条路径，网络控制器可以根据该条路径中每个转发节点处的可用资源信息，如每个转发节点的发送队列缓存最大深度或平均深度等信息，分析每个数据周期内该业务的报文若通过该转发节点进行转发，是否会导致该转发节点的发送队列缓存溢出。若通过该转发节点转发可能会导致该转发节点的发送队列缓存溢出，则说明通过该转发节点发送该业务的报文有可能会导致丢包，此时，则可以不选择这条路径作为传输路径。通过上述方式，网络控制器可以将多条路径中有可能导致该业务的报文发送丢包的路径去除，从剩余的路径中选择一条路径作为该业务的传输路径。
上述仅是本申请实施例给出的两种确定业务的传输路径的可行的实现方式，当然，网络控制器也可以通过负载均衡等其他方式来为该业务选择传输路径，本申请实施例在此不做限定。
另外，还需要说明的是，步骤3022可以与步骤3021同时执行，也可以在步骤3021之前执行，本申请实施例对此不做限定。
3023：根据每个报文的容忍时延总和，确定每个报文在该业务的传输路径上的每个转发节点处的容忍时延。
在确定该业务的传输路径以及该业务的每个报文的容忍时延总和之后，网络控制器可以根据每个报文的容忍时延总和来分配每个报文在所经过的每个转发节点处的容忍时延。
示例性地，在一种可能的实现方式中，网络控制器可以确定该业务的传输路径上包括的转发节点的数量，之后，根据每个报文的容忍时延总和以及该传输路径上包括的转发节点的数量，确定每个报文在该传输路径上的每个转发节点处的容忍时延。
其中，该业务的每个报文都将流经该业务的传输路径上的所有转发节点，最终到达接收节点。因此，该业务的传输路径上包括的转发节点的数量即是该业务的每个报文所要流经的转发节点的数量。在确定该传输路径上包括的转发节点的数量之后，网络控制器可以将每个报文的容忍时延总和与转发节点的数量的比值作为相应报文在每个转发节点处的容忍时延。也即，在该种实现方式中，可以将每个报文的容忍时延总和平均分配到该传输路径的每个转发节点上，从而得到相应报文在每个转发节点处的容忍时延。此时，对于任一个报文而言，该报文在传输路径上的每个转发节点处的容忍时延均相等。
另外，值得注意的是，根据前述步骤3021中的介绍可知，对于该业务的同一个数据周期内的多个报文来说，该多个报文的容忍时延总和是不同的，在此基础上，根据上述方法确定的每个报文在每个转发节点处的容忍时延也是不同的。由此可见，该多个报文在同一个转发节点处的容忍时延不同。
可选地，在另一种可能的实现方式中，网络控制器可以根据该传输路径上包括的各个转发节点的当前流量状况，确定每个报文在每个转发节点处的时延比重；根据每个报文的容忍 时延总和以及每个报文在每个转发节点处的时延比重，确定每个报文在传输路径上的每个转发节点处的容忍时延。
其中，网络控制器可以根据每个转发节点当前的流量状况，确定每个报文在每个转发节点处可能消耗的最长时间。之后，根据每个报文在各个转发节点处可能消耗的最长时间来确定每个报文在各个转发节点处的时延比重，将每个报文的容忍时延总和与每个转发节点的时延比重的乘积作为相应报文在相应转发节点处的容忍时延。
示例性地，图6示出了该业务的传输路径以及该传输路径上的每个转发节点处的当前的流量状况。如图6所示，该传输路径上包括发送节点S、转发节点SW1、转发节点SW4、转发节点SW5和接收节点R。其中，转发节点SW1当前承载的业务有f1，转发节点SW4上当前承载的业务有f1、f2和f3，转发节点SW5上当前承载的业务有f1和f4。假设f1-f4这四个业务的数据周期均相等，且数据周期内均包括一个报文，每个转发节点的端口发送时间为t，则在第一个转发节点SW1处，转发时间为t，也即对当前待发送的业务的报文，在最坏的情况下，在转发节点SW1处需要经过t后发送出去，换句话说，在转发节点SW1处的最大转发时延为t。在转发节点SW4处，由于f1-f3的汇聚作用，对于该业务的报文，在最坏的情况下，在该转发节点SW4处需要经过3t后发送出去，换句话说，该业务的报文在该转发节点SW4处的最大转发时延为3t。同理，在转发节点SW处的最大转发时延为2t。由此可见，根据每个转发节点处当前承载的业务的流量状况，确定得到该业务的报文在每个转发节点处可能的最大转发时延分别为t、3t、2t，由此可以得到该业务的报文在每个转发节点处的时延比重分别为1/6、3/6、2/6。假设该业务的任一报文的容忍时延总和为D t，则根据上述确定得到的每个转发节点处的时延比重可以得到该报文在转发节点SW1处的容忍时延为
Figure PCTCN2020084183-appb-000001
D t，在转发节点SW4处的容忍时延为
Figure PCTCN2020084183-appb-000002
D t，在SW5处的容忍时延为
Figure PCTCN2020084183-appb-000003
D t。
值得注意的是，当通过该种实现方式来确定报文在每个转发节点处的容忍时延时，对于该业务的一个数据周期内的多个报文，该多个报文在同一个转发节点处的容忍时延有可能相同也有可能不同，并且，同一个报文在不同转发节点处的容忍时延有可能相同也有可能不同。
需要说明的是，当采用上述第一种方式来确定报文在每个转发节点处的容忍时延时，操作步骤简单，运算量较小。当通过上述介绍的第二种实现方式来确定报文在每个转发节点处的容忍时延时，由于考虑了传输路径中各个转发节点上所承载的业务的流量状况，因此，确定得到的每个节点处的容忍时延更接近实际情况，更为准确。
步骤303：根据每个报文在传输路径上的每个转发节点处的容忍时延，检测每个报文在每个转发节点处是否满足转发需求。
在确定了该业务的每个报文在传输路径上的每个转发节点处的容忍时延之后，网络控制器还可以根据每个报文在每个转发节点处的容忍时延来判断每个报文在每个转发节点处是否均满足转发需求。其中，转发需求是报文在相应节点处能够被接纳所需满足的条件。也即，网络控制器可以通过本步骤来判断相应报文是否能够在每个转发节点处均被接纳。
接下来以判断该业务的任一报文在任一转发节点处是否满足转发需求为例来对本步骤进行说明。其中，为了方便描述，将该报文称为第一报文，将该转发节点称为第一转发节点。参见图7，网络控制器可以通过以下三个步骤来检测第一报文在第一转发节点处是否满足转发需求。
3031：确定第一转发节点的第一缓存链表，第一缓存链表是指在第一报文到达第一转发 节点的时刻第一转发节点缓存的报文的队列。
在本申请实施例中，网络控制器可以根据接收到的各个业务的时间需求信息以及维护的当前网络的拓扑信息和该网络中每个节点的资源信息，来预估该网络中每个转发节点在各个时间段内的缓存链表。基于此，网络控制器可以根据第一转发节点在传输路径上所处的位置，预估第一报文到达第一转发节点的时刻，并根据第一报文到达第一转发节点的时刻从预估的第一转发节点在多个时间段对应的多个缓存链表中获取对应的第一缓存链表。
其中，网络控制器可以根据时间需求信息确定第一报文从发送节点发出的时间。之后，由于步骤302中已确定得到第一报文在每个转发节点处的容忍时延，因此，网络控制器可以根据第一报文在第一转发节点之前的每个转发节点处的容忍时延以及第一报文从发送节点处发出的时间，预估第一报文到达第一转发节点处的时刻。之后，网络控制器可以从预估得到的各个时间段对应的缓存链表中获取第一报文到达第一转发节点的时刻所属的时间段所对应的缓存链表，进而将获取的缓存链表作为第一缓存链表。
可选地，在另一种可能的实现方式中，网络控制器可以根据该业务的数据周期，从预估的各个时间段的缓存链表中选择与该数据周期匹配的缓存链表，将选择的缓存链表作为第一缓存链表。例如，假设该业务的数据周期为t1-t4，则网络控制器可以从各个时间段中选择包含有该数据周期的时间段，并将选择的时间段对应的缓存链表作为第一缓存链表。
3032：根据第一缓存链表中的报文在第一转发节点上的容忍时延和第一报文在第一转发节点的容忍时延，按照从大到小的顺序对第一缓存链表中的报文和第一报文进行排序，得到第二缓存链表。
在确定第一缓存链表之后，网络控制器可以获取第一缓存链表中每个报文在第一转发节点上的容忍时延。其中，第一缓存链表中每个报文在第一转发节点上的容忍时延可以是网络控制器在对相应报文进行处理时采用前述实施例中确定容忍时延的方法得到并存储的。在本步骤中，网络控制器可以直接获取存储的第一缓存链表中每个报文在第一转发节点上的容忍时延。
在获取到第一缓存链表中每个报文在第一转发节点上的容忍时延之后，网络控制器可以根据第一缓存链表中各个报文在第一转发节点上的容忍时延与第一报文在第一转发节点上的容忍时延的大小，按照从大到小的顺序对第一缓存链表中的报文与第一报文进行排序，从而得到第二缓存链表。
在得到第二缓存链表之后，网络控制器可以判断第一转发节点发送第二缓存链表中第一报文之前的所有报文所需的总时长是否小于第一报文的容忍时延，并判断该业务中第一报文之后的每个报文的容忍时延是否均大于第一转发节点发送相应报文之前的所有报文所需的总时长。
例如，假设第二缓存链表为[P 1，P 2，P 3，P 4，P 5，P 6，P 7，P 8，P 9，P 10]，第一报文为P 7，则对于P 1-P 6这六个报文，网络控制器可以确定每个报文的大小与第一转发节点的端口速率之间的比值，该比值即为第一转发节点转发相应报文所需的时间。将第一转发节点转发这六个报文所需的时间的总和与第一报文的容忍时延进行比较，若发送这六个报文所需的时间的总和小于第一报文的容忍时延，则网络控制器可以继续判断P 7之后的每个报文的容忍时延是否均大于发送之前所有报文所需的总时长。其中，网络控制器判断P 7之后的每个报文的容忍时延是否均大于发送之前所有报文所需的总时长的方法，可以参考判断P 7的容忍时延是否大于 发送之前六个报文所需的总时长的方法，本申请实施例在此不再赘述。
需要说明的是，在上述示例中，网络控制器也可以在判断P 7在第一转发节点处的容忍时延是否大于发送前六个报文所需的总时长的同时，判断P 7之后的每个报文的容忍时延是否大于发送之前所有报文所需的总时长。也即，上述各个判断操作可以同时进行。
3033：若发送第二缓存链表中第一报文之前的所有报文所需的总时长小于第一报文的容忍时延，且第二缓存链表中第一报文之后的每个报文的容忍时延均大于发送相应报文之前的所有报文所需的总时长，则确定第一报文在第一转发节点处满足转发需求。
如果通过步骤3032判断之后确定第一报文在第一转发节点处的容忍时延大于第一转发节点发送第一报文之前的所有报文所需的总时长，且第一报文之后的每个报文的容忍时延也均大于第一转发节点发送相应报文之前的所有报文所需的总时长，则说明第一转发节点可以接纳该第一报文。也即，第一报文在第一转发节点处满足转发需求。
可选地，如果第一报文在第一转发节点处的容忍时延不大于第一转发节点发送第一报文之前所有报文所需的总时长，或者是，如果第一报文之后的每个报文在第一转发节点处的容忍时延不大于第一转发节点发送相应报文之前的所有数据报文所需的总时长，则说明第一转发节点无法接纳该第一报文，也即，第一报文在第一转发节点处不满足转发需求。
对于该传输路径中的每个转发节点，网络控制器均可以参考对第一转发节点的处理方式，来判断第一报文在每个转发节点处是否满足转发需求。进一步地，对于该业务中的每个报文，网络控制器均可以参考前述对第一报文的处理方式，来确定每个报文在传输路径中的每个转发节点上是否均满足转发需求。若每个报文在每个转发节点处均满足转发需求，则说明该传输路径可以接纳该业务的数据周期内的报文。在这种情况下，网络控制器可以执行步骤304。
可选地，若通过上述方式确定得到该业务中存在某个报文在传输路径的某个转发节点处不满足转发需求，则说明该传输路径无法接纳该业务的报文。在这种情况下，网络控制器可以向发送节点发送失败通知消息，以指示发送节点该业务的报文无法被接纳。
步骤304：若每个报文在每个转发节点处均满足转发需求，则根据每个报文在传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息。
如果通过步骤303确定每个报文在每个转发节点处均满足转发需求，也即，该业务的报文可以被接纳，则网络控制器可以根据每个报文在传输路径上的每个转发点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息。
其中，在一种可能的实现方式中，网络控制器可以直接将每个报文的在每个转发节点处的容忍时延作为紧迫度位置信息，并向入网侧边缘节点下发该紧迫度配置信息。也即，该紧迫度配置信息可以包括每个报文在每个转发节点处的容忍时延。
可选地，在另一种可能的实现方式中，网络控制器可以获取每个转发节点的容忍时延区间与优先级之间的映射关系；从每个转发节点的容忍时延区间与优先级之间的映射关系中，获取每个报文在每个转发节点处的容忍时延对应的优先级。将获取到的每个报文在每个转发节点处的优先级作为紧迫度配置信息，并向入网侧边缘节点下发该紧迫度配置信息。
其中，网络控制器可以按照每个转发节点上各个时间段内的缓存链表中包含的报文的容忍时延的大小，划分得到多个容忍时延区间，各个容忍时延区间不重合。之后，为每个容忍时延区间设置一个对应的优先级，从而得到每个转发节点的容忍时延区间与优先级之间的映射关系。需要说明的是，容忍时延区间的下限值越小，则对应的优先级越高。
需要说明的是，每个转发节点的容忍时延区间与优先级之间的对应关系可以是网络控制器通过上述方式预先生成并存储的，也可以是网络控制器在当前时刻生成的。本申请实施例对此不做限定。
在获取到每个转发节点的容忍时延区间与优先级之间的映射关系之后，以第一报文和第一转发节点为例，网络控制器可以从第一转发节点的容忍时延区间与优先级之间的映射关系中，确定包含有第一报文在第一转发节点处的容忍时延的容忍时延区间，之后，将确定的容忍时延区间对应的优先级确定为第一报文在第一转发节点处的优先级。对于该业务中的每个报文，以及该业务的传输路径上的每个转发节点，网络控制器均可以参照上述第一报文、第一节点的实现方式，从而确定得到每个报文在该传输路径上的每个转发节点处的优先级。之后，网络控制器可以将每个报文在每个转发节点处的优先级作为该业务的紧迫度配置信息进行下发，也即，该紧迫度配置信息包括每个报文在每个转发节点处的优先级。
需要说明的是，上述仅是本申请实施例给出的两种确定紧迫度配置信息的可行实现方式。当然，也可以通过其他转换的方式将每个报文在每个转发节点处的容忍时延转换为其他可以用于指示相应报文在每个转发节点处的转发紧急程度的信息，从而得到紧迫度配置信息。例如，可以将每个报文在每个转发节点处的容忍时延按照一定的比例进行缩放，从而得到每个报文在每个转发节点处的时间折算值，将这些折算值作为紧迫度配置信息。示例性地，如当链路速率为b时，可以以64B长度的数据转发所消耗的时间作为一个单位，也即，以64B/b为单位，对每个报文在每个转发节点处的容忍时延进行折算，从而得到每个报文在每个转发节点处的时间折算值。
综上可知，业务的紧迫度配置信息可以包括该业务的每个报文在每个转发节点处的容忍时延、或者是优先级或者是其他用于标识转发紧急程度的时间折算值，将这一类可以用于标识转发紧急程度的信息称为初始紧迫度信息，也即，该业务的紧迫度配置信息可以包括该业务的每个报文在每个转发节点处的初始紧迫度信息。
另外，在本申请实施例中，紧迫度配置信息不仅可以包括每个报文在每个转发节点处的初始紧迫度信息，还可以包括用于标识该业务的五元组信息中的全部或部分信息。当该紧迫度配置信息包括五元组信息中的部分信息时，该部分信息可以为该业务的源IP地址和目的IP地址。
表1是本申请实施例示出的一种业务的紧迫度配置信息的示例。如表1中所示，该紧迫度配置信息中包括索引信息和紧迫度信息列表，其中，索引信息包括该业务的源IP地址和目的IP地址，用于标识该业务。紧迫度信息列表中包括该业务的n个报文中每个报文的报文标识以及每个报文的报文标识对应的在m个转发节点中的每个转发节点处的初始紧迫度信息。其中，P 1-P n分别用于标识该业务中的第1-n个报文。Urg nm用于表示第n个报文在第m个转发节点处的初始紧迫度信息。例如，Urg 11即表示第1个报文在第1个转发节点处的初始紧迫度信息。
表1紧迫度配置信息
Figure PCTCN2020084183-appb-000004
在确定紧迫度配置信息之后，网络控制器可以将该紧迫度配置信息下发至入网侧边缘节点，以便入网侧边缘节点可以根据该紧迫度配置信息来对该业务的报文进行处理。其中，由 前述系统架构的相关介绍可知，该入网侧边缘节点可以为发送节点，也可以为该传输路径上位于发送节点的下一跳的转发节点，也即，该传输路径上的第一个转发节点。
需要说明的是，在本申请实施例中，如果入网侧边缘节点为该传输路径上的第一个转发节点，则网络控制器不仅可以向第一个转发节点下发该紧迫度配置信息，还可以根据该紧迫度配置信息，向该传输路径上的除第一个转发节点外的每个转发节点发送各个报文在相应转发节点处的初始紧迫度信息，以便每个转发节点在接收到该业务的报文时，可以根据该业务的报文在该转发节点处的初始紧迫度信息对该业务的报文进行处理。
另外，在本申请实施例中，步骤303为可选步骤，当网络控制器不执行步骤303时，该网络控制器在确定每个报文在传输路径上的每个转发节点处的容忍时延之后，可以直接根据每个数据报文在传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息。
在本申请实施例中，网络控制器可以根据业务的时间需求信息来确定业务的每个报文在传输路径上的每个转发节点处的容忍时延，进而根据每个报文在传输路径上的每个转发节点处的容忍时延确定紧迫度配置信息。将该紧迫度位置信息下发至入网侧边缘节点，这样，入网侧边缘节点就可以根据该紧迫度配置信息来处理每个报文，以此来保证每个报文在各个转发节点处的转发时延不超过容忍时延，进而保证业务的传输满足时间需求。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
由上述实施例中的相关介绍可知，对于任一个业务，网络控制器可以向入网侧边缘节点下发该业务的紧迫度配置信息。其中，当入网侧边缘节点为该业务的传输路径上的第一个转发节点时，该入网侧边缘节点可以通过图8所示的业务处理方法，根据该紧迫度配置信息来对该业务的报文进行处理。
图8是本申请实施例示出的另一种业务处理方法，该方法可以应用于入网侧边缘节点，其中，该入网侧边缘节点是指业务的传输路径上的第一个转发节点。如图8所示，该方法包括以下步骤：
步骤801：接收第一报文，该第一报文为第一业务的报文。
步骤802：接收第一业务的紧迫度配置信息，该紧迫度配置信息包括第一业务的多个报文中每个报文在第一业务的传输路径上的每个转发节点处的初始紧迫度信息。
网络控制器可以向入网侧边缘节点下发第一业务的紧迫度配置信息。相应地，该入网侧边缘节点可以接收第一业务的紧迫度配置信息。
需要说明的是，本步骤可以在步骤801之前执行。
步骤803：从第一业务的紧迫度配置信息中获取第一报文在第一业务的传输路径上的每个转发节点处的初始紧迫度信息。
其中，由于第一业务的紧迫度配置信息包括第一业务的多个报文中每个报文在第一业务的传输路径上的每个转发节点处的初始紧迫度信息，因此，该入网侧边缘节点在接收到第一报文时，可以从第一业务的紧迫度配置信息中获取第一报文在传输路径上的每个转发节点处的初始紧迫度信息。其中，第一报文在各个转发节点处的初始紧迫度信息可以相同也可以不同。另外，对于第一业务的一个数据周期内的多个报文，该多个报文在该第一业务的传输路 径上的同一个转发节点处的初始紧迫度信息可以不同，也可以相同。
需要说明的是，由于该入网侧边缘节点可能是多个业务的第一个转发节点，因此，该入网侧边缘节点可能接收并存储了多个业务的紧迫度配置信息。基于此，该入网侧边缘节点在接收到第一报文时，可以根据第一报文中携带的源地址和目的地址，从多个业务的紧迫度配置信息中确定第一业务的紧迫度配置信息，之后，入网侧边缘节点可以根据第一报文在该业务的多个报文中所处的位置，从第一业务的紧迫度配置信息中获取第一报文在各个转发节点处初始紧迫度信息。
例如，以步骤304中表1所示的紧迫度配置信息为例，该紧迫度配置信息中可以包括每个报文的报文标识，且该报文标识可以用于标识相应报文在该业务的多个报文中的排序。基于此，在本申请实施例中，当接收到第一报文时，该入网侧边缘节点可以确定第一报文是该业务的第几个报文，从而得到第一报文的报文标识。之后，该入网侧边缘节点可以从第一业务的紧迫度配置信息中获取第一报文的报文标识对应的在每个转发节点处的初始紧迫度信息。
步骤804：在第一报文中添加紧迫度标识头，该第一报文的紧迫度标识头包括第一报文在第一业务的传输路径上的每个转发节点处的初始紧迫度信息。
在获取到第一报文在每个转发节点处的初始紧迫度信息之后，该入网侧边缘节点可以在第一报文中添加紧迫度标识头，并将第一报文在每个转发节点处的初始紧迫度信息携带在该紧迫度标识头中。其中，在该紧迫度标识头中，第一报文在每个转发节点处的初始紧迫度信息按照各个转发节点在传输路径上的先后顺序排列。
需要说明的是，为了后续的转发节点在接收到第一报文时能够方便的从该紧迫度标识头中获取到第一报文在自身处的初始紧迫度信息，在一种可能的实现方式中，该入网侧边缘节点还可以在第一报文的紧迫度标识头中添加第一报文的剩余跳数。其中，第一报文的剩余跳数是指到当前节点为止，第一报文沿传输路径转发的过程中还剩余的转发跳数。其中，在该种实现方式中，由于该入网侧边缘节点为第一个转发节点，因此，第一报文的剩余跳数可以为第一业务的传输路径上除去第一个转发节点之外剩余的转发节点的数量。
示例性地，以第一报文为以太网报文为例，如图9所示，该入网侧边缘节点可以在该以太网报文中新增“TYPE”字段，用于指示该字段之后为紧迫度标识头。在该紧迫度标识头中可以包括第一报文在每个转发节点上的初始紧迫度信息，以及第一报文的剩余跳数。并且，该多个初始紧迫度信息根据对应的多个转发节点在传输路径上的顺序依次排列。
可选地，参见图10，该紧迫度标识头中除了可以包括报文的剩余跳数以及报文在每个转发节点处的初始紧迫度信息之外，还可以携带用于指示该多个初始紧迫度信息的个数的紧迫度信息长度以及该报文的容忍时延总和以及到当前节点为止已消耗的时间。
需要说明的是，步骤802-804也可以在步骤805之后执行。
步骤805：根据第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定第一报文和第二报文的发送顺序。
其中，第二报文是指在第一报文之前接收的且还未发送出去的报文。并且，需要说明的是，第二报文中同样携带有紧迫度标识头，且第二报文的紧迫度标识头中可以包括至少一个初始紧迫度信息和剩余跳数，该至少一个初始紧迫度信息是第二报文在传输路径包括的至少一个转发节点处的初始紧迫度信息，且至少一个初始紧迫度信息按照至少一个转发节点在传输路径上的先后顺序排列。换句话说，第二报文的紧迫度标识头中可以携带有第二报文在所 要途经的所有转发节点处的初始紧迫度信息。该剩余跳数是第二报文到当前节点为止剩余的跳数。
或者，第二报文的紧迫度标识头中可以包括第二报文在当前节点处的初始紧迫度信息以及第二报文在当前节点之后途经的其他节点处的初始紧迫度信息，且这些初始紧迫度信息按照当前节点和第二报文在当前节点之后途经的转发节点在传输路径上的先后顺序排列。换句话说，第二报文的紧迫度标识头可以仅仅包括第二报文在还未经过的转发节点处的初始紧迫度信息。在这种情况下，该紧迫度标识头中还可以包括用于指示包括的初始紧迫度信息的个数的紧迫度信息长度。
值得注意的是，当前节点可能并非第二报文的第一个转发节点，所以，第二报文的紧迫度标识头可能并非由当前节点添加，而是由第二报文的传输路径上的第一个转发节点添加。
需要说明的是，当接收到第一报文时，入网侧边缘节点可以首先获取第一报文在当前节点处的初始紧迫度信息和第二报文在当前节点处的初始紧迫度信息，获取第二报文在当前节点处的紧迫度校准信息，将第一报文在当前节点处的初始紧迫度信息作为第一报文在当前节点处的当前紧迫度信息，根据第二报文在当前节点处的初始紧迫度信息和第二报文在当前节点处的紧迫度校准信息，确定第二报文在当前节点处的当前紧迫度信息。之后，服务器可以根据确定的第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定第一报文和第二报文的发送顺序。
其中，由于在本实施例中，入网侧边缘节点是第一报文的第一个转发节点，因此，该入网侧边缘节点可以直接从存储的第一业务的紧迫度配置信息中获取第一报文在当前节点处的初始紧迫度信息，也可以从前述步骤804中为第一报文添加的紧迫度标识头中获取第一报文在当前节点处的初始紧迫度信息。
其中，若直接从存储的第一业务的紧迫度配置信息中获取第一报文在当前节点处的初始紧迫度信息，则入网侧边缘节点可以首先参考前述相关实现方式从第一业务的紧迫度配置信息中查找第一报文在每个转发节点处的初始紧迫度信息，之后，入网侧边缘节点可以将第一报文的多个初始紧迫度信息中的第一个初始紧迫度信息作为第一报文在当前转发节点处的初始紧迫度信息。其中，第一报文在每个转发节点处的初始紧迫度信息按照各个转发节点在传输路径上的先后顺序排列。
可选地，若从第一报文的紧迫度标识头中获取第一报文在当前节点处的初始紧迫度信息，当该紧迫度标识头中包括剩余跳数时，当前节点可以根据第一报文的剩余跳数以及第一报文的传输路径上的转发节点的数量，从第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息。其中，当前节点可以根据第一报文的剩余跳数以及第一报文的传输路径上的转发节点的数量，确定当前节点在第一报文的传输路径上的位置，也即，当前节点为第一报文的传输路径上的第几个转发节点，之后，当前节点可以根据自身在第一报文的传输路径上的位置，从第一报文的紧迫度标识头包括的初始紧迫度信息中获取对应的初始紧迫度信息。
若第一报文的紧迫度标识头中不包括剩余跳数，则当前节点可以直接从第一报文的紧迫度标识头中获取第一个初始紧迫度信息，并将获取的初始紧迫度信息作为第一报文在当前节点处的初始紧迫度信息。
在获取第一报文在当前节点处的初始紧迫度信息的同时，当前节点还可以获取第二报文 在当前节点处的初始紧迫度信息。其中，由于当前节点可能并非第二报文的第一个转发节点，也即，当前节点可能并非第二报文的入网侧边缘节点，因此，当前节点中可能并未存储第二报文所属的第二业务的紧迫度配置信息。在这种情况下，当前节点可以直接从第二报文的紧迫度标识头中获取第二报文在当前节点处的初始紧迫度信息。
其中，若第二报文的紧迫度标识头中包括其在所要途经的所有转发节点处的初始紧迫度信息和剩余跳数时，则当前节点可以参考前述第一报文携带有剩余跳数时从第一报文的紧迫度标识头中获取第一报文在当前节点处的初始紧迫度信息的实现方式来获取第二报文在当前节点处的初始紧迫度信息，本申请实施例在此不再赘述。
若第二报文的紧迫度标识头中包括其在未经过的转发节点处的初始紧迫度信息时，则当前节点可以参考前述第一报文中不携带剩余跳数时从第一报文的紧迫度标识头中获取第一报文在当前节点处的初始紧迫度信息的实现方式来获取第二报文在当前节点处的初始紧迫度信息，本申请实施例在此不再赘述。
在获取第一报文和第二报文在当前节点处的初始紧迫度信息之后，由于第一报文是刚接收到的，也即，当前时刻距离第一报文的接收时刻极短，因此，可以直接将第一报文在当前节点处的初始紧迫度信息作为第一报文在当前节点处的当前紧迫度信息。然而，由于第二报文是在第一报文之前接收到的，因此，第二报文可能已经在当前节点上停留了一定的时长，消耗了一定的时间，此时，第二报文在当前节点处的转发紧急程度将发生变化。换句话说，任一报文在一个节点处的紧迫度信息将会随着这个报文在该节点处停留时间的变化而变化。基于此，当前节点可以根据第二报文在当前节点上的已消耗时间来确定紧迫度校准信息，进而通过该紧迫度校准信息来对第二报文在当前节点处的初始紧迫度信息进行校准，从而得到第二报文在当前节点处的当前紧迫度信息。
其中，当前节点在接收到一个报文时，即可以从接收到该报文的时刻起通过计时器为该报文进行计时。在此基础上，当前节点可以获取到当前时刻为止第二报文的计时时长，该计时时长即为第二报文在当前节点处已消耗的时间。之后，当前节点可以直接将该已消耗时间作为紧迫度校准信息来对初始紧迫度信息进行校准，从而得到第二报文在当前节点处的当前紧迫度信息。
示例性地，根据初始紧迫度信息的不同，当前节点可以根据第二报文在当前节点处的紧迫度校准信息，通过不同的方式来确定得到第二报文在当前节点处的当前紧迫度信息。
其中，若初始紧迫度信息的信息类型为容忍时延，则当前节点可以将第二报文在当前节点处的初始容忍时延和第二报文在当前节点处的已消耗时间之间的差值确定为第二报文在当前节点处的剩余容忍时延，并将该剩余容忍时延作为第二报文在当前节点处的当前紧迫度信息。
可选地，若初始紧迫度信息的信息类型为优先级，则当前节点可以根据第二报文在当前节点处的已消耗时间，确定第二报文的优先级增量，之后，将第二报文在当前节点处的初始优先级和第二报文的优先级增量的总和确定为第二报文在当前节点处的当前优先级；将第二报文在当前节点处的当前优先级作为第二报文在当前节点处的当前紧迫度信息。
其中，当前节点中可以存储有时长范围与优先级增量之间的对应关系，在这种情况下，当前节点可以直接确定第二报文在当前节点处的已消耗时间所处的时长范围，并将确定的时长范围对应的优先级增量作为第二报文的优先级增量。
或者，当前节点中可以存储有单位时长对应的优先级增量，也即，每增加单位时长对应的优先级增量的数值。在这种情况下，当前节点可以确定已消耗时间是单位时长的几倍，进而根据确定的倍数确定第二报文的优先级增量。例如，假设每增加1秒，优先级增加1级，若已消耗时间为2s，则对应的优先级增量为2级。
需要说明的是，在一种可能的实现方式中，紧迫度校准信息也可以根据初始紧迫度信息的信息类型的不同而不同。例如，当初始紧迫度信息为容忍时延时，紧迫度校准信息即为已消耗时间。若初始紧迫度信息为优先级，则可以根据上述介绍的方法将已消耗时间转换为优先级增量，并将优先级增量作为紧迫度校准信息。或者，若初始紧迫度信息为其他时间折算值，则可以将已消耗时间转换为相应类型的变化量作为紧迫度校准信息。本申请实施例对此不做限定。
可选地，在本申请实施例中，为了更准确的表征第一报文当前时刻在当前节点处的转发紧急程度，当前节点也可以不直接将第一报文在当前节点处的初始紧迫度信息作为第一报文的当前紧迫度信息，而是参考前述对第二报文的处理方式，获取第一报文的紧迫度校准信息，进而根据第一报文的紧迫度校准信息对第一报文在当前节点处的初始紧迫度信息进行校准，以得到第一报文在当前节点处的当前紧迫度信息。
在确定第一报文和第二报文在当前节点处的当前紧迫度信息之后，当前节点可以按照第一报文和第二报文在当前节点处的当前紧迫度信息来对第一报文和第二报文进行排序，从而得到第一报文和第二报文的发送顺序。
其中，当当前紧迫度信息的信息类型为容忍时延时，当前节点可以根据第一报文在当前节点处的当前容忍时延和第二报文在当前节点处的当前容忍时延，按照从小到大的顺序对第一报文和第二报文进行排序，从而得到第一报文和第二报文的发送顺序。其中，第一报文在当前节点处的当前容忍时延可以为第一报文在当前节点处的初始容忍时延，也可以为第一报文在当前节点处的剩余容忍时延，而第二报文在当前节点处的当前容忍时延即为通过前述方法确定的第二报文在当前节点处的剩余容忍时延。
可选地，当当前紧迫度信息的信息类型为优先级时，当前节点可以根据第一报文在当前节点处的当前优先级和第二报文在当前节点处的当前优先级，按照从高到低的顺序对第一报文和第二报文进行排序，从而得到第一报文和第二报文的发送顺序。其中，第一报文在当前节点处的当前优先级可以为第一报文在当前节点处的初始优先级，也可以为根据紧迫度校准信息校准得到的当前优先级，第二报文在当前节点处的当前优先级为根据紧迫度校准信息校准得到的优先级。
步骤806：按照第一报文和第二报文的发送顺序发送第一报文和第二报文。
其中，当第一报文和第二报文的紧迫度标识头中包括相应报文在所有途经的转发节点处的初始紧迫度信息和剩余跳数时，为了保证当前节点的下一跳能够继续根据剩余跳数来获取对应的初始紧迫度信息，当前节点可以将紧迫度标识头中的剩余跳数减一，得到更新后的剩余跳数后再按照第一报文和第二报文的发送顺序发送第一报文和第二报文。
当第一报文和第二报文的紧迫度标识头中包括相应报文在未经过的转发节点处的初始紧迫度信息时，当前节点在发送第一报文和第二报文之前，可以将第一报文的紧迫度标识头中第一报文在当前节点处的初始紧迫度信息进行删除，将第二报文的紧迫度标识头中第二报文在当前节点处的初始紧迫度信息进行删除，之后，再发送第一报文和第二报文。这样，当第 一报文和第二报文到达各自传输路径上的下一个转发节点时，下一个转发节点可以直接从携带的至少一个初始紧迫度信息中获取第一个初始紧迫度信息作为相应报文在自身处的初始紧迫度信息。并且，由于每经过一跳，可以将对应的初始紧迫度信息进行删除，因此，当报文到达最后一个转发节点时，最后一个转发节点在发出该报文之前，该报文中的初始紧迫度信息将全部被删除完，此时，最后一个转发节点可以确定自身为该报文的最后一跳，这样，最后一个转发节点可以将该报文中携带的紧迫度标识头删除掉，从而恢复得到原始的报文，之后再将该报文发送至接收节点。
可选地，当第一报文和第二报文的紧迫度标识头中包括相应报文在未经过的转发节点处的初始紧迫度信息以及紧迫度信息长度时，在逐跳删除初始紧迫度信息的过程中，还可以对应的更新紧迫度信息长度，这样，最后一个转发节点可以根据该紧迫度信息长度来确定自身是否为最后一个转发节点。
可选地，如果紧迫度标识头中还携带有容忍时延总和以及已消耗时间，则当前节点在根据对应初始紧迫度信息确定得到发送顺序之后，可以根据该报文在发送顺序所处的位置、该报文的大小、该报文之前的其他报文的大小以及当前的端口速率来计算该报文在当前节点上的转发时延，之后，当前节点可以确定已消耗时间与该转发时延的时长总和，如果确定的时长总和大于容忍时延总和，则可以确定该报文的转发失败，此时，当前节点可以不再转发该报文。如果确定的时长总和不大于容忍时延总和，则当前节点可以将该报文的紧迫度标识头中的已消耗时间更新为前述确定的时长总和，并执行根据确定的发送顺序来发送报文的步骤。
在本申请实施例中，入网侧边缘节点可以接收网络控制器下发的紧迫度配置信息，进而根据该紧迫度配置信息，在接收到的业务的报文中添加紧迫度标识头之后发送该报文，这样，该传输路径上的其他转发节点在接收到该报文之后，可以根据该报文的紧迫度标识头中携带的初始紧迫度信息所指示的转发紧急程度来转发该报文，以此来保证该业务的转发时延能够满足时间要求。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
需要说明的是，当入网侧边缘节点在报文中添加紧迫度标识头以携带报文在每个转发节点处的初始紧迫度信息时，对于报文途经的后续的每个转发节点，该转发节点在接收到报文时，均可以参照上述实施例中的步骤805和步骤806来发送该报文。本申请实施例在此不再赘述。
上述实施例介绍了当入网侧边缘节点为业务的传输路径上的第一个转发节点时，入网侧边缘节点根据网络控制器下发的该业务的紧迫度配置信息对该业务的报文进行处理的实现过程。若入网侧边缘节点为发送节点，则该入网侧边缘节点可以根据上述实施例中的步骤802-804中介绍的相关实现方式，为业务的每个报文添加包含有相应报文在每个转发节点处的初始紧迫度信息的紧迫度标识头，并严格按照其向网络控制器发送的时间需求信息来发送该业务的报文。在这种情况下，该业务的传输路径上的第一个转发节点则可以通过前述实施例中的步骤801、步骤805和步骤806来对接收到的该业务的报文进行转发。
上述实施例中介绍了网络控制器向入网侧边缘节点下发紧迫度配置信息时，入网侧边缘节点根据该紧迫度配置信息将初始紧迫度信息携带在报文中的情况下，各个节点对报文进行 处理的实现过程。由图3介绍的实施例可知，网络控制器还可以向业务的传输路径上的每个转发节点下发该业务的多个报文在相应转发节点处的初始紧迫度信息，在这种情况下，转发节点可以通过图11所示的业务处理方法来对接收到的报文进行处理，如图11所示，该方法包括以下步骤：
步骤1101：接收第一报文。
步骤1102：根据第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定第一报文和第二报文的发送顺序。
其中，第二报文是指在第一报文之前接收的且当前还未发送的报文。当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度。
其中，对于任一业务，网络控制器可以向该业务的传输路径上的每个转发节点发送该业务的多个报文在相应转发节点处的初始紧迫度信息，相应地，转发节点可以接收网络控制器发送的途经该转发节点的所有业务的多个报文在该转发节点处的初始紧迫度信息，并对其进行存储。
在这种情况下，当前节点在接收到第一报文之后，可以从存储的多个初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息以及第二报文在当前节点处的初始紧迫度信息，该多个初始紧迫度信息包括途经当前节点的多个业务中每个业务的多个报文在当前节点处的初始紧迫度信息。
示例性的，当前节点可以确定第一报文在第一业务的多个报文中的位置，以及确定第二报文在第二业务的多个报文中的位置，第一业务是第一报文所属的业务，第二业务是第二报文所属的业务；根据第一报文在第一业务的多个报文中的位置，从多个初始紧迫度信息包括的第一业务的多个报文在当前节点处的初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息；根据第二报文在所述第二业务的多个报文中的位置，从多个初始紧迫度信息包括的第二业务的多个报文在当前节点处的初始紧迫度信息中获取第二报文在当前节点处的初始紧迫度信息。
其中，由于当前节点中存储有多个业务中每个业务的多个报文在当前节点处的初始紧迫度信息，因此，当前节点可以首先根据第一报文的源地址和目的地址从多个业务的初始紧迫度信息中确定第一报文所属的第一业务对应的初始紧迫度信息，之后，当前节点可以确定第一报文在第一业务的多个报文中的位置，也即，确定第一报文为第一业务的多个报文中的第几个报文，并根据第一报文在第一业务的多个报文中的位置，从第一业务的多个报文在当前节点处的初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息。
需要说明的是，当前节点可以通过计数器或者其他实现方式来计数在第一业务的数据周期内接收到的第一业务的报文的数量，并根据计数得到的数量来确定第一报文为第一业务的数据周期内的第几个报文。
同理，对于第二报文，当前节点可以采用相同的方式来获取第二报文在当前节点处的初始紧迫度信息。
在获取到第一报文和第二报文在当前节点处的初始紧迫度信息之后，当前节点可以将第一报文在当前节点处的初始紧迫度信息作为第一报文在当前节点处的当前紧迫度信息。获取第二报文在当前节点处的紧迫度校准信息，进而根据第二报文在当前节点处的紧迫度校准信息对第二报文在当前节点处的初始紧迫度信息进行校准，以得到第二报文在当前节点处的当 前紧迫度信息。具体地的实现方式可以参考前述实施例中步骤805中的相关实现方式，本申请实施例在此不再赘述。
同样的，在本申请实施例中，当前节点也可以获取第一报文在当前节点处的紧迫度校准信息，根据该紧迫度校准信息对第一报文在当前节点处的初始紧迫度信息进行校准，从而得到第一报文在当前节点处的当前紧迫度信息。
在确定第一报文和第二报文在当前节点处的当前紧迫度信息之后，当前节点可以参考前述实施例中步骤805中的相关实现方式来确定第一报文和第二报文的发送顺序。本申请实施例在此不再赘述。
步骤1103：按照第一报文和第二报文的发送顺序发送第一报文和第二报文。
在确定第一报文和第二报文的发送顺序之后，当前节点可以按照确定的发送顺序发送第一报文和第二报文。
在本申请实施例中，各个转发节点可以接收网络控制器根据紧迫度配置信息下发途经相应转发节点的业务的多个报文在相应转发节点处的初始紧迫度信息，这样，转发节点在接收到报文之后，可以从存储的多个初始紧迫度信息获取该报文在当前节点处的初始紧迫度信息，进而根据获取的初始紧迫度信息确定用于指示该报文在当前时刻的转发紧急程度的当前紧迫度信息，按照该当前紧迫度信息发送报文，以此来保证对应的业务的转发时延能够满足时间要求。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。另外，由于网络控制器向每个转发节点均下发了途经相应转发节点的业务的多个报文在相应转发节点处的初始紧迫度信息，因此，在发送节点处或第一个转发节点处，无需在业务的报文中添加紧迫度标识头，相应地，在接收节点处或最后一个转发节点处也无需删除该紧迫度标识头。也即，本申请实施例可以不必对报文进行修改。
上述实施例中以转发设备先后接收到两个报文为例来对转发设备发送报文的实现过程进行了说明。接下来，以转发设备接收到多个报文且多个报文还未发送时又接收到第一报文为例，来对转发设备发送该多个报文和第一报文的实现过程进行说明。如图12所示，该方法包括以下步骤：
步骤1201：接收第一报文。
步骤1202：根据第一报文在当前节点处的当前紧迫度信息和多个报文在当前节点处的当前紧迫度信息，确定第一报文和该多个报文的发送顺序。
其中，该多个报文是指转发节点在第一报文之前接收的且当前还未发送的报文。
需要说明的是，如果每个报文中均携带有相应报文在传输路径上的每个节点处的初始紧迫度信息，则在本步骤中，当前节点可以参考前述实施例中的步骤805中的相关实现方式来确定第一报文在当前节点处的当前紧迫度信息。而对于多个报文中的每个报文，转发节点均可以参考前述实施例中步骤805中介绍的确定第二报文在当前节点处的当前紧迫度信息来确定多个报文中每个报文在当前节点处的当前紧迫度信息。其中，如果当前节点为第一报文的传输路径上的第一个转发节点，在本步骤之前，当前节点还可以参考前述实施例中的步骤802-804，在第一报文中添加包括有初始紧迫度信息的紧迫度标识头。
可选地，如果每个报文中未携带有初始紧迫度信息，而是在每个转发节点中存储有途经 相应节点的报文的初始紧迫度信息，则当前节点可以参考前述实施例中的步骤1102中的相关实现方式来确定第一报文在当前节点处的当前紧迫度信息。而对于多个报文中的每个报文，转发节点均可以参考前述实施例中步骤1102中介绍的确定第二报文在当前节点处的当前紧迫度信息来确定多个报文中每个报文在当前节点处的当前紧迫度信息。
在确定第一报文和多个报文在当前节点处的当前紧迫度信息之后，如果该紧迫度信息的类型为容忍时延，则当前节点可以根据第一报文和多个报文的当前容忍时延的大小，按照从小到大的顺序对第一报文和多个报文进行排序，从而得到第一报文和该多个报文的发送顺序。可选地，如果紧迫度信息的类型为优先级，则当前节点可以根据第一报文和该多个报文的当前优先级，按照从高到低的顺序对第一报文和该多个报文进行排序，从而得到第一报文和该多个报文的发送顺序。
步骤1203：按照确定的发送顺序发送第一报文和该多个报文。
在确定第一报文和该多个报文的发送顺序之后，当前节点可以按照确定的发送顺序发送第一报文和该多个报文。
在本申请实施例中，当转发节点接收到第一报文时，如果该转发节点还缓存有多个在第一报文之前接收到的报文，则转发节点可以根据第一报文和多个报文在当前节点处的当前紧迫度信息来确定第一报文和该多个报文的发送顺序，其中，当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度。之后，转发节点可以按照确定的发送顺序来发送第一报文和该多个报文。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
接下来对本申请实施例提供的业务处理装置进行介绍。
参见图13，本申请实施例提供了一种业务处理装置1300，该装置1300包括：
接收模块1301，用于执行前述实施例中的步骤801或步骤1101或步骤1201；
第一确定模块1302，用于执行前述实施例中的步骤805或步骤1102或步骤1202；
发送模块1303，用于执行前述实施例中的步骤806或步骤1103或步骤1203。
可选地，该装置1300还包括：
第一获取模块，用于获取第一报文在当前节点处的初始紧迫度信息和第二报文在当前节点处的初始紧迫度信息；
第二获取模块，用于获取第二报文在当前节点处的紧迫度校准信息；
第二确定模块，用于将第一报文在当前节点处的初始紧迫度信息作为第一报文在当前节点处的当前紧迫度信息，根据第二报文在当前节点处的初始紧迫度信息和第二报文在当前节点处的紧迫度校准信息，确定第二报文在当前节点处的当前紧迫度信息。
可选地，第一报文和第二报文均携带有紧迫度标识头，紧迫度标识头包括至少一个初始紧迫度信息；
第一获取模块包括：
第一获取子模块，用于从第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息，从第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取第二报文在当前节点处的初始紧迫度信息。
可选地，紧迫度标识头还包括到当前节点为止相应报文的剩余跳数，至少一个初始紧迫 度信息是指相应报文在传输路径上的至少一个转发节点处的初始紧迫度信息，且至少一个初始紧迫度信息按照至少一个转发节点在相应报文的传输路径上的先后顺序排列。
可选地，第一获取子模块具体用于：
根据第一报文的剩余跳数以及第一报文的传输路径上的转发节点的数量，从第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息；
根据第二报文的剩余跳数以及第二报文的传输路径上的转发节点的数量，从第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取第二报文在当前节点处的初始紧迫度信息。
可选地，至少一个初始紧迫度信息包括相应报文在当前节点处的初始紧迫度信息，以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息；
其中，相应报文在当前节点处的初始紧迫度信息以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息按照当前节点和相应报文在当前节点之后途经的转发节点在相应报文的传输路径上的先后顺序排列。
可选地，第一获取子模块具体用于：
获取第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为第一报文在当前节点处的初始紧迫度信息；
获取第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为第二报文在当前节点处的初始紧迫度信息。
可选地，发送模块1303具体用于：
删除第一报文的紧迫度标识头中第一报文在当前节点处的初始紧迫度信息；
删除第二报文的紧迫度标识头中第二报文在当前节点处的初始紧迫度信息；
按照第一报文和第二报文的发送顺序，发送删除初始紧迫度信息之后的第一报文和第二报文。
可选地，当当前节点为第一报文所属的第一业务的传输路径上的第一个转发节点时，该装置还用于：
接收第一业务的紧迫度配置信息，紧迫度配置信息包括第一业务的多个报文中每个报文在第一业务的传输路径上的每个转发节点处的初始紧迫度信息；
从第一业务的紧迫度配置信息中获取第一报文在第一业务的传输路径上的每个转发节点处的初始紧迫度信息；
在第一报文中添加紧迫度标识头，第一报文的紧迫度标识头包括第一报文在第一业务的传输路径上的每个转发节点处的初始紧迫度信息。
可选地，第一获取模块包括：
第二获取子模块，用于从存储的多个初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息以及第二报文在当前节点处的初始紧迫度信息，多个初始紧迫度信息包括途经当前节点的多个业务中每个业务的多个报文在当前节点处的初始紧迫度信息。
可选地，第二获取子模块具体用于：
确定第一报文在第一业务的多个报文中的位置，以及确定第二报文在第二业务的多个报文中的位置，第一业务是第一报文所属的业务，第二业务是第二报文所属的业务；
根据第一报文在第一业务的多个报文中的位置，从多个初始紧迫度信息包括的第一业务的多个报文在当前节点处的初始紧迫度信息中获取第一报文在当前节点处的初始紧迫度信息；
根据第二报文在第二业务的多个报文中的位置，从多个初始紧迫度信息包括的第二业务的多个报文在当前节点处的初始紧迫度信息中获取第二报文在当前节点处的初始紧迫度信息。
可选地，第二报文在当前节点处的紧迫度校准信息是指第二报文在当前节点处的已消耗时间。
可选地，初始紧迫度信息是指初始容忍时延，初始容忍时延是指相应的转发节点转发相应的报文时所允许的最大时延；
第二确定模块具体用于：
将第二报文在当前节点处的初始容忍时延与第二报文在当前节点处的已消耗时间之间的差值确定为第二报文在当前节点处的剩余容忍时延；
将第二报文在当前节点处的剩余容忍时延作为第二报文在当前节点处的当前紧迫度信息。
可选地，第一确定模块1302具体用于：
根据第一报文在当前节点处的初始容忍时延和第二报文在当前节点处的剩余容忍时延，按照从小到大的顺序对第一报文和第二报文进行排序，得到第一报文和第二报文的发送顺序。
可选地，初始紧迫度信息是指初始优先级，初始优先级用于指示相应的转发节点转发相应的报文时的最低优先等级；
第二确定模块具体用于：
根据第二报文在当前节点处的已消耗时间，确定第二报文的优先级增量；
将第二报文在当前节点处的初始优先级和第二报文的优先级增量的总和确定为第二报文在当前节点处的当前优先级；
将第二报文在当前节点处的当前优先级作为第二报文在当前节点处的当前紧迫度信息。
可选地，第一确定模块1302具体用于：
根据第一报文在当前节点处的初始优先级和第二报文在当前节点处的当前优先级，按照从高到低的顺序对第一报文和第二报文进行排序，得到第一报文和第二报文的发送顺序。
可选地，第一报文所属的第一业务的每个数据周期内的多个报文在当前节点处的初始紧迫度信息均不相同。
综上所述，在本申请实施例中，在接收到第二报文之后且该第二报文还未发送出去时，如果又接收到了第一报文，则转发节点可以根据这两个报文在当前节点处的当前紧迫度信息来确定这两个报文的发送顺序，其中，当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度。之后，转发节点可以按照确定的发送顺序来发送这两个报文。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
参见图14，本申请实施例提供了另一种业务处理装置1400，该装置1400包括：
获取模块1401，用于执行前述实施例中步骤301；
确定模块1402，用于执行前述实施例中的步骤302；
发送模块1403，用于执行前述实施例中的步骤304。
可选地，时间需求信息包括业务的数据周期、数据周期内每个报文的大小、第一时间间 隔和第二时间间隔；
第一时间间隔是指数据周期内第一个报文在发送节点处的开始发送时刻与数据周期的开始时刻之间的时间间隔；
第二时间间隔是指数据周期内每相邻两个报文中前一个报文在发送节点处的发送完成时刻到下一个报文在发送节点处的开始发送时刻之间的时间间隔。
可选地，确定模块1402包括：
第一确定子模块，用于根据时间需求信息，确定业务的每个报文的容忍时延总和；
第二确定子模块，用于确定业务的传输路径；
第三确定子模块，用于根据每个报文的容忍时延总和，确定每个报文在传输路径上的每个转发节点处的容忍时延。
可选地，第三确定子模块具体用于：
确定传输路径上包括的转发节点的数量；
根据每个报文的容忍时延总和以及传输路径上包括的转发节点的数量，确定每个报文在传输路径上的每个转发节点处的容忍时延。
可选地，第三确定子模块具体用于：
根据传输路径上包括的各个转发节点的当前流量状况，确定每个报文在每个转发节点处的时延比重；
根据每个报文的容忍时延总和以及每个报文在每个转发节点处的时延比重，确定每个报文在传输路径上的每个转发节点处的容忍时延。
可选地，发送模块1403具体用于：
将业务的每个报文在每个转发节点处的容忍时延作为紧迫度配置信息；
向入网侧边缘节点下发紧迫度配置信息。
可选地，发送模块1403具体用于：
获取每个转发节点的容忍时延区间与优先级之间的映射关系；
从每个转发节点的容忍时延区间与优先级之间的映射关系中，获取每个报文在每个转发节点处的容忍时延对应的优先级；
将获取到的每个报文在每个转发节点处的优先级作为紧迫度配置信息；
向入网侧边缘节点下发紧迫度配置信息。
可选地，该装置1400还包括：
检测模块，用于根据每个报文在传输路径上的每个转发节点处的容忍时延，检测每个报文在每个转发节点处是否满足转发需求；
触发模块，用于若每个报文在每个转发节点处均满足转发需求，则触发发送模块根据每个报文在传输路径上的每个转发节点处的容忍时延，向入网侧边缘节点下发紧迫度配置信息。
可选地，检测模块具体用于：
确定第一转发节点的第一缓存链表，第一缓存链表是指在第一报文到达第一转发节点的时刻第一转发节点缓存的报文的队列，第一报文是指业务中的任一报文，第一转发节点是指传输路径上的任一转发节点；
根据第一缓存链表中的报文在第一转发节点上的容忍时延和第一报文在第一转发节点的容忍时延，按照从大到小的顺序对第一缓存链表中的报文和第一报文进行排序，得到第二缓 存链表；
若发送第二缓存链表中第一报文之前的所有报文所需的总时长小于第一报文的容忍时延，且第二缓存链表中第一报文之后的每个报文的容忍时延均大于发送相应报文之前的所有报文所需的总时长，则确定第一报文在第一转发节点处满足转发需求。
可选地，入网侧边缘节点是指发送节点，或者，入网侧边缘节点是指传输路径上的第一个转发节点。
可选地，当入网侧边缘节点为传输路径上的第一个转发节点时，该装置1400还用于：
根据紧迫度配置信息，向传输路径上除第一个转发节点之外的每个转发节点发送每个报文在相应转发节点处的容忍时延或优先级，以指示除第一个转发节点之外的每个转发节点根据每个报文在相应转发节点处的容忍时延或优先级处理业务的报文。
可选地，业务的每个数据周期内的多个报文在传输路径上的同一个转发节点处的容忍时延不同。
本申请实施例根据业务的时间需求信息来确定业务的每个报文在传输路径上的每个转发节点处的容忍时延，进而根据每个报文在传输路径上的每个转发节点处的容忍时延确定紧迫度配置信息。将该紧迫度位置信息下发至入网侧边缘节点，这样，入网侧边缘节点就可以根据该紧迫度配置信息来处理每个报文，以此来保证每个报文在各个转发节点处的转发时延不超过容忍时延，进而保证业务的传输满足时间需求。由此可见，本申请实施例提供的业务处理方法不需要发送节点和转发节点进行严格协作和精确配合即可以满足时间敏感业务对转发时延的要求，降低了实施难度。
需要说明的是：上述实施例提供的业务处理装置在处理业务时，仅以上述各功能模块的划分进行举例说明，实际应用中，可以根据需要而将上述功能分配由不同的功能模块完成，即将设备的内部结构划分成不同的功能模块，以完成以上描述的全部或者部分功能。另外，上述实施例提供的业务处理装置与业务处理方法实施例属于同一构思，其具体实现过程详见方法实施例，这里不再赘述。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意结合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机指令时，全部或部分地产生按照本发明实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如：同轴电缆、光纤、数据用户线(Digital Subscriber Line，DSL))或无线(例如：红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如：软盘、硬盘、磁带)、光介质(例如：数字通用光盘(Digital Versatile Disc，DVD))、或者半导体介质(例如：固态硬盘(Solid State Disk，SSD))等。
本领域普通技术人员可以理解实现上述实施例的全部或部分步骤可以通过硬件来完成， 也可以通过程序来指令相关的硬件完成，所述的程序可以存储于一种计算机可读存储介质中，上述提到的存储介质可以是只读存储器，磁盘或光盘等。
以上所述为本申请提供的实施例，并不用以限制本申请，凡在本申请的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。

Claims (34)

  1. 一种业务处理方法，其特征在于，所述方法包括：
    接收第一报文；
    根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序，所述第二报文是在所述第一报文之前接收的且还未发送的报文，所述当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度；
    按照所述第一报文和所述第二报文的发送顺序发送所述第一报文和所述第二报文。
  2. 如权利要求1所述的方法，其特征在于，所述根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序之前，还包括：
    获取所述第一报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的初始紧迫度信息；
    获取所述第二报文在当前节点处的紧迫度校准信息；
    将所述第一报文在当前节点处的初始紧迫度信息作为所述第一报文在当前节点处的当前紧迫度信息，根据所述第二报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的紧迫度校准信息，确定所述第二报文在当前节点处的当前紧迫度信息。
  3. 如权利要求2所述的方法，其特征在于，所述第一报文和所述第二报文均携带有紧迫度标识头，所述紧迫度标识头包括至少一个初始紧迫度信息；
    所述获取所述第一报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的初始紧迫度信息，包括：
    从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
  4. 如权利要求3所述的方法，其特征在于，所述紧迫度标识头还包括到当前节点为止相应报文的剩余跳数，所述至少一个初始紧迫度信息是指相应报文在传输路径上的至少一个转发节点处的初始紧迫度信息，且所述至少一个初始紧迫度信息按照至少一个转发节点在相应报文的传输路径上的先后顺序排列。
  5. 如权利要求4所述的方法，其特征在于，所述从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息，包括：
    根据所述第一报文的剩余跳数以及所述第一报文的传输路径上的转发节点的数量，从所 述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息；
    根据所述第二报文的剩余跳数以及所述第二报文的传输路径上的转发节点的数量，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
  6. 如权利要求3所述的方法，其特征在于，所述至少一个初始紧迫度信息包括相应报文在当前节点处的初始紧迫度信息，以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息；
    其中，相应报文在当前节点处的初始紧迫度信息以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息按照当前节点和相应报文在当前节点之后途经的转发节点在相应报文的传输路径上的先后顺序排列。
  7. 如权利要求6所述的方法，其特征在于，所述从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息，包括：
    获取所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为所述第一报文在当前节点处的初始紧迫度信息；
    获取所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为所述第二报文在当前节点处的初始紧迫度信息。
  8. 如权利要求6或7所述的方法，其特征在于，所述按照所述第一报文和所述第二报文的发送顺序发送所述第一报文和所述第二报文，包括：
    删除所述第一报文的紧迫度标识头中所述第一报文在当前节点处的初始紧迫度信息；
    删除所述第二报文的紧迫度标识头中所述第二报文在当前节点处的初始紧迫度信息；
    按照所述第一报文和所述第二报文的发送顺序，发送删除初始紧迫度信息之后的第一报文和第二报文。
  9. 如权利要求3-8任一所述的方法，其特征在于，所述方法还包括：
    当所述当前节点为所述第一报文所属的第一业务的传输路径上的第一个转发节点时，接收所述第一业务的紧迫度配置信息，所述紧迫度配置信息包括所述第一业务的多个报文中每个报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息；
    从所述第一业务的紧迫度配置信息中获取所述第一报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息；
    在所述第一报文中添加紧迫度标识头，所述第一报文的紧迫度标识头包括所述第一报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息。
  10. 如权利要求2所述的方法，其特征在于，所述获取所述第一报文在当前节点处的初 始紧迫度信息和所述第二报文在当前节点处的初始紧迫度信息，包括：
    从存储的多个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息以及所述第二报文在当前节点处的初始紧迫度信息，所述多个初始紧迫度信息包括途经当前节点的多个业务中每个业务的多个报文在当前节点处的初始紧迫度信息。
  11. 如权利要求10所述的方法，其特征在于，所述从存储的多个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息以及所述第二报文在当前节点处的初始紧迫度信息，包括：
    确定所述第一报文在第一业务的多个报文中的位置，以及确定所述第二报文在第二业务的多个报文中的位置，所述第一业务是所述第一报文所属的业务，所述第二业务是所述第二报文所属的业务；
    根据所述第一报文在所述第一业务的多个报文中的位置，从所述多个初始紧迫度信息包括的所述第一业务的多个报文在当前节点处的初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息；
    根据所述第二报文在所述第二业务的多个报文中的位置，从所述多个初始紧迫度信息包括的所述第二业务的多个报文在当前节点处的初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
  12. 如权利要求2-11任一所述的方法，其特征在于，所述第二报文在当前节点处的紧迫度校准信息是指所述第二报文在当前节点处的已消耗时间。
  13. 如权利要求12所述的方法，其特征在于，所述初始紧迫度信息是指初始容忍时延，所述初始容忍时延是指相应的转发节点转发相应的报文时所允许的最大时延；
    所述根据所述第二报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的紧迫度校准信息，确定所述第二报文在当前节点处的当前紧迫度信息，包括：
    将所述第二报文在当前节点处的初始容忍时延与所述第二报文在当前节点处的已消耗时间之间的差值确定为所述第二报文在当前节点处的剩余容忍时延；
    将所述第二报文在当前节点处的剩余容忍时延作为所述第二报文在当前节点处的当前紧迫度信息。
  14. 如权利要求13所述的方法，其特征在于，所述根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序，包括：
    根据所述第一报文在当前节点处的初始容忍时延和所述第二报文在当前节点处的剩余容忍时延，按照从小到大的顺序对所述第一报文和所述第二报文进行排序，得到所述第一报文和所述第二报文的发送顺序。
  15. 如权利要求12所述的方法，其特征在于，所述初始紧迫度信息是指初始优先级，所述初始优先级用于指示相应的转发节点转发相应的报文时的最低优先等级；
    所述根据所述第二报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的紧迫度校准信息，确定所述第二报文在当前节点处的当前紧迫度信息，包括：
    根据所述第二报文在当前节点处的已消耗时间，确定所述第二报文的优先级增量；
    将所述第二报文在当前节点处的初始优先级和所述第二报文的优先级增量的总和确定为所述第二报文在当前节点处的当前优先级；
    将所述第二报文在当前节点处的当前优先级作为所述第二报文在当前节点处的当前紧迫度信息。
  16. 如权利要求15所述的方法，其特征在于，所述根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序，包括：
    根据所述第一报文在当前节点处的初始优先级和所述第二报文在当前节点处的当前优先级，按照从高到低的顺序对所述第一报文和所述第二报文进行排序，得到所述第一报文和所述第二报文的发送顺序。
  17. 如权利要求2-16任一所述的方法，其特征在于，所述第一报文所属的第一业务的每个数据周期内的多个报文在当前节点处的初始紧迫度信息均不相同。
  18. 一种业务处理装置，其特征在于，所述装置包括：
    接收模块，用于接收第一报文；
    第一确定模块，用于根据所述第一报文在当前节点处的当前紧迫度信息和第二报文在当前节点处的当前紧迫度信息，确定所述第一报文和所述第二报文的发送顺序，所述第二报文是在所述第一报文之前接收的且还未发送的报文，所述当前紧迫度信息用于指示在当前时刻相应报文的转发紧急程度；
    发送模块，用于按照所述第一报文和所述第二报文的发送顺序发送所述第一报文和所述第二报文。
  19. 如权利要求18所述的装置，其特征在于，所述装置还包括：
    第一获取模块，用于获取所述第一报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的初始紧迫度信息；
    第二获取模块，用于获取所述第二报文在当前节点处的紧迫度校准信息；
    第二确定模块，用于将所述第一报文在当前节点处的初始紧迫度信息作为所述第一报文在当前节点处的当前紧迫度信息，根据所述第二报文在当前节点处的初始紧迫度信息和所述第二报文在当前节点处的紧迫度校准信息，确定所述第二报文在当前节点处的当前紧迫度信息。
  20. 如权利要求19所述的装置，其特征在于，所述第一报文和所述第二报文均携带有紧迫度标识头，所述紧迫度标识头包括至少一个初始紧迫度信息；
    所述第一获取模块包括：
    第一获取子模块，用于从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
  21. 如权利要求20所述的装置，其特征在于，所述紧迫度标识头还包括到当前节点为止相应报文的剩余跳数，所述至少一个初始紧迫度信息是指相应报文在传输路径上的至少一个转发节点处的初始紧迫度信息，且所述至少一个初始紧迫度信息按照至少一个转发节点在相应报文的传输路径上的先后顺序排列。
  22. 如权利要求21所述的装置，其特征在于，所述第一获取子模块具体用于：
    根据所述第一报文的剩余跳数以及所述第一报文的传输路径上的转发节点的数量，从所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息；
    根据所述第二报文的剩余跳数以及所述第二报文的传输路径上的转发节点的数量，从所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
  23. 如权利要求20所述的装置，其特征在于，所述至少一个初始紧迫度信息包括相应报文在当前节点处的初始紧迫度信息，以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息；
    其中，相应报文在当前节点处的初始紧迫度信息以及相应报文在当前节点之后途经的每个转发节点处的初始紧迫度信息按照当前节点和相应报文在当前节点之后途经的转发节点在相应报文的传输路径上的先后顺序排列。
  24. 如权利要求23所述的装置，其特征在于，所述第一获取子模块具体用于：
    获取所述第一报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为所述第一报文在当前节点处的初始紧迫度信息；
    获取所述第二报文的紧迫度标识头包括的至少一个初始紧迫度信息中的第一个初始紧迫度信息，将获取的初始紧迫度信息作为所述第二报文在当前节点处的初始紧迫度信息。
  25. 如权利要求23或24所述的装置，其特征在于，所述发送模块具体用于：
    删除所述第一报文的紧迫度标识头中所述第一报文在当前节点处的初始紧迫度信息；
    删除所述第二报文的紧迫度标识头中所述第二报文在当前节点处的初始紧迫度信息；
    按照所述第一报文和所述第二报文的发送顺序，发送删除初始紧迫度信息之后的第一报文和第二报文。
  26. 如权利要求20-25任一所述的装置，其特征在于，当所述当前节点为所述第一报文所属的第一业务的传输路径上的第一个转发节点时，所述装置还用于：
    接收所述第一业务的紧迫度配置信息，所述紧迫度配置信息包括所述第一业务的多个报 文中每个报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息；
    从所述第一业务的紧迫度配置信息中获取所述第一报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息；
    在所述第一报文中添加紧迫度标识头，所述第一报文的紧迫度标识头包括所述第一报文在所述第一业务的传输路径上的每个转发节点处的初始紧迫度信息。
  27. 如权利要求19所述的装置，其特征在于，所述第一获取模块包括：
    第二获取子模块，用于从存储的多个初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息以及所述第二报文在当前节点处的初始紧迫度信息，所述多个初始紧迫度信息包括途经当前节点的多个业务中每个业务的多个报文在当前节点处的初始紧迫度信息。
  28. 如权利要求27所述的装置，其特征在于，所述第二获取子模块具体用于：
    确定所述第一报文在第一业务的多个报文中的位置，以及确定所述第二报文在第二业务的多个报文中的位置，所述第一业务是所述第一报文所属的业务，所述第二业务是所述第二报文所属的业务；
    根据所述第一报文在所述第一业务的多个报文中的位置，从所述多个初始紧迫度信息包括的所述第一业务的多个报文在当前节点处的初始紧迫度信息中获取所述第一报文在当前节点处的初始紧迫度信息；
    根据所述第二报文在所述第二业务的多个报文中的位置，从所述多个初始紧迫度信息包括的所述第二业务的多个报文在当前节点处的初始紧迫度信息中获取所述第二报文在当前节点处的初始紧迫度信息。
  29. 如权利要求19-28任一所述的装置，其特征在于，所述第二报文在当前节点处的紧迫度校准信息是指所述第二报文在当前节点处的已消耗时间。
  30. 如权利要求29所述的装置，其特征在于，所述初始紧迫度信息是指初始容忍时延，所述初始容忍时延是指相应的转发节点转发相应的报文时所允许的最大时延；
    所述第二确定模块具体用于：
    将所述第二报文在当前节点处的初始容忍时延与所述第二报文在当前节点处的已消耗时间之间的差值确定为所述第二报文在当前节点处的剩余容忍时延；
    将所述第二报文在当前节点处的剩余容忍时延作为所述第二报文在当前节点处的当前紧迫度信息。
  31. 如权利要求30所述的装置，其特征在于，所述第一确定模块具体用于：
    根据所述第一报文在当前节点处的初始容忍时延和所述第二报文在当前节点处的剩余容忍时延，按照从小到大的顺序对所述第一报文和所述第二报文进行排序，得到所述第一报文和所述第二报文的发送顺序。
  32. 如权利要求29所述的装置，其特征在于，所述初始紧迫度信息是指初始优先级，所 述初始优先级用于指示相应的转发节点转发相应的报文时的最低优先等级；
    所述第二确定模块具体用于：
    根据所述第二报文在当前节点处的已消耗时间，确定所述第二报文的优先级增量；
    将所述第二报文在当前节点处的初始优先级和所述第二报文的优先级增量的总和确定为所述第二报文在当前节点处的当前优先级；
    将所述第二报文在当前节点处的当前优先级作为所述第二报文在当前节点处的当前紧迫度信息。
  33. 如权利要求32所述的装置，其特征在于，所述第一确定模块具体用于：
    根据所述第一报文在当前节点处的初始优先级和所述第二报文在当前节点处的当前优先级，按照从高到低的顺序对所述第一报文和所述第二报文进行排序，得到所述第一报文和所述第二报文的发送顺序。
  34. 如权利要求19-33任一所述的装置，其特征在于，所述第一报文所属的第一业务的每个数据周期内的多个报文在当前节点处的初始紧迫度信息均不相同。
PCT/CN2020/084183 2019-04-10 2020-04-10 业务处理方法及装置 WO2020207469A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910284097.6A CN111817985B (zh) 2019-04-10 2019-04-10 业务处理方法及装置
CN201910284097.6 2019-04-10

Publications (1)

Publication Number Publication Date
WO2020207469A1 true WO2020207469A1 (zh) 2020-10-15

Family

ID=72750977

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/084183 WO2020207469A1 (zh) 2019-04-10 2020-04-10 业务处理方法及装置

Country Status (2)

Country Link
CN (1) CN111817985B (zh)
WO (1) WO2020207469A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115134273A (zh) * 2021-03-29 2022-09-30 北京华为数字技术有限公司 一种报文处理方法以及相关设备

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115052251B (zh) * 2021-03-09 2023-08-18 Oppo广东移动通信有限公司 广播信息传输方法、装置、电子设备及存储介质
CN114448573B (zh) * 2022-03-02 2024-02-23 新华三半导体技术有限公司 一种报文处理方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070153802A1 (en) * 2006-01-04 2007-07-05 Juergen Anke Priority assignment and transmission of sensor data
CN101043438A (zh) * 2006-03-24 2007-09-26 华为技术有限公司 数据包传输系统和方法
CN103929490A (zh) * 2014-04-28 2014-07-16 中国科学院微电子研究所 一种体域网系统的数据传输方法
US20160044693A1 (en) * 2013-03-08 2016-02-11 Zte Corporation Service Data Transmission Processing Method and Device and Service Data Transmission Method and Device
CN108540404A (zh) * 2017-03-06 2018-09-14 中国移动通信有限公司研究院 一种动态调整流表的方法和装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070153802A1 (en) * 2006-01-04 2007-07-05 Juergen Anke Priority assignment and transmission of sensor data
CN101043438A (zh) * 2006-03-24 2007-09-26 华为技术有限公司 数据包传输系统和方法
US20160044693A1 (en) * 2013-03-08 2016-02-11 Zte Corporation Service Data Transmission Processing Method and Device and Service Data Transmission Method and Device
CN103929490A (zh) * 2014-04-28 2014-07-16 中国科学院微电子研究所 一种体域网系统的数据传输方法
CN108540404A (zh) * 2017-03-06 2018-09-14 中国移动通信有限公司研究院 一种动态调整流表的方法和装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115134273A (zh) * 2021-03-29 2022-09-30 北京华为数字技术有限公司 一种报文处理方法以及相关设备

Also Published As

Publication number Publication date
CN111817985B (zh) 2024-02-02
CN111817985A (zh) 2020-10-23

Similar Documents

Publication Publication Date Title
WO2020207469A1 (zh) 业务处理方法及装置
US11934868B2 (en) Systems and methods for scheduling tasks
US9225659B2 (en) Method and apparatus for scheduling a heterogeneous communication flow
WO2019196630A1 (zh) 负载均衡的方法、设备及系统
US8830829B2 (en) Parallel processing using multi-core processor
US9270527B2 (en) Methods, systems, and computer readable media for enabling real-time guarantees in publish-subscribe middleware using dynamically reconfigurable networks
WO2019127597A1 (zh) 一种发送报文的方法、设备和系统
US10248615B2 (en) Distributed processing in a network
US11171869B2 (en) Microburst detection and management
WO2021147354A1 (zh) 服务等级配置方法以及装置
JP2000295228A (ja) スイッチ及びそのスケジューラ並びにスイッチスケジューリング方法
WO2020147440A1 (zh) 数据用量上报的方法、装置及系统
WO2020238292A1 (zh) 确定业务传输需求的方法、设备及系统
JP2022532731A (ja) スライスベースネットワークにおける輻輳回避
WO2022110948A1 (zh) 路径权重分配方法以及装置
EP4044525A1 (en) Data transmission method and apparatus
KR20050046089A (ko) 패킷을 스케줄링하는 라우터 및 그 방법
WO2018188570A1 (zh) 一种数据传输方法及装置
CN115622952A (zh) 资源调度方法、装置、设备及计算机可读存储介质
WO2018157819A1 (zh) 多子流网络传输方法及装置
WO2021146926A1 (zh) 一种数据传输方法、设备及系统
US11108697B2 (en) Technologies for controlling jitter at network packet egress
JP2011091711A (ja) ノード及び送信フレーム振り分け方法並びにプログラム
WO2020248166A1 (zh) 流量调度方法、设备及存储介质
WO2023193689A1 (zh) 报文传输方法、装置、设备及计算机可读存储介质

Legal Events

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

Ref document number: 20786866

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20786866

Country of ref document: EP

Kind code of ref document: A1