[go: up one dir, main page]

WO2016150020A1 - Procédé et dispositif de programmation de paquets à base d'identificateur de flux de programmation - Google Patents

Procédé et dispositif de programmation de paquets à base d'identificateur de flux de programmation Download PDF

Info

Publication number
WO2016150020A1
WO2016150020A1 PCT/CN2015/082100 CN2015082100W WO2016150020A1 WO 2016150020 A1 WO2016150020 A1 WO 2016150020A1 CN 2015082100 W CN2015082100 W CN 2015082100W WO 2016150020 A1 WO2016150020 A1 WO 2016150020A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
flow identifier
scheduling
forwarding device
scheduling flow
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2015/082100
Other languages
English (en)
Chinese (zh)
Inventor
徐春松
钟炜
张树冲
蔡广平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Publication of WO2016150020A1 publication Critical patent/WO2016150020A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Definitions

  • This document relates to the field of communications, and in particular, to a message scheduling method and apparatus based on a scheduling flow identifier.
  • QoS Quality of Service
  • the traffic classification uses certain rules to identify packets that meet certain characteristics. It is the premise and basis for differentiated services.
  • the traffic classification rule can use the priority bits of the ToS (Type of Service) field in the IP packet header to identify traffic with different priority characteristics.
  • the network administrator can also set the traffic classification policy, for example, through the integration. The source address, the destination address, the MAC (Media Access Control) address, the IP protocol, or the port number of the application are classified.
  • the purpose of traffic classification is to provide services in a differentiated manner.
  • the traffic classification is associated with the flow control or resource allocation actions to complete the Qos function.
  • the current QoS technology usually processes incoming messages, and then extracts message information that needs to be processed by TCAM (Ternary Content Addressable Memory) device or software algorithm. After the classification, traffic policing, traffic shaping, congestion management, and congestion avoidance are further processed, and such processing is required for each incoming message. This way is very wasteful of system resources and performance.
  • TCAM Ternary Content Addressable Memory
  • a device that is classified on a medium or high-end router or a packet forwarding device is usually a TCAM.
  • the classification of QoS requires a large key value, and the TCAM performance and space are limited. Each message comes in one or more TCAMs. Lookups can cause a drop in forwarding performance.
  • software algorithms are usually used to classify messages. However, there are many key values, and search also requires a certain amount of performance, which affects the performance of the entire system.
  • the embodiment of the invention provides a packet scheduling method and device based on a scheduling flow identifier, and the technical problem to be solved is how to simplify the processing complexity of the traffic classification.
  • the embodiment of the present invention provides the following technical solutions:
  • a packet scheduling method based on a scheduling flow identifier includes:
  • the forwarding device obtains the scheduling flow identifier corresponding to the next forwarding device of the packet in the forwarding path, in the process of forwarding the received packet.
  • the forwarding device adds the scheduling flow identifier to the packet
  • the forwarding device sends a packet including the scheduling flow identifier to the next forwarding device.
  • the forwarding device acquires a scheduling flow identifier corresponding to the next forwarding device of the packet on the forwarding path, including:
  • the forwarding device acquires packet feature information of the packet
  • the forwarding device searches for the scheduling flow identifier of the next forwarding device corresponding to the packet feature information of the packet according to the correspondence between the local pre-stored packet feature information and the scheduling flow identifier of the next forwarding device;
  • the forwarding device uses the found result as the scheduling flow identifier corresponding to the packet;
  • the forwarding device sends a query request to the next forwarding device, where the query request includes packet feature information of the packet; and receives a query response fed back by the next forwarding device,
  • the query response includes scheduling flow identification information of the packet.
  • the forwarding device adds the scheduling flow identifier to the packet, including:
  • the forwarding device adds a field after the Layer 2 protocol header of the packet, and adds the scheduling flow identifier to the added field.
  • a packet scheduling method based on a scheduling flow identifier includes:
  • the forwarding device After receiving the packet including the scheduling flow identifier, the forwarding device acquires the scheduling flow in the packet. Identification
  • the forwarding device performs a scheduling operation on the packet according to the scheduling flow identifier.
  • the method further includes:
  • the forwarding device acquires a scheduling flow identifier corresponding to the next forwarding device of the packet on the forwarding path;
  • the forwarding device replaces the forwarding identifier in the packet with the scheduling stream identifier corresponding to the next forwarding device;
  • the forwarding device sends the packet that has been replaced by the scheduled flow identifier.
  • a message scheduling device based on a scheduling flow identifier comprising:
  • the first obtaining module is configured to: in the process of scheduling the received packet, obtain the scheduling flow identifier corresponding to the next forwarding device of the packet in the forwarding path;
  • Adding a module configured to add the scheduling flow identifier to the packet
  • the first sending module is configured to send a packet including the scheduling flow identifier to the next forwarding device.
  • the first acquiring module includes:
  • An obtaining unit configured to obtain message feature information of the packet
  • the search unit is configured to search for a scheduling flow identifier of the next forwarding device corresponding to the packet feature information of the packet according to the correspondence between the local pre-stored packet feature information and the scheduling flow identifier of the next forwarding device;
  • a first determining unit configured to: if found, the forwarding device uses the found result as a scheduling flow identifier corresponding to the packet;
  • a sending unit configured to send a query request to the next forwarding device if not found, where the query request includes message feature information of the packet;
  • the receiving unit is configured to receive a query response fed back by the next forwarding device, where the query response includes scheduling flow identification information of the packet.
  • the adding module is configured to: add a field after the Layer 2 protocol header of the packet, and add the scheduling flow identifier to the added field.
  • a message scheduling device based on a scheduling flow identifier comprising:
  • the second obtaining module is configured to: after receiving the packet that includes the scheduling flow identifier, obtain the scheduling flow identifier in the packet;
  • the scheduling module is configured to perform a scheduling operation on the packet according to the scheduling flow identifier.
  • the apparatus further includes:
  • a third acquiring module configured to obtain a scheduling flow identifier corresponding to a next forwarding device of the packet on the forwarding path;
  • the replacement module is configured to replace the forwarding identifier in the packet with the scheduling flow identifier corresponding to the next forwarding device;
  • the second sending module is configured to send the packet after the completion of the scheduling flow identifier is replaced.
  • a computer storage medium having stored therein computer executable instructions for performing the methods described above.
  • the forwarding device adds the scheduling flow identifier of the packet on the next forwarding device in the forwarding path to the next forwarding device, and reduces the feature information of the next forwarding device to parse the packet again.
  • Obtaining the time of the scheduling flow identifier corresponding to the packet improves the information processing efficiency and reduces the hardware consumption.
  • FIG. 1 is a flowchart of a packet scheduling method based on a scheduling flow identifier according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of another method for scheduling a packet based on a scheduling flow identifier according to an embodiment of the present disclosure
  • FIG. 3 is a schematic structural diagram of a header of a packet in a scheduling flow identifier request distribution protocol according to an embodiment of the present disclosure
  • FIG. 4 is a structural diagram of a message body of a message in a scheduling flow identifier request distribution protocol according to an embodiment of the present invention
  • FIG. 5 is a schematic diagram of comparison of packet formats according to an embodiment of the present invention.
  • FIG. 6 is a schematic structural diagram of a scheduling flow identifier field according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic diagram of an Ethernet network according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a packet format change in a packet process based on a scheduling flow identifier in an Ethernet network according to an embodiment of the present disclosure
  • FIG. 9 is a schematic diagram of a format of a packet encapsulated by a forwarding device R1 according to an embodiment of the present disclosure.
  • FIG. 10 is a structural diagram of a packet scheduling apparatus based on a scheduling flow identifier according to an embodiment of the present disclosure
  • FIG. 11 is a structural diagram of another packet scheduling apparatus based on a scheduling flow identifier according to an embodiment of the present invention.
  • FIG. 1 is a flowchart of a packet scheduling method based on a scheduling flow identifier according to an embodiment of the present invention. The method shown in Figure 1 includes:
  • Step 101 The forwarding device acquires a scheduling flow identifier corresponding to the next forwarding device of the packet in the forwarding path, in the process of scheduling the received packet.
  • Step 102 The forwarding device adds the scheduling flow identifier to the packet.
  • Step 103 The forwarding device sends a packet including the scheduling flow identifier to the next forwarding device.
  • the forwarding device in the process of processing the packet, obtains the scheduling flow identifier of the next forwarding device on the forwarding path by using the result of the local processing, and the scheduling is performed.
  • the flow identifier is carried to the next forwarding device, which reduces the time for the next forwarding device to parse the packet feature information again to obtain the scheduling flow identifier corresponding to the packet, thereby improving information processing efficiency and reducing hardware consumption.
  • FIG. 2 is a flowchart of another method for scheduling a message based on a scheduling flow identifier according to an embodiment of the present invention.
  • the method shown in Figure 2 includes:
  • Step 201 After receiving the packet including the scheduling flow identifier, the forwarding device acquires the scheduling flow identifier in the packet.
  • Step 202 The forwarding device performs a scheduling operation on the packet according to the scheduling flow identifier.
  • the forwarding device uses the scheduling flow identifier in the packet to schedule the packet, and does not need to parse the feature information of the packet again to obtain the scheduling flow identifier, so that the packet scheduling can be completed, thereby saving local
  • the scheduling time improves the efficiency of information processing and reduces hardware consumption.
  • the forwarding device obtains the scheduling flow identifier corresponding to the next forwarding device of the packet on the forwarding path, including:
  • the forwarding device acquires packet feature information of the packet
  • the forwarding device searches for the scheduling flow identifier corresponding to the packet feature information of the packet according to the correspondence between the locally stored packet feature information and the scheduling flow identifier;
  • the forwarding device uses the found result as the scheduling flow identifier corresponding to the packet;
  • the forwarding device sends a query request to the next forwarding device, where the query request includes packet feature information of the packet; and receives a query response fed back by the next forwarding device,
  • the query response includes scheduling flow identification information of the packet.
  • the packet feature information may be information such as an integrated source address, a destination address, a MAC address, a label exp, an IP protocol, or an application port number.
  • the correspondence between the packet feature information and the scheduling flow identifier is obtained by:
  • the forwarding device requests the next forwarding device to obtain the corresponding scheduling flow identifier of the packet feature information on the next forwarding device;
  • the next forwarding device After receiving the request, the next forwarding device feeds back the information of the local traffic classification, and feeds back the scheduling flow identifier corresponding to the feature information to the forwarding device.
  • the forwarding device After the forwarding device obtains the packet flow information corresponding to the scheduling flow identifier corresponding to the next forwarding device, the corresponding relationship between the two is saved for subsequent use.
  • the scheduling flow identifier request distribution protocol is based on the TCP protocol (the port number is a temporary port number of 1024-5000), and the scheduling flow identifier request distribution protocol is divided into a scheduling flow identifier request packet and a scheduling flow identifier response packet, and the packet header is sent by the header.
  • the department and the message body are composed of two parts.
  • FIG. 3 is a schematic structural diagram of a header of a message in a scheduling flow identifier request distribution protocol according to an embodiment of the present invention.
  • the protocol header shown in Figure 3 has a total of 8 bytes, each of which is described as follows:
  • Version 1 byte, used to identify the version of the dispatch stream identifier request distribution protocol.
  • Protocol payload length 2 bytes, the total length of the protocol payload, excluding the protocol header length.
  • Message Type Identifies the packet type. The request is 0 and the response is 1.
  • Request number 3 bytes are used to identify the request. (The attachment protocol format has been modified)
  • FIG. 4 is a structural diagram of a message body of a message in a scheduling flow identifier request distribution protocol according to an embodiment of the present invention.
  • the message body shown in Figure 4 consists of a type, length, and value (Type, Length, Value, TLV) format. The description of each of these fields is as follows:
  • Type field indicating the content of the following fields, such as source IP, destination IP, source port number, destination port, and so on.
  • Length A length field that identifies the length of a group of TLVs.
  • Value corresponds to the value of the attribute. The specific length is determined according to the attribute. For example, Type is an IP address, then Value is 4 bytes. If Type is the destination mac, then it is 6 bytes, and the attribute is less than one byte. One byte indicates that the value of exp is 1 byte.
  • 0 The value of the scheduled flow identifier to be returned. Currently, the specific value of the scheduled flow identifier is 2 bytes.
  • the forwarding device adds the scheduling flow identifier to the packet, including:
  • the forwarding device adds a field after the Layer 2 protocol header of the packet, and adds the scheduling flow identifier to the added field.
  • the Ethernet packet is used as an example.
  • the added field is located between the packet header field and the IP header field of the Ethernet packet.
  • the IP packet is used as an example.
  • the added field is located between the IP header field and the data segment field.
  • FIG. 5 is a schematic diagram of comparison of packet formats according to an embodiment of the present invention.
  • the first packet format is the original packet format
  • the second packet format is the processed packet format.
  • the "Scheduled Flow Identifier" field is inserted between the Layer 2 Ethernet Header and the Layer 3 IP, so that the next forwarding device can directly search for the corresponding schedule according to the value of the "Scheduled Flow Identifier" field.
  • Information perform scheduling actions.
  • a corresponding protocol field is added in the Ethernet header to identify a packet with a scheduling flow identifier, and a flow identifier value may be added in the scheduling flow identifier field to increase the upper protocol type. Value, which is convenient for the device to parse the message.
  • FIG. 6 is a schematic structural diagram of a scheduling flow identifier field according to an embodiment of the present invention.
  • the schematic diagram shown in FIG. 6 includes a scheduling flow identifier and upper layer protocol number information.
  • the upper layer protocol number information is used to indicate data protocol information corresponding to the data of the subsequent field.
  • the forwarding device of the next forwarding device acquires the scheduling flow identifier corresponding to the next forwarding device of the packet on the forwarding path;
  • the forwarding device replaces the forwarding identifier in the packet with the scheduling stream identifier corresponding to the next forwarding device;
  • the forwarding device sends the packet that has been replaced by the scheduled flow identifier.
  • FIG. 7 is a schematic diagram of an Ethernet network according to an embodiment of the present invention.
  • R1, R2, and R3 are three forwarding devices on the forwarding path.
  • the packets are forwarded from R1 to R2, and R2 forwards them to R3.
  • R3 forwards them again.
  • QoS processing is performed on R1, R2, and R3, it is classified according to information such as source address, destination address, MAC address, label exp, IP protocol, or application port number, and then scheduled.
  • the packets are forwarded through R1, R2, and R3, and the three forwarding devices perform protocol interaction and negotiation in advance, so that the output packet format on the forwarding device changes. .
  • FIG. 8 is a schematic diagram of a packet format change in a packet process based on a scheduling flow identifier in an Ethernet network according to an embodiment of the present invention.
  • the packet forwarding path is R1->R2->R3, then R1 is the upstream device of R2, and R2 is the downstream device of R1. Others are similar.
  • the following figure illustrates the process of scheduling flow identification request and distribution, and requests are distributed from upstream to downstream.
  • the message format becomes the "processed message" in the figure (that is, the output message of R1), and after R2 processing, Replace the "scheduling flow identifier" in the input message with the corresponding local "scheduling flow identifier" (R3 assigned to R2), and then send it to R3, and R3 performs a similar action on R2.
  • R2, R3, and subsequent forwarding devices do not need to be classified according to information such as source address, destination address, MAC address, label exp, IP protocol, or application port number, but can be directly based on the pre-allocated scheduling stream identifier. Perform the correct scheduling action.
  • the processing method in the related art is that the forwarding device needs to be identified according to the characteristics of the message, and this operation step is very cost-effective. In addition, it is considered that the same type of packets on the network are always persistent for a certain period of time. In the related art, even if the packets of the same type are received, the forwarding device repeatedly recognizes the packets according to the characteristics of the packets. The action of classification. Different from the related art, the embodiment of the present invention identifies the flow in advance through the interaction on the control plane protocol, and the upstream forwarding device The scheduling flow identifier is sent to the downstream forwarding device.
  • the downstream forwarding device does not need to perform the classification action by using the scheduling flow identification information, and does not need to identify each packet one by one when it is the same type of packet for a period of time. Because the scheduled flow identifier requested by the upstream device is a preparatory action for triggering the downstream device to perform the corresponding scheduling mode of the device, the prepared action avoids the persistent classification action that is originally necessary.
  • the forwarding device detects that the scheduling identifier carried in the received packet changes, the packet is scheduled according to the newly obtained scheduling flow identifier in a preset time.
  • the scheduled flow identifier of the previously obtained packet is A, and the currently received scheduling flow identifier becomes B, according to the law of data transmission in the network, the received packet is received in the next one end time.
  • the packet feature information is the same. Therefore, the scheduling flow identifier of the subsequent packets is also B. Therefore, the forwarding device does not need to identify the packet characteristics one by one, which reduces the processing pressure of the forwarding device and reduces hardware consumption.
  • the communication between the forwarding device R1 and the forwarding device R2 is taken as an example for description:
  • Steps A01 and R1 enable the functions of the embodiment of the present invention, and configure the entry quintuple information such as: the destination IP address is 200.1.1.10, the source IP address is 210.1.1.10, the protocol number is UDP, the source port number is 1000, and the destination port number is It is 1000.
  • Steps A02 and R1 process the message to obtain the characteristics of the output message. For example, if the quintuple information remains unchanged and a layer of tag information is added, then R1 puts the quintuple information and the tag value (for example, 1200) and exp (for example, 1) into the request message of the scheduling flow identification request distribution protocol. , sent to the next hop device R2.
  • the quintuple information remains unchanged and a layer of tag information is added
  • R1 puts the quintuple information and the tag value (for example, 1200) and exp (for example, 1) into the request message of the scheduling flow identification request distribution protocol. , sent to the next hop device R2.
  • Steps A03 and R2 receive the received packet feature information, obtain an index of the corresponding local scheduling classification entry according to the actual forwarding process, and send the index as a scheduling flow identifier in the response packet of the scheduling flow identifier request distribution protocol.
  • R1 is L2 in the above figure, and the specific value is, for example, 0x1200.
  • This classification is the same as the normal classification implementation (eg using TCAM).
  • Step A05 When R1 receives the feature traffic from the interface (the destination IP address of the quintuple information is 200.1.1.10, the source IP address is 210.1.1.10, the protocol number is UDP, the source port number is 1000, and the destination port number is 1000.
  • the classification is performed, the scheduling flow identifier in the classification table is obtained, and then encapsulated into the packet. .
  • FIG. 9 is a schematic diagram of a format of a packet encapsulated by a forwarding device R1 according to an embodiment of the present invention.
  • 0x1200 is the scheduling flow identifier of the downstream branch
  • 0x0800 is the protocol number of the upper layer protocol.
  • Steps A06 and R1 send the message.
  • the embodiment of the invention implements a method for distributing a scheduling flow identifier in a network, and performing QoS scheduling based on the distributed scheduling flow identifier.
  • the main implementation steps are as follows:
  • Embodiment 1 is a diagrammatic representation of Embodiment 1:
  • Step 1 Enable the function of distributing the scheduling flow identifier and performing the QoS scheduling based on the distributed scheduling flow identifier on each forwarding device.
  • Step 2 Configure the stream characteristics to be processed, such as the source address, the destination address, the MAC address, the label exp, the IP protocol, or the port number of the application, on the entire forwarding path upstream device R1. It can be either an entry or an outgoing message feature.
  • Step 3 If it is an inbound packet feature, the upstream device R1 processes the packet characteristics of the egress, and then carries the packet feature field to send a request to the downstream device R2 to request distribution of the scheduling flow identifier. If the egress message feature is configured, the downstream device is directly requested to distribute the scheduling flow identifier.
  • Step 4 R1 downstream device R2 receives the request of the upstream device, generates a scheduling flow identifier L2 as a response and sends it to the upstream device R1, and obtains the egress packet feature of the device according to the ingress packet processing, and then sends the egress packet feature of the device to the downstream device R3.
  • the request to dispatch the flow identifier is distributed, and R3 responds to the request, so that R2 also obtains the dispatch flow identifier L3 allocated by R3, and R2 associates the dispatch flow identifier L3 with the dispatch flow identifier L2 that is sent to R1 by itself. That is, L3 can be found according to L2.
  • each device associates the scheduling flow identifier assigned to the upstream device with its own scheduling action, that is, the scheduling action can be found according to the scheduling flow identifier.
  • Step 5 The devices on the forwarding path perform similar functions until the last forwarding device, and the scheduling flow identifier is distributed.
  • Step 6 Receive a packet on R1 to find out whether it is a configured flow feature. If yes, the L2 scheduling flow identifier is encapsulated in the normal forwarding process, and then forwarded to R2.
  • R2 parses the packet according to the protocol number, and then finds the associated scheduling action according to L2, performs scheduling, and sends the packet. When you replace L2 with an L3 tag, send it to R2.
  • Step 7 R3 performs an R2-like action until the message is forwarded to the destination.
  • the devices dynamically negotiate the allocation of the scheduling flow identifiers through the protocol, and perform scheduling according to the scheduling flow identifier.
  • Embodiment 2 is a diagrammatic representation of Embodiment 1:
  • the present embodiment is such that the manner is completed by static configuration.
  • the specific instructions are as follows:
  • Step 1 Each forwarding device enables distribution of the scheduling flow identifier, and performs QoS scheduling based on the distributed scheduling flow identifier.
  • Step 2 Configure flow characteristics on each device and specify the dispatch flow identifier to be distributed to the upstream device.
  • the outbound encapsulated scheduling flow identifier L1 is specified for the particular flow.
  • the scheduled flow identifier L1 of the ingress and the scheduled flow identifier L2 of the egress are configured, and the ingress scheduling flow identifier L2 is configured on R3.
  • R2 and R3 associate the scheduling action with the ingress scheduling flow identifier.
  • Step 3 The packet enters R1, and R1 encapsulates the configured scheduling flow identifier L1 when forwarding the packet according to the flow characteristics and configuration.
  • Step 4 Relevant scheduling is performed according to L1 on R2, and L2 is sent to R3 on the egress package.
  • Step 5 R3 receives the packet, similar to R2 for related scheduling, forwarding, and the like.
  • the forwarding device performs the interaction, assigns a specific identifier to a specific flow, and sends a request message of the scheduling flow identifier requesting the distribution protocol to the downstream device.
  • the downstream device convects the flow according to the processing of the device. Assigning a specific identifier, and then notifying the upstream forwarding device by sending a response packet of the scheduling distribution identifier requesting the distribution protocol, so that the upstream forwarding device encapsulates the specific scheduling flow identifier into the packet when processing the packet.
  • the downstream forwarding device is sent to the downstream forwarding device, and the downstream forwarding device can directly perform related action processing and scheduling according to the scheduling flow identifier, without performing classification processing, thereby improving processing performance and even saving hardware devices such as TCAM.
  • FIG. 10 is a structural diagram of a message scheduling apparatus based on a scheduling flow identifier according to an embodiment of the present invention.
  • the device shown in Figure 10 includes:
  • the first obtaining module 1001 is configured to: in the process of processing the received packet, obtain a scheduling flow identifier corresponding to the next forwarding device of the packet in the forwarding path;
  • the adding module 1002 is configured to add the scheduling flow identifier to the packet.
  • the first sending module 1003 is configured to send a packet including the scheduling flow identifier to the next forwarding device.
  • the first obtaining module 1001 includes:
  • An obtaining unit configured to obtain message feature information of the packet
  • the searching unit searches for the scheduling flow identifier of the next forwarding device corresponding to the packet feature information of the packet according to the correspondence between the local pre-stored packet feature information and the scheduling flow identifier of the next forwarding device;
  • a first determining unit configured to: if found, the forwarding device uses the found result as a scheduling flow identifier corresponding to the packet;
  • a sending unit configured to send a query request to the next forwarding device if not found, where the query request includes message feature information of the packet;
  • the receiving unit is configured to receive a query response fed back by the next forwarding device, where the query response includes message feature information of the packet.
  • the adding module 1002 is configured to: add a field after the Layer 2 protocol header of the packet, and add the scheduling flow identifier to the added field.
  • the device provided by the embodiment of the present invention obtains the scheduling flow identifier of the next forwarding device on the forwarding path by using the result of the local scheduling process in the process of scheduling the packet, and identifies the scheduling flow identifier.
  • the notification is sent to the next forwarding device, which reduces the time for the next forwarding device to parse the packet feature information again to obtain the scheduling flow identifier corresponding to the packet, which improves the information processing efficiency and reduces the hardware consumption.
  • FIG. 11 is another packet scheduling device based on a scheduling flow identifier according to an embodiment of the present invention. Structure diagram. The device shown in Figure 11 includes:
  • the second obtaining module 1101 is configured to: after receiving the packet that includes the scheduling flow identifier, obtain the scheduling flow identifier in the packet;
  • the scheduling module 1102 is configured to perform a scheduling operation on the packet according to the scheduling flow identifier.
  • the device further comprises:
  • a third acquiring module configured to obtain a scheduling flow identifier corresponding to a next forwarding device of the packet on the forwarding path;
  • the replacement module is configured to replace the forwarding identifier in the packet with the scheduling flow identifier corresponding to the next forwarding device;
  • the second sending module is configured to send the packet after the completion of the scheduling flow identifier is replaced.
  • the device provided by the embodiment of the present invention in the process of processing the packet, obtains the scheduling flow identifier of the next forwarding device on the forwarding path by using the result of the local processing, and carries the scheduling flow identifier
  • the next forwarding device is used to reduce the time when the next forwarding device parses the packet feature information to obtain the scheduling flow identifier corresponding to the packet, which improves information processing efficiency and reduces hardware consumption.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve. Thus, the invention is not limited to any specific combination of hardware and software.
  • the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.
  • each device/function module/functional unit in the above embodiment When each device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the foregoing technical solution reduces the time for the next forwarding device to parse the packet feature information again to obtain the scheduling flow identifier corresponding to the packet, thereby improving information processing efficiency and reducing hardware consumption.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé et un dispositif de programmation de paquets à base d'identificateur de flux de programmation, le procédé comprenant les étapes suivantes : pendant le traitement de réacheminement d'un paquet reçu, un dispositif de réacheminement obtient un identificateur de flux de programmation correspondant d'un dispositif de réacheminement suivant d'un paquet dans un chemin de réacheminement ; le dispositif de réacheminement ajoute l'identificateur de flux programmation au paquet ; le dispositif de réacheminement envoie le paquet comprenant l'identificateur de flux de programmation au dispositif de réacheminement suivant. La présente solution technique réduit le temps d'analyse à nouveau par le dispositif de réacheminement suivant des informations de caractéristiques de paquets de manière à obtenir l'identificateur de flux de programmation correspondant du paquet, ce qui permet d'augmenter l'efficacité de traitement des informations, et de réduire la consommation de matériel.
PCT/CN2015/082100 2015-03-20 2015-06-23 Procédé et dispositif de programmation de paquets à base d'identificateur de flux de programmation Ceased WO2016150020A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510125978.5 2015-03-20
CN201510125978.5A CN106034089A (zh) 2015-03-20 2015-03-20 基于调度流标识的报文调度方法和装置

Publications (1)

Publication Number Publication Date
WO2016150020A1 true WO2016150020A1 (fr) 2016-09-29

Family

ID=56976931

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/082100 Ceased WO2016150020A1 (fr) 2015-03-20 2015-06-23 Procédé et dispositif de programmation de paquets à base d'identificateur de flux de programmation

Country Status (2)

Country Link
CN (1) CN106034089A (fr)
WO (1) WO2016150020A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113364676A (zh) * 2020-03-05 2021-09-07 华为技术有限公司 一种数据流处理的方法及装置

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108011824B (zh) * 2016-11-02 2021-07-09 华为技术有限公司 一种报文处理方法以及网络设备
CN107948088B (zh) * 2018-01-05 2021-10-01 宝牧科技（天津）有限公司 一种网络应用层负载均衡的方法
WO2019192306A1 (fr) * 2018-04-03 2019-10-10 华为技术有限公司 Procédé, appareil et système de transmission de messages
CN110351030B (zh) 2018-04-03 2022-07-12 华为技术有限公司 报文传输方法、装置和系统
CN118827570A (zh) * 2023-10-16 2024-10-22 清华大学 一种流量调度方法、设备及介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102271079A (zh) * 2010-06-04 2011-12-07 华为技术有限公司 报文转发的方法、节点和系统
CN103748842A (zh) * 2013-06-26 2014-04-23 华为技术有限公司 一种转发数据包的方法、装置和路由设备
US20140146677A1 (en) * 2012-11-09 2014-05-29 Aruba Networks, Inc. Dynamic determination of transmission parameters based on packet priority and network conditions

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102215160B (zh) * 2010-04-07 2016-01-20 中兴通讯股份有限公司 数据通信系统及方法
CN102970239B (zh) * 2012-11-28 2015-07-22 福建星网锐捷网络有限公司 流处理方法、流处理装置、路由器及流处理系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102271079A (zh) * 2010-06-04 2011-12-07 华为技术有限公司 报文转发的方法、节点和系统
US20140146677A1 (en) * 2012-11-09 2014-05-29 Aruba Networks, Inc. Dynamic determination of transmission parameters based on packet priority and network conditions
CN103748842A (zh) * 2013-06-26 2014-04-23 华为技术有限公司 一种转发数据包的方法、装置和路由设备

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113364676A (zh) * 2020-03-05 2021-09-07 华为技术有限公司 一种数据流处理的方法及装置
WO2021174986A1 (fr) * 2020-03-05 2021-09-10 华为技术有限公司 Procédé et dispositif de traitement de flux de données
CN113364676B (zh) * 2020-03-05 2023-05-02 华为技术有限公司 一种数据流处理的方法及装置

Also Published As

Publication number Publication date
CN106034089A (zh) 2016-10-19

Similar Documents

Publication Publication Date Title
US10110517B2 (en) System and method for open vSwitch virtual switch that supports IEEE 802.1p
JP7634561B2 (ja) メッセージ処理方法及び装置、通告方法及び装置、ネットワークブリッジノード、ソースデバイス、記憶媒体及びメッセージ処理システム
US11165716B2 (en) Data flow processing method and device
CN108353029A (zh) 用于管理计算网络中的数据业务的方法和系统
WO2016150020A1 (fr) Procédé et dispositif de programmation de paquets à base d'identificateur de flux de programmation
US8284789B2 (en) Methods and apparatus for providing dynamic data flow queues
US11863459B2 (en) Packet processing method and apparatus
US12028260B2 (en) Service packet processing method, apparatus, and system
CN107786465A (zh) 一种用于处理低延迟业务流的方法和装置
WO2020087523A1 (fr) Procédé et appareil de communication de réseau et dispositif électronique
WO2015101066A1 (fr) Procédé et nœud pour établir une réservation de qualité de service
CN112995056B (zh) 一种流量调度方法、电子设备及存储介质
CN106789671B (zh) 一种业务报文转发方法及设备
CN111865805B (zh) 一种组播gre报文处理方法及系统
CN117061435A (zh) 一种数据传输方法及其相关设备
CN111953619A (zh) 一种基于dscp对报文进行分流的方法、系统、设备及介质
CN110958185B (zh) 基于业务的QoS配置方法及装置
CN118282932A (zh) 信息处理方法、设备和存储介质
WO2017193814A1 (fr) Procédé et système de génération de chaîne de service
CN116192763A (zh) 基于5g-tsn融合的工业互联网报文发送和接收方法
CN115460651A (zh) 数据传输方法及装置、可读存储介质、终端
CN117941409A (zh) 发送上行数据包的方法和通信装置
CN117768417A (zh) 数据传输方法、装置、计算机设备和存储介质
WO2025129991A1 (fr) Procédé de traitement cyclique pour service déterministe, et système
CN118250230A (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: 15885958

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: 15885958

Country of ref document: EP

Kind code of ref document: A1