WO2017035752A1 - 一种数据流报头压缩传输方法、系统及控制器、节点 - Google Patents

一种数据流报头压缩传输方法、系统及控制器、节点 Download PDF

Info

Publication number
WO2017035752A1
WO2017035752A1 PCT/CN2015/088641 CN2015088641W WO2017035752A1 WO 2017035752 A1 WO2017035752 A1 WO 2017035752A1 CN 2015088641 W CN2015088641 W CN 2015088641W WO 2017035752 A1 WO2017035752 A1 WO 2017035752A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
cid
transmission path
data stream
controller
Prior art date
Application number
PCT/CN2015/088641
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 华为技术有限公司
Priority to PCT/CN2015/088641 priority Critical patent/WO2017035752A1/zh
Priority to CN201580035116.1A priority patent/CN107210964B/zh
Publication of WO2017035752A1 publication Critical patent/WO2017035752A1/zh

Links

Images

Definitions

  • the present invention relates to the field of communications, and in particular, to a data stream header compression transmission method, system, controller, and node.
  • IPsec Internet Protocol Security adds a packet header to the security of communications over an Internet Protocol (IP) network, which makes the packet header and packet payload size similar or even more The problem of wasted bandwidth is becoming more serious.
  • IP Internet Protocol
  • a header compression transmission mechanism such as Robust Header Compression (ROHC) and Internet Protocol Header Compression (Internet Protocol Header) is proposed. Compression, IPHC).
  • ROHC Robust Header Compression
  • IPHC Internet Protocol Header Compression
  • the existing header compression transmission mechanism compresses and decompresses the packet header hop by hop, that is, each node of the data stream needs to perform header compression and header decompression processing on the transmission path, which requires that each node supports
  • the header compression protocol and the header decompression protocol increase the complexity of the node device.
  • the node since each node on the transmission path in the existing header compression transmission mechanism needs to perform header compression, header decompression, and integrity check on the data packet, the node has a long processing time and a large data transmission delay.
  • a node needs to establish a context mapping for each data stream, and the header compression of each data stream is different from the context used for header decompression.
  • the node needs to save a large amount of data stream context, so the hardware requirements of the node's memory and the like are extremely high, thereby increasing the node equipment cost.
  • the existing header compression transmission mechanism has high complexity and high cost of the node device. Moreover, the node has a long processing time and a large data transmission delay.
  • the embodiment of the present invention provides a data stream header compression transmission method, system, controller, and node, so as to reduce device complexity and equipment cost of a node used for data stream header compression transmission, and reduce node processing data stream header compression transmission. Time, reducing the data stream header compression transmission delay.
  • a data stream header compression transmission method provided by an embodiment of the present invention includes:
  • the controller allocates an unoccupied context identifier CID for the data stream, and determines a transmission path of the data stream;
  • the controller performs the following steps for each node on the transmission path:
  • the controller For the first node on the transmission path, the controller sends the header identifier of the data flow, the CID, and the node identifier of the next node of the first node to the first node;
  • the controller For each intermediate node on the transmission path, the controller sends the CID and the node identifier of the next node of the intermediate node to the intermediate node;
  • the controller sends the CID to the end node for the last node on the transmission path.
  • the method further includes:
  • the controller sends an identifier of a compression algorithm for compressing a packet header of the data stream to the head node;
  • the controller sends a method identifier for decompressing a packet header of the data stream for decompressing the data stream to the end node.
  • the method further includes:
  • the controller counts the number of occupied CIDs
  • the controller uses the utilization.
  • the lowest rate CID identifier is unoccupied, and the first node and the last node on the transmission path of the data stream occupying the CID with the lowest utilization rate are released to release the CID with the lowest utilization rate.
  • the utilization of the CID is the quotient of the difference between the number of bytes before and after compression of the packet header of the data stream occupying the CID and the time interval at which the data stream occupies the CID.
  • the method further includes:
  • the control recalculates the utilization of each occupied CID.
  • the method further includes:
  • the controller When the time interval of the last node decompressing the data packet header of the data stream exceeds the fourth threshold, the controller identifies the CID occupied by the data stream as unoccupied, and notifies the data. The first node and the last node on the transmission path of the stream release the CID.
  • the method further includes:
  • the controller determines an alternate transmission path of the transmission path when the transmission path of the data stream is broken, and the first node and the last node on the alternative transmission path are respectively the transmission path The first node, the last node, and does not include the link on the transmission path where the link is broken;
  • the controller performs the following steps for each node on the alternate transmission path:
  • the controller sends the CID and a node identifier of a next node of the first node on the replaceable transmission path to the first node;
  • the controller For the intermediate node on the alternative transmission path, the controller sends the CID and the node identifier of the next node of the intermediate node on the alternative transmission path to the intermediate node.
  • a data stream header compression transmission method provided by an embodiment of the present invention includes:
  • a header node on a transmission path of the data stream receives a header identifier of the data stream sent by the controller, a context identifier CID allocated by the controller for the data stream, and a next step of the head node on the transmission path
  • the head node performs header compression on a first data packet that matches a header identifier of the data flow Processing to obtain a second data packet;
  • the first node transmits the second data packet carrying the CID to a next node corresponding to the node identifier of the next node.
  • the method before the first node performs a header compression process on the first data packet that matches the header identifier of the data flow to obtain the second data packet, the method further includes:
  • the first node receives a compression algorithm identifier sent by the controller
  • the first node performs a header compression process on the first data packet that matches the header identifier of the data stream to obtain a second data packet, including:
  • the first node performs header compression processing on the first data packet by using a compression algorithm to identify a corresponding compression algorithm to obtain a second data packet.
  • the method further includes:
  • the first node receives a notification sent by the controller to indicate release of the CID occupied by the data flow
  • the head node releases the CID according to the notification.
  • the method further includes:
  • the first node performs header compression processing on the first data packet that matches the header identifier of the data stream to obtain a second data packet;
  • the first node transmits the second data packet carrying the CID to a next node corresponding to a node identifier of a next node of the first node on the replaceable transmission path.
  • a data stream header compression transmission method provided by an embodiment of the present invention includes:
  • An intermediate node on a transmission path of the data stream receives a context identifier CID allocated by the controller for the data stream and a node of the next node of the intermediate node on the transmission path Node identifier
  • the intermediate node When receiving the second data packet carrying the CID, the intermediate node transmits the second data packet carrying the CID to the next node corresponding to the node identifier of the next node, where the second data is The packet is obtained by the header compression processing of the first data packet.
  • the method further includes:
  • the intermediate node receives the second data packet carrying the CID, transmitting the second data packet carrying the CID to a node of a next node of the intermediate node on the replaceable transmission path Identifies the corresponding next node.
  • a data stream header compression transmission method provided by an embodiment of the present invention includes:
  • the last node on the transmission path of the data stream receives the context identifier CID that the controller sends to the data stream by the controller;
  • the last node When the last node receives the second data packet carrying the CID, performing header decompression processing on the second data packet to obtain a first data packet, where the second data packet is that the first data packet passes The header compression process is obtained.
  • the method before the performing, by the end node, performing header decompression processing on the second data packet to obtain the first data packet, the method further includes:
  • the end node receives the decompression algorithm identifier sent by the controller
  • the end node uses the decompression algorithm to identify a corresponding decompression algorithm to perform header decompression processing on the second data packet to obtain a first data packet.
  • the method further includes:
  • the end node releases the CID according to the notification.
  • a fifth aspect of the present invention provides a controller, including:
  • a path determining unit configured to allocate an unoccupied context identifier CID to the data stream, and determine a transmission path of the data stream;
  • the information sending unit is configured to:
  • the information sending unit sends a header identifier of the data stream, a CID allocated by the path determining unit, and a node identifier of a next node of the head node to the head node;
  • the information sending unit For each intermediate node on the transmission path, the information sending unit sends the CID and the node identifier of the next node of the intermediate node to the intermediate node;
  • the information transmitting unit transmits the CID to the last node for the last node on the transmission path.
  • the information sending unit is further configured to:
  • a method identifier of a decompression algorithm for decompressing a packet header of the data stream is sent to the end node.
  • the method further includes:
  • a first CID release unit for:
  • the CID with the lowest utilization rate is used.
  • the first node and the last node on the transmission path of the data stream occupying the CID occupying the lowest utilization rate are released as the unoccupied, and the CID is used as the CID-occupied data stream.
  • the difference between the number of bytes before and after compression of the packet header and the data stream The quotient of the time interval with CID.
  • the first CID release unit is further configured to:
  • each of the Occupied CID utilization When the number of occupied CIDs is greater than or equal to the first threshold and less than or equal to the total number of CIDs, if the time interval from the last calculation of the utilization rate of each occupied CID is greater than or equal to the third threshold, each of the Occupied CID utilization.
  • the method further includes:
  • a second CID release unit configured to: when the time interval of the last node decompressing the data packet header of the data stream exceeds a fourth threshold, identify the CID occupied by the data stream as unoccupied, and Notifying the head node and the last node on the transmission path of the data stream to release the CID.
  • the method further includes:
  • Link interrupt processing unit for:
  • a first node and a last node on the alternative transmission path are respectively a first node of the transmission path, a last node, and does not include a link on the transmission path where a link interruption occurs;
  • a first node is provided by the embodiment of the present invention, where the first node is a first node on a transmission path of a data stream, and the first node includes:
  • An information receiving unit configured to receive a header identifier of the data stream sent by the controller, a context identifier CID allocated by the controller for the data stream, and a node of a next node of the head node on the transmission path Identification
  • a packet compression unit configured to perform header compression processing on the first data packet that matches the header identifier of the data stream received by the information receiving unit to obtain a second data packet
  • a data packet transmission unit configured to transmit the second data packet processed by the data packet compression unit that carries the CID to a next node corresponding to a node identifier of the next node.
  • the information receiving unit is further configured to:
  • the packet compression unit is specifically configured to:
  • the method further includes:
  • CID release unit for:
  • the information receiving unit is further configured to:
  • the packet compression unit is further configured to:
  • the data packet transmission unit is further configured to:
  • an intermediate node is provided by the embodiment of the present invention, where the intermediate node is an intermediate node on a transmission path of a data stream, and the intermediate node includes:
  • An information receiving unit configured to receive, by the controller, the controller to allocate the data stream a context identifier CID and a node identifier of a next node of the intermediate node on the transmission path;
  • a data packet transmission unit configured to: when receiving the second data packet carrying the CID received by the information receiving unit, transmitting a second data packet carrying the CID to a node identifier of the next node Corresponding to the next node, the second data packet is obtained by compressing the first data packet by a header.
  • the information receiving unit is further configured to:
  • the data packet transmission unit is further configured to:
  • the node of a node identifies the next node corresponding to it.
  • a last node is provided by the embodiment of the present invention, where the last node is a last node on a transmission path of a data stream, and the last node includes:
  • An information receiving unit configured to receive, by the controller, a context identifier CID allocated by the controller for the data stream;
  • a packet decompression unit configured to perform a header decompression process on the second data packet to obtain a first data packet, when the second data packet carrying the CID received by the information receiving unit is received, where The second data packet is obtained by the header compression processing of the first data packet.
  • the information receiving unit is further configured to:
  • the packet decompression unit is specifically configured to:
  • the method further includes:
  • a CID release unit configured to receive a notification sent by the controller to indicate release of the CID occupied by the data flow, and release the CID.
  • controller provided by the embodiment of the present invention includes:
  • a processor configured to allocate an unoccupied context identifier CID to the data stream, and determine a transmission path of the data stream;
  • the transceiver For each node on the transmission path determined by the processor, the transceiver is used to:
  • the CID assigned by the processor is sent to the last node for the last node on the transmission path.
  • the transceiver is further configured to:
  • a method identifier of a decompression algorithm for decompressing a packet header of the data stream is sent to the end node.
  • the processor is further configured to:
  • the utilization rate of the CID having the lowest utilization rate among the occupied CIDs is lower than the second threshold. Determining that the first node and the last node on the transmission path of the data stream occupying the CID occupying the lowest utilization rate release the CID with the lowest utilization rate, and the utilization rate of the CID is The quotient of the difference between the number of bytes before and after compression of the packet header of the data stream occupying the CID and the time interval at which the data stream occupies the CID.
  • the processor is further configured to:
  • the processor is further configured to:
  • the CID occupied by the data stream is identified as unoccupied, and the transceiver is controlled to notify the data stream.
  • the first node and the last node on the transmission path release the CID.
  • the processor is further configured to:
  • a first node and a last node on the alternative transmission path are respectively a first node of the transmission path, a last node, and does not include a link on the transmission path where a link interruption occurs;
  • the transceiver For each node on the alternate transmission path determined by the processor, the transceiver is also used to:
  • a first node is provided by the embodiment of the present invention, where the first node is a first node on a transmission path of the data stream, and the first node includes:
  • a transceiver configured to receive a header identifier of the data stream sent by the controller, a context identifier CID allocated by the controller for the data stream, and a node identifier of a next node of the head node on the transmission path ;
  • a processor configured to perform header compression processing on the first data packet that matches the header identifier of the data stream received by the transceiver to obtain a second data packet;
  • the transceiver is further configured to transmit the second data packet processed by the processor carrying the CID to a next node corresponding to the node identifier of the next node.
  • the transceiver is further configured to:
  • the processor is specifically used to:
  • the compression algorithm received by the transceiver identifies a corresponding compression algorithm, and performs header compression processing on the first data packet to obtain a second data packet.
  • the transceiver is further configured to:
  • the processor is also used to:
  • the CID occupied by the data stream is released according to the notification received by the transceiver.
  • the transceiver is further configured to:
  • the processor is also used to:
  • the transceiver is also used to:
  • an intermediate node is provided by the embodiment of the present invention, where the intermediate node is an intermediate node on a transmission path of the data stream, and the intermediate node includes:
  • a transceiver configured to receive, by the controller, a context identifier CID allocated by the controller for the data stream, and a node identifier of a next node of the intermediate node on the transmission path; and receiving an intermediate node in the transmitting a packet transmitted by the previous node on the path;
  • a processor configured to carry when the transceiver receives the second data packet carrying the CID
  • the second data packet having the CID is transmitted to the next node corresponding to the node identifier of the next node, and the second data packet is obtained by the header compression processing of the first data packet.
  • the transceiver is further configured to:
  • the last node provided by the embodiment of the present invention, the last node is a last node on a transmission path of the data stream, and the last node includes:
  • a transceiver configured to receive, by the controller, a context identifier CID allocated by the controller for the data stream; and receive a data packet transmitted by a last node of the last node on the transmission path;
  • a processor configured to perform a header decompression process on the second data packet to obtain a first data packet, where the second data packet is the first data packet, when the transceiver receives the second data packet carrying the CID A packet is obtained by header compression processing.
  • the transceiver is further configured to:
  • the processor is specifically used to:
  • the decompression algorithm received by the transceiver identifies a corresponding decompression algorithm, and performs decompression processing on the second data packet received by the transceiver to obtain a first data packet.
  • the transceiver is further configured to:
  • the processor is also used to:
  • the CID occupied by the data stream is released according to the notification received by the transceiver.
  • a thirteenth aspect, a data stream header compression transmission system provided by an embodiment of the present invention
  • the system includes a controller, and a first node, an intermediate node, and a last node on a transmission path of the data stream;
  • the controller is a controller of any of the possible implementations of the fifth aspect
  • the first node is a head node of any of the possible implementations of the sixth aspect
  • the intermediate node is an intermediate node of any of the possible implementations of the seventh aspect
  • the last node is the last node of any of the possible implementations of the eighth aspect.
  • the controller allocates a CID for the data stream, calculates a transmission path for the data stream, and sends information such as a CID and a next node on the transmission path to each node on the transmission path.
  • the first node on the transmission path performs header compression processing on the data packet, and then transmits the data packet to the next node on the transmission path, and the last node on the transmission path performs header decompression processing on the received header compressed data packet, on the transmission path.
  • the intermediate node only needs to transmit the received header compressed data packet to the next node on the transmission path.
  • the technical solution of the present invention does not need to support the header compression protocol in each node on the transmission path as in the prior art, which reduces the complexity of the node device.
  • the technical solution of the present invention does not need to perform processing such as header compression, header decompression, and integrity check on the data packets as in the prior art, which reduces the processing time of the node and reduces the data transmission delay.
  • the controller allocates a CID for the data flow, and the node does not need to allocate and save the CID for the data flow passing through the node, thereby reducing the node device cost.
  • FIG. 1 is a schematic diagram of a network architecture of a data stream header compression transmission according to an embodiment of the present invention
  • FIG. 2 is a schematic flowchart of a data stream header compression transmission method according to an embodiment of the present invention
  • FIG. 3 is a schematic flowchart of a data stream header compression transmission method according to an embodiment of the present disclosure
  • FIG. 4 is a schematic flowchart of a data stream header compression transmission method according to an embodiment of the present invention.
  • FIG. 5 is a schematic flowchart of a data stream header compression transmission method according to an embodiment of the present invention.
  • FIG. 6 is a schematic structural diagram of a controller according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of a first node according to an embodiment of the present disclosure.
  • FIG. 8 is a schematic structural diagram of an intermediate node according to an embodiment of the present disclosure.
  • FIG. 9 is a schematic structural diagram of a terminal node according to an embodiment of the present disclosure.
  • FIG. 10 is a schematic structural diagram of a data stream header compression transmission system according to an embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of a controller according to an embodiment of the present disclosure.
  • FIG. 12 is a schematic structural diagram of a first node according to an embodiment of the present disclosure.
  • FIG. 13 is a schematic structural diagram of an intermediate node according to an embodiment of the present disclosure.
  • FIG. 14 is a schematic structural diagram of a terminal node according to an embodiment of the present invention.
  • Embodiments of the present invention provide a data stream header compression transmission method, system, and apparatus (including a controller, a first node, an intermediate node, and a last node on a transmission path of a data stream) to reduce a node used for compression of a data stream header.
  • Device complexity, equipment cost, reduce the time that the node processes the data stream header compression transmission, and reduces the data stream header compression transmission delay.
  • the method and the device are based on the same inventive concept. Since the principles of the method and the device for solving the problem are similar, the implementation of the device and the method can be referred to each other, and the repeated description is not repeated.
  • FIG. 1 is a schematic diagram of a system structure of the present invention, which is different from the header compression transmission mechanism for compressing and decompressing a packet header hop by hop in the prior art.
  • the controller allocates a context identifier (CID) for the data stream, calculates a transmission path for the data stream, and sends information such as the CID and the next node on the transmission path to each node on the transmission path.
  • the first node on the transmission path performs header compression processing on the data packet, and then transmits the data packet to the next node on the transmission path, and the last node on the transmission path performs header decompression processing on the received header compressed data packet, on the transmission path.
  • the intermediate node only needs to transmit the received header compressed data packet to the next node on the transmission path.
  • the technical solution of the present invention does not need to support the header compression protocol in each node on the transmission path as in the prior art, which reduces the complexity of the node device.
  • the technical solution of the present invention does not need to be like the prior art
  • Each node needs to perform header compression, header decompression, and integrity check on the data packet, which reduces the processing time of the node and reduces the data transmission delay.
  • the controller allocates a CID for the data flow, and the node does not need to allocate and save the CID for the data flow passing through the node, thereby reducing the node device cost.
  • an embodiment of the present invention provides a data stream header compression transmission method, including:
  • the controller allocates an unoccupied context identifier CID for the data stream, and determines a transmission path of the data stream.
  • the controller For each node on the transmission path, the controller performs the following steps:
  • the controller For the first node on the transmission path, the controller sends the header identifier of the data flow, the CID, and the node identifier of the next node of the first node to the first node;
  • the controller For each intermediate node on the transmission path, the controller sends the CID and the node identifier of the next node of the intermediate node to the intermediate node;
  • the controller For the last node on the transmission path, the controller sends the CID to the last node.
  • the controller determines whether it is necessary to perform header compression transmission on the data stream.
  • the controller determines, according to the judgment result, that the data stream needs to be subjected to header compression transmission, allocates an unoccupied CID to the data stream, and determines a transmission path of the data stream, and the first node on the transmission path is the first to receive the data stream.
  • the node of the packet determines that the node receives the first data packet of the data stream.
  • the node after receiving the first data packet of the data flow, the node reports the header identifier of the data flow to the controller, and the controller determines, according to the mapping relationship between the header identifier of the data flow and the data flow transmission policy, whether the node needs to The data stream is subjected to header compression transmission.
  • the header identifier of the data stream may be a source IP identifier, a destination IP address, a transmission protocol, a Transmission Control Protocol (TCP) port, or a User Datagram Protocol (UDP) port, and the like. Divided into header compression transmission and header uncompressed transmission.
  • the controller after the controller allocates an unoccupied CID to the data stream and determines a transmission path of the data stream, optionally, the controller identifies the allocated CID as occupied, and records the CID and the CID. Information such as the relationship between data streams and the transmission path of data streams.
  • the controller may save the recorded information in the form of a table to subsequently manage the CID occupied by the data stream and the data stream.
  • the controller pre-creates the CID status table, as shown in Table 1 below:
  • the CID status includes both occupied and unoccupied.
  • the transmission path information of the data stream occupying the CID includes the first node and the last node on the transmission path.
  • the CID status table pre-created by the controller further includes information such as a start time of the CID being occupied, a utilization rate of the CID, and the like.
  • the initial CID status table includes all CIDs that are not occupied (ie, CIDs that can be used for controller allocation). At this time, the status of all CIDs is unoccupied, and the controller selects the CID status table when assigning CIDs to the data stream. An unoccupied CID is assigned to the data stream, and then the information of the assigned CID in the CID status table is updated. Alternatively, the initial CID status table does not contain an unoccupied CID, and the controller allocates one CID for each data stream, and updates the information of the assigned CID in the CID status table.
  • the controller further performs the following steps:
  • the controller sends the identifier of the compression algorithm of the packet header for compressing the data stream to the first node;
  • the controller sends the identification of the decompression algorithm of the packet header used to decompress the data stream to the last node.
  • the first node compresses the data packet header of the data stream by using a compression algorithm corresponding to the identifier of the compression algorithm
  • the last node uses the decompression algorithm corresponding to the identifier of the decompression algorithm to receive the report.
  • the header compresses the packet for decompression.
  • the head node and the last node may also negotiate a compression algorithm for determining a packet header for compressing the data stream and a decompression algorithm for decompressing the packet header of the data stream.
  • the information sent by the controller to each node on the transmission path in S202 is used for each node to transmit a data stream, and the specific transmission process is shown in FIG. 3 to FIG.
  • the embodiment of the present invention provides a data stream header compression transmission method, including:
  • the first node on the transmission path of the data stream receives the header identifier of the data stream sent by the controller, the context identifier CID allocated by the controller for the data stream, and the node identifier of the next node of the first node on the transmission path.
  • the first node performs header compression processing on the first data packet that matches the header identifier of the data stream to obtain a second data packet.
  • the first node transmits the second data packet carrying the CID to the next node corresponding to the node identifier of the next node.
  • the first node may connect the transmission paths corresponding to the multiple data streams respectively, that is, the first node processes multiple data streams at the same time, and the header identifier of the data stream sent by the controller to the first node in S301 can be used for the first node to distinguish different data streams, data.
  • the header identifier of the stream may be a source IP identifier, a destination IP address, a transport protocol, a TCP port, or a UDP port.
  • the first node further receives the compression algorithm identifier sent by the controller, and then the first node uses a compression algorithm to identify a corresponding compression algorithm to perform header compression processing on the first data packet to obtain a second data packet.
  • the head node and the last node negotiate a compression algorithm that determines a packet header for compressing the data stream and a decompression algorithm for decompressing the packet header of the data stream.
  • the embodiment of the present invention provides a data stream header compression transmission method, including:
  • the intermediate node on the transmission path of the data stream receives a context identifier CID allocated by the controller for the data stream and a node identifier of the next node of the intermediate node on the transmission path.
  • the intermediate node When the intermediate node receives the second data packet carrying the CID, the intermediate node carries the CID.
  • the second data packet is transmitted to the next node corresponding to the node identifier of the next node, and the second data packet is obtained by the header data compression processing of the first data packet.
  • the embodiment of the present invention provides a data stream header compression transmission method, including:
  • the last node on the transmission path of the data stream receives a context identifier CID allocated by the controller for the data stream.
  • the last node receives the decompression algorithm identifier sent by the controller, and then the last node uses the decompression algorithm to identify the corresponding decompression algorithm to perform header decompression processing on the second data packet to obtain the first data packet.
  • the head node and the last node negotiate a compression algorithm that determines a packet header for compressing the data stream and a decompression algorithm for decompressing the packet header of the data stream.
  • the data stream header compression transmission method can avoid that each node on the transmission path supports the header compression protocol as in the prior art, thereby reducing the complexity of the node device; As with technology, each node needs to perform header compression, header decompression, and integrity check on the data packet, which reduces the processing time of the node and reduces the data transmission delay.
  • the controller allocates a CID for the data flow, and the node does not need to allocate and save the CID for the data flow passing through the node, thereby reducing the node device cost.
  • the node Since the length of the CID field in the compressed header is limited, only a limited number of data streams can be transmitted simultaneously by header compression.
  • the node allocates a CID according to the arrival order of the data stream, and does not release the CID occupation of the data stream when the data stream transmission stops, until all CIDs are occupied, the node is according to the CID.
  • the CID is released in the order of occupancy so that the released CID is reallocated. Therefore, the CID allocation mode of the existing mechanism is likely to cause the CID to be exhausted. Since the CID redistribution does not consider the difference in compression efficiency between the data streams, it is highly possible to abandon the data stream with a large compression gain, and the decompression gain is more Small data flow, making the overall gain greatly drop.
  • the embodiment of the present invention provides two methods for recovering CID, the first method is a method for recovering CID in combination with the utilization rate of CID, and the second method.
  • the method is to combine the method of stopping the processing of the data stream by the node to recover the CID, as follows:
  • the first method is a method of recovering CID in combination with the utilization of CID.
  • the controller counts the number of occupied CIDs; when the number of occupied CIDs is greater than or equal to the first threshold and less than or equal to the total number of CIDs, it indicates that the CID may be exhausted or is about to be exhausted, if the occupied CID has the lowest utilization rate. If the utilization of the CID is lower than the second threshold, the controller reclaims the CID with the lowest utilization.
  • the utilization of the CID is the quotient of the difference between the number of bytes before and after compression of the packet header occupying the data stream of the CID and the time interval at which the data stream occupies the CID.
  • the operation of the controller to recover the lowest-utilized CID includes: the controller identifies the CID with the lowest utilization as unoccupied, and notifies the first node and the last node on the transmission path of the data stream occupying the lowest utilization CID. The lowest utilization CID.
  • the data stream transmission policy corresponding to the data stream occupying the lowest utilization CID may be changed from the header compression transmission to the header uncompressed transmission, and after the set time interval, the data is further compressed.
  • the data stream transmission policy corresponding to the stream is changed from the header uncompressed transmission to the header compressed transmission, and then the controller re-allocates the unoccupied CID for the data stream.
  • the set time interval can be set according to experience, for example, can be set to 60 seconds.
  • the first node and the last node on the transmission path of the data stream with the lowest utilization CID receive the notification sent by the controller to indicate release of the lowest utilization CID, and the first node and the last node release the lowest utilization rate. CID and related information about the lowest utilization CID.
  • the total number of CIDs refers to the total number of CIDs that can be used for controller allocation.
  • the total number of CIDs, the first threshold, and the second threshold can all be set according to experience.
  • the total number of CIDs can be set to 16383
  • the first threshold can be set to 90% of the total number of CIDs
  • the second threshold can be set to 200 bits per second (Bps).
  • the number of gains can be preferentially stopped when the CID is exhausted or is about to be exhausted. According to the stream header compression transmission, the CID occupied by the data stream with small gain is recovered.
  • the controller may obtain the number of bytes before and after compression of the packet header of the data stream occupying the CID from the first node or the last node on the transmission path of the data stream occupying the CID.
  • control The device recalculates the utilization of each occupied CID.
  • the third threshold can be set empirically, for example, can be set to 10 seconds. In this way, it is not necessary to recalculate the utilization of the occupied CID every time the controller allocates the CID, thereby preventing the controller from frequently calculating the utilization rate of the occupied CID.
  • the probability that the controller recovers the CID with the lowest utilization rate is different according to different conditions that the CID with the lowest utilization rate satisfies.
  • the controller recovers the probability of the lowest utilized CID.
  • the first probability can be set empirically, for example, can be set to 50%.
  • the controller recovers the probability of the lowest utilized CID. Is the second probability.
  • the second probability can be set empirically, for example, can be set to 1, and the second probability is greater than the first probability.
  • the second method is a method of reclaiming the CID in conjunction with the time at which the node stops processing the data stream.
  • the controller reclaims the CID occupied by the data stream. That is, the controller identifies the CID occupied by the data stream as unoccupied, and notifies the first node and the last node on the transmission path of the data stream to release the CID.
  • the first node and the last node After the notification sent by the controller indicating that the CID with the lowest utilization is released, the first node and the last node release the CID with the lowest utilization and the CID with the lowest utilization.
  • the CID occupied by the data stream that stops the transmission may also be recovered by determining that the first node or the intermediate node stops processing the data stream. That is, when the time interval of the first node from the packet header of the last compressed data stream exceeds the fourth threshold, it may be that the first node stops processing the data stream, and the data stream transmission stops. At this time, the controller reclaims the CID occupied by the data stream. .
  • the time interval between the intermediate node and the header compressed data packet of the last received data stream exceeds the fourth threshold, it may be that the intermediate node stops transmitting the data stream, and the data stream transmission stops, and the controller recycles the data stream. CID.
  • the CID occupied by the data stream can be recovered in time when the data stream transmission is stopped.
  • the header compression is performed after the routing.
  • the node cannot re-route the compressed data packet due to the irreversibility of the header compression. Processing, so the node can only drop packets. Even if the interrupted transmission path is restored or the transmission path is changed, the node needs to re-establish the context, and the compression efficiency is greatly reduced.
  • the embodiment of the present invention provides a solution, which is specifically as follows:
  • the controller determines an alternative transmission path of the transmission path, and the first node and the last node on the transmission path are respectively the first node and the last node of the transmission path, and are not included. a link on the transmission path where a link is broken;
  • the controller For each node on the alternate transmission path, the controller performs the following steps:
  • the controller For the first node on the alternative transmission path, the controller sends the CID and the node identifier of the next node of the first node on the alternative transmission path to the first node;
  • the controller sends the CID and the node identification of the next node of the intermediate node on the alternative transmission path to the intermediate node.
  • the header is compressed and transmitted. Specifically,
  • the first node receives the CID sent by the controller and the node identifier of the next node of the first node on the alternative transmission path of the data stream; the first node determines the header identifier of the data stream associated with the CID; The node performs header compression processing on the first data packet matching the header identifier of the data stream to obtain a second data packet; the first node transmits the second data packet carrying the CID to the node of the next node of the first node on the alternative transmission path. Identifies the corresponding next node.
  • the intermediate node receives the CID sent by the controller and the node identifier of the next node of the intermediate node on the alternative transmission path of the data stream; when the intermediate node receives the second data packet carrying the CID And transmitting the second data packet carrying the CID to the next node corresponding to the node identifier of the next node of the intermediate node on the alternative transmission path.
  • the second data packet is subjected to header decompression processing to obtain the first data packet.
  • the controller allocates a CID for the data stream, calculates a transmission path for the data stream, and sends information such as a CID and a next node on the transmission path to each node on the transmission path.
  • the first node on the transmission path performs header compression processing on the data packet, and then transmits the data packet to the next node on the transmission path, and the last node on the transmission path performs header decompression processing on the received header compressed data packet, on the transmission path.
  • the intermediate node only needs to transmit the received header compressed data packet to the next node on the transmission path.
  • the technical solution of the present invention does not need to support the header compression protocol in each node on the transmission path as in the prior art, which reduces the complexity of the node device.
  • the technical solution of the present invention does not need to perform processing such as header compression, header decompression, and integrity check on the data packets as in the prior art, which reduces the processing time of the node and reduces the data transmission delay.
  • the controller allocates a CID for the data flow, and the node does not need to allocate and save the CID for the data flow passing through the node, thereby reducing the node device cost.
  • the present invention further provides a controller, which may adopt the method provided by the embodiment corresponding to FIG. 2, as shown in FIG. 6, the controller 600 includes: path determination Unit 601 and information transmitting unit 602.
  • the controller 600 further includes: a first CID release unit 603, a second CID release unit 604, and a link interruption processing unit 605.
  • the first CID release unit 603 and the second CID release unit 604 may be the same unit.
  • a path determining unit 601 configured to allocate an unoccupied context identifier CID to the data stream, and determine a transmission path of the data stream;
  • the information sending unit 602 is configured to:
  • the information sending unit 602 sends the header identifier of the data stream, the CID assigned by the path determining unit 601, and the node identifier of the next node of the head node to the head node. ;
  • the information sending unit 602 For each intermediate node on the transmission path, the information sending unit 602 sends the CID and the node identifier of the next node of the intermediate node to the intermediate node;
  • the information transmitting unit 602 transmits the CID to the last node for the last node on the transmission path.
  • the information sending unit 602 is further configured to:
  • a method identifier of a decompression algorithm for decompressing a packet header of the data stream is sent to the end node.
  • it also includes:
  • the first CID release unit 603 is configured to:
  • the utilization rate of the CID having the lowest utilization rate among the occupied CIDs is lower than the second threshold, the CID with the lowest utilization rate is used.
  • the first node and the last node on the transmission path of the data stream occupying the CID occupying the lowest utilization rate are notified to be unoccupied, and the CID with the lowest utilization rate is released, and the CID is profitable.
  • the usage rate is the quotient of the difference between the number of bytes before and after compression of the packet header of the data stream occupying the CID and the time interval at which the data stream occupies the CID.
  • the first CID release unit 603 is further configured to:
  • each of the Occupied CID utilization When the number of occupied CIDs is greater than or equal to the first threshold and less than or equal to the total number of CIDs, if the time interval from the last calculation of the utilization rate of each occupied CID is greater than or equal to the third threshold, each of the Occupied CID utilization.
  • it also includes:
  • the second CID release unit 604 is configured to: when the time interval of the last node decompressing the data packet header of the data stream exceeds a fourth threshold, identify the CID occupied by the data stream as unoccupied. And notifying the first node and the last node on the transmission path of the data stream to release the CID.
  • it also includes:
  • the link interruption processing unit 605 is configured to:
  • a first node and a last node on the alternative transmission path are respectively a first node of the transmission path, a last node, and does not include a link on the transmission path where a link interruption occurs;
  • the present invention further provides a first node, which is a first node on a transmission path of a data stream, and the first node may adopt a method provided by the embodiment corresponding to FIG.
  • the head node 700 includes an information receiving unit 701, a packet compression unit 702, and a data packet transmission unit 703.
  • the head node 700 further includes: a CID release unit 704.
  • the information receiving unit 701 is configured to receive a header identifier of the data stream sent by the controller, a context identifier CID allocated by the controller for the data stream, and the first node on the transmission path The node ID of the next node;
  • a packet compression unit 702 configured to perform header compression processing on the first data packet that matches the header identifier of the data stream received by the information receiving unit 701 to obtain a second data packet;
  • the data packet transmission unit 703 is configured to transmit the second data packet processed by the data packet compression unit 702 that carries the CID to a next node corresponding to the node identifier of the next node.
  • the information receiving unit 701 is further configured to:
  • the packet compression unit 702 is specifically configured to:
  • it also includes:
  • the CID release unit 704 is configured to:
  • the information receiving unit 701 is further configured to:
  • the packet compression unit 702 is further configured to:
  • the data packet transmission unit 703 is further configured to:
  • the present invention further provides an intermediate node, where the intermediate node is an intermediate node on the transmission path of the data stream, and the intermediate node may adopt the method provided by the embodiment corresponding to FIG. 4, as shown in FIG. 800 includes: an information receiving unit 801 and a data packet transmitting unit 802.
  • the information receiving unit 801 is configured to receive, by the controller, a context identifier CID allocated by the controller for the data stream, and a node identifier of a next node of the intermediate node on the transmission path;
  • a data packet transmission unit 802 configured to: when receiving the second data packet carrying the CID received by the information receiving unit 801, transmitting the second data packet carrying the CID to the next node
  • the node identifier corresponds to the next node, and the second data packet is obtained by compressing the first data packet by a header.
  • the information receiving unit 801 is further configured to:
  • the data packet transmission unit 802 is further configured to:
  • the present invention further provides a last node, which is a last node on the transmission path of the data stream, and the last node may adopt the method provided by the embodiment corresponding to FIG. 5, referring to FIG.
  • the end node 900 includes an information receiving unit 901 and a packet decompression unit 902.
  • the last node 900 further includes: a CID release unit 903.
  • the information receiving unit 901 is configured to receive, by the controller, a context identifier CID allocated by the controller for the data stream;
  • the packet decompression unit 902 is configured to perform a header decompression process on the second data packet to obtain a first data packet when receiving the second data packet carrying the CID received by the information receiving unit 901, where The second data packet is obtained by the header compression processing of the first data packet.
  • the information receiving unit 901 is further configured to:
  • the packet decompression unit 902 is specifically configured to:
  • it also includes:
  • the CID release unit 903 is configured to receive a notification sent by the controller to indicate release of the CID occupied by the data flow, and release a CID occupied by the data flow.
  • the present invention further provides a data stream header compression transmission system.
  • the data stream header compression transmission system 1000 includes: a controller 1001, and a first node on a data stream transmission path. 1002, intermediate node 1003 and end node 1004, intermediate node 1003 may be one or more.
  • the controller 1001 may adopt the controller corresponding to FIG. 6, the first node 1002 may adopt the first node corresponding to FIG. 7, and the intermediate node 1003 may adopt the intermediate node corresponding to FIG. 8, and the last node 1004 may The last node corresponding to Figure 9 is used.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium.
  • the technical solution of the present application in essence or the contribution to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium.
  • a computer device which may be a personal computer, a server, or a network device, etc.
  • a processor to perform the embodiments of the present application. All or part of the steps of the method.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like. .
  • the present invention further provides a controller, which may adopt the method provided by the embodiment corresponding to FIG. 2, and may be the same device as the controller shown in FIG. 6.
  • the controller 1100 includes a processor 1101, a transceiver 1102, a bus 1103, and a memory 1104, where:
  • the processor 1101, the transceiver 1102, and the memory 1104 are connected to each other through a bus 1103.
  • the bus 1103 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. Wait.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 11, but it does not mean that there is only one bus or one type of bus.
  • the processor 1101 is configured to allocate an unoccupied context identifier CID to the data stream, and determine a transmission path of the data stream;
  • the transceiver 1102 For each node on the transmission path determined by the processor 1101, the transceiver 1102 is configured to:
  • the CID assigned by the processor 1101 is sent to the last node for the last node on the transmission path.
  • the transceiver 1102 is further configured to:
  • processor 1101 is further configured to:
  • the CID with the lowest utilization rate is used. Identifying that the transceiver is not occupied, and controlling the transceiver 1102 to notify the first node and the last node on the transmission path of the data stream occupying the CID with the lowest utilization rate to release the CID with the lowest utilization rate, and the utilization rate of the CID The quotient of the difference between the number of bytes before and after compression of the packet header of the data stream occupying the CID and the time interval at which the data stream occupies the CID.
  • processor 1101 is further configured to:
  • processor 1101 is further configured to:
  • the CID occupied by the data stream is identified as unoccupied, and the transceiver 1102 is notified to notify the data.
  • the first node and the last node on the transmission path of the stream release the CID.
  • processor 1101 is further configured to:
  • a first node and a last node on the alternative transmission path are respectively a first node of the transmission path, a last node, and does not include a link on the transmission path where a link interruption occurs;
  • the transceiver 1102 is further configured to:
  • the controller 1100 also includes a memory 1104 for storing programs and the like.
  • the program can include program code, the program code including computer operating instructions.
  • the memory 1104 may include a random access memory (RAM), and may also include a non-volatile memory such as at least one disk storage.
  • the processor 1101 executes an application stored in the memory 1104 to implement the above-described car network data transmission method.
  • the present invention further provides a first node, which is a first node on a transmission path of a data stream, and the first node may adopt a method provided by the embodiment corresponding to FIG. 3, which may be compared with FIG. 7.
  • the head node 1200 includes a transceiver 1201, a processor 1202, a bus 1203, and a memory 1204, where:
  • the transceiver 1201, the processor 1202, and the memory 1204 are connected to each other through a bus 1203; the bus 1203 may be a PCI bus or an EISA bus or the like.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 12, but it does not mean that there is only one bus or one type of bus.
  • the transceiver 1201 is configured to receive a header identifier of the data stream sent by the controller, a context identifier CID allocated by the controller for the data stream, and a node of the next node of the head node on the transmission path. Identification
  • the processor 1202 is configured to perform header compression processing on the first data packet that matches the header identifier of the data stream received by the transceiver 1201 to obtain a second data packet.
  • the transceiver 1201 is further configured to transmit the second data packet processed by the processor 1202 carrying the CID to a next node corresponding to the node identifier of the next node.
  • the transceiver 1201 is further configured to:
  • the processor 1202 is specifically configured to:
  • the compression algorithm received by the transceiver 1201 identifies a corresponding compression algorithm, and performs header compression processing on the first data packet to obtain a second data packet.
  • the transceiver 1201 is further configured to:
  • the processor 1202 is also configured to:
  • the CID occupied by the data stream is released according to the notification received by the transceiver 1201.
  • the transceiver 1201 is further configured to:
  • the processor 1202 is also configured to:
  • the transceiver 1201 is also used to:
  • the head node 1200 also includes a memory 1204 for storing programs and the like.
  • the program can include program code, the program code including computer operating instructions.
  • the memory 1204 may include RAM and may also include non-volatile memory, such as at least one disk storage.
  • the processor 1202 executes the application stored in the memory 1204 to implement the above-described car network data transmission method.
  • the present invention further provides an intermediate node, which is an intermediate node on the transmission path of the data stream, and the intermediate node may adopt the method provided by the embodiment corresponding to FIG. 4, which may be the same as FIG.
  • the same intermediate device is shown.
  • the intermediate node 1300 includes a transceiver 1301, a processor 1302, a bus 1303, and a memory 1304, where:
  • the transceiver 1301, the processor 1302, and the memory 1304 are connected to each other through a bus 1303; the bus 1303 may be a PCI bus or an EISA bus or the like.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in FIG. 13, but it does not mean that there is only one bus or one type of bus.
  • the transceiver 1301 is configured to receive, by the controller, a context identifier CID allocated by the controller for the data flow, and a node identifier of a next node of the intermediate node on the transmission path; a packet transmitted by a previous node on the transmission path;
  • the processor 1302 is configured to: when the transceiver 1301 receives the second data packet carrying the CID, transmit the second data packet carrying the CID to the next node corresponding to the node identifier of the next node
  • the second data packet is obtained by compressing the first data packet by a header.
  • the transceiver 1301 is further configured to:
  • the intermediate node 1300 also includes a memory 1304 for storing programs and the like.
  • the program can include program code, the program code including computer operating instructions.
  • Memory 1304 may include RAM and may also include non-volatile memory, such as at least one disk storage.
  • the processor 1302 executes the application stored in the memory 1304 to implement the above-described car network data transmission method.
  • the present invention further provides a last node, which is a last node on the transmission path of the data stream, and the last node may adopt the method provided by the embodiment corresponding to FIG. 5, which may be the same as FIG. The same device as the last node shown.
  • the terminal node 1400 includes a transceiver 1401, a processor 1402, a bus 1403, and a memory 1404, wherein:
  • the transceiver 1401, the processor 1402, and the memory 1404 are connected to each other through a bus 1403; the bus 1403 may be a PCI bus or an EISA bus or the like.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 14, but it does not mean that there is only one bus or one type of bus.
  • the transceiver 1401 is configured to receive, by the controller, a context identifier CID allocated by the controller for the data stream, and receive a data packet that is transmitted by a last node of the last node on the transmission path;
  • the processor 1402 is configured to: when the transceiver 1401 receives the second data packet carrying the CID, perform a header decompression process on the second data packet to obtain a first data packet, where the second data packet is The first data packet is obtained by header compression processing.
  • the transceiver 1401 is further configured to:
  • the processor 1402 is specifically configured to:
  • the decompression algorithm received by the transceiver 1401 identifies a corresponding decompression algorithm, and performs decompression processing on the second data packet received by the transceiver 1401 to obtain a first data packet.
  • the transceiver 1401 is further configured to:
  • the processor 1402 is also configured to:
  • the CID occupied by the data stream is released according to the notification received by the transceiver 1401.
  • the end node 1400 also includes a memory 1404 for storing programs and the like.
  • the program can include program code, the program code including computer operating instructions.
  • Memory 1404 may include RAM and may also include non-volatile memory, such as at least one disk storage.
  • the processor 1402 executes the application stored in the memory 1404 to implement the above-described car network data transmission method.
  • the controller allocates a CID for the data stream, calculates a transmission path for the data stream, and sends information such as a CID and a next node on the transmission path to each node on the transmission path.
  • the first node on the transmission path performs header compression processing on the data packet, and then transmits the data packet to the next node on the transmission path, and the last node on the transmission path performs header decompression processing on the received header compressed data packet, on the transmission path.
  • the intermediate node only needs to transmit the received header compressed data packet to the next node on the transmission path.
  • the technical solution of the present invention does not need to support the header compression protocol in each node on the transmission path as in the prior art, which reduces the complexity of the node device.
  • the technical solution of the invention does not need to perform processing such as header compression, header decompression and integrity check on the data packets as in the prior art, which reduces the processing time of the node and reduces the data transmission. delay.
  • the controller allocates a CID for the data flow, and the node does not need to allocate and save the CID for the data flow passing through the node, thereby reducing the node device cost.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明提供了一种数据流报头压缩传输方法及装置,以降低用于数据流报头压缩传输的节点的设备复杂度、设备成本,减少节点处理数据流报头压缩传输的时间,降低数据流报头压缩传输延迟。本发明方法包括:控制器为数据流分配未被占用的上下文标识CID,并确定数据流的传输路径;针对传输路径上的各个节点,控制器执行以下步骤:针对传输路径上的首节点,控制器将数据流的报头标识、CID和首节点的下一节点的节点标识发送给首节点;针对传输路径上的各中间节点,控制器将CID和该中间节点的下一节点的节点标识发送给该中间节点;针对传输路径上的末节点,控制器将CID发送给末节点。

Description

一种数据流报头压缩传输方法、系统及控制器、节点 技术领域
本发明涉及通信领域,尤其涉及一种数据流报头压缩传输方法、系统及控制器、节点。
背景技术
互联网协议安全(Internet Protocol Security,IPsec)为在互联网协议(Internet Protocol,IP)网络上的通信提供安全服务的同时增加了数据包报头,这使得由于数据包报头与数据包有效载荷大小相近甚至更大而造成的带宽浪费问题变得更加严重。
为解决由于数据包报头过大而造成的带宽利用率低、传输时延长等问题,提出了报头压缩传输机制,例如健壮性报头压缩(Robust Header Compression,ROHC)、互联网协议报头压缩(Internet Protocol Header Compression,IPHC)。报头压缩传输机制可以通过协商,去除报头中几乎不变和可以推测的信息,只传输变化的信息,从而减少需要传输的数据包报头,提高带宽利用率。
现有的报头压缩传输机制对数据包报头逐跳进行压缩和解压缩,即某一数据流的数据包在传输路径上各个节点均需要进行报头压缩和报头解压缩处理,这就要求各个节点均支持报头压缩协议和报头解压缩协议,因此增加了节点设备复杂度。另外,由于现有的报头压缩传输机制中传输路径上的各个节点均需要对数据包进行报头压缩、报头解压缩和完整性检查等处理,导致节点处理时间长、数据传输延迟大的问题。
现有的报头压缩传输机制中,节点需要为每个数据流建立上下文映射,且每个数据流的报头压缩与报头解压缩所使用的上下文是不同的。当很多数据流通过同一节点时,该节点就需要保存大量的数据流上下文,因此对节点的内存等硬件的要求极高,进而提高了节点设备成本。
综上所述,现有的报头压缩传输机制存在节点设备复杂度高、成本高, 且节点处理时间长、数据传输延迟大的问题。
发明内容
本发明实施例提供了一种数据流报头压缩传输方法、系统及控制器、节点,以降低用于数据流报头压缩传输的节点的设备复杂度、设备成本,减少节点处理数据流报头压缩传输的时间,降低数据流报头压缩传输延迟。
本发明实施例提供的具体技术方案如下:
第一方面,本发明实施例提供的一种数据流报头压缩传输方法,包括:
控制器为数据流分配未被占用的上下文标识CID,并确定所述数据流的传输路径;
针对所述传输路径上的各个节点,所述控制器执行以下步骤:
针对传输路径上的首节点,所述控制器将所述数据流的报头标识、所述CID和所述首节点的下一节点的节点标识发送给所述首节点;
针对传输路径上的各中间节点,所述控制器将所述CID和该中间节点的下一节点的节点标识发送给该中间节点;
针对传输路径上的末节点,所述控制器将所述CID发送给所述末节点。
结合第一方面,在第一种可能的实现方式中,还包括:
所述控制器将用于压缩所述数据流的数据包报头的压缩算法的标识发送给所述首节点;
所述控制器将用于解压缩所述数据流的数据包报头的解压缩算的法标识发送给所述末节点。
结合第一方面,在第二种可能的实现方式中,还包括:
所述控制器统计被占用的CID数量;
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则所述控制器将所述利用率最低的CID标识为未被占用,并通知占用所述利用率最低的CID的数据流的传输路径上的首节点和末节点释放所述利用率最低的CID,所述 CID的利用率为占用CID的数据流的数据包报头压缩前后字节数量的差值与数据流占用CID的时间间隔的商。
结合第一方面的第二种可能的实现方式,在第一方面的第三种可能的实现方式中,还包括:
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次控制器计算每个被占用的CID的利用率的时间间隔大于等于第三阈值,则所述控制器重新计算每个被占用的CID的利用率。
结合第一方面,在第四种可能的实现方式中,还包括:
当所述末节点距离上一次解压缩所述数据流的数据包报头的时间间隔超过第四阈值时,所述控制器将所述数据流占用的CID标识为未被占用,并通知所述数据流的传输路径上的首节点和末节点释放所述CID。
结合第一方面,在第五种可能的实现方式中,还包括:
当所述数据流的所述传输路径发生链路中断时,所述控制器确定所述传输路径的可替代传输路径,所述可替代传输路径上的首节点、末节点分别为所述传输路径的首节点、末节点,且不包括所述传输路径上发生链路中断的链路;
针对所述可替代传输路径上的各个节点,所述控制器执行以下步骤:
针对所述可替代传输路径上的首节点,所述控制器将所述CID和所述可替代传输路径上首节点的下一节点的节点标识发送给首节点;
针对所述可替代传输路径上的中间节点,所述控制器将所述CID和所述可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
第二方面,本发明实施例提供的一种数据流报头压缩传输方法,包括:
数据流的传输路径上的首节点接收控制器发送的所述数据流的报头标识、所述控制器为所述数据流分配的上下文标识CID和所述首节点在所述传输路径上的下一节点的节点标识;
所述首节点对与所述数据流的报头标识匹配的第一数据包进行报头压缩 处理得到第二数据包;
所述首节点将携带有所述CID的所述第二数据包传输至所述下一节点的节点标识对应的下一节点。
结合第二方面,在第一种可能的实现方式中,所述首节点对与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包之前,还包括:
所述首节点接收所述控制器发送的压缩算法标识;
所述首节点对与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包,包括:
所述首节点利用所述压缩算法标识对应的压缩算法对所述第一数据包进行报头压缩处理得到第二数据包。
结合第二方面,在第二种可能的实现方式中,还包括:
所述首节点接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
所述首节点根据所述通知释放所述CID。
结合第二方面,在第三种可能的实现方式中,还包括:
所述首节点接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述首节点的下一节点的节点标识;
所述首节点确定所述CID关联的所述数据流的报头标识;
所述首节点将与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
所述首节点将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述首节点的下一节点的节点标识对应的下一节点。
第三方面,本发明实施例提供的一种数据流报头压缩传输方法,包括:
数据流的传输路径上的中间节点接收控制器发送的所述控制器为所述数据流分配的上下文标识CID和所述中间节点在所述传输路径上的下一节点的 节点标识;
所述中间节点接收到携带有所述CID的第二数据包时,将携带有所述CID的第二数据包传输至所述下一节点的节点标识对应的下一节点,所述第二数据包是第一数据包经过报头压缩处理的得到的。
结合第三方面,在第一种可能的实现方式中,还包括:
所述中间节点接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述中间节点的下一节点的节点标识;
所述中间节点接收到携带有所述CID的第二数据包时,将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述中间节点的下一节点的节点标识对应的下一节点。
第四方面,本发明实施例提供的一种数据流报头压缩传输方法,包括:
数据流的传输路径上的末节点接收控制器发送的所述控制器为所述数据流分配的上下文标识CID;
所述末节点接收到携带有所述CID的第二数据包时,对所述第二数据包进行报头解压缩处理得到第一数据包,所述第二数据包是所述第一数据包经过报头压缩处理得到的。
结合第四方面,在第一种可能的实现方式中,所述末节点对所述第二数据包进行报头解压缩处理得到第一数据包之前,还包括:
所述末节点接收所述控制器发送的解压缩算法标识;
所述末节点对所述第二数据包进行报头解压缩处理得到第一数据包,包括:
所述末节点利用所述解压缩算法标识对应的解压缩算法对所述第二数据包进行报头解压缩处理得到第一数据包。
结合第四方面,在第二种可能的实现方式中,还包括:
所述末节点接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
所述末节点根据所述通知释放所述CID。
第五方面,本发明实施例提供的一种控制器,包括:
路径确定单元,用于为数据流分配未被占用的上下文标识CID,并确定所述数据流的传输路径;
针对所述路径确定单元确定的传输路径上的各个节点,信息发送单元用于:
针对传输路径上的首节点,所述信息发送单元将所述数据流的报头标识、所述路径确定单元分配的CID和所述首节点的下一节点的节点标识发送给所述首节点;
针对传输路径上的各中间节点,所述信息发送单元将所述CID和该中间节点的下一节点的节点标识发送给该中间节点;
针对传输路径上的末节点,所述信息发送单元将所述CID发送给所述末节点。
结合第五方面,在第一种可能的实现方式中,所述信息发送单元还用于:
将用于压缩所述数据流的数据包报头的压缩算法的标识发送给所述首节点;
将用于解压缩所述数据流的数据包报头的解压缩算的法标识发送给所述末节点。
结合第五方面,在第二种可能的实现方式中,还包括:
第一CID释放单元,用于:
统计被占用的CID数量;
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则将所述利用率最低的CID标识为未被占用,并通知占用所述利用率最低的CID的数据流的传输路径上的首节点和末节点释放所述利用率最低的CID,所述CID的利用率为占用CID的数据流的数据包报头压缩前后字节数量的差值与数据流占 用CID的时间间隔的商。
结合第五方面的第二种可能的实现方式,在第五方面的第三种可能的实现方式中,所述第一CID释放单元还用于:
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次计算每个被占用的CID的利用率的时间间隔大于等于第三阈值,则重新计算每个被占用的CID的利用率。
结合第五方面,在第四种可能的实现方式中,还包括:
第二CID释放单元,用于当所述末节点距离上一次解压缩所述数据流的数据包报头的时间间隔超过第四阈值时,将所述数据流占用的CID标识为未被占用,并通知所述数据流的传输路径上的首节点和末节点释放所述CID。
结合第五方面,在第五种可能的实现方式中,还包括:
链路中断处理单元,用于:
当所述数据流的所述传输路径发生链路中断时,确定所述传输路径的可替代传输路径,所述可替代传输路径上的首节点、末节点分别为所述传输路径的首节点、末节点,且不包括所述传输路径上发生链路中断的链路;
针对所述可替代传输路径上的首节点,将所述CID和所述可替代传输路径上首节点的下一节点的节点标识发送给首节点;
针对所述可替代传输路径上的中间节点,将所述CID和所述可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
第六方面,本发明实施例提供的一种首节点,所述首节点为数据流的传输路径上的首节点,所述首节点包括:
信息接收单元,用于接收控制器发送的所述数据流的报头标识、所述控制器为所述数据流分配的上下文标识CID和所述首节点在所述传输路径上的下一节点的节点标识;
数据包压缩单元,用于对与所述信息接收单元接收的数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
数据包传输单元,用于将携带有所述CID的所述数据包压缩单元处理得到的所述第二数据包传输至所述下一节点的节点标识对应的下一节点。
结合第六方面,在第一种可能的实现方式中,
所述信息接收单元还用于:
接收所述控制器发送的压缩算法标识;
所述数据包压缩单元具体用于:
利用所述信息接收单元接收的所述压缩算法标识对应的压缩算法,对所述第一数据包进行报头压缩处理得到第二数据包。
结合第六方面,在第二种可能的实现方式中,还包括:
CID释放单元,用于:
接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知,并释放所述CID。
结合第六方面,在第三种可能的实现方式中,
所述信息接收单元还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述首节点的下一节点的节点标识;
所述数据包压缩单元还用于:
确定所述信息接收单元接收的所述CID关联的所述数据流的报头标识;将与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
所述数据包传输单元还用于:
将携带有所述CID的所述数据包压缩单元处理得到的第二数据包传输至所述可替代传输路径上所述首节点的下一节点的节点标识对应的下一节点。
第七方面,本发明实施例提供的一种中间节点,所述中间节点为数据流的传输路径上的中间节点,所述中间节点包括:
信息接收单元,用于接收控制器发送的所述控制器为所述数据流分配的 上下文标识CID和所述中间节点在所述传输路径上的下一节点的节点标识;
数据包传输单元,用于当接收到携带有所述信息接收单元接收的所述CID的第二数据包时,将携带有所述CID的第二数据包传输至所述下一节点的节点标识对应的下一节点,所述第二数据包是第一数据包经过报头压缩处理的得到的。
结合第七方面,在第一种可能的实现方式中,
所述信息接收单元还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述中间节点的下一节点的节点标识;
所述数据包传输单元还用于:
当接收到携带有所述信息接收单元接收的所述CID的第二数据包时,将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述中间节点的下一节点的节点标识对应的下一节点。
第八方面,本发明实施例提供的一种末节点,所述末节点为数据流的传输路径上的末节点,所述末节点包括:
信息接收单元,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID;
数据包解压缩单元,用于当接收到携带有所述信息接收单元接收的所述CID的第二数据包时,对所述第二数据包进行报头解压缩处理得到第一数据包,所述第二数据包是所述第一数据包经过报头压缩处理得到的。
结合第八方面,在第一种可能的实现方式中,
所述信息接收单元还用于:
接收所述控制器发送的解压缩算法标识;
所述数据包解压缩单元具体用于:
利用所述信息接收单元接收的所述解压缩算法标识对应的解压缩算法,对所述第二数据包进行报头解压缩处理得到第一数据包。
结合第八方面,在第二种可能的实现方式中,还包括:
CID释放单元,用于接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知,并释放所述CID。
第九方面,本发明实施例提供的一种控制器,包括:
处理器,用于为数据流分配未被占用的上下文标识CID,并确定所述数据流的传输路径;
针对所述处理器确定的传输路径上的各个节点,收发机用于:
针对传输路径上的首节点,将所述数据流的报头标识、所述处理器分配的CID和所述首节点的下一节点的节点标识发送给所述首节点;
针对传输路径上的各中间节点,将所述处理器分配的CID和该中间节点的下一节点的节点标识发送给该中间节点;
针对传输路径上的末节点,将所述处理器分配的CID发送给所述末节点。
结合第九方面,在第一种可能的实现方式中,所述收发机还用于:
将用于压缩所述数据流的数据包报头的压缩算法的标识发送给所述首节点;
将用于解压缩所述数据流的数据包报头的解压缩算的法标识发送给所述末节点。
结合第九方面,在第二种可能的实现方式中,所述处理器还用于:
统计被占用的CID数量;
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则将所述利用率最低的CID标识为未被占用,并控制所述收发机通知占用所述利用率最低的CID的数据流的传输路径上的首节点和末节点释放所述利用率最低的CID,所述CID的利用率为占用CID的数据流的数据包报头压缩前后字节数量的差值与数据流占用CID的时间间隔的商。
结合第九方面的第二种可能的实现方式,在第九方面的第三种可能的实 现方式中,所述处理器还用于:
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次控制器计算每个被占用的CID的利用率的时间间隔大于等于第三阈值,则重新计算每个被占用的CID的利用率。
结合第九方面,在第四种可能的实现方式中,所述处理器还用于:
当所述末节点距离上一次解压缩所述数据流的数据包报头的时间间隔超过第四阈值时,将所述数据流占用的CID标识为未被占用,并控制收发机通知所述数据流的传输路径上的首节点和末节点释放所述CID。
结合第九方面,在第五种可能的实现方式中,处理器还用于:
当所述数据流的所述传输路径发生链路中断时,确定所述传输路径的可替代传输路径,所述可替代传输路径上的首节点、末节点分别为所述传输路径的首节点、末节点,且不包括所述传输路径上发生链路中断的链路;
针对所述处理器确定的可替代传输路径上的各个节点,收发机还用于:
针对所述可替代传输路径上的首节点,将所述CID和所述可替代传输路径上首节点的下一节点的节点标识发送给首节点;
针对所述可替代传输路径上的中间节点,将所述CID和所述可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
第十方面,本发明实施例提供的一种首节点,首节点为数据流的传输路径上的首节点,首节点包括:
收发机,用于接收控制器发送的所述数据流的报头标识、所述控制器为所述数据流分配的上下文标识CID和所述首节点在所述传输路径上的下一节点的节点标识;
处理器,用于对与所述收发机接收的数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
收发机,还用于将携带有所述CID的处理器处理得到的所述第二数据包传输至所述下一节点的节点标识对应的下一节点。
结合第十方面,在第一种可能的实现方式中,收发机还用于:
接收所述控制器发送的压缩算法标识;
处理器具体用于:
利用收发机接收的所述压缩算法标识对应的压缩算法,对所述第一数据包进行报头压缩处理得到第二数据包。
结合第十方面,在第二种可能的实现方式中,收发机还用于:
接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
处理器还用于:
根据收发机接收的通知释放数据流占用的所述CID。
结合第十方面,在第三种可能的实现方式中,收发机还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述首节点的下一节点的节点标识;
处理器还用于:
确定收发机接收的所述CID关联的所述数据流的报头标识;
将与确定的所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
收发机还用于:
将携带有所述CID的处理器处理得到的所述第二数据包传输至所述可替代传输路径上所述首节点的下一节点的节点标识对应的下一节点。
第十一方面,本发明实施例提供的一种中间节点,中间节点为数据流的传输路径上的中间节点,中间节点包括:
收发机,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID和所述中间节点在所述传输路径上的下一节点的节点标识;接收中间节点在所述传输路径上的上一节点传输的数据包;
处理器,用于当收发机接收到携带有所述CID的第二数据包时,将携带 有所述CID的第二数据包传输至所述下一节点的节点标识对应的下一节点,所述第二数据包是第一数据包经过报头压缩处理的得到的。
结合第十一方面,在第一种可能的实现方式中,收发机还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述中间节点的下一节点的节点标识;
当接收到携带有所述CID的第二数据包时,将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述中间节点的下一节点的节点标识对应的下一节点。
第十二方面,本发明实施例提供的一种末节点,末节点为数据流的传输路径上的末节点,末节点包括:
收发机,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID;接收末节点在所述传输路径上的上一节点传输的数据包;
处理器,用于当收发机接收到携带有所述CID的第二数据包时,对所述第二数据包进行报头解压缩处理得到第一数据包,所述第二数据包是所述第一数据包经过报头压缩处理得到的。
结合第十二方面,在第一种可能的实现方式中,收发机还用于:
接收所述控制器发送的解压缩算法标识;
处理器具体用于:
利用收发机接收的所述解压缩算法标识对应的解压缩算法,对收发机接收的所述第二数据包进行报头解压缩处理得到第一数据包。
结合第十二方面,在第二种可能的实现方式中,收发机还用于:
接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
处理器还用于:
根据收发机接收的所述通知释放数据流占用的所述CID。
第十三方面,本发明实施例提供的一种数据流报头压缩传输系统,该系 统包括控制器、以及数据流的传输路径上的首节点、中间节点和末节点;
该控制器为第五方面中任一可能实现方式的控制器;
该首节点为第六方面中任一可能实现方式的首节点;
该中间节点为第七方面中任一可能实现方式的中间节点;
该末节点为第八方面中任一可能实现方式的末节点。
本发明实施例提供的技术方案中,由控制器为数据流分配CID,为数据流计算传输路径,并将CID、传输路径上下一节点等信息发送给传输路径上的各个节点。传输路径上的首节点对数据包进行报头压缩处理后将数据包传输至传输路径上的下一节点,传输路径上的末节点对接收的报头压缩数据包进行报头解压缩处理,传输路径上的中间节点仅需将接收的报头压缩数据包传输至传输路径上的下一节点。因此,本发明技术方案无需像现有技术那样传输路径上的各个节点均支持报头压缩协议,降低了节点设备的复杂度。本发明技术方案无需像现有技术那样各个节点均需要对数据包进行报头压缩、报头解压缩和完整性检查等处理,减少了节点处理时间长,降低了数据传输延迟。本发明技术方案中由控制器为数据流分配CID,节点不需要为经过该节点的数据流分配并保存CID,降低了节点设备成本。
附图说明
图1为本发明实施例提供的一种数据流报头压缩传输的网络架构示意图;
图2为本发明实施例提供的一种数据流报头压缩传输方法流程示意图;
图3为本发明实施例提供的一种数据流报头压缩传输方法流程示意图;
图4为本发明实施例提供的一种数据流报头压缩传输方法流程示意图;
图5为本发明实施例提供的一种数据流报头压缩传输方法流程示意图;
图6为本发明实施例提供的一种控制器结构示意图;
图7为本发明实施例提供的一种首节点结构示意图;
图8为本发明实施例提供的一种中间节点结构示意图;
图9为本发明实施例提供的一种末节点结构示意图;
图10为本发明实施例提供的一种数据流报头压缩传输系统架构示意图;
图11为本发明实施例提供的一种控制器结构示意图;
图12为本发明实施例提供的一种首节点结构示意图;
图13为本发明实施例提供的一种中间节点结构示意图;
图14为本发明实施例提供的一种末节点结构示意图。
具体实施方式
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅仅是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。
本发明实施例提供一种数据流报头压缩传输方法、系统及装置(包括控制器及数据流的传输路径上的首节点、中间节点和末节点),以降低用于数据流报头压缩传输的节点的设备复杂度、设备成本,减少节点处理数据流报头压缩传输的时间,降低数据流报头压缩传输延迟。其中,方法和装置是基于同一发明构思的,由于方法及装置解决问题的原理相似,因此装置与方法的实施可以相互参见,重复之处不再赘述。
本发明的技术方案涉及数据流报头压缩传输技术,图1所示为本发明系统结构示意图,区别于现有技术中对数据包报头逐跳进行压缩和解压缩的报头压缩传输机制,本发明中由控制器为数据流分配上下文标识(ContextIdentifier,CID),为数据流计算传输路径,并将CID、传输路径上下一节点等信息发送给传输路径上的各个节点。传输路径上的首节点对数据包进行报头压缩处理后将数据包传输至传输路径上的下一节点,传输路径上的末节点对接收的报头压缩数据包进行报头解压缩处理,传输路径上的中间节点仅需将接收的报头压缩数据包传输至传输路径上的下一节点。
因此,本发明技术方案无需像现有技术那样传输路径上的各个节点均支持报头压缩协议,降低了节点设备的复杂度。本发明技术方案无需像现有技 术那样各个节点均需要对数据包进行报头压缩、报头解压缩和完整性检查等处理,减少了节点处理时间长,降低了数据传输延迟。本发明技术方案中由控制器为数据流分配CID,节点不需要为经过该节点的数据流分配并保存CID,降低了节点设备成本。
实施例一
如图2所示,针对控制器,本发明实施例提供了一种数据流报头压缩传输方法,包括:
S201、控制器为数据流分配未被占用的上下文标识CID,并确定数据流的传输路径;
S202、针对传输路径上的各个节点,控制器执行以下步骤:
针对传输路径上的首节点,控制器将数据流的报头标识、CID和首节点的下一节点的节点标识发送给首节点;
针对传输路径上的各中间节点,控制器将CID和该中间节点的下一节点的节点标识发送给该中间节点;
针对传输路径上的末节点,控制器将CID发送给末节点。
本实施例中,控制器确定节点接收到数据流的第一个数据包时,控制器判断是否需要对该数据流进行报头压缩传输。控制器根据判断结果确定需要对该数据流进行报头压缩传输时,为数据流分配未被占用的CID,并确定该数据流的传输路径,传输路径上的首节点即为接收该数据流第一个数据包的节点。
可选的,节点接收到数据流的第一个数据包后,节点向控制器上报数据流的报头标识,控制器根据数据流的报头标识与数据流传输策略的映射关系,确定是否需要对该数据流进行报头压缩传输。其中,数据流的报头标识可以是源IP标识、目的IP地址、传输协议、传输控制协议(Transmission Control Protocol,TCP)端口或用户数据报协议(User Datagram Protocol,UDP)端口等;数据流传输策略分为报头压缩传输和报头不压缩传输。
本实施例中,控制器为数据流分配未被占用的CID,并确定数据流的传输路径后,可选的,控制器将分配的CID标识为被占用,并记录该CID与占用该CID的数据流之间的关联关系、数据流的传输路径等信息。
举例说明,控制器可以将记录的信息以表格的形式保存,以便后续管理数据流与数据流占用的CID。控制器预先创建CID状态表,如下表一所示:
表一
Figure PCTCN2015088641-appb-000001
表一中,CID状态包括被占用和未被占用两种,占用CID的数据流的传输路径信息包括传输路径上的首节点和末节点。可选的,控制器预先创建的CID状态表中还包括CID被占用的起始时间、CID的利用率等信息。
起始的CID状态表包括未被占用的所有CID(即可用于控制器分配的CID),此时所有CID的状态均为未被占用,控制器在为数据流分配CID时选择CID状态表中未被占用的一个CID分配给数据流,然后更新被分配的CID在CID状态表中的信息。或者,起始的CID状态表不包含未被占用的CID,控制器每为一个数据流分配一个CID,更新CID状态表中被分配的CID的信息。
本实施例中,可选的,针对传输路径上的首节点和末节点,控制器还执行以下步骤:
控制器将用于压缩数据流的数据包报头的压缩算法的标识发送给首节点;
控制器将用于解压缩数据流的数据包报头的解压缩算法的标识发送给末节点。
以便首节点利用该压缩算法的标识对应的压缩算法对数据流的数据包报头进行压缩,末节点利用该解压缩算法的标识对应的解压缩算法对接收的报 头压缩数据包进行解压缩。首节点和末节点也可以协商确定用于压缩数据流的数据包报头的压缩算法和用于解压缩数据流的数据包报头的解压缩算法。
本实施例中,S202中控制器向传输路径上各个节点发送的信息用于各个节点传输数据流,具体传输过程如图3至5所示。
与图1所示方法对应的,如图3所示,针对数据流的传输路径上的首节点,本发明实施例提供了一种数据流报头压缩传输方法,包括:
S301、数据流的传输路径上的首节点接收控制器发送的数据流的报头标识、控制器为数据流分配的上下文标识CID和首节点在传输路径上的下一节点的节点标识;
S302、首节点对与数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
S303、首节点将携带有CID的第二数据包传输至下一节点的节点标识对应的下一节点。
首节点可能连接多个数据流分别对应的传输路径,即首节点同时处理多个数据流,S301中控制器向首节点发送的数据流的报头标识可以用于首节点区分不同的数据流,数据流的报头标识可以是源IP标识、目的IP地址、传输协议、TCP端口或UDP端口等。
可选的,首节点还接收控制器发送的压缩算法标识,然后首节点利用压缩算法标识对应的压缩算法对第一数据包进行报头压缩处理得到第二数据包。或者,首节点和末节点协商确定用于压缩数据流的数据包报头的压缩算法和用于解压缩数据流的数据包报头的解压缩算法。
与图1所示方法对应的,如图4所示,针对数据流的传输路径上的中间节点,本发明实施例提供了一种数据流报头压缩传输方法,包括:
S401、数据流的传输路径上的中间节点接收控制器发送的控制器为数据流分配的上下文标识CID和中间节点在传输路径上的下一节点的节点标识;
S402、中间节点接收到携带有CID的第二数据包时,将携带有CID的第 二数据包传输至下一节点的节点标识对应的下一节点,第二数据包是第一数据包经过报头压缩处理的得到的。
与图1所示方法对应的,如图5所示,针对数据流的传输路径上的末节点,本发明实施例提供了一种数据流报头压缩传输方法,包括:
S501、数据流的传输路径上的末节点接收控制器发送的控制器为数据流分配的上下文标识CID;
S502、末节点接收到携带有CID的第二数据包时,对第二数据包进行报头解压缩处理得到第一数据包,第二数据包是第一数据包经过报头压缩处理得到的。
可选的,末节点接收控制器发送的解压缩算法标识,然后末节点利用解压缩算法标识对应的解压缩算法对第二数据包进行报头解压缩处理得到第一数据包。或者,首节点和末节点协商确定用于压缩数据流的数据包报头的压缩算法和用于解压缩数据流的数据包报头的解压缩算法。
因此,通过本发明实施例提供的一种数据流报头压缩传输方法,可以避免像现有技术那样传输路径上的各个节点均支持报头压缩协议,降低了节点设备的复杂度;可以避免像现有技术那样各个节点均需要对数据包进行报头压缩、报头解压缩和完整性检查等处理,减少了节点处理时间长,降低了数据传输延迟。本发明技术方案中由控制器为数据流分配CID,节点不需要为经过该节点的数据流分配并保存CID,降低了节点设备成本。
由于压缩报头中的CID字段长度有限,用报头压缩的方式只能同时传输有限数量的数据流。现有的数据流报头压缩传输机制中节点按照数据流到达顺序为数据流分配CID,当数据流传输停止时也没有解除数据流对CID的占用,直至所有CID均被占用时,节点按照CID被占用的顺序释放CID使得释放的CID被重新分配。因此,现有机制的CID分配方式容易导致CID被耗尽,由于CID的重新分配没有考虑数据流之间存在的压缩效率差异,极有可能放弃压缩增益较大的数据流,而去压缩增益较小的数据流,使总体增益大幅下 降。
针对现有机制存在上述弊端,考虑到数据流之间的增益差异,本发明实施例提供了两种回收CID的方法,第一种方法是结合CID的利用率来回收CID的方法,第二种方法是结合节点停止处理数据流的时间来回收CID的方法,具体如下:
第一种方法是结合CID的利用率来回收CID的方法。
控制器统计被占用的CID数量;当被占用的CID数量大于等于第一阈值、且小于等于CID总数时,说明CID可能被耗尽或即将被耗尽,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则控制器回收该利用率最低的CID。CID的利用率为占用该CID的数据流的数据包报头压缩前后字节数量的差值与数据流占用该CID的时间间隔的商。
控制器回收该利用率最低的CID的操作包括:控制器将该利用率最低的CID标识为未被占用,并通知占用利用率最低的CID的数据流的传输路径上的首节点和末节点释放利用率最低的CID。控制器回收利用率最低的CID之后,可以将占用该利用率最低的CID的数据流对应的数据流传输策略从报头压缩传输改为报头不压缩传输,经过设定时间间隔后,再将该数据流对应的数据流传输策略从报头不压缩传输改为报头压缩传输,然后控制器重新为该数据流分配未被占用的CID,设定时间间隔可以根据经验设置,例如可以设置为60秒。
针对利用率最低的CID的数据流的传输路径上的首节点和末节点,接收到控制器发送的用于指示释放该利用率最低的CID的通知后,首节点和末节点释放该利用率最低的CID以及该利用率最低的CID的相关信息。
其中,CID总数是指可用于控制器分配的CID总数,CID总数、第一阈值和第二阈值均可以根据经验设置。例如,CID总数可以设置为16383,第一阈值可以设置为CID总数的90%,第二阈值可以设置为200比特/每秒(Bps)。
这样,可以在CID被耗尽或即将被耗尽的情况下优先停止对增益小的数 据流的报头压缩传输,使得增益小的数据流占用的CID被回收。
可选的,控制器在确定CID的利用率时,可以从占用该CID的数据流的传输路径上的首节点或末节点处获得占用CID的数据流的数据包报头压缩前后字节数量。
可选的,当被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次计算控制器每个被占用的CID的利用率的时间间隔大于等于第三阈值,则控制器重新计算每个被占用的CID的利用率。第三阈值可以根据经验进行设置,例如可以设置为10秒。这样,并非每次控制器分配CID之后都需要重新计算被占用CID的利用率,进而避免控制器频繁计算被占用CID的利用率。
可选的,根据利用率最低的CID满足的条件不同,控制器回收该利用率最低的CID的概率也不同。
当被占用的CID数量大于等于第一阈值、且小于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则控制器回收该利用率最低的CID的概率为第一概率。第一概率可以根据经验设置,例如可以设置为50%。
当被占用的CID数量大于等于第一阈值、且等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则控制器回收该利用率最低的CID的概率为第二概率。第二概率可以根据经验设置,例如可以设置为1,第二概率大于第一概率。
第二种方法是结合节点停止处理数据流的时间来回收CID的方法。
当末节点距离上一次解压缩数据流的数据包报头的时间间隔超过第四阈值时,说明可能末节点停止处理该数据流,数据流传输停止,此时控制器回收该数据流占用的CID。即控制器将数据流占用的CID标识为未被占用,并通知数据流的传输路径上的首节点和末节点释放CID。
针对利用率最低的CID的数据流的传输路径上的首节点和末节点,接收 到控制器发送的用于指示释放该利用率最低的CID的通知后,首节点和末节点释放该利用率最低的CID以及该利用率最低的CID的相关信息。
可选的,与判断末节点停止处理数据流的方法类似,也可以通过判断首节点或中间节点停止处理数据流的方法来回收停止传输的数据流占用的CID。即:当首节点距离上一次压缩数据流的数据包报头的时间间隔超过第四阈值时,说明可能首节点停止处理该数据流,数据流传输停止,此时控制器回收该数据流占用的CID。或者,当中间节点距离上一次接收到数据流的报头压缩数据包的时间间隔超过第四阈值时,说明可能中间节点停止传输该数据流,数据流传输停止,此时控制器回收该数据流占用的CID。
这样,可以在数据流传输停止时及时回收该数据流占用的CID。
现有的报头压缩传输机制中,报头压缩是在路由之后进行的,当数据流的传输路径发生中断等突发情况时,由于报头压缩的不可逆性,节点无法对压缩后的数据包进行再路由处理,因此节点只能将数据包丢弃。即使中断的传输路径恢复或传输路径改变,也需要节点重新建立上下文,压缩效率大大降低。
针对数据流的传输路径发生中断的情况,本发明实施例提供了一种解决方法,具体如下:
首先,当数据流的传输路径发生链路中断时,控制器确定传输路径的可替代传输路径,可替代传输路径上的首节点、末节点分别为传输路径的首节点、末节点,且不包括传输路径上发生链路中断的链路;
针对可替代传输路径上的各个节点,控制器执行以下步骤:
针对可替代传输路径上的首节点,控制器将CID和可替代传输路径上首节点的下一节点的节点标识发送给首节点;
针对可替代传输路径上的中间节点,控制器将CID和可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
然后,可替代传输路径上的各个节点接收到控制器发送的信息后,对数 据流进行报头压缩传输,具体的,
针对可替代传输路径上的首节点,首节点接收控制器发送的CID和数据流的可替代传输路径上首节点的下一节点的节点标识;首节点确定CID关联的数据流的报头标识;首节点将与数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;首节点将携带有CID的第二数据包传输至可替代传输路径上首节点的下一节点的节点标识对应的下一节点。
针对可替代传输路径上的中间节点,中间节点接收控制器发送的CID和数据流的可替代传输路径上中间节点的下一节点的节点标识;中间节点接收到携带有CID的第二数据包时,将携带有CID的第二数据包传输至可替代传输路径上中间节点的下一节点的节点标识对应的下一节点。
针对可替代传输路径上的末节点,末节点接收到携带有CID的第二数据包时,对第二数据包进行报头解压缩处理得到第一数据包。
本发明实施例提供的技术方案中,由控制器为数据流分配CID,为数据流计算传输路径,并将CID、传输路径上下一节点等信息发送给传输路径上的各个节点。传输路径上的首节点对数据包进行报头压缩处理后将数据包传输至传输路径上的下一节点,传输路径上的末节点对接收的报头压缩数据包进行报头解压缩处理,传输路径上的中间节点仅需将接收的报头压缩数据包传输至传输路径上的下一节点。因此,本发明技术方案无需像现有技术那样传输路径上的各个节点均支持报头压缩协议,降低了节点设备的复杂度。本发明技术方案无需像现有技术那样各个节点均需要对数据包进行报头压缩、报头解压缩和完整性检查等处理,减少了节点处理时间长,降低了数据传输延迟。本发明技术方案中由控制器为数据流分配CID,节点不需要为经过该节点的数据流分配并保存CID,降低了节点设备成本。
实施例二
基于以上实施例,本发明还提供了一种控制器,所述控制器可以采用图2对应的实施例提供的方法,参阅图6所示,所述控制器600包括:路径确定 单元601和信息发送单元602。可选地,所述控制器600还包括:第一CID释放单元603、第二CID释放单元604以及链路中断处理单元605,第一CID释放单元603和第二CID释放单元604可以为同一个单元。
路径确定单元601,用于为数据流分配未被占用的上下文标识CID,并确定所述数据流的传输路径;
针对所述路径确定单元601确定的传输路径上的各个节点,信息发送单元602用于:
针对传输路径上的首节点,所述信息发送单元602将所述数据流的报头标识、所述路径确定单元601分配的CID和所述首节点的下一节点的节点标识发送给所述首节点;
针对传输路径上的各中间节点,所述信息发送单元602将所述CID和该中间节点的下一节点的节点标识发送给该中间节点;
针对传输路径上的末节点,所述信息发送单元602将所述CID发送给所述末节点。
可选的,所述信息发送单元602还用于:
将用于压缩所述数据流的数据包报头的压缩算法的标识发送给所述首节点;
将用于解压缩所述数据流的数据包报头的解压缩算的法标识发送给所述末节点。
可选的,还包括:
第一CID释放单元603,用于:
统计被占用的CID数量;
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则将所述利用率最低的CID标识为未被占用,并通知占用所述利用率最低的CID的数据流的传输路径上的首节点和末节点释放所述利用率最低的CID,所述CID的利 用率为占用CID的数据流的数据包报头压缩前后字节数量的差值与数据流占用CID的时间间隔的商。
可选的,所述第一CID释放单元603还用于:
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次计算每个被占用的CID的利用率的时间间隔大于等于第三阈值,则重新计算每个被占用的CID的利用率。
可选的,还包括:
第二CID释放单元604,用于当所述末节点距离上一次解压缩所述数据流的数据包报头的时间间隔超过第四阈值时,将所述数据流占用的CID标识为未被占用,并通知所述数据流的传输路径上的首节点和末节点释放所述CID。
可选的,还包括:
链路中断处理单元605,用于:
当所述数据流的所述传输路径发生链路中断时,确定所述传输路径的可替代传输路径,所述可替代传输路径上的首节点、末节点分别为所述传输路径的首节点、末节点,且不包括所述传输路径上发生链路中断的链路;
针对所述可替代传输路径上的首节点,将所述CID和所述可替代传输路径上首节点的下一节点的节点标识发送给首节点;
针对所述可替代传输路径上的中间节点,将所述CID和所述可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
基于以上实施例,本发明还提供了一种首节点,所述首节点为数据流的传输路径上的首节点,所述首节点可以采用图3对应的实施例提供的方法,参阅图7所示,所述首节点700包括:信息接收单元701、数据包压缩单元702和数据包传输单元703。可选地,首节点700还包括:CID释放单元704。
信息接收单元701,用于接收控制器发送的所述数据流的报头标识、所述控制器为所述数据流分配的上下文标识CID和所述首节点在所述传输路径上 的下一节点的节点标识;
数据包压缩单元702,用于对与所述信息接收单元701接收的数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
数据包传输单元703,用于将携带有所述CID的所述数据包压缩单元702处理得到的所述第二数据包传输至所述下一节点的节点标识对应的下一节点。
可选的,信息接收单元701还用于:
接收所述控制器发送的压缩算法标识;
所述数据包压缩单元702具体用于:
利用所述信息接收单元701接收的所述压缩算法标识对应的压缩算法,对所述第一数据包进行报头压缩处理得到第二数据包。
可选的,还包括:
CID释放单元704,用于:
接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知,并释放所述CID。
可选的,所述信息接收单元701还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述首节点的下一节点的节点标识;
所述数据包压缩单元702还用于:
确定所述信息接收单元701接收的所述CID关联的所述数据流的报头标识;将与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
所述数据包传输单元703还用于:
将携带有所述CID的所述数据包压缩单元702处理得到的第二数据包传输至所述可替代传输路径上所述首节点的下一节点的节点标识对应的下一节点。
基于以上实施例,本发明还提供了一种中间节点,中间节点为数据流的传输路径上的中间节点,中间节点可以采用图4对应的实施例提供的方法,参阅图8所示,中间节点800包括:信息接收单元801和数据包传输单元802。
信息接收单元801,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID和所述中间节点在所述传输路径上的下一节点的节点标识;
数据包传输单元802,用于当接收到携带有所述信息接收单元801接收的所述CID的第二数据包时,将携带有所述CID的第二数据包传输至所述下一节点的节点标识对应的下一节点,所述第二数据包是第一数据包经过报头压缩处理的得到的。
可选的,信息接收单元801还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述中间节点的下一节点的节点标识;
所述数据包传输单元802还用于:
当接收到携带有所述信息接收单元801接收的所述CID的第二数据包时,将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述中间节点的下一节点的节点标识对应的下一节点。
基于以上实施例,本发明还提供了一种末节点,所述末节点为数据流的传输路径上的末节点,所述末节点可以采用图5对应的实施例提供的方法,参阅图9所示,所述末节点900包括:信息接收单元901和数据包解压缩单元902。可选地,末节点900还包括:CID释放单元903。
信息接收单元901,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID;
数据包解压缩单元902,用于当接收到携带有所述信息接收单元901接收的所述CID的第二数据包时,对所述第二数据包进行报头解压缩处理得到第一数据包,所述第二数据包是所述第一数据包经过报头压缩处理得到的。
可选的,信息接收单元901还用于:
接收所述控制器发送的解压缩算法标识;
所述数据包解压缩单元902具体用于:
利用所述信息接收单元901接收的所述解压缩算法标识对应的解压缩算法,对所述第二数据包进行报头解压缩处理得到第一数据包。
可选的,还包括:
CID释放单元903,用于接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知,并释放数据流占用的CID。
基于以上实施例,本发明还提供了一种数据流报头压缩传输系统,参阅图10所示,所述数据流报头压缩传输系统1000包括:控制器1001、以及数据流的传输路径上的首节点1002、中间节点1003和末节点1004,中间节点1003可以为一个或多个。
其中,所述控制器1001可以采用图6对应的控制器,所述首节点1002可以采用图7对应的首节点,所述中间节点1003可以采用图8对应的中间节点,所述末节点1004可以采用图9对应的末节点。
需要说明的是,本发明实施例中对单元的划分是示意性的,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式。另外,在本申请各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现,也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时,可以存储在一个计算机可读取存储介质中。基于这样的理解,本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)或处理器(processor)执行本申请各个实施例所述 方法的全部或部分步骤。而前述的存储介质包括:U盘、移动硬盘、只读存储器(ROM,Read-Only Memory)、随机存取存储器(RAM,Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
基于以上实施例,本发明还提供了一种控制器,所述控制器可采用图2对应的实施例提供的方法,可以是与图6所示的控制器相同的设备。参阅图11所示,该控制器1100包括:处理器1101、收发机1102、总线1103以及存储器1104,其中:
处理器1101、收发机1102以及存储器1104通过总线1103相互连接;总线1103可以是外设部件互连标准(peripheral component interconnect,简称PCI)总线或扩展工业标准结构(extended industry standard architecture,简称EISA)总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示,图11中仅用一条粗线表示,但并不表示仅有一根总线或一种类型的总线。
处理器1101,用于为数据流分配未被占用的上下文标识CID,并确定所述数据流的传输路径;
针对所述处理器1101确定的传输路径上的各个节点,收发机1102用于:
针对传输路径上的首节点,将所述数据流的报头标识、所述处理器1101分配的CID和所述首节点的下一节点的节点标识发送给所述首节点;
针对传输路径上的各中间节点,将所述处理器1101分配的CID和该中间节点的下一节点的节点标识发送给该中间节点;
针对传输路径上的末节点,将所述处理器1101分配的CID发送给所述末节点。
可选的,所述收发机1102还用于:
将用于压缩所述数据流的数据包报头的压缩算法的标识发送给所述首节点;
将用于解压缩所述数据流的数据包报头的解压缩算的法标识发送给所述末节点
可选的,所述处理器1101还用于:
统计被占用的CID数量;
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则将所述利用率最低的CID标识为未被占用,并控制所述收发机1102通知占用所述利用率最低的CID的数据流的传输路径上的首节点和末节点释放所述利用率最低的CID,所述CID的利用率为占用CID的数据流的数据包报头压缩前后字节数量的差值与数据流占用CID的时间间隔的商。
可选的,所述处理器1101还用于:
当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次控制器计算每个被占用的CID的利用率的时间间隔大于等于第三阈值,则重新计算每个被占用的CID的利用率。
可选的,所述处理器1101还用于:
当所述末节点距离上一次解压缩所述数据流的数据包报头的时间间隔超过第四阈值时,将所述数据流占用的CID标识为未被占用,并控制收发机1102通知所述数据流的传输路径上的首节点和末节点释放所述CID。
可选的,处理器1101还用于:
当所述数据流的所述传输路径发生链路中断时,确定所述传输路径的可替代传输路径,所述可替代传输路径上的首节点、末节点分别为所述传输路径的首节点、末节点,且不包括所述传输路径上发生链路中断的链路;
针对所述处理器1101确定的可替代传输路径上的各个节点,收发机1102还用于:
针对所述可替代传输路径上的首节点,将所述CID和所述可替代传输路径上首节点的下一节点的节点标识发送给首节点;
针对所述可替代传输路径上的中间节点,将所述CID和所述可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
该控制器1100还包括存储器1104,用于存放程序等。具体地,程序可以包括程序代码,该程序代码包括计算机操作指令。存储器1104可能包含随机存取存储器(random access memory,RAM),也可能还包括非易失性存储器(non-volatile memory),例如至少一个磁盘存储器。处理器1101执行存储器1104所存放的应用程序,实现如上车联网数据传输方法。
基于以上实施例,本发明还提供了一种首节点,该首节点为数据流的传输路径上的首节点,该首节点可采用图3对应的实施例提供的方法,可以是与图7所示的首节点相同的设备。参阅图12所示,该首节点1200包括:收发机1201、处理器1202、总线1203以及存储器1204,其中:
收发机1201、处理器1202、以及存储器1204通过总线1203相互连接;总线1203可以是PCI总线或EISA总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示,图12中仅用一条粗线表示,但并不表示仅有一根总线或一种类型的总线。
收发机1201,用于接收控制器发送的所述数据流的报头标识、所述控制器为所述数据流分配的上下文标识CID和所述首节点在所述传输路径上的下一节点的节点标识;
处理器1202,用于对与所述收发机1201接收的数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
收发机1201,还用于将携带有所述CID的处理器1202处理得到的所述第二数据包传输至所述下一节点的节点标识对应的下一节点。
可选的,收发机1201还用于:
接收所述控制器发送的压缩算法标识;
处理器1202具体用于:
利用收发机1201接收的所述压缩算法标识对应的压缩算法,对所述第一数据包进行报头压缩处理得到第二数据包。
可选的,收发机1201还用于:
接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
处理器1202还用于:
根据收发机1201接收的通知释放数据流占用的所述CID。
可选的,收发机1201还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述首节点的下一节点的节点标识;
处理器1202还用于:
确定收发机1201接收的所述CID关联的所述数据流的报头标识;
将与确定的所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
收发机1201还用于:
将携带有所述CID的处理器1202处理得到的所述第二数据包传输至所述可替代传输路径上所述首节点的下一节点的节点标识对应的下一节点。
该首节点1200还包括存储器1204,用于存放程序等。具体地,程序可以包括程序代码,该程序代码包括计算机操作指令。存储器1204可能包含RAM,也可能还包括非易失性存储器,例如至少一个磁盘存储器。处理器1202执行存储器1204所存放的应用程序,实现如上车联网数据传输方法。
基于以上实施例,本发明还提供了一种中间节点,该中间节点为数据流的传输路径上的中间节点,该中间节点可采用图4对应的实施例提供的方法,可以是与图8所示的中间节点相同的设备。参阅图13所示,该中间节点1300包括:收发机1301、处理器1302、总线1303以及存储器1304,其中:
收发机1301、处理器1302、以及存储器1304通过总线1303相互连接;总线1303可以是PCI总线或EISA总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示,图13中仅用一条粗线表示,但并不表示仅有一根总线或一种类型的总线。
收发机1301,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID和所述中间节点在所述传输路径上的下一节点的节点标识;接收中间节点在所述传输路径上的上一节点传输的数据包;
处理器1302,用于当收发机1301接收到携带有所述CID的第二数据包时,将携带有所述CID的第二数据包传输至所述下一节点的节点标识对应的下一节点,所述第二数据包是第一数据包经过报头压缩处理的得到的。
可选的,收发机1301还用于:
接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述中间节点的下一节点的节点标识;
当接收到携带有所述CID的第二数据包时,将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述中间节点的下一节点的节点标识对应的下一节点。
该中间节点1300还包括存储器1304,用于存放程序等。具体地,程序可以包括程序代码,该程序代码包括计算机操作指令。存储器1304可能包含RAM,也可能还包括非易失性存储器,例如至少一个磁盘存储器。处理器1302执行存储器1304所存放的应用程序,实现如上车联网数据传输方法。
基于以上实施例,本发明还提供了一种末节点,该末节点为数据流的传输路径上的末节点,该末节点可采用图5对应的实施例提供的方法,可以是与图9所示的末节点相同的设备。参阅图14所示,该末节点1400包括:收发机1401、处理器1402、总线1403以及存储器1404,其中:
收发机1401、处理器1402、以及存储器1404通过总线1403相互连接;总线1403可以是PCI总线或EISA总线等。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示,图14中仅用一条粗线表示,但并不表示仅有一根总线或一种类型的总线。
收发机1401,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID;接收末节点在所述传输路径上的上一节点传输的数据包;
处理器1402,用于当收发机1401接收到携带有所述CID的第二数据包时,对所述第二数据包进行报头解压缩处理得到第一数据包,所述第二数据包是所述第一数据包经过报头压缩处理得到的。
可选的,收发机1401还用于:
接收所述控制器发送的解压缩算法标识;
处理器1402具体用于:
利用收发机1401接收的所述解压缩算法标识对应的解压缩算法,对收发机1401接收的所述第二数据包进行报头解压缩处理得到第一数据包。
可选的,收发机1401还用于:
接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
处理器1402还用于:
根据收发机1401接收的所述通知释放数据流占用的所述CID。
该末节点1400还包括存储器1404,用于存放程序等。具体地,程序可以包括程序代码,该程序代码包括计算机操作指令。存储器1404可能包含RAM,也可能还包括非易失性存储器,例如至少一个磁盘存储器。处理器1402执行存储器1404所存放的应用程序,实现如上车联网数据传输方法。
本发明实施例提供的技术方案中,由控制器为数据流分配CID,为数据流计算传输路径,并将CID、传输路径上下一节点等信息发送给传输路径上的各个节点。传输路径上的首节点对数据包进行报头压缩处理后将数据包传输至传输路径上的下一节点,传输路径上的末节点对接收的报头压缩数据包进行报头解压缩处理,传输路径上的中间节点仅需将接收的报头压缩数据包传输至传输路径上的下一节点。因此,本发明技术方案无需像现有技术那样传输路径上的各个节点均支持报头压缩协议,降低了节点设备的复杂度。本发明技术方案无需像现有技术那样各个节点均需要对数据包进行报头压缩、报头解压缩和完整性检查等处理,减少了节点处理时间长,降低了数据传输 延迟。本发明技术方案中由控制器为数据流分配CID,节点不需要为经过该节点的数据流分配并保存CID,降低了节点设备成本。
本领域内的技术人员应明白,本发明的实施例可提供为方法、系统、或计算机程序产品。因此,本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且,本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中,使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本发明的优选实施例,但本领域内的技术人员一旦得知了基本创造性概念,则可对这些实施例做出另外的变更和修改。所以,所附权 利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。
显然,本领域的技术人员可以对本发明实施例进行各种改动和变型而不脱离本发明实施例的精神和范围。这样,倘若本发明实施例的这些修改和变型属于本发明权利要求及其等同技术的范围之内,则本发明也意图包含这些改动和变型在内。

Claims (31)

  1. 一种数据流报头压缩传输方法,其特征在于,包括:
    控制器为数据流分配未被占用的上下文标识CID,并确定所述数据流的传输路径;
    针对所述传输路径上的各个节点,所述控制器执行以下步骤:
    针对传输路径上的首节点,所述控制器将所述数据流的报头标识、所述CID和所述首节点的下一节点的节点标识发送给所述首节点;
    针对传输路径上的各中间节点,所述控制器将所述CID和该中间节点的下一节点的节点标识发送给该中间节点;
    针对传输路径上的末节点,所述控制器将所述CID发送给所述末节点。
  2. 如权利要求1所述的方法,其特征在于,还包括:
    所述控制器将用于压缩所述数据流的数据包报头的压缩算法的标识发送给所述首节点;
    所述控制器将用于解压缩所述数据流的数据包报头的解压缩算的法标识发送给所述末节点。
  3. 如权利要求1所述的方法,其特征在于,还包括:
    所述控制器统计被占用的CID数量;
    当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则所述控制器将所述利用率最低的CID标识为未被占用,并通知占用所述利用率最低的CID的数据流的传输路径上的首节点和末节点释放所述利用率最低的CID,所述CID的利用率为占用CID的数据流的数据包报头压缩前后字节数量的差值与数据流占用CID的时间间隔的商。
  4. 如权利要求3所述的方法,其特征在于,还包括:
    当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次控制器计算每个被占用的CID的利用率的时间间隔大于等于第 三阈值,则所述控制器重新计算每个被占用的CID的利用率。
  5. 如权利要求1所述的方法,其特征在于,还包括:
    当所述末节点距离上一次解压缩所述数据流的数据包报头的时间间隔超过第四阈值时,所述控制器将所述数据流占用的CID标识为未被占用,并通知所述数据流的传输路径上的首节点和末节点释放所述CID。
  6. 如权利要求1所述的方法,其特征在于,还包括:
    当所述数据流的所述传输路径发生链路中断时,所述控制器确定所述传输路径的可替代传输路径,所述可替代传输路径上的首节点、末节点分别为所述传输路径的首节点、末节点,且不包括所述传输路径上发生链路中断的链路;
    针对所述可替代传输路径上的各个节点,所述控制器执行以下步骤:
    针对所述可替代传输路径上的首节点,所述控制器将所述CID和所述可替代传输路径上首节点的下一节点的节点标识发送给首节点;
    针对所述可替代传输路径上的中间节点,所述控制器将所述CID和所述可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
  7. 一种数据流报头压缩传输方法,其特征在于,包括:
    数据流的传输路径上的首节点接收控制器发送的所述数据流的报头标识、所述控制器为所述数据流分配的上下文标识CID和所述首节点在所述传输路径上的下一节点的节点标识;
    所述首节点对与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
    所述首节点将携带有所述CID的所述第二数据包传输至所述下一节点的节点标识对应的下一节点。
  8. 如权利要求7所述的方法,其特征在于,所述首节点对与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包之前,还包括:
    所述首节点接收所述控制器发送的压缩算法标识;
    所述首节点对与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包,包括:
    所述首节点利用所述压缩算法标识对应的压缩算法对所述第一数据包进行报头压缩处理得到第二数据包。
  9. 如权利要求7所述的方法,其特征在于,还包括:
    所述首节点接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
    所述首节点根据所述通知释放所述CID。
  10. 如权利要求7所述的方法,其特征在于,还包括:
    所述首节点接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述首节点的下一节点的节点标识;
    所述首节点确定所述CID关联的所述数据流的报头标识;
    所述首节点将与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
    所述首节点将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述首节点的下一节点的节点标识对应的下一节点。
  11. 一种数据流报头压缩传输方法,其特征在于,包括:
    数据流的传输路径上的中间节点接收控制器发送的所述控制器为所述数据流分配的上下文标识CID和所述中间节点在所述传输路径上的下一节点的节点标识;
    所述中间节点接收到携带有所述CID的第二数据包时,将携带有所述CID的第二数据包传输至所述下一节点的节点标识对应的下一节点,所述第二数据包是第一数据包经过报头压缩处理的得到的。
  12. 如权利要求11所述的方法,其特征在于,还包括:
    所述中间节点接收所述控制器发送的所述CID和所述数据流的可替代传 输路径上所述中间节点的下一节点的节点标识;
    所述中间节点接收到携带有所述CID的第二数据包时,将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述中间节点的下一节点的节点标识对应的下一节点。
  13. 一种数据流报头压缩传输方法,其特征在于,包括:
    数据流的传输路径上的末节点接收控制器发送的所述控制器为所述数据流分配的上下文标识CID;
    所述末节点接收到携带有所述CID的第二数据包时,对所述第二数据包进行报头解压缩处理得到第一数据包,所述第二数据包是所述第一数据包经过报头压缩处理得到的。
  14. 如权利要求13所述的方法,其特征在于,所述末节点对所述第二数据包进行报头解压缩处理得到第一数据包之前,还包括:
    所述末节点接收所述控制器发送的解压缩算法标识;
    所述末节点对所述第二数据包进行报头解压缩处理得到第一数据包,包括:
    所述末节点利用所述解压缩算法标识对应的解压缩算法对所述第二数据包进行报头解压缩处理得到第一数据包。
  15. 如权利要求13所述的方法,其特征在于,还包括:
    所述末节点接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知;
    所述末节点根据所述通知释放所述CID。
  16. 一种控制器,其特征在于,包括:
    路径确定单元,用于为数据流分配未被占用的上下文标识CID,并确定所述数据流的传输路径;
    针对所述路径确定单元确定的传输路径上的各个节点,信息发送单元用于:
    针对传输路径上的首节点,所述信息发送单元将所述数据流的报头标识、所述路径确定单元分配的CID和所述首节点的下一节点的节点标识发送给所述首节点;
    针对传输路径上的各中间节点,所述信息发送单元将所述CID和该中间节点的下一节点的节点标识发送给该中间节点;
    针对传输路径上的末节点,所述信息发送单元将所述CID发送给所述末节点。
  17. 如权利要求16所述的控制器,其特征在于,所述信息发送单元还用于:
    将用于压缩所述数据流的数据包报头的压缩算法的标识发送给所述首节点;
    将用于解压缩所述数据流的数据包报头的解压缩算的法标识发送给所述末节点。
  18. 如权利要求16所述的控制器,其特征在于,还包括:
    第一CID释放单元,用于:
    统计被占用的CID数量;
    当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若被占用的CID中利用率最低的CID的利用率低于第二阈值,则将所述利用率最低的CID标识为未被占用,并通知占用所述利用率最低的CID的数据流的传输路径上的首节点和末节点释放所述利用率最低的CID,所述CID的利用率为占用CID的数据流的数据包报头压缩前后字节数量的差值与数据流占用CID的时间间隔的商。
  19. 如权利要求18所述的控制器,其特征在于,所述第一CID释放单元还用于:
    当所述被占用的CID数量大于等于第一阈值、且小于等于CID总数时,若距离上一次计算每个被占用的CID的利用率的时间间隔大于等于第三阈 值,则重新计算每个被占用的CID的利用率。
  20. 如权利要求16所述的控制器,其特征在于,还包括:
    第二CID释放单元,用于当所述末节点距离上一次解压缩所述数据流的数据包报头的时间间隔超过第四阈值时,将所述数据流占用的CID标识为未被占用,并通知所述数据流的传输路径上的首节点和末节点释放所述CID。
  21. 如权利要求16所述的控制器,其特征在于,还包括:
    链路中断处理单元,用于:
    当所述数据流的所述传输路径发生链路中断时,确定所述传输路径的可替代传输路径,所述可替代传输路径上的首节点、末节点分别为所述传输路径的首节点、末节点,且不包括所述传输路径上发生链路中断的链路;
    针对所述可替代传输路径上的首节点,将所述CID和所述可替代传输路径上首节点的下一节点的节点标识发送给首节点;
    针对所述可替代传输路径上的中间节点,将所述CID和所述可替代传输路径上该中间节点的下一节点的节点标识发送给该中间节点。
  22. 一种首节点,其特征在于,所述首节点为数据流的传输路径上的首节点,所述首节点包括:
    信息接收单元,用于接收控制器发送的所述数据流的报头标识、所述控制器为所述数据流分配的上下文标识CID和所述首节点在所述传输路径上的下一节点的节点标识;
    数据包压缩单元702,用于对与所述信息接收单元接收的数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
    数据包传输单元,用于将携带有所述CID的所述数据包压缩单元702处理得到的所述第二数据包传输至所述下一节点的节点标识对应的下一节点。
  23. 如权利要求22所述的首节点,其特征在于,
    所述信息接收单元还用于:
    接收所述控制器发送的压缩算法标识;
    所述数据包压缩单元702具体用于:
    利用所述信息接收单元接收的所述压缩算法标识对应的压缩算法,对所述第一数据包进行报头压缩处理得到第二数据包。
  24. 如权利要求22所述的首节点,其特征在于,还包括:
    CID释放单元,用于:
    接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知,并释放所述CID。
  25. 如权利要求22所述的首节点,其特征在于,
    所述信息接收单元还用于:
    接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述首节点的下一节点的节点标识;
    所述数据包压缩单元702还用于:
    确定所述信息接收单元接收的所述CID关联的所述数据流的报头标识;将与所述数据流的报头标识匹配的第一数据包进行报头压缩处理得到第二数据包;
    所述数据包传输单元还用于:
    将携带有所述CID的所述数据包压缩单元702处理得到的第二数据包传输至所述可替代传输路径上所述首节点的下一节点的节点标识对应的下一节点。
  26. 一种中间节点,其特征在于,所述中间节点为数据流的传输路径上的中间节点,所述中间节点包括:
    信息接收单元,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID和所述中间节点在所述传输路径上的下一节点的节点标识;
    数据包传输单元,用于当接收到携带有所述信息接收单元接收的所述CID的第二数据包时,将携带有所述CID的第二数据包传输至所述下一节点的节点标识对应的下一节点,所述第二数据包是第一数据包经过报头压缩处理的 得到的。
  27. 如权利要求26所述的中间节点,其特征在于,
    所述信息接收单元还用于:
    接收所述控制器发送的所述CID和所述数据流的可替代传输路径上所述中间节点的下一节点的节点标识;
    所述数据包传输单元还用于:
    当接收到携带有所述信息接收单元接收的所述CID的第二数据包时,将携带有所述CID的所述第二数据包传输至所述可替代传输路径上所述中间节点的下一节点的节点标识对应的下一节点。
  28. 一种末节点,其特征在于,所述末节点为数据流的传输路径上的末节点,所述末节点包括:
    信息接收单元,用于接收控制器发送的所述控制器为所述数据流分配的上下文标识CID;
    数据包解压缩单元702,用于当接收到携带有所述信息接收单元接收的所述CID的第二数据包时,对所述第二数据包进行报头解压缩处理得到第一数据包,所述第二数据包是所述第一数据包经过报头压缩处理得到的。
  29. 如权利要求28所述的末节点,其特征在于,
    所述信息接收单元还用于:
    接收所述控制器发送的解压缩算法标识;
    所述数据包解压缩单元702具体用于:
    利用所述信息接收单元接收的所述解压缩算法标识对应的解压缩算法,对所述第二数据包进行报头解压缩处理得到第一数据包。
  30. 如权利要求28所述的末节点,其特征在于,还包括:
    CID释放单元,用于接收所述控制器发送的用于指示释放所述数据流占用的所述CID的通知,并释放所述CID。
  31. 一种数据流报头压缩传输系统,其特征在于,所述系统包括控制器、 以及数据流的传输路径上的首节点、中间节点和末节点;
    所述控制器为权利要求16至21任一所述的控制器;
    所述首节点为权利要求22至25任一所述的首节点;
    所述中间节点为权利要求26至27任一所述的中间节点;
    所述末节点为权利要求28至30任一所述的末节点。
PCT/CN2015/088641 2015-08-31 2015-08-31 一种数据流报头压缩传输方法、系统及控制器、节点 WO2017035752A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2015/088641 WO2017035752A1 (zh) 2015-08-31 2015-08-31 一种数据流报头压缩传输方法、系统及控制器、节点
CN201580035116.1A CN107210964B (zh) 2015-08-31 2015-08-31 一种数据流报头压缩传输方法、系统及控制器、节点

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/088641 WO2017035752A1 (zh) 2015-08-31 2015-08-31 一种数据流报头压缩传输方法、系统及控制器、节点

Publications (1)

Publication Number Publication Date
WO2017035752A1 true WO2017035752A1 (zh) 2017-03-09

Family

ID=58186521

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/088641 WO2017035752A1 (zh) 2015-08-31 2015-08-31 一种数据流报头压缩传输方法、系统及控制器、节点

Country Status (2)

Country Link
CN (1) CN107210964B (zh)
WO (1) WO2017035752A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021017812A1 (zh) * 2019-07-30 2021-02-04 夏普株式会社 用户设备及其执行的方法和基站及其执行的方法
CN112565076A (zh) * 2019-09-10 2021-03-26 中国电信股份有限公司 基于isis协议的关键路径信息转发方法、装置和系统
CN112804149A (zh) * 2021-04-13 2021-05-14 新华三技术有限公司 一种寻找路径的方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101960815A (zh) * 2008-02-28 2011-01-26 阿尔卡特朗讯公司 用于桥接集成移动深度包检测(dpi)的压缩ip流识别
WO2011023124A1 (zh) * 2009-08-26 2011-03-03 华为技术有限公司 网络中继场景下的头压缩方法及装置
CN102474753A (zh) * 2009-08-17 2012-05-23 高通股份有限公司 用于中继节点的报头压缩
US20140064259A1 (en) * 2012-08-28 2014-03-06 Electronics And Telecommunications Research Institute Method of managing context table for compression of ipv6 header based on context in wireless mesh network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7058728B1 (en) * 1999-10-29 2006-06-06 Nokia Corporation Method and apparatus for initiating compression of headers of packets and refreshing the context related to the packets

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101960815A (zh) * 2008-02-28 2011-01-26 阿尔卡特朗讯公司 用于桥接集成移动深度包检测(dpi)的压缩ip流识别
CN102474753A (zh) * 2009-08-17 2012-05-23 高通股份有限公司 用于中继节点的报头压缩
WO2011023124A1 (zh) * 2009-08-26 2011-03-03 华为技术有限公司 网络中继场景下的头压缩方法及装置
US20140064259A1 (en) * 2012-08-28 2014-03-06 Electronics And Telecommunications Research Institute Method of managing context table for compression of ipv6 header based on context in wireless mesh network

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021017812A1 (zh) * 2019-07-30 2021-02-04 夏普株式会社 用户设备及其执行的方法和基站及其执行的方法
CN112565076A (zh) * 2019-09-10 2021-03-26 中国电信股份有限公司 基于isis协议的关键路径信息转发方法、装置和系统
CN112804149A (zh) * 2021-04-13 2021-05-14 新华三技术有限公司 一种寻找路径的方法及装置
CN112804149B (zh) * 2021-04-13 2021-08-31 新华三技术有限公司 一种寻找路径的方法及装置

Also Published As

Publication number Publication date
CN107210964B (zh) 2020-11-10
CN107210964A (zh) 2017-09-26

Similar Documents

Publication Publication Date Title
US8762532B2 (en) Apparatus and method for efficient memory allocation
US8788782B2 (en) Apparatus and method for memory management and efficient data processing
US10164870B2 (en) Relaxed ordering network
WO2017035752A1 (zh) 一种数据流报头压缩传输方法、系统及控制器、节点
US9495130B2 (en) Data transmitter apparatus and method for data communication using the same
EP3122012B1 (en) Data processing method and apparatus for openflow network
US20180124218A1 (en) Implementing autoswitching network protocols for optimal efficiency
US20200187052A1 (en) Systems and methods for segmentation and reassembly of data frames in 802.11 wireless local area networks
US9426693B2 (en) Robustness header compression processing method, compressor and system
JP2017143344A (ja) パケット伝送装置,制御装置,及びパケット伝送制御方法
JP2011186797A (ja) データ通信装置及び方法
US20180102977A1 (en) Communication device, communication method, and storage medium
JP4468332B2 (ja) パケット処理方法およびパケット処理装置
WO2019033891A1 (zh) 一种基于rdma的网络流量确定方法及装置
CN107005538B (zh) 数据传输的方法、装置和系统
WO2009087774A1 (ja) ネットワークカードおよび情報処理装置
WO2013146770A1 (ja) 通信装置、制御装置、通信システム、通信方法、通信装置の制御方法及びプログラム
CN111262792A (zh) 报文转发方法、装置、网络设备及存储介质
US10187329B2 (en) Method and apparatus for processing network protocol stack data
WO2009098819A1 (ja) 通信システム
US20150156653A1 (en) Packet analysis within a radio access network
WO2023246616A1 (zh) 网络拥塞控制方法及装置
JP6298804B2 (ja) データ通信システム、方法及びプログラム
JP2008028767A (ja) ネットワークカードおよび情報処理装置
JP4766703B2 (ja) エッジノードおよび帯域制御方法

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

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

Country of ref document: EP

Kind code of ref document: A1