CN111865475B - Packet switching method and system - Google Patents
Packet switching method and system Download PDFInfo
- Publication number
- CN111865475B CN111865475B CN201910335911.2A CN201910335911A CN111865475B CN 111865475 B CN111865475 B CN 111865475B CN 201910335911 A CN201910335911 A CN 201910335911A CN 111865475 B CN111865475 B CN 111865475B
- Authority
- CN
- China
- Prior art keywords
- packet
- coding
- coding block
- slice
- coding blocks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q11/0066—Provisions for optical burst or packet networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a packet switching method and a system, which relate to the technical field of communication, and the method comprises the following steps: constructing a slice packet for bearing an integer number of coding blocks at a transmitting end, and filling the coding blocks into the slice packet according to a preset sequence and position; and sending the slice packets to a receiving end, and extracting the coding blocks at the receiving end. The invention does not need to carry out synchronous processing at the receiving end, can effectively improve the bandwidth utilization rate and lighten the transmission pressure of the cell switching matrix.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a packet switching method and system.
Background
In optical communication networks (optical communications networks), packet switching matrices (packet fabrics) are widely used to implement packet switching of ethernet networks. However, in some scenarios, the network device does not want to parse the ethernet packet from the 66B code stream of the PCS (physical coding sublayer) layer and then perform packet switching through the switching matrix, but wants that the 66B code stream can directly pass through the switching matrix without loss.
A significant benefit of this is that the codec module of 66B and the corresponding processing circuit of the ethernet packet can be omitted in some scenarios, and meanwhile, since some processing of the ethernet packet needs to be performed in a whole packet, a certain time is needed to wait for collecting an ultra-long ethernet packet, and if the 66B code stream is directly transmitted, the low-delay characteristic can be achieved. Of course, the 66B code stream is not limited to ethernet traffic, and may carry other traffic encapsulated in the 66B block.
However, when a data packet passes through a packet switching matrix at present, the following problems exist, and when a 66B coding block is transmitted from a transmitting end to a receiving end, the received 66B code stream needs to be synchronized, and a complex synchronization circuit is needed; because of the large number of data packets, the cell switch matrix tends to have a large transmission pressure and a low bandwidth utilization rate.
Disclosure of Invention
In view of the defects in the prior art, a first aspect of the present invention provides a packet switching method that does not require synchronization processing at a receiving end.
In order to achieve the above purposes, the technical scheme adopted by the invention is as follows:
a packet switching method, the method comprising the steps of:
constructing a slice packet for bearing an integer number of coding blocks at a transmitting end, and filling the coding blocks into the slice packet according to a preset sequence and position;
and sending the slice packets to a receiving end, and extracting the coding blocks at the receiving end.
On the basis of the technical scheme, the coding block is an original coding block or a compressed coding block obtained by compressing the original coding block;
when the coding block is a compressed coding block:
at a transmitting end, compressing an original coding block to obtain a compressed coding block and then constructing a slice packet;
and at the receiving end, after the compressed coding block is extracted, recovering the compressed coding block to obtain the original coding block.
On the basis of the above technical solution, the original coding block is a 66B coding block, and the compressed coding block is a 65B coding block.
On the basis of the technical proposal, the device comprises a shell,
at a sending end, a 66B coding block containing two bit control bits is compressed into a 65B coding block containing only 1 bit control bits, and then slicing and packet construction are carried out;
at the receiving end, after the 65B code block is extracted, the 65B code block containing the 1-bit control bit is restored to a 66B code block containing the two-bit control bit according to the control bit.
Based on the technical scheme, the maximum number of the coding blocks which can be borne by one slice packet is determined according to the maximum packet length of the cell switching matrix.
Meanwhile, a second aspect of the present invention provides a packet switching system that does not require a synchronization process at a receiving end.
In order to achieve the above purposes, the technical scheme adopted by the invention is as follows:
a packet switching system comprising:
the system comprises a group packaging module, a group packaging module and a group selecting module, wherein the group packaging module is used for constructing a slice package bearing an integer number of coding blocks at a sending end and filling the coding blocks into the slice package according to a preset sequence and position;
a cell switching matrix for transmitting the slice packets from a transmitting end to a receiving end;
an extraction module for extracting the coding block at a receiving end.
On the basis of the technical scheme, the packet switching system further comprises a compression module and a decompression module, wherein the coding blocks are original coding blocks or compressed coding blocks obtained by compressing the original coding blocks;
when the coding block is a compressed coding block:
at a sending end, the compression module is used for compressing an original coding block to obtain a compressed coding block;
and at the receiving end, after the compressed coding blocks are extracted, the decompression module is used for recovering the compressed coding blocks to obtain the original coding blocks.
On the basis of the technical scheme, the original coding blocks are 66B coding blocks, and the compressed coding blocks are 65B coding blocks.
On the basis of the technical proposal, the utility model has the advantages that,
at a transmitting end, the compression module is used for compressing a 66B coding block containing two bits of control bits into a 65B coding block containing only 1 bit of control bits;
at the receiving end, after the 65B code block is extracted, the decompression module restores the 65B code block containing the 1-bit control bit into a 66B code block containing the two-bit control bit according to the control bit.
On the basis of the technical scheme, the group packaging module determines the number of coding blocks which can be borne by one slice at most according to the maximum packet length of the cell switching matrix.
Compared with the prior art, the invention has the advantages that:
(1) the invention fills the code blocks into the slice packet loads in a determined order and position. The slice packet is enabled to bear an integral number of coding blocks by filling the padding bits at the tail of the slice packet, so that the boundary of the coding blocks cannot be damaged by the slice packet. Therefore, even if the slice packet is lost in the transmission process, the number of the lost coding blocks is also an integer, and after the receiving end extracts the coding blocks from the slice packet, the relative positions of the control bits of the coding blocks cannot slide due to the packet loss, so that the receiving end does not need to synchronize the coding blocks even if the packet loss occurs in the slice packet.
(2) The packet switching method in the embodiment of the invention compresses the original coding blocks into the compressed coding blocks, and can transmit more compressed coding blocks under the same bandwidth, thereby improving the bandwidth utilization rate. Meanwhile, less slice packets are needed for transmitting the same data volume, thereby reducing the transmission pressure of cell switching.
Drawings
Fig. 1 is a flow chart of a packet switching method in an embodiment of the invention;
FIG. 2 is a diagram illustrating a distribution of slice packet fields according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a slice packet transmission coding block according to an embodiment of the present invention;
fig. 4 is a flow chart of a packet switching method for transmitting 66B encoded blocks in an embodiment of the present invention;
fig. 5 is a schematic diagram of a distribution of slice packet fields carrying 65B encoded blocks according to an embodiment of the present invention;
fig. 6 is a schematic diagram of slice packet transmission 66B encoding blocks according to an embodiment of the present invention;
FIG. 7 is a diagram illustrating a method for compressing 66B encoded blocks according to an embodiment of the present invention;
fig. 8 is a schematic diagram of a method for recovering a 65B coding block according to an embodiment of the present invention;
fig. 9 is a block diagram of a packet switching system in an embodiment of the present invention;
fig. 10 is a block diagram showing the configuration of a packet switching system provided with a compression module and a decompression module according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Referring to fig. 1, an embodiment of the present invention provides a packet switching method, including the following steps:
A. constructing a slice packet for bearing an integer number of coding blocks at a transmitting end, and filling the coding blocks into the slice packet according to a preset sequence and position;
referring to fig. 2, the slice packet in this embodiment includes an overhead field, N coding blocks, and padding bits, where the N coding blocks are sequentially placed. Specifically, a slice packet carrying an integer number of coding blocks is constructed at a transmitting end, and the number of the coding blocks which can be carried by one slice packet at most is usually determined according to the maximum packet length of a cell switch matrix, and the specific process is as follows:
determining the maximum packet length of the slice packets according to the limit of the cell switching matrix on the transmission packet length and the characteristic that the packet length of the slice packets is an integer byte;
determining the length of a required overhead field, and carrying an integer number of coding blocks as much as possible according to the maximum packet length of the slice packets and the length of the overhead field;
the overhead field in the slice packet can carry link maintenance information and other user-defined information, and the number of actually required overhead information bits is determined, so that the length of the overhead field can be determined.
And judging whether the slice packets have spare bits or not, if so, filling by using filling bits, and if not, finishing.
B. Sending the slice packets to a receiving end, and extracting the coding blocks at the receiving end;
after the code blocks are extracted at the receiving end, the extracted code blocks can be combined into a data code stream according to the transmission sequence.
In this embodiment, the code blocks at the transmitting end are generated by the internal circuit at the transmitting end or are synchronized after being received through the optical interface, so the positions of the control bits of the code blocks on the internal bus are fixed, that is, the arrangement of the code blocks on the internal bus is known. With this known information, the code blocks can be stuffed into the payload of the slice packets in a determined order and position. For example, the bit sequence of the coding block can be sequentially placed from the lower bit to the higher bit according to the transmission sequence (i.e. the lower bit is transmitted first, and the higher bit is transmitted later). While the control bits in the code block are transmitted before the data bits so that the control bits are in the low bits and the data bits are in the high bits. The slice packet carries an integral number of coding blocks by filling the padding bits at the tail of the slice packet, so that the slice packet does not damage the boundary of the coding blocks.
Therefore, even if the slice packet is lost in the transmission process, the lost block is an integer number of coding blocks, and after the receiving end extracts the coding blocks from the slice packet, the relative position of the control bits of the coding blocks does not slide due to the packet loss, so that the receiving end does not need to synchronize the coding blocks even if the slice packet is lost.
As a better implementation manner, the coding block is an original coding block or a compressed coding block obtained by compressing the original coding block. That is, the original coding block may be transmitted directly without compression or after being compressed.
Referring to fig. 3, when the coding block is a compressed coding block:
at a transmitting end, compressing an original coding block to obtain a compressed coding block and then constructing a slice packet;
and at a receiving end, after the compressed coding block is extracted, recovering the compressed coding block to obtain an original coding block.
Preferably, the original coding blocks are 66B coding blocks, and the compressed coding blocks are 65B coding blocks.
At the moment, at a sending end, a 66B coding block containing two bit control bits is compressed into a 65B coding block containing only 1 bit control bits, and then slicing packet construction is carried out;
at the receiving end, after the 65B code block is extracted, the 65B code block containing the 1-bit control bit is restored to a 66B code block containing the two-bit control bit according to the control bit.
Referring to fig. 4 and fig. 6, the following description will be made in detail by taking the compression of a 66B coded block into a 65B coded block as an example:
s1, compressing a 66B coding block into a 65B coding block;
the first two bits of the 66B coding block represent a synchronization header, i.e., a 2-bit control bit, which is mainly used for data alignment at the receiving end and synchronization of the received data stream. The 2-bit control bits are two kinds of "01" and "10", the "01" indicates that the following 64 bits are both data, and the "10" indicates that the following 64 bits are a mixture of data and control information.
Referring to fig. 4, in one embodiment, compressing 66B coded blocks into 65B coded blocks specifically includes:
s11, determining the position of a 2-bit control bit in a data code stream according to the arrangement mode of the 66B coding blocks on a transmission bus;
and S12, deleting the upper bit or the lower bit in the 2-bit control bits of all the 66B coding blocks.
Deleting the high-order bit, namely deleting the 0 in the 01 or deleting the 1 in the 10; deleting the low order bits, namely deleting the 1 in the 01 or deleting the 0 in the 10.
S2, constructing a slice packet bearing an integral number of the 65B coding blocks at a sending end;
referring to fig. 5, the slice packet in the present embodiment includes an overhead field, N65B code blocks, and a padding bit, where the N65B code blocks are sequentially placed. Specifically, step S2 includes the steps of:
s21, determining the maximum packet length of the slice packets according to the limit of the cell switching matrix on the transmission packet length and the characteristic that the packet length of the slice packets is an integer byte;
s22, determining the length of a required overhead field, and carrying an integral number of 65B coding blocks as much as possible according to the maximum packet length of the slice packets and the length of the overhead field;
the overhead field in the slice packet can carry link maintenance information and other user-defined information, and the number of actually required overhead information bits is determined, so that the length of the overhead field can be determined.
The expression of carrying as many integer 65B code blocks as possible means that the length of overhead field in the packet length of the slice packet is removed, and the remaining positions carry as many integer 65B code blocks as possible, i.e. after carrying several integer 65B code blocks, the spare bits of the slice packet are less than 65 bits.
And S23, judging whether the slice packets have spare bits or not, if so, filling by using filling bits, and if not, finishing.
After step S22, the spare bits of the slice packet should be less than 65 bits and equal to or greater than 0, and if there are spare bits, padding is performed with padding bits, that is, the packet length of the slice packet is guaranteed to be an integer number of bytes.
S3, sending the slice packets to a receiving end, and extracting the 65B coding blocks at the receiving end;
and S4, restoring each 65B coding block into a 66B coding block according to the control bit, and forming a data code stream by the restored 66B coding blocks according to the transmission sequence.
Step S4 specifically includes the following steps:
s41, determining the position of the 1-bit control bit of each 65B coding block in the slice packet, and inverting each 1-bit control bit to obtain a recovery control bit;
in this embodiment, when the transmitting end constructs a slice packet, the 65B coding blocks are sequentially placed at corresponding positions in the slice packet, and then the positions of the 65B coding blocks are naturally fixed. The padding bit is also set to fix the 65B code block position because it can only place a portion of the 65B code block if the padding bit is also used to place the 65B code block. For example, only the first 30 bits and then the last 35 bits are to be placed in the next slice packet, which results in the relative position of the 65B code block in the second slice packet being different from that in the first slice packet.
Referring to fig. 8, inverting each 1-bit control bit to obtain a recovered control bit specifically refers to:
because the 2-bit control bits of the 66B code block have two types, namely "01" and "10", when the control bit information of the 65B code block is known, the deleted control bit can be determined by inverting: if the control bit of the 65B coding block is '1', the inverted result is '0'; if the control bit of the 65B coding block is "0", the result of the negation is "1".
And S42, adding the recovery control bits at corresponding positions according to the compression mode of the 66B coding blocks, so that each 65B coding block is recovered into a 66B coding block.
After the recovery control bits are obtained, the positions of the recovery control bits also need to be known, and in this embodiment, the positions of the recovery control bits are determined as follows:
if the 66B coding block deletes the high-order bit in the 2-bit control bit, adding the recovery control bit to the high-order bit side of the control bit in the 65B coding block;
if the 66B code block deletes the lower bits of the 2-bit control bits, the recovery control bits are added to the 65B code block on the lower bit side of the control bits.
In summary, in the packet switching method for improving bandwidth utilization in this embodiment, the 66B coding blocks are compressed into 65B coding blocks containing only 1-bit control bits, and more 65B coding blocks can be transmitted under the same bandwidth, thereby improving bandwidth utilization. Meanwhile, less slice packets are needed for transmitting the same data volume, thereby reducing the transmission pressure of cell switching.
Furthermore, if the position of the 66B coding block in the slice packet received by the receiving end is uncertain, the 2-bit control code of these 66B coding blocks needs to be retrieved to determine the position of the 66B coding block in the slice packet, which is called synchronization. In the embodiment, since an integral number of 65B coding blocks are carried in the slice packet, and the 65B coding blocks are sequentially placed, the position of each 65B coding block can be determined, and then the position of the recovered 66B coding block is fixed, and if the position of the 66B coding block in the slice packet is fixed, synchronization is not needed.
The embodiment of the invention also provides a packet switching system which comprises a packet packaging module, a cell switching matrix and an extraction module. Referring to fig. 9, the description will be made by taking 100GE as an example, but 200GE, 400GE, etc. are also possible here. Flexe Shim in FIG. 9 refers to an intermediate level that maps or reflects Flexe clients and Flexe groups. Of course, the 66B code stream is not limited to ethernet traffic, and may be other traffic encapsulated in the 66B block.
The system comprises a group packaging module, a group packaging module and a group selecting module, wherein the group packaging module is used for constructing a slice packet bearing an integral number of coding blocks at a sending end and filling the coding blocks into the slice packet according to a preset sequence and position;
a cell switching matrix for transmitting the slice packets from a transmitting end to a receiving end;
an extraction module for extracting the coding block at a receiving end.
Further, referring to fig. 10, the packet switching system further includes a compression module and a decompression module, where the coding block is an original coding block or a compressed coding block obtained by compressing the original coding block;
when the coding block is a compressed coding block:
at a sending end, the compression module is used for compressing an original coding block to obtain a compressed coding block;
and at the receiving end, after the compressed coding blocks are extracted, the decompression module is used for recovering the compressed coding blocks to obtain the original coding blocks.
Preferably, the original coding blocks are 66B coding blocks, and the compressed coding blocks are 65B coding blocks.
At this time, at the transmitting end, the compression module is configured to compress a 66B coding block including a two-bit control bit into a 65B coding block including only a 1-bit control bit;
at the receiving end, after the 65B code block is extracted, the decompression module restores the 65B code block containing the 1-bit control bit into a 66B code block containing the two-bit control bit according to the control bit.
Further, the compressing module compresses the 66B coding block into a 65B coding block, which specifically includes:
determining the position of the 2-bit control bit in the data code stream according to the arrangement mode of the 66B coding blocks on the transmission bus;
and deleting the upper bits or the lower bits of the 2-bit control bits of all the 66B coding blocks.
Further, the decompressing module restores each 65B coding block to a 66B coding block according to the control bit, which specifically includes:
determining the position of the 1-bit control bit of each 65B coding block in the slice packet, and inverting each 1-bit control bit to obtain a recovery control bit;
according to the compression mode of the 66B coding block, the recovery control bit is added at the corresponding position, so that each 65B coding block is recovered into the 66B coding block.
Further, the method for constructing a slice packet carrying an integer number of coding blocks at a sending end by the group packet module specifically includes:
determining the maximum packet length of the slice packets according to the limitation of the cell switching matrix on the transmission packet length and the characteristic that the packet length of the slice packets is an integer byte;
determining the length of a required overhead field, and carrying an integer number of coding blocks as much as possible according to the maximum packet length of the slice packets and the length of the overhead field;
and judging whether the slice packets have spare bits or not, if so, filling by using filling bits, and if not, finishing.
The present invention is not limited to the above-described embodiments, and it will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements are also considered to be within the scope of the present invention. Those not described in detail in this specification are well within the skill of the art.
Claims (8)
1. A packet switching method, characterized in that it comprises the steps of:
constructing a slice packet bearing an integer number of coding blocks at a transmitting end, and filling the coding blocks into a slice packet according to a preset sequence and position, wherein a filling position is filled at the tail of the slice packet to enable the slice packet to bear the integer number of coding blocks;
sending the slice packets to a receiving terminal, and extracting the coding blocks at the receiving terminal;
the coding block is an original coding block or a compressed coding block obtained by compressing the original coding block;
when the coding block is a compressed coding block:
at a transmitting end, compressing an original coding block to obtain a compressed coding block and then constructing a slice packet;
and at the receiving end, after the compressed coding block is extracted, recovering the compressed coding block to obtain the original coding block.
2. The packet switching method according to claim 1, wherein the original coding block is a 66B coding block, and the compressed coding block is a 65B coding block.
3. The packet switching method of claim 2, wherein:
at a sending end, a 66B coding block containing two bit control bits is compressed into a 65B coding block containing only 1 bit control bits, and then slicing and packet construction are carried out;
at the receiving end, after the 65B code block is extracted, the 65B code block containing the 1-bit control bit is restored to a 66B code block containing the two-bit control bit according to the control bit.
4. The packet switching method of claim 1, wherein: the maximum number of coding blocks which can be carried by one slice packet is determined according to the maximum packet length of the cell switching matrix.
5. A packet switching system, comprising:
the system comprises a packaging module, a transmitting module and a receiving module, wherein the packaging module is used for constructing a slice packet bearing an integer number of coding blocks at a transmitting end and filling the coding blocks into slice packets according to a preset sequence and position, and the packaging module is used for filling bits at the tail of the slice packet to enable the slice packets to bear the integer number of coding blocks;
a cell switching matrix for transmitting the slice packets from a transmitting end to a receiving end;
an extraction module, configured to extract the coding block at a receiving end;
the packet switching system also comprises a compression module and a decompression module, wherein the coding blocks are original coding blocks or compressed coding blocks obtained by compressing the original coding blocks;
when the coding block is a compressed coding block:
at a sending end, the compression module is used for compressing an original coding block to obtain a compressed coding block;
and at the receiving end, after the compressed coding blocks are extracted, the decompression module is used for recovering the compressed coding blocks to obtain the original coding blocks.
6. The packet switching system of claim 5, wherein: the original coding blocks are 66B coding blocks, and the compressed coding blocks are 65B coding blocks.
7. The packet switching system of claim 6, wherein:
at a transmitting end, the compression module is used for compressing a 66B coding block containing two bits of control bits into a 65B coding block containing only 1 bit of control bits;
at the receiving end, after the 65B code block is extracted, the decompression module restores the 65B code block containing the 1-bit control bit into a 66B code block containing the two-bit control bit according to the control bit.
8. The packet switching system of claim 5, wherein: the packet packing module determines the number of coding blocks which can be borne by one packet according to the maximum packet length of the cell switching matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910335911.2A CN111865475B (en) | 2019-04-24 | 2019-04-24 | Packet switching method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910335911.2A CN111865475B (en) | 2019-04-24 | 2019-04-24 | Packet switching method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111865475A CN111865475A (en) | 2020-10-30 |
| CN111865475B true CN111865475B (en) | 2022-08-30 |
Family
ID=72952232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910335911.2A Active CN111865475B (en) | 2019-04-24 | 2019-04-24 | Packet switching method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111865475B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101227450A (en) * | 2007-01-16 | 2008-07-23 | 华为技术有限公司 | Equipment, system and method for transmitting spending information |
| WO2009060628A1 (en) * | 2007-11-09 | 2009-05-14 | Panasonic Corporation | Padding bit assignment method and transmitter |
| CN105391518A (en) * | 2015-10-16 | 2016-03-09 | 中国人民解放军国防科学技术大学 | Deep space network oriented file transfer method |
| CN108092924A (en) * | 2017-12-25 | 2018-05-29 | 烽火通信科技股份有限公司 | Cell switching method and system based on FlexE business |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8255779B2 (en) * | 2009-05-13 | 2012-08-28 | Applied Micro Circuits Corporation | System and method for accelerated forward error correction (FEC) synchronization |
-
2019
- 2019-04-24 CN CN201910335911.2A patent/CN111865475B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101227450A (en) * | 2007-01-16 | 2008-07-23 | 华为技术有限公司 | Equipment, system and method for transmitting spending information |
| WO2009060628A1 (en) * | 2007-11-09 | 2009-05-14 | Panasonic Corporation | Padding bit assignment method and transmitter |
| CN105391518A (en) * | 2015-10-16 | 2016-03-09 | 中国人民解放军国防科学技术大学 | Deep space network oriented file transfer method |
| CN108092924A (en) * | 2017-12-25 | 2018-05-29 | 烽火通信科技股份有限公司 | Cell switching method and system based on FlexE business |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111865475A (en) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101171806B (en) | Method and apparatus for transmitting and receiving packet data using predefined length indicant in mobile communication system | |
| US8718098B2 (en) | Method for compressing and decompressing time stamp and equipment thereof | |
| CN106301678B (en) | Data processing method, communication equipment and communication system | |
| CN113784437B (en) | Method and device for realizing FlexE bearing small particle service | |
| US20060209782A1 (en) | Bandwidth optimization system | |
| EP1523148A1 (en) | Header compression/decompression device and header compression/decompression method | |
| CN101283620B (en) | Header compression optimization method during and after handovers in cellular communication network | |
| CN101237419A (en) | Packet header compression method in air-space communication of aviation telecommunication network | |
| US10015285B2 (en) | System and method for multi-stream compression and decompression | |
| CN111464635B (en) | Dictionary index transmission method and device | |
| CN104917591A (en) | Satellite network data package compression method suitable for uni-directional lossy link | |
| US7342902B2 (en) | Two stage loss-less compressor for a clear channel over a packet network | |
| US7908399B2 (en) | Compression of repeated patterns in full bandwidth channels over a packet network | |
| CN111865475B (en) | Packet switching method and system | |
| CN111327970B (en) | Passive optical network management channel, establishment method and system, sending end and receiving end | |
| CN102006295A (en) | Data compression method based on asynchronous transfer mode (ATM) carried IP voice | |
| CN107294878A (en) | Data transmission method, system and relevant device | |
| CN114726615B (en) | VoIP hidden channel construction method and system based on audio coding transformation | |
| JPH10200595A (en) | Variable length encoded data transmitter, transmitter side equipment, receiver side equipment and its method | |
| WO2023165222A1 (en) | Mapping method and apparatus for content to be mapped, and storage medium and electronic apparatus | |
| CN110572237A (en) | Signal sending and relaying method and related equipment | |
| US7158597B2 (en) | TFO resynchronization system | |
| CN113993163A (en) | Service processing method and device | |
| CN115276903A (en) | Method for improving LTE air interface transmission efficiency | |
| CN117978322A (en) | Downhole data storage system and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |