CN116192693A - Data transmission method, system and network equipment - Google Patents
Data transmission method, system and network equipment Download PDFInfo
- Publication number
- CN116192693A CN116192693A CN202310168220.4A CN202310168220A CN116192693A CN 116192693 A CN116192693 A CN 116192693A CN 202310168220 A CN202310168220 A CN 202310168220A CN 116192693 A CN116192693 A CN 116192693A
- Authority
- CN
- China
- Prior art keywords
- data
- receiving end
- message
- sending
- length
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
- H04L67/108—Resource delivery mechanisms characterised by resources being split in blocks or fragments
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a data transmission method, a system and network equipment, which are applied to the field of data transmission. Determining the route hop count and communication time delay between a sending end and a receiving end; determining the length of data sent to a receiving end; when the route hop count is not greater than the preset hop count, the communication time delay is not greater than the preset time delay and the length of the data is greater than the preset value, dividing the data into message fragments and sending the message fragments to a receiving end; and when the route hop count is greater than the preset hop count, the communication time delay is greater than the preset time delay and the length of the data is greater than the preset value, compressing the data and then sending the compressed data to the receiving end. And when the route hop count is larger than the preset hop count and the communication time delay is larger than the preset time delay, the current transmission link is characterized as a high network load and congestion state, the number of times of data slicing and reorganization is reduced or avoided, and the occupation of link bandwidths of a transmitting end and a receiving end is reduced.
Description
Technical Field
The present invention relates to the field of data transmission, and in particular, to a data transmission method, system and network device.
Background
In a lan, the most common interconnection between network devices is an ethernet wired connection. In the ethernet protocol, data is transmitted in units of ethernet frames, and according to the IEEE802.3 standard that ethernet complies with, the length of one ethernet frame cannot exceed 1514 bytes at maximum, where the ethernet header length occupies 14 bytes, so that the ethernet encapsulated data packet is 1500 bytes at maximum, i.e. the value specified by the MTU (Maximum Transmission Unit ). If the total data length of the transmitting end exceeds 1500 bytes, the message needs to be split into a plurality of sub-messages and then transmitted, namely the message is fragmented. Message slicing is a default processing mode of a protocol layer on ultra-long data, but in a scene of frequently receiving and transmitting huge messages, excessive slicing occupies excessive network bandwidth, and meanwhile, the risk of losing more messages is brought, so that network bandwidth resource waste is caused. The compression of data before transmission to reduce the number of fragments and decompression of the compressed data at the receiving end is a viable solution, but the difficulty is that data compression and decompression also consume system resources, so in some scenarios, if there is no difference in compressing and transmitting data, the compression delay is rather higher than not.
Disclosure of Invention
The invention aims to provide a data transmission method, a system and network equipment, which avoid the number of data fragment recombination and reduce the occupation of link bandwidths of a sending end and a receiving end.
In order to solve the technical problems, the present invention provides a data transmission method, including:
determining the route hop count and communication time delay between a sending end and a receiving end;
determining the length of data sent to the receiving end;
when the route hop count is not greater than a preset hop count, the communication delay is not greater than a preset delay and the length of data is greater than a preset value, dividing the data into message fragments and sending the message fragments to the receiving end;
and when the route hop count is larger than the preset hop count, the communication time delay is larger than the preset time delay and the length of the data is larger than a preset value, compressing the data and then sending the compressed data to the receiving end.
Preferably, determining the number of route hops between the transmitting end and the receiving end includes:
setting the initial TTL of the detection message as 1;
sending the detection message to a port of the receiving end, wherein the port is an unused port;
judging whether a timeout response is received;
if the overtime response is received, adding one to the TTL of the detection message, and returning to the step of sending the detection message to the port of the receiving end;
If the timeout response is not received, judging whether an error response is received or not;
if an error response is received, the TTL value of the current detection message is the route hop count between the current detection message and the receiving end.
Preferably, determining the communication delay between the transmitting end and the receiving end includes:
sending a message to the receiving end;
and determining communication time delay according to the response message returned by the receiving end.
Preferably, sending a message to the receiving end includes:
and sending an ICMP request message to the receiving end.
Preferably, the splitting the data into message fragments and sending the message fragments to the receiving end includes:
and dividing the data into message fragments according to the length of the data and the MTU of a transmission protocol, and sending the message fragments to the receiving end, wherein the length of each message fragment is not more than the MTU.
Preferably, the data is compressed and then sent to the receiving end, including:
and defining a message header for the compressed data, so that the receiving end can determine that the data is compressed data when receiving the compressed data.
Preferably, the data is compressed and then sent to the receiving end, including:
and compressing the data through an LZO algorithm and then sending the compressed data to the receiving end.
Preferably, the data is compressed and then sent to the receiving end, including:
and transmitting the length before data compression, the length after data compression and the compressed data to the receiving end.
In order to solve the technical problem, the present invention further provides a data transmission system, including:
the first determining unit is used for determining the route hop count and the communication time delay between the sending end and the receiving end;
a second determining unit for determining a length of data transmitted to the receiving end;
a first sending unit, configured to segment the data into message fragments and send the message fragments to the receiving end when the number of hops of the route is not greater than a preset number of hops, the communication delay is not greater than a preset delay, and the length of the data is greater than a preset value;
and the second sending unit is used for compressing the data and sending the compressed data to the receiving end when the route hop count is larger than a preset hop count, the communication time delay is larger than a preset time delay and the length of the data is larger than a preset value.
In order to solve the technical problem, the present invention further provides a network device, which is characterized by comprising:
a memory for storing a computer program;
and the processor is used for realizing the steps of the data transmission method when executing the computer program.
The application provides a data transmission method, a system and network equipment, which are applied to the field of data transmission. Determining the route hop count between a sending end and a receiving end; determining communication time delay between a transmitting end and a receiving end; determining the length of data sent to a receiving end; when the route hop count is not greater than the preset hop count, the communication time delay is not greater than the preset time delay and the length of the data is greater than the preset value, dividing the data into message fragments and sending the message fragments to a receiving end; and when the route hop count is greater than the preset hop count, the communication time delay is greater than the preset time delay and the length of the data is greater than the preset value, compressing the data and then sending the compressed data to the receiving end. And when the route hop count is larger than the preset hop count and the communication time delay is larger than the preset time delay, the current transmission link is characterized as a high network load and congestion state, the number of times of data slicing and reorganization is reduced or avoided, and the occupation of link bandwidths of a transmitting end and a receiving end is reduced.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required in the prior art and the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a data transmission method provided by the invention;
fig. 2 is a schematic diagram of an MTU provided by the present invention;
FIG. 3 is a schematic diagram of a message slicing according to the present invention;
FIG. 4 is a schematic diagram of compressed data according to the present invention;
fig. 5 is a schematic structural diagram of a data transmission system according to the present invention;
fig. 6 is a schematic structural diagram of a network device according to the present invention.
Detailed Description
The core of the invention is to provide a data transmission method, a system and network equipment, which avoid the number of data fragment recombination and reduce the occupation of the link bandwidth of a transmitting end and a receiving end.
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In a lan, the most common interconnection between network devices is an ethernet wired connection. In the ethernet protocol, data is transmitted in units of ethernet frames, and according to the IEEE802.3 standard that ethernet complies with, the length of one ethernet frame cannot exceed 1514 bytes at maximum, where the ethernet header length occupies 14 bytes, so that the ethernet encapsulated data packet is 1500 bytes at maximum, i.e. the value specified by the MTU (Maximum Transmission Unit ). If the total data length of the transmitting end exceeds 1500 bytes, the message needs to be split into a plurality of sub-messages and then transmitted, namely the message is fragmented. Message slicing is a default processing mode of a protocol layer on ultra-long data, but in a scene of frequently receiving and transmitting huge messages, excessive slicing occupies excessive network bandwidth, and meanwhile, the risk of losing more messages is brought, so that network bandwidth resource waste is caused. The compression of data before transmission to reduce the number of fragments and decompression of the compressed data at the receiving end is a viable solution, but the difficulty is that data compression and decompression also consume system resources, so in some scenarios, if there is no difference in compressing and transmitting data, the compression delay is rather higher than not.
Fig. 1 is a flowchart of a data transmission method provided by the present invention, where the data transmission method includes:
s11: determining the route hop count and communication time delay between a sending end and a receiving end;
considering that two methods for sending oversized data exist in the prior art, one method is to send message fragments to a receiving end in sequence, in this method, the message fragments occupy too much network bandwidth, and if other message fragments in the network are still being sent in the transmission process, the too many message fragments may be lost. The other is to compress the larger data, send the compressed data to the receiving end, and decompress the data at the receiving end. In some cases, for example, less data is transmitted in the network, and more time is taken to transmit the compressed data. Therefore, the two methods are selected by determining whether the network between the sending end and the receiving end is busy or not according to the busyness of the current network through the route hop count and the communication time delay between the sending end and the receiving end, and then the subsequent method for sending data can be selected.
The sending end and the receiving end are both network devices, the sending end network device and the receiving end network device are connected through an Ethernet in a wired mode, and the sending end and the receiving end receive and send data through the Ethernet.
S12: determining the length of data sent to a receiving end;
since the ethernet has a fixed MTU (Maximum Transmission Unit ), the MTU refers to the maximum datagram size that can pass through a layer of a communication protocol, so that the length of data needs to be determined before the data is transmitted, if the length of data exceeds the MTU, the data cannot be directly transmitted through the ethernet, and the data needs to be split and then transmitted or compressed. If the data is not longer than the MTU, it is sent directly, whether or not the network is busy.
S13: when the route hop count is not greater than the preset hop count, the communication time delay is not greater than the preset time delay and the length of the data is greater than the preset value, dividing the data into message fragments and sending the message fragments to a receiving end;
if the route hop count is not greater than the preset hop count and the communication time delay is not greater than the preset time delay, the network between the sending end and the receiving end is not in a busy state, if the length of the data is greater than the preset value, the data can be segmented into message fragments and sent to the receiving end, and the receiving end combines the received message fragments to obtain complete data.
Fig. 2 is a schematic diagram of an MTU provided herein;
The data comprises an Ethernet frame Header (DMAC, SMAC and Type), an IP message frame Header IP Header, a message data IP Payload and CRC check bits, wherein the lengths of the IP message frame Header and the message data IP Payload are 46-1500Bytes, and 1500Bytes are MTU of the data, namely the data cannot exceed 1500 Bytes.
FIG. 3 is a schematic diagram of a message slicing according to the present invention;
if the length of the message frame header is 20 bytes and the length of the data is 2000 bytes, and the maximum length of the data which can be transmitted by the Ethernet is 1500bytes, the 2000 bytes of data are required to be split into 1480 bytes and 520 bytes, the 1480 bytes of data and the 520 bytes of data are respectively combined with the 20 bytes of message frame header to form two message fragments, and the receiving end can acquire the original data sent by the sending end by combining the two messages together.
S14: and when the route hop count is greater than the preset hop count, the communication time delay is greater than the preset time delay and the length of the data is greater than the preset value, compressing the data and then sending the compressed data to the receiving end.
If the number of route hops is larger than the preset number of hops and the communication time delay is larger than the preset time delay, the network between the sending end and the receiving end is relatively busy, at the moment, the data with the length larger than the preset value is transmitted in a slicing mode, the situation that retransmission is lost easily or the slicing reordering is abnormal is caused in the transmission process, the current network is in a busy state, the network is relatively busy when excessive message slicing is continuously transmitted, so that the data is compressed and then transmitted to the receiving end, and after the receiving end receives the compressed data, the data is decompressed, and the original data transmitted by the sending end can be obtained.
The application provides a data transmission method, which is applied to the field of data transmission. Determining the route hop count between a sending end and a receiving end; determining communication time delay between a transmitting end and a receiving end; determining the length of data sent to a receiving end; when the route hop count is not greater than the preset hop count, the communication time delay is not greater than the preset time delay and the length of the data is greater than the preset value, dividing the data into message fragments and sending the message fragments to a receiving end; and when the route hop count is greater than the preset hop count, the communication time delay is greater than the preset time delay and the length of the data is greater than the preset value, compressing the data and then sending the compressed data to the receiving end. And when the route hop count is larger than the preset hop count and the communication time delay is larger than the preset time delay, the current transmission link is characterized as a high network load and congestion state, the number of times of data slicing and reorganization is reduced or avoided, and the occupation of link bandwidths of a transmitting end and a receiving end is reduced.
Based on the above embodiments:
as a preferred embodiment, determining the number of route hops between the transmitting end and the receiving end includes:
setting initial TTL (Time To Live) of a detection message To be 1;
sending a detection message to a port of a receiving end, wherein the port is an unused port;
Judging whether a timeout response is received;
if the overtime response is received, adding one to the TTL of the detection message, and returning to the step of sending the detection message to the port of the receiving end;
if the timeout response is not received, judging whether an error response is received or not;
if an error response is received, the TTL value of the current detection message is the route hop number between the current detection message and the receiving end.
A probe message is sent with TTL set to 1, and TTL specifies the maximum number of segments (i.e., number of route hops) that the IP packet is allowed to pass before being dropped by the router for this field. The destination port is set to a port that is unlikely to be used. TTL 1 indicates that after the router forwards once, if the router cannot reach the receiving end, the router is discarded by the first-hop router, and a timeout response is returned to the sending end. After receiving the timeout response, the receiving end indicates that the route hop number between the receiving end and the transmitting end is greater than 1. Continuously increasing the TTL to detect, setting the TTL to 2, if the route still cannot reach the receiving end after being forwarded for 2 times, judging that the route with more than 2 hops exists in the current link by the sending end through overtime, continuously increasing the detection, and the like; if the detected message arrives at the receiving end within 3 times of route forwarding, but the destination port is not started, the receiving end returns an unreachable error response of the port, and at the moment, the sending end can predict that the hop count of the route is 3 according to the type of the response message, and the detection is ended, and the like.
In particular, the ports that are unlikely to be used may be 65533 ports.
Generally, if the number of detected route hops is greater than 64, it means that the transmission between the transmitting end and the receiving end needs to be forwarded through more than 64 routes, and the link state is marked as longer route. The specific number of hops can be set according to actual needs, and the application is not limited too much.
As a preferred embodiment, determining a communication delay between a transmitting end and a receiving end includes:
sending a message to a receiving end;
and determining the communication time delay according to the response message returned by the receiving end.
The communication time delay between the transmitting end and the receiving end can be determined by sending a message to the receiving end, determining the time for sending the message, returning the message which is successfully received after the receiving end receives the message, determining the time for receiving the message, and determining the communication time delay between the transmitting end and the receiving end through the time for sending the message and the time for receiving the message.
Further, the larger the interval between the two times, the more busy the current communication link is proved, and the smaller the interval, the more idle the current communication link is proved.
Specifically, if the link delay is higher than 200ms, the link is marked as a high delay state. The preset time delay can be set according to the actual needs of the user, and the application is not limited too much here.
As a preferred embodiment, the sending a message to a receiving end includes:
and sending an ICMP (Internet Control Message Protocol ) request message to the receiving end.
ICMP is a sub-protocol of the TCP/IP (Transmission Control Protocol/Internet Protocol ) protocol family for passing control messages between IP hosts, routers.
ICMP is a very important protocol, which has an extremely important meaning for network security. By utilizing the characteristic that the ICMP protocol can record single message request and response time delay, ICMP request messages are sent to the receiving end, and the time delay is judged according to the returned response messages, so that the communication time delay between the sending end and the receiving end can be conveniently and rapidly determined.
As a preferred embodiment, the splitting the data into message fragments and sending the message fragments to the receiving end includes:
and dividing the data into message fragments according to the length of the data and the MTU of the transmission protocol, and sending the message fragments to a receiving end, wherein the length of each message fragment is not more than the MTU.
Considering that the data has different lengths and different MTU of the transmission protocol, when the data is segmented into message fragments, the length of each message fragment should not be larger than the MTU, so that normal transmission of the message fragments can be ensured, and meanwhile, too many message fragments are caused by not dividing each message fragment into too small bytes, and the situation of message loss retransmission or abnormal fragment reordering can occur in the transmission process.
If the data length is 7000 bytes and the MTU of the transmission protocol is 1500 bytes, the data needs to be divided into 5 message slices, so that the length of each message slice can be ensured not to exceed the MTU of the transmission protocol, and each message slice can be transmitted by the current transmission protocol.
As a preferred embodiment, the method for transmitting compressed data to a receiving end includes:
a header is defined for the compressed data to determine that the data is compressed data when the receiving end receives the compressed data.
It is considered that during the transmission, some data may be directly sent to the receiving end without compression, so the data needs to be marked.
FIG. 4 is a schematic diagram of compressed data according to the present invention;
if the original data message header is 20 bytes and the data content is 2000 bytes, the original data is 2020 bytes, the MTU is exceeded, when the data needs to be compressed for transmission, the message header of 20 bytes is not compressed, the data content of 2000 bytes is compressed into 200 bytes, and meanwhile, the custom message header of 6 bytes is added in front of the message header. The receiving end discards the 6-byte custom header after decompression until the 20-byte header and the 2000-byte data content obtained after 200-byte decompression are reserved.
It should be noted that, the length of the defined header is set according to actual needs, and the application is not limited here too much.
As a preferred embodiment, the method for transmitting compressed data to a receiving end includes:
and compressing the data through an LZO algorithm and then sending the compressed data to a receiving end.
The LZO algorithm achieves many of the following features: the algorithm decompression is simple, the speed is very fast, the decompression does not need memory, the compression speed is fast, the compression needs 64kB memory, the compression rate is allowed to be improved at the cost of losing the compression speed in the compression part, the decompression speed is not reduced, the compression level for generating pre-compressed data is included, the compression ratio with quite competitive capacity can be obtained, the compression level only needs 8kB memory, the algorithm is thread-safe, the algorithm is lossless, LZO supports repeated compression and in-situ decompression, and LZO is a block compression algorithm, namely the data compressed and decompressed into blocks. The size of the blocks used for compression and decompression must be the same, LZO compresses the data blocks into a sequence of matching data (sliding dictionary) and non-matching text. LZO has special handling for longer matching data and longer non-matching text sequences, which can achieve good results for highly redundant data and acceptable results for incompressible data.
The LZO algorithm is used as the compression method of the present application, so that the time in the compression and decompression process can be reduced.
As a preferred embodiment, the method for transmitting compressed data to a receiving end includes:
and transmitting the length before data compression, the length after data compression and the compressed data to a receiving end.
Specifically, the compression process provided in the present application is as follows:
the method comprises the steps that a sending end calculates the length of original data before compression, an LZO algorithm is used for compressing the original data, the length of the compressed data is calculated, the length of the data before compression, the length of the compressed data and the compressed data are combined to form to-be-sent data, and the to-be-sent data are sent to a receiving end. After receiving the data, the receiving end extracts the length of the data before compression, the length of the data after compression and the length of the data after compression, decompresses the data after compression by using an LZO algorithm, compares the length of the data after decompression with the length of the data before compression and the length of the data after compression, and if the lengths are equal, the verification is passed. If the lengths are not equal, the verification is not passed.
Fig. 5 is a schematic structural diagram of a data transmission method according to the present invention, where the data transmission method includes:
A first determining unit 51, configured to determine a number of route hops and a communication delay between the transmitting end and the receiving end;
a second determining unit 52 that determines the length of data transmitted to the receiving end;
a first sending unit 53, configured to split data into message fragments and send the message fragments to a receiving end when the number of hops is not greater than a preset number of hops, the communication delay is not greater than a preset delay, and the length of the data is greater than a preset value;
the second sending unit 54 is configured to compress the data and send the compressed data to the receiving end when the number of hops is greater than a preset number of hops, the communication delay is greater than a preset delay, and the length of the data is greater than a preset value.
Considering that two methods for sending oversized data exist in the prior art, one method is to send message fragments to a receiving end in sequence, in this method, the message fragments occupy too much network bandwidth, and if other message fragments in the network are still being sent in the transmission process, the too many message fragments may be lost. The other is to compress the larger data, send the compressed data to the receiving end, and decompress the data at the receiving end. In some cases, for example, less data is transmitted in the network, and more time is taken to transmit the compressed data. Therefore, the two methods are selected by determining whether the network between the sending end and the receiving end is busy or not according to the busyness of the current network through the route hop count and the communication time delay between the sending end and the receiving end, and then the subsequent method for sending data can be selected.
The sending end and the receiving end are both network devices, the sending end network device and the receiving end network device are connected through an Ethernet in a wired mode, and the sending end and the receiving end receive and send data through the Ethernet.
Since the ethernet has a fixed MTU (Maximum Transmission Unit ), the MTU refers to the maximum datagram size that can pass through a layer of a communication protocol, so that the length of data needs to be determined before the data is transmitted, if the length of data exceeds the MTU, the data cannot be directly transmitted through the ethernet, and the data needs to be split and then transmitted or compressed. If the data is not longer than the MTU, it is sent directly, whether or not the network is busy.
If the route hop count is not greater than the preset hop count and the communication time delay is not greater than the preset time delay, the network between the sending end and the receiving end is not in a busy state, if the length of the data is greater than the preset value, the data can be segmented into message fragments and sent to the receiving end, and the receiving end combines the received message fragments to obtain complete data.
Fig. 2 is a schematic diagram of an MTU provided herein;
the data comprises an Ethernet frame Header (DMAC, SMAC and Type), an IP message frame Header IP Header, a message data IP Payload and CRC check bits, wherein the lengths of the IP message frame Header and the message data IP Payload are 46-1500Bytes, and 1500Bytes are MTU of the data, namely the data cannot exceed 1500 Bytes.
FIG. 3 is a schematic diagram of a message slicing according to the present invention;
if the length of the message frame header is 20 bytes and the length of the data is 2000 bytes, and the maximum length of the data which can be transmitted by the Ethernet is 1500 bytes, the 2000 bytes of data are required to be split into 1480 bytes and 520 bytes, the 1480 bytes of data and the 520 bytes of data are respectively combined with the 20 bytes of message frame header to form two message fragments, and the receiving end can acquire the original data sent by the sending end by combining the two messages together.
If the number of route hops is larger than the preset number of hops and the communication time delay is larger than the preset time delay, the network between the sending end and the receiving end is relatively busy, at the moment, the data with the length larger than the preset value is transmitted in a slicing mode, the situation that retransmission is lost easily or the slicing reordering is abnormal is caused in the transmission process, the current network is in a busy state, the network is relatively busy when excessive message slicing is continuously transmitted, so that the data is compressed and then transmitted to the receiving end, and after the receiving end receives the compressed data, the data is decompressed, and the original data transmitted by the sending end can be obtained.
The application provides a data transmission system, which is applied to the field of data transmission. Determining the route hop count between a sending end and a receiving end; determining communication time delay between a transmitting end and a receiving end; determining the length of data sent to a receiving end; when the route hop count is not greater than the preset hop count, the communication time delay is not greater than the preset time delay and the length of the data is greater than the preset value, dividing the data into message fragments and sending the message fragments to a receiving end; and when the route hop count is greater than the preset hop count, the communication time delay is greater than the preset time delay and the length of the data is greater than the preset value, compressing the data and then sending the compressed data to the receiving end. And when the route hop count is larger than the preset hop count and the communication time delay is larger than the preset time delay, the current transmission link is characterized as a high network load and congestion state, the number of times of data slicing and reorganization is reduced or avoided, and the occupation of link bandwidths of a transmitting end and a receiving end is reduced.
Based on the above embodiments:
as a preferred embodiment, further comprising:
the setting unit is used for setting the initial TTL (Time To Live) of the detection message To be 1;
the third sending unit is used for sending a detection message to a port of the receiving end, wherein the port is an unused port;
a first judging unit for judging whether a timeout response is received; if yes, triggering an addition unit; if not, triggering a second judging unit;
the adding unit is used for adding one to the TTL of the detection message and triggering the third sending unit;
a second judging unit for judging whether an error response is received; if yes, triggering the first determining unit 51;
the first determining subunit is configured to determine, according to the TTL value of the current probe packet, a number of route hops between the first determining subunit and the receiving end.
A probe message is sent with TTL set to 1, and TTL specifies the maximum number of segments (i.e., number of route hops) that the IP packet is allowed to pass before being dropped by the router for this field. The destination port is set to a port that is unlikely to be used. TTL 1 indicates that after the router forwards once, if the router cannot reach the receiving end, the router is discarded by the first-hop router, and a timeout response is returned to the sending end. After receiving the timeout response, the receiving end indicates that the route hop number between the receiving end and the transmitting end is greater than 1. Continuously increasing the TTL to detect, setting the TTL to 2, if the route still cannot reach the receiving end after being forwarded for 2 times, judging that the route with more than 2 hops exists in the current link by the sending end through overtime, continuously increasing the detection, and the like; if the detected message arrives at the receiving end within 3 times of route forwarding, but the destination port is not started, the receiving end returns an unreachable error response of the port, and at the moment, the sending end can predict that the hop count of the route is 3 according to the type of the response message, and the detection is ended, and the like.
In particular, the ports that are unlikely to be used may be 65533 ports.
Generally, if the number of detected route hops is greater than 64, it means that the transmission between the transmitting end and the receiving end needs to be forwarded through more than 64 routes, and the link state is marked as longer route. The specific number of hops can be set according to actual needs, and the application is not limited too much.
As a preferred embodiment, further comprising:
a fourth sending unit, configured to send a message to a receiving end;
and the second determining subunit is used for determining the communication time delay according to the response message returned by the receiving end.
The communication time delay between the transmitting end and the receiving end can be determined by sending a message to the receiving end, determining the time for sending the message, returning the message which is successfully received after the receiving end receives the message, determining the time for receiving the message, and determining the communication time delay between the transmitting end and the receiving end through the time for sending the message and the time for receiving the message.
Further, the larger the interval between the two times, the more busy the current communication link is proved, and the smaller the interval, the more idle the current communication link is proved.
Specifically, if the link delay is higher than 200ms, the link is marked as a high delay state. The preset time delay can be set according to the actual needs of the user, and the application is not limited too much here.
As a preferred embodiment, the fourth transmitting unit is specifically configured to transmit ICMP to the receiving end
Internet Control Message Protocol, internet control message protocol) request messages.
ICMP is a sub-protocol of the TCP/IP (Transmission Control Protocol/Internet Protocol ) protocol family for passing control messages between IP hosts, routers.
ICMP is a very important protocol, which has an extremely important meaning for network security. By utilizing the characteristic that the ICMP protocol can record single message request and response time delay, ICMP request messages are sent to the receiving end, and the time delay is judged according to the returned response messages, so that the communication time delay between the sending end and the receiving end can be conveniently and rapidly determined.
As a preferred embodiment, the first sending unit 53 is specifically configured to split the data into message fragments according to the length of the data and the MTU of the transmission protocol, and send the message fragments to the receiving end, where the length of each message fragment is not greater than the MTU.
Considering that the data has different lengths and different MTU of the transmission protocol, when the data is segmented into message fragments, the length of each message fragment should not be larger than the MTU, so that normal transmission of the message fragments can be ensured, and meanwhile, too many message fragments are caused by not dividing each message fragment into too small bytes, and the situation of message loss retransmission or abnormal fragment reordering can occur in the transmission process.
If the data length is 7000 bytes and the MTU of the transmission protocol is 1500 bytes, the data needs to be divided into 5 message slices, so that the length of each message slice can be ensured not to exceed the MTU of the transmission protocol, and each message slice can be transmitted by the current transmission protocol.
As a preferred embodiment, the method further comprises a definition unit for defining a header for the compressed data, so as to determine the data as compressed data when the receiving end receives the compressed data.
It is considered that during the transmission, some data may be directly sent to the receiving end without compression, so the data needs to be marked.
FIG. 4 is a schematic diagram of compressed data according to the present invention;
if the original data message header is 20 bytes and the data content is 2000 bytes, the original data is 2020 bytes, the MTU is exceeded, when the data needs to be compressed for transmission, the message header of 20 bytes is not compressed, the data content of 2000 bytes is compressed into 200 bytes, and meanwhile, the custom message header of 6 bytes is added in front of the message header. The receiving end discards the 6-byte custom header after decompression until the 20-byte header and the 2000-byte data content obtained after 200-byte decompression are reserved.
It should be noted that, the length of the defined header is set according to actual needs, and the application is not limited here too much.
As a preferred embodiment, the method for transmitting compressed data to a receiving end includes:
and compressing the data through an LZO algorithm and then sending the compressed data to a receiving end.
The LZO algorithm achieves many of the following features: the algorithm decompression is simple, the speed is very fast, the decompression does not need memory, the compression speed is fast, the compression needs 64kB memory, the compression rate is allowed to be improved at the cost of losing the compression speed in the compression part, the decompression speed is not reduced, the compression level for generating pre-compressed data is included, the compression ratio with quite competitive capacity can be obtained, the compression level only needs 8kB memory, the algorithm is thread-safe, the algorithm is lossless, LZO supports repeated compression and in-situ decompression, and LZO is a block compression algorithm, namely the data compressed and decompressed into blocks. The size of the blocks used for compression and decompression must be the same, LZO compresses the data blocks into a sequence of matching data (sliding dictionary) and non-matching text. LZO has special handling for longer matching data and longer non-matching text sequences, which can achieve good results for highly redundant data and acceptable results for incompressible data.
The LZO algorithm is used as the compression method of the present application, so that the time in the compression and decompression process can be reduced.
As a preferred embodiment, the second sending unit 54 is specifically configured to send the length before data compression, the length after data compression, and the compressed data to the receiving end.
Specifically, the compression process provided in the present application is as follows:
the method comprises the steps that a sending end calculates the length of original data before compression, an LZO algorithm is used for compressing the original data, the length of the compressed data is calculated, the length of the data before compression, the length of the compressed data and the compressed data are combined to form to-be-sent data, and the to-be-sent data are sent to a receiving end. After receiving the data, the receiving end extracts the length of the data before compression, the length of the data after compression and the length of the data after compression, decompresses the data after compression by using an LZO algorithm, compares the length of the data after decompression with the length of the data before compression and the length of the data after compression, and if the lengths are equal, the verification is passed. If the lengths are not equal, the verification is not passed.
Fig. 6 is a schematic structural diagram of a network device according to the present invention, where the network device includes:
A memory 61 for storing a computer program;
a processor 62 for implementing the steps of the data transmission method described above when executing the computer program.
Specifically, the steps of the method for implementing the above data transmission when the processor 62 executes the computer program are as follows:
s11: determining the route hop count and communication time delay between a sending end and a receiving end;
considering that two methods for sending oversized data exist in the prior art, one method is to send message fragments to a receiving end in sequence, in this method, the message fragments occupy too much network bandwidth, and if other message fragments in the network are still being sent in the transmission process, the too many message fragments may be lost. The other is to compress the larger data, send the compressed data to the receiving end, and decompress the data at the receiving end. In some cases, for example, less data is transmitted in the network, and more time is taken to transmit the compressed data. Therefore, the two methods are selected by determining whether the network between the sending end and the receiving end is busy or not according to the busyness of the current network through the route hop count and the communication time delay between the sending end and the receiving end, and then the subsequent method for sending data can be selected.
The sending end and the receiving end are both network devices, the sending end network device and the receiving end network device are connected through an Ethernet in a wired mode, and the sending end and the receiving end receive and send data through the Ethernet.
S12: determining the length of data sent to a receiving end;
since the ethernet has a fixed MTU (Maximum Transmission Unit ), the MTU refers to the maximum datagram size that can pass through a layer of a communication protocol, so that the length of data needs to be determined before the data is transmitted, if the length of data exceeds the MTU, the data cannot be directly transmitted through the ethernet, and the data needs to be split and then transmitted or compressed. If the data is not longer than the MTU, it is sent directly, whether or not the network is busy.
S13: when the route hop count is not greater than the preset hop count, the communication time delay is not greater than the preset time delay and the length of the data is greater than the preset value, dividing the data into message fragments and sending the message fragments to a receiving end;
if the route hop count is not greater than the preset hop count and the communication time delay is not greater than the preset time delay, the network between the sending end and the receiving end is not in a busy state, if the length of the data is greater than the preset value, the data can be segmented into message fragments and sent to the receiving end, and the receiving end combines the received message fragments to obtain complete data.
Fig. 2 is a schematic diagram of an MTU provided herein;
the data comprises an Ethernet frame Header (DMAC, SMAC and Type), an IP message frame Header IP Header, a message data IP Payload and CRC check bits, wherein the lengths of the IP message frame Header and the message data IP Payload are 46-1500Bytes, and 1500Bytes are MTU of the data, namely the data cannot exceed 1500 Bytes.
FIG. 3 is a schematic diagram of a message slicing according to the present invention;
if the length of the message frame header is 20 bytes and the length of the data is 2000 bytes, and the maximum length of the data which can be transmitted by the Ethernet is 1500bytes, the 2000 bytes of data are required to be split into 1480 bytes and 520 bytes, the 1480 bytes of data and the 520 bytes of data are respectively combined with the 20 bytes of message frame header to form two message fragments, and the receiving end can acquire the original data sent by the sending end by combining the two messages together.
S14: and when the route hop count is greater than the preset hop count, the communication time delay is greater than the preset time delay and the length of the data is greater than the preset value, compressing the data and then sending the compressed data to the receiving end.
If the number of route hops is larger than the preset number of hops and the communication time delay is larger than the preset time delay, the network between the sending end and the receiving end is relatively busy, at the moment, the data with the length larger than the preset value is transmitted in a slicing mode, the situation that retransmission is lost easily or the slicing reordering is abnormal is caused in the transmission process, the current network is in a busy state, the network is relatively busy when excessive message slicing is continuously transmitted, so that the data is compressed and then transmitted to the receiving end, and after the receiving end receives the compressed data, the data is decompressed, and the original data transmitted by the sending end can be obtained.
The application provides a network device which is applied to the field of data transmission. Determining the route hop count between a sending end and a receiving end; determining communication time delay between a transmitting end and a receiving end; determining the length of data sent to a receiving end; when the route hop count is not greater than the preset hop count, the communication time delay is not greater than the preset time delay and the length of the data is greater than the preset value, dividing the data into message fragments and sending the message fragments to a receiving end; and when the route hop count is greater than the preset hop count, the communication time delay is greater than the preset time delay and the length of the data is greater than the preset value, compressing the data and then sending the compressed data to the receiving end. And when the route hop count is larger than the preset hop count and the communication time delay is larger than the preset time delay, the current transmission link is characterized as a high network load and congestion state, the number of times of data slicing and reorganization is reduced or avoided, and the occupation of link bandwidths of a transmitting end and a receiving end is reduced.
Based on the above embodiments:
as a preferred embodiment, determining the number of route hops between the transmitting end and the receiving end includes:
setting initial TTL (Time To Live) of a detection message To be 1;
sending a detection message to a port of a receiving end, wherein the port is an unused port;
Judging whether a timeout response is received;
if the overtime response is received, adding one to the TTL of the detection message, and returning to the step of sending the detection message to the port of the receiving end;
if the timeout response is not received, judging whether an error response is received or not;
if an error response is received, the TTL value of the current detection message is the route hop number between the current detection message and the receiving end.
A probe message is sent with TTL set to 1, and TTL specifies the maximum number of segments (i.e., number of route hops) that the IP packet is allowed to pass before being dropped by the router for this field. The destination port is set to a port that is unlikely to be used. TTL 1 indicates that after the router forwards once, if the router cannot reach the receiving end, the router is discarded by the first-hop router, and a timeout response is returned to the sending end. After receiving the timeout response, the receiving end indicates that the route hop number between the receiving end and the transmitting end is greater than 1. Continuously increasing the TTL to detect, setting the TTL to 2, if the route still cannot reach the receiving end after being forwarded for 2 times, judging that the route with more than 2 hops exists in the current link by the sending end through overtime, continuously increasing the detection, and the like; if the detected message arrives at the receiving end within 3 times of route forwarding, but the destination port is not started, the receiving end returns an unreachable error response of the port, and at the moment, the sending end can predict that the hop count of the route is 3 according to the type of the response message, and the detection is ended, and the like.
In particular, the ports that are unlikely to be used may be 65533 ports.
Generally, if the number of detected route hops is greater than 64, it means that the transmission between the transmitting end and the receiving end needs to be forwarded through more than 64 routes, and the link state is marked as longer route. The specific number of hops can be set according to actual needs, and the application is not limited too much.
As a preferred embodiment, determining a communication delay between a transmitting end and a receiving end includes:
sending a message to a receiving end;
and determining the communication time delay according to the response message returned by the receiving end.
The communication time delay between the transmitting end and the receiving end can be determined by sending a message to the receiving end, determining the time for sending the message, returning the message which is successfully received after the receiving end receives the message, determining the time for receiving the message, and determining the communication time delay between the transmitting end and the receiving end through the time for sending the message and the time for receiving the message.
Further, the larger the interval between the two times, the more busy the current communication link is proved, and the smaller the interval, the more idle the current communication link is proved.
Specifically, if the link delay is higher than 200ms, the link is marked as a high delay state. The preset time delay can be set according to the actual needs of the user, and the application is not limited too much here.
As a preferred embodiment, the sending a message to a receiving end includes:
and sending an ICMP (Internet Control Message Protocol ) request message to the receiving end.
ICMP is a sub-protocol of the TCP/IP (Transmission Control Protocol/Internet Protocol ) protocol family for passing control messages between IP hosts, routers.
ICMP is a very important protocol, which has an extremely important meaning for network security. By utilizing the characteristic that the ICMP protocol can record single message request and response time delay, ICMP request messages are sent to the receiving end, and the time delay is judged according to the returned response messages, so that the communication time delay between the sending end and the receiving end can be conveniently and rapidly determined.
As a preferred embodiment, the splitting the data into message fragments and sending the message fragments to the receiving end includes:
and dividing the data into message fragments according to the length of the data and the MTU of the transmission protocol, and sending the message fragments to a receiving end, wherein the length of each message fragment is not more than the MTU.
Considering that the data has different lengths and different MTU of the transmission protocol, when the data is segmented into message fragments, the length of each message fragment should not be larger than the MTU, so that normal transmission of the message fragments can be ensured, and meanwhile, too many message fragments are caused by not dividing each message fragment into too small bytes, and the situation of message loss retransmission or abnormal fragment reordering can occur in the transmission process.
If the data length is 7000 bytes and the MTU of the transmission protocol is 1500 bytes, the data needs to be divided into 5 message slices, so that the length of each message slice can be ensured not to exceed the MTU of the transmission protocol, and each message slice can be transmitted by the current transmission protocol.
As a preferred embodiment, the method for transmitting compressed data to a receiving end includes:
a header is defined for the compressed data to determine that the data is compressed data when the receiving end receives the compressed data.
It is considered that during the transmission, some data may be directly sent to the receiving end without compression, so the data needs to be marked.
FIG. 4 is a schematic diagram of compressed data according to the present invention;
if the original data message header is 20 bytes and the data content is 2000 bytes, the original data is 2020 bytes, the MTU is exceeded, when the data needs to be compressed for transmission, the message header of 20 bytes is not compressed, the data content of 2000 bytes is compressed into 200 bytes, and meanwhile, the custom message header of 6 bytes is added in front of the message header. The receiving end discards the 6-byte custom header after decompression until the 20-byte header and the 2000-byte data content obtained after 200-byte decompression are reserved.
It should be noted that, the length of the defined header is set according to actual needs, and the application is not limited here too much.
As a preferred embodiment, the method for transmitting compressed data to a receiving end includes:
and compressing the data through an LZO algorithm and then sending the compressed data to a receiving end.
The LZO algorithm achieves many of the following features: the algorithm decompression is simple, the speed is very fast, the decompression does not need memory, the compression speed is fast, the compression needs 64kB memory, the compression rate is allowed to be improved at the cost of losing the compression speed in the compression part, the decompression speed is not reduced, the compression level for generating pre-compressed data is included, the compression ratio with quite competitive capacity can be obtained, the compression level only needs 8kB memory, the algorithm is thread-safe, the algorithm is lossless, LZO supports repeated compression and in-situ decompression, and LZO is a block compression algorithm, namely the data compressed and decompressed into blocks. The size of the blocks used for compression and decompression must be the same, LZO compresses the data blocks into a sequence of matching data (sliding dictionary) and non-matching text. LZO has special handling for longer matching data and longer non-matching text sequences, which can achieve good results for highly redundant data and acceptable results for incompressible data.
The LZO algorithm is used as the compression method of the present application, so that the time in the compression and decompression process can be reduced.
As a preferred embodiment, the method for transmitting compressed data to a receiving end includes:
and transmitting the length before data compression, the length after data compression and the compressed data to a receiving end.
Specifically, the compression process provided in the present application is as follows:
the method comprises the steps that a sending end calculates the length of original data before compression, an LZO algorithm is used for compressing the original data, the length of the compressed data is calculated, the length of the data before compression, the length of the compressed data and the compressed data are combined to form to-be-sent data, and the to-be-sent data are sent to a receiving end. After receiving the data, the receiving end extracts the length of the data before compression, the length of the data after compression and the length of the data after compression, decompresses the data after compression by using an LZO algorithm, compares the length of the data after decompression with the length of the data before compression and the length of the data after compression, and if the lengths are equal, the verification is passed. If the lengths are not equal, the verification is not passed.
It should also be noted that in this specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method of transmitting data, comprising:
determining the route hop count and communication time delay between a sending end and a receiving end;
determining the length of data sent to the receiving end;
when the route hop count is not greater than a preset hop count, the communication delay is not greater than a preset delay and the length of data is greater than a preset value, dividing the data into message fragments and sending the message fragments to the receiving end;
and when the route hop count is larger than the preset hop count, the communication time delay is larger than the preset time delay and the length of the data is larger than a preset value, compressing the data and then sending the compressed data to the receiving end.
2. The method for transmitting data according to claim 1, wherein determining the number of route hops between the transmitting end and the receiving end comprises:
setting the initial TTL of the detection message as 1;
sending the detection message to a port of the receiving end, wherein the port is an unused port;
judging whether a timeout response is received;
if the overtime response is received, adding one to the TTL of the detection message, and returning to the step of sending the detection message to the port of the receiving end;
if the timeout response is not received, judging whether an error response is received or not;
If an error response is received, the TTL value of the current detection message is the route hop count between the current detection message and the receiving end.
3. The method for transmitting data according to claim 1, wherein determining a communication delay between the transmitting end and the receiving end comprises:
sending a message to the receiving end;
and determining communication time delay according to the response message returned by the receiving end.
4. The method for transmitting data according to claim 3, wherein sending a message to the receiving end includes:
and sending an ICMP request message to the receiving end.
5. The method for transmitting data according to claim 1, wherein slicing the data into message fragments and transmitting the message fragments to the receiving end comprises:
and dividing the data into message fragments according to the length of the data and the MTU of a transmission protocol, and sending the message fragments to the receiving end, wherein the length of each message fragment is not more than the MTU.
6. The method for transmitting data according to claim 1, wherein the step of compressing the data and transmitting the compressed data to the receiving terminal includes:
and defining a message header for the compressed data, so that the receiving end can determine that the data is compressed data when receiving the compressed data.
7. The method for transmitting data according to claim 1, wherein the step of compressing the data and transmitting the compressed data to the receiving terminal includes:
and compressing the data through an LZO algorithm and then sending the compressed data to the receiving end.
8. The method for transmitting data according to any one of claims 1 to 7, wherein the data is compressed and then transmitted to the receiving end, comprising:
and transmitting the length before data compression, the length after data compression and the compressed data to the receiving end.
9. A data transmission system, comprising:
the first determining unit is used for determining the route hop count and the communication time delay between the sending end and the receiving end;
a second determining unit for determining a length of data transmitted to the receiving end;
a first sending unit, configured to segment the data into message fragments and send the message fragments to the receiving end when the number of hops of the route is not greater than a preset number of hops, the communication delay is not greater than a preset delay, and the length of the data is greater than a preset value;
and the second sending unit is used for compressing the data and sending the compressed data to the receiving end when the route hop count is larger than a preset hop count, the communication time delay is larger than a preset time delay and the length of the data is larger than a preset value.
10. A network device, comprising:
a memory for storing a computer program;
processor for implementing the steps of the data transmission method according to any one of claims 1 to 8 when executing said computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310168220.4A CN116192693A (en) | 2023-02-24 | 2023-02-24 | Data transmission method, system and network equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310168220.4A CN116192693A (en) | 2023-02-24 | 2023-02-24 | Data transmission method, system and network equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116192693A true CN116192693A (en) | 2023-05-30 |
Family
ID=86448379
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310168220.4A Pending CN116192693A (en) | 2023-02-24 | 2023-02-24 | Data transmission method, system and network equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116192693A (en) |
-
2023
- 2023-02-24 CN CN202310168220.4A patent/CN116192693A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210067446A1 (en) | Systems, Apparatuses and Methods for Network Packet Management | |
| JP4829896B2 (en) | Method, system and article for improved network performance by avoiding data corruption | |
| US20170149675A1 (en) | Packet retransmission method and apparatus | |
| EP1771742B1 (en) | High performance tcp for systems with infrequent ack | |
| JP3853765B2 (en) | Packet compression method, packet restoration method, packet compression method, and packet restoration method | |
| KR101610715B1 (en) | One-way data transmission and reception system, and one-way data transmission and reception method | |
| WO2017114231A1 (en) | Packet sending method, tcp proxy, and tcp client | |
| WO2012129922A1 (en) | Packet handling method, forwarding device and system | |
| CN107645409B (en) | Method and device for determining transmission fault reason of data | |
| US20050169305A1 (en) | Mobile terminal and radio access point in radio access system | |
| CN107135216B (en) | Method for enhancing streaming media transmission in weak network environment | |
| CN109120540B (en) | Method for transmitting message, proxy server and computer readable storage medium | |
| EP1787419A1 (en) | Signalling a state of a transmission link via a transport control protocol | |
| WO2015180046A1 (en) | Protocol stack adaptation method and apparatus | |
| CN106464567B (en) | Dynamic flow control method, device, gateway and fusion access convergent point | |
| WO2000072532A9 (en) | System and method for network packet reduction | |
| CN111181688B (en) | ROHC compressor and implementation method thereof | |
| CN116192693A (en) | Data transmission method, system and network equipment | |
| CN113424578B (en) | Acceleration method and device for transmission control protocol | |
| EP3809748A1 (en) | Data transmitting method and device, and data receiving method and device | |
| CN107196819B (en) | Network connection method and system and computer readable storage medium | |
| JP2002094553A (en) | Device and method for transmitting packet | |
| Iqbal | Performance evaluation of robust header compression protocol for low data rate networks | |
| KR101997211B1 (en) | Network security apparatus and method for detecting attack thereof | |
| JP2005039602A (en) | Ip packet processor |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |