CN108881062A - A kind of data pack transmission method and equipment - Google Patents

A kind of data pack transmission method and equipment Download PDF

Info

Publication number
CN108881062A
CN108881062A CN201710334946.5A CN201710334946A CN108881062A CN 108881062 A CN108881062 A CN 108881062A CN 201710334946 A CN201710334946 A CN 201710334946A CN 108881062 A CN108881062 A CN 108881062A
Authority
CN
China
Prior art keywords
data packet
packet
cell
packaging
data
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
Application number
CN201710334946.5A
Other languages
Chinese (zh)
Inventor
刘沙
王萌
杨进红
张自渊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sanechips Technology Co Ltd
Shenzhen ZTE Microelectronics Technology Co Ltd
Original Assignee
Shenzhen ZTE Microelectronics Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen ZTE Microelectronics Technology Co Ltd filed Critical Shenzhen ZTE Microelectronics Technology Co Ltd
Priority to CN201710334946.5A priority Critical patent/CN108881062A/en
Publication of CN108881062A publication Critical patent/CN108881062A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling

Abstract

The invention discloses a kind of data pack transmission method and equipment, the data pack transmission method, including:The data packet for going to same destination is carried out packaging, then the data packet after packaging is carried out as a whole to the cutting of cell, by scheduling, sent cell in switching network by the link of selection by uplink;Downlink caches the cell received from switching network, then carries out data package-restructuring and unpacking processing, and the data packet after unpacking is scheduled output.The embodiment of the present invention is by carrying out packaging processing to parcel according to different packaging rules, data packet after packaging is carried out to the cutting of cell as a whole, pass through scheduling, it sends cell in switching network by the link of selection, exchange chip cell forward rate demand can be reduced, improve link transmission efficiency with exchange speed-up ratio, while it is beneficial to load balancing.

Description

A kind of data pack transmission method and equipment
Technical field
The present invention relates to field of communication technology more particularly to a kind of data pack transmission method and equipment.
Background technique
Large-scale distributed exchange network is one of the core technology of current large capacity high-end router, in order to reach T More than bit big exchange capacity demand generallys use the exchange network of multistage interconnection, and the exchange network of multistage interconnection is mainly by handing over It changes access chip SA (Switch Access) and exchange chip SF (Switch Fabric) to form, with SA and SF in the following contents Referred to as.
Fig. 1 is switch network architecture schematic diagram in the related technology, in order to meet exchange bandwidth demand, between SA and SF by A plurality of high-speed serial bus (SerDes) is connected, hereinafter referred to as link.When data packet forwarded via SF from a source SA it is past It when one purpose SA, is transmitted by the link of a plurality of physical connection, data packet before transmitting, needs to carry out data packet Scheduling, is then cut into cell, is sent to SF finally by effective link, while cell is forwarded to purpose SA by SF, finally It is cached after cell is completed package-restructuring by purpose SA, the output data packet after through scheduling.
There are the following problems for the prior art:Parcel is scheduled output as a small cell, as bandwidth demand amount increases Greatly, the processing capacity of exchange chip is required very high.Therefore, exchange chip forward rate demand how is reduced, technology people is become Member's problem in need of consideration.
Summary of the invention
It is the general introduction to the theme being described in detail herein below.This general introduction is not the protection model in order to limit claim It encloses.
The embodiment of the invention provides a kind of data pack transmission method and equipment, and can reduce exchange chip forward rate needs It asks, improves link transmission efficiency.
To achieve the goals above, the embodiment of the invention provides a kind of data pack transmission methods, including:
Uplink, will go to same destination data packet carry out packaging, then by the data packet after packaging as a whole into The cutting of row cell is sent cell in switching network by the link of selection by scheduling.
The embodiment of the invention also provides a kind of data Packet Transport Equipment, the data Packet Transport Equipment include processor, Memory and communication bus;
The communication bus is for realizing the connection communication between processor and memory;
The processor is for executing the data packet transfer procedure stored in memory, to realize following steps:
Uplink, will go to same destination data packet carry out packaging, then by the data packet after packaging as a whole into The cutting of row cell is sent cell in switching network by the link of selection by scheduling.
The embodiment of the invention also provides a kind of computer readable storage medium, the computer-readable recording medium storage There is one or more program, one or more of programs can be executed by one or more processor, following to realize Step:
Uplink, will go to same destination data packet carry out packaging, then by the data packet after packaging as a whole into The cutting of row cell is sent cell in switching network by the link of selection by scheduling.
Compared with prior art, data pack transmission method provided in an embodiment of the present invention and equipment, by according to different Packaging rule carries out packaging processing to parcel, and the data packet after packaging is carried out to the cutting of cell as a whole, will by scheduling Cell is sent in switching network by the link of selection, can reduce exchange chip cell forward rate demand, improves link transmission Efficiency with exchange speed-up ratio, while it is beneficial to load balancing.In addition, the embodiment of the present invention in downlink, will directly connect from switching network The cell received is cached, and data package-restructuring and unpacking processing are then carried out;Data packet after unpacking is scheduled output, To improve data buffer storage utilization rate.In embodiments of the present invention, a variety of packaging methods are provided, has and realizes simple spy Point can satisfy the various application demands of user.
After reading and understanding attached drawing and detailed description, it can be appreciated that other aspects.
Detailed description of the invention
Attached drawing is used to provide to further understand technical scheme, and constitutes part of specification, with this The embodiment of application is used to explain the technical solution of the application together, does not constitute the limitation to technical scheme.Attached In figure:
Fig. 1 is switch network architecture schematic diagram in the related technology.
Fig. 2 is data pack transmission method flow chart provided in an embodiment of the present invention.
Fig. 3 is data packet transfer device structural schematic diagram provided in an embodiment of the present invention.
Fig. 4 is the schematic diagram that packaging is carried out using the data pack transmission method of the embodiment of the present invention.
Fig. 5 is the caching schematic diagram using the data pack transmission method of the embodiment of the present invention.
Fig. 6 is the unpackaging schematic diagram using the data pack transmission method of the embodiment of the present invention.
The embodiments will be further described with reference to the accompanying drawings for realization, functional characteristics and the advantage of the application purpose.
Specific embodiment
It should be appreciated that specific embodiment described herein is only used to explain the application, it is not used to limit the application.
It should be noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can phase Mutual any combination.
It is data pack transmission method flow chart provided in an embodiment of the present invention referring to shown in Fig. 2.The data packet transmission side Method, including:
Step 201:The data packet for going to same destination is carried out packaging by uplink;
Wherein, the same destination specifically refers to which SA be sent to by switching network from the SA by data packet, goes to The same SA is just destined to same destination.
Step 202:Cell is passed through choosing by scheduling by the cutting that the data packet after packaging is carried out to cell as a whole The link selected is sent in switching network;
Step 203:Downlink caches the cell received from switching network, then carries out package-restructuring and unpacking processing;
Step 204:Data packet after unpacking is scheduled output.
Wherein, for going to, the data packet of same destination can be a packet or two packets are spelled in step 201 It connects, is also possible to multiple packets and is spliced.
Specifically, described that the data packet for going to same destination is subjected to packaging, including:
1) 1 packet is spliced and (carries out splicing to be equivalent to not splicing to 1 packet) or 2 packets splice, and The packet of current 1 data packet for going to same destination can just go to same mesh when growing less than the first preset parameter value with the latter The data packet on ground spliced.Such as the previous a length of N of data packet packet for going to same destination, go to same destination The latter a length of M of data packet packet, and 2 packets are then combined into a whole packet less than the first preset parameter value by N, whole after packaging Packet length is M+N, is a kind of special circumstances when M is equal to N, the whole packet length after packaging is 2*N certainly.Wherein, described One preset parameter value can be configured according to actual system situation, application demand etc., and first preset parameter value can be with For 144B, i.e., previous packet length can just be spliced when being less than 144B with the latter packet.
Using above-mentioned packaging method, have the characteristics that realize that logic is simple, and be able to satisfy application demand.It is default with first Parameter value is 144B, for a length of 64B of most parcel, when carrying out packaging and unpacking, where the packet of second packet is first in cell Position only appears in 64B~144B, without any position in cell, meeting in this realization to packaging and unpacking It is simple more.
2) one or more parcels are spliced, but spliced several parcels is required to form a complete cell.Example Such as, cell payload length is N, when continuously receiving the parcel that length is L, is at this time spliced n parcel, spliced packet A length of n*L, and (n*L)<=N.
3) continuous packaging splices packet that is, as long as packaging length is less than the second parameter value, the packet of unlimited packaging Number.The setting of second parameter value and Packet Forwarding Rate, system clock, cell tax, the relating to parameters such as link transmission bandwidth, It needs to be calculated according to specific requirements, by taking the second parameter value is equal to 1024B as an example, it is assumed that a length of 64B of most parcel then at most may be used 16 packets are combined into a whole packet, i.e. the packet number range of packaging is 1~16.
Further, the uplink packaging rule can also include:
1) it is less than the packet of M (third parameter value) for length, it is unified to be handled according to M.Packet less than M first passes through filling nothing Byte is imitated to M length, then carries out packaging processing again.When i.e. packet of the length less than M and other packets are spliced, the latter packet exists Initial position in cell is mth byte.The long field of packet in the packet header of parcel is not modified, and is still small before indicating packaging The physical length of packet.It when downlink unpacks, extracts the long field of packet and is judged, if packet is long to be less than M, according to length when handling It is unpacked for M.
It is 144B with the first preset parameter value, for third parameter value M is 64B, when carrying out packaging and unpacking, second Position where the packet of packet is first in cell only appears in 64B~144B, and without any position in cell, this is right It can be simply more in the realization of packaging and unpacking.
2) data packet for participating in packaging, cannot be out-of-order after packaging, i.e., the packet first reached is located at the high ratio of the whole packet after packaging Special position, the packet reached afterwards are located at the low bit position of whole packet.
3) packaging granularity is set, i.e., in the cell on packaging boundary, the initial position of next parcel needs what is met to want It asks.Next parcel initial position calculation method (by taking packaging granularity is P as an example):Previous parcel packet long-pressing P is that granularity is upward It is rounded.Such as:When a length of L of previous packet, the initial position of next packet is [being rounded (L/P)+1] * P.
Wherein, packaging granularity is needed in the case where meeting packet transmission bandwidth, chooses maximum value.Because packaging granularity is got over Greatly, first place is wrapped in cell sets the local fewer of appearance, such as:Packaging granularity is 32B, when maximum cell length is 256B, then Packet first place, which is set, in cell only appears in the 0th, 32,64,96,128,160,192,224 byte, the realization that such packaging unpacks It can be simply more.
Example:First parcel (A) wraps a length of 125B, and second parcel (B) wraps a length of 256B, according to the packaging granularity of 4B Packaging, B packet initial position are:128B.
4) setting time-out configuration, time threshold is arranged in the time before current packet arrives to next packet, when being more than this Between thresholding will be no longer waiting for next packet and carry out packaging, directly will currently wrap carry out subsequent processing.
After the completion of packaging, the whole packet after packaging carries out the cutting of cell, and cutting mode may include:
If maximum cell length is Max, minimum cell length is Min, wraps a length of L.
The determination of maximum cell and minimum cell and total system scheme architecture design have relationship, can be according to using need It asks and is set.It is 256B with maximum cell length, for minimum cell length is 128B, for wrapping the packet of a length of 1000B, then Packet is cut into 4 cells, cell length is respectively:256B, 256B, 256B, 232B.
It is less than the packet of Max for length, a cell directly is dressed up into whole encapsulating.
If packet is long to be equal to n*Max, packet is directly cut into the cell that n length is Max.
If packet is long to be equal to (n*Max)+r, and r is more than or equal to Min, then is cut into cell and one that n length is Max Length is the cell of r.
If packet is long to be equal to (n*Max)+r, and r is less than Min, then is cut into the cell that n-1 length is Max, one long The cell that degree is Max/2 and the cell that a length is (Max/2+r).
Wherein, n is the natural number more than or equal to 1, and r is the natural number more than or equal to 1.
Packet after cutting is as cell payload.
Cell length, packaging instruction and the label information for being used to recombinate are loaded into header, by header and cell Payload is scheduled output as a cell.
The packaging instruction, including:First packet position instruction and useful signal and packet tail eop identifier, it is seen then that in uplink When cutting cell, first packet position instruction and useful signal and packet tail eop identifier are added in header, are used for downlink solution Packet.
In step 202, in downlink, the cell received from switching network is cached, then carries out package-restructuring and unpacking Processing, and the data packet after unpacking is scheduled output.
During specific implementation, since data packet between the cell of different data packet by will appear after switching network Interweave, after several cells of same data packet cutting may also have by the time of different links arrival downlink and first have, because This needs to carry out package-restructuring to data packet.
To data packet carry out package-restructuring method include:
The cell received is cached, and extracts the label information in header, then by label information and letter The storage location of member divides link to carry out queue caching together, is then compared by label information, the cell that will be sent at first Scheduling output, completes cell order maintaining, i.e., by label information, cell is successively dispatched to output, to realize package-restructuring.
The cell of caching can be only comprising cell payload, i.e., the data after removing header, while conciliating in package-restructuring It is cached before packet, as shown in figure 5, parcels multiple in this way only take up a spatial cache, to save spatial cache, is improved slow Deposit utilization rate.
After data packet completes package-restructuring, unpackaging operation is carried out to whole packet, the step of unpacking includes:
1) the first position in cell of packet that practical first packet is obtained according to first packet position instruction, is wrapped further according to first Package informatin, extract first packet packet it is long.
As it can be seen that the information that unpacking needs are used includes:First packet position instruction and useful signal may have in one cell Parcel data packet packet is first, it is also possible to which first without data packet packet, when there is data packet packet head, it is 1 that packet first place, which is set effective signal,.
2) packet is long extracts:The long initial position for calculating next data packet of the packet wrapped according to upper one, then according to packet header The packet long message of middle carrying, the packet for successively extracting the data packet in packaging is long, and the packet then after read group total packaging is long, big packet It is long to detect number of slices for wrapping, to detect the long splicing correctness of packet.When being provided with packaging granularity, next packet initial position Preparation method (by taking packaging granularity is P as an example) is:Upper parcel packet long-pressing P rounds up for granularity.
3) packet tail is obtained according to packet tail eop identifier, this packet tail indicates the packet tail of whole packet after packaging.Work as eop=1, indicates Current cell is the tail cell of whole packet.
Each cell of packet after unpacking is successively read into then scheduling output by group packet sequence from caching.
Due to there is a packaging, i.e. in a cell there are two or several parcels, therefore a cell addresses need it is multiple Team out such as needs can just carry out address recycling after all exporting at all parcels.As shown in fig. 6,2 parcels are spliced into a whole packet, And it has been cut into a cell, and it is all when dispatching output since caching is cached according to cell, it needs to repeat to read the letter Twice, one small packet scheduling output is read every time in first address.
It is data packet transfer device structural schematic diagram provided in an embodiment of the present invention referring to shown in Fig. 3.The data packet passes Defeated device, including:
Packaging processing unit, in uplink, the data packet for going to same destination to be carried out packaging processing;
Cell cutter unit, for cutting the whole packet after packaging, a whole packet is sent out after being cut into several cells Give switching network;
Package-restructuring and unpackaging processing unit, for being cached to from the received cell of switching network, then in downlink Carry out package-restructuring and unpackaging processing;
Output unit is dispatched, for exporting after being scheduled to the data packet after unpacking.
A kind of data Packet Transport Equipment is also provided for the embodiment of the present invention.The data Packet Transport Equipment include processor, Memory and communication bus;
The communication bus is for realizing the connection communication between processor and memory;
The processor is for executing the data packet transfer procedure stored in memory, to realize following steps:
Uplink, will go to same destination data packet carry out packaging, then by the data packet after packaging as a whole into The cutting of row cell is sent cell in switching network by the link of selection by scheduling;
Downlink caches the cell received from switching network, then carries out data package-restructuring and unpacking processing, and will Data packet after unpacking is scheduled output.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realization will be gone The step of data packet toward same destination carries out packaging, including:
2 packets are spliced:The packet of current 1 data packet for going to same destination is long less than the first preset parameter value When and the latter go to the data packet of same destination and spliced;Alternatively, 1 packet is spliced.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realization will be gone The step of data packet toward same destination carries out packaging, including:
One or more parcels for going to same destination are spliced, and spliced parcel forms one completely Cell.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realization will be gone The step of data packet toward same destination carries out packaging, including:
The continuous packaging of data packet that same destination will be gone to, and the data packet length after packaging is less than the second parameter Value.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realization will be gone The step of data packet toward same destination carries out packaging, including:
It is less than the packet of third parameter value for length, first passes through filling slack byte to third parameter value length, then again Carry out packaging processing.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realization will be gone The step of data packet toward same destination carries out packaging, including:
The packet first reached is located at the higher bit position of the data packet after packaging, and the packet reached afterwards is located at the data packet after packaging Low bit position.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realization will be gone The step of data packet toward same destination carries out packaging, including:
Packaging granularity is set, in the cell on packaging boundary, the initial position of next parcel is:Previous parcel packet is long It rounds up by packaging granularity.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realization will be gone The step of data packet toward same destination carries out packaging, including:
Time threshold is arranged in time before current packet arrives to next packet, will be no longer waiting for more than the time threshold Next packet carries out packaging.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, and realizing will spell The step of data packet after packet carries out the cutting of cell as a whole, including:
It is less than maximum cell length when wrapping length, a cell directly is dressed up into encapsulating.;
When long n times for being equal to maximum cell length of packet, then packet is directly cut into the letter that n length is maximum cell length Member;
As the long n times of+r for being equal to maximum cell length of packet, and r is more than or equal to minimum cell length, then packet is cut into n The cell that the cell of length maximum cell length and a length are r;
If the long n times of+r for being equal to maximum cell length of packet, and r would be less than minimum cell length, then packet is cut into n-1 Length is the cell of maximum cell length, and a length is the cell of half maximum cell length and a length is two The cell of/mono- maximum cell length+r;
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, after packaging Data packet the step of carrying out the cutting of cell as a whole, including:
Using the packet after cutting as cell payload, the label information that cell length, packaging indicate and are used for recombinate is added It is downloaded to header, is scheduled output using header and cell payload as a cell.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, after packaging The packaging instruction that includes of data packet the step of carrying out the cutting of cell as a whole, including:First packet position instruction and Useful signal and packet tail identifier.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, will be from exchange The step of cell that net receives is cached, and package-restructuring is then carried out, including:
The cell received is cached, and extracts the label information in header, then by label information and letter The storage location of member divides link to carry out queue caching together, and cell is successively then dispatched to output according to the label information, real Existing package-restructuring.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, will be from exchange The step of cell that net receives is cached, and package-restructuring is then carried out, including:
The cell of the caching only includes cell payload, i.e., the data after removing header.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, is unpacked The step of processing, including:
The first position in cell of packet that practical first packet is obtained according to first packet position instruction, is wrapped further according to first Package informatin, the packet for extracting first packet are long;
The long initial position for obtaining next parcel of the packet wrapped according to upper one, then according to the packet long letter carried in packet header Breath, the packet for successively extracting the parcel in packaging is long, and the data packet packet that then summation obtains after packaging is long;
Packet tail is obtained according to packet tail identifier.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, is unpacked The step of processing, including:
When being provided with packaging granularity, next data packet initial position preparation method is:Upper data packet packet long-pressing Packaging granularity rounds up.
In embodiments of the present invention, the processor executes the data packet transfer procedure stored in memory, after unpacking Data packet the step of being scheduled output, including:
Each cell of packet after unpacking is successively read into then scheduling output by group packet sequence from caching.
In addition, the embodiment of the present invention also provides a kind of computer readable storage medium, the computer readable storage medium It is stored with one or more program, one or more of programs can be executed by one or more processor, to realize Following steps:
Uplink, will go to same destination data packet carry out packaging, then by the data packet after packaging as a whole into The cutting of row cell is sent cell in switching network by the link of selection by scheduling;
Downlink caches the cell received from switching network, then carries out data package-restructuring and unpacking processing, and will Data packet after unpacking is scheduled output.
Above-mentioned computer readable storage medium, including some instructions are used so that a computer installation (can be individual Computer, server or network equipment etc.) or processor (Processor) execution each embodiment the method for the disclosure Part steps.And the computer readable storage medium includes:USB flash disk, mobile hard disk, read-only memory (ReadOnly Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. is various to deposit Store up the medium of program code.
It should be noted that, in this document, the terms "include", "comprise" or its any other variant are intended to non-row His property includes, so that the process, method, article or the device that include a series of elements not only include those elements, and And further include other elements that are not explicitly listed, or further include for this process, method, article or device institute it is intrinsic Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including being somebody's turn to do There is also other identical elements in the process, method of element, article or device.
The serial number of the above embodiments of the invention is only for description, does not represent the advantages or disadvantages of the embodiments.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side Method can be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but in many cases The former is more preferably embodiment.Based on this understanding, technical solution of the present invention substantially in other words does the prior art The part contributed out can be embodied in the form of software products, which is stored in a storage medium In (such as ROM/RAM, magnetic disk, CD), including some instructions are used so that a terminal device (can be mobile phone, computer, clothes Business device, air conditioner or the network equipment etc.) execute method described in each embodiment of the present invention.
The above is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills Art field, is included within the scope of the present invention.

Claims (21)

1. a kind of data pack transmission method, which is characterized in that including:
The data packet for going to same destination is carried out packaging, the data packet after packaging is then carried out letter as a whole by uplink The cutting of member is sent cell in switching network by the link of selection by scheduling.
2. the method according to claim 1, wherein further including:
Downlink caches the cell received from switching network, then carries out data package-restructuring and unpacking processing, and will unpack Data packet afterwards is scheduled output.
3. the method according to claim 1, wherein described spell the data packet for going to same destination Packet, including:
2 data packets are spliced:The packet of current 1 data packet for going to same destination is long less than the first preset parameter value When, the data packet that preceding 1 data packet for going to same destination and the latter go to same destination is spliced;Or Person splices 1 data packet.
4. the method according to claim 1, wherein described spell the data packet for going to same destination Packet, including:
One or more data packets for going to same destination are spliced, and spliced data packet group is complete at one Cell.
5. the method according to claim 1, wherein described spell the data packet for going to same destination Packet, including:
The continuous packaging of data packet that same destination will be gone to, and the data packet length after packaging is less than the second parameter value.
6. the method according to claim 1, wherein described spell the data packet for going to same destination Packet, including:
It is less than the data packet of third parameter value for length, first passing through filling slack byte makes data packet packet grow to third parameter value Then length carries out packaging processing again.
7. the method according to claim 1, wherein described spell the data packet for going to same destination Packet, including:
The data packet first reached is located at the higher bit position of the data packet after packaging, and the data packet reached afterwards is located at the data after packaging The low bit position of packet.
8. the method according to claim 1, wherein described spell the data packet for going to same destination Packet, including:
Packaging granularity is set, in the cell on packaging boundary, the initial position of next data packet is:Previous data packet packet is long It rounds up by packaging granularity.
9. the method according to claim 1, wherein described spell the data packet for going to same destination Packet, including:
Time threshold is arranged in time before current data packet to next data packet arrives, and being more than the time threshold will no longer Next data packet is waited to carry out packaging.
10. the method according to claim 1, wherein the data packet by after packaging carries out letter as a whole The cutting of member, including:
Data packet packet after packaging is long less than maximum cell length, and the data envelope after packaging is directly dressed up a cell;
Long n times for being equal to maximum cell length of data packet packet after packaging, then be directly cut into n for the data packet after packaging Length is the cell of maximum cell length;
The long n times of+r for being equal to maximum cell length of data packet packet after packaging, and r is more than or equal to minimum cell length, then will Data packet after packaging is cut into the cell that n length is maximum cell length and the cell that a length is r;
The long n times of+r for being equal to maximum cell length of data packet packet after packaging, and r is less than minimum cell length, then by packaging Data packet afterwards is cut into the cell that n-1 length is maximum cell length, and a length is half maximum cell length Cell and length be half maximum cell length+r cell;
Wherein, n is the natural number more than or equal to 1, and r is the natural number more than or equal to 1.
11. method according to claim 1 or 2, which is characterized in that the method also includes:
Using the data packet after cutting as cell payload, the label information that cell length, packaging indicate and are used for recombinate is added It is downloaded to header, is scheduled output using header and cell payload as a cell.
12. according to the method for claim 11, which is characterized in that the packaging instruction, including:First packet position instruction and Useful signal and packet tail identifier.
13. according to the method for claim 11, which is characterized in that described to delay the cell received from switching network It deposits, then carries out data package-restructuring, including:
The cell received is cached, and extracts the label information in header, by the storage of label information and cell Position divides link to carry out queue caching together, and cell is successively dispatched to output according to the label information, realizes data package-restructuring.
14. according to the method for claim 11, which is characterized in that described to delay the cell received from switching network It deposits, then carries out data package-restructuring, including:
The cell payload received is cached, and extracts the label information in header, by label information and cell Storage location divides link to carry out queue caching together, and cell is successively dispatched to output according to the label information, realizes data packet Recombination;Wherein, the cell payload is the data after removing header.
15. according to the method for claim 12, which is characterized in that it is described to carry out unpacking processing, including:
The first position in cell of packet for obtaining practical first data packet according to first packet position instruction, further according to first data The package informatin of packet, the packet for extracting first data packet are long;
According to the long initial position for obtaining next data packet of the packet of a upper data packet, according to the packet long letter carried in packet header Breath, the packet for successively extracting the data packet in packaging is long, and the data packet packet that then summation obtains after packaging is long;
Packet tail is obtained according to packet tail identifier.
16. according to the method for claim 15, which is characterized in that
When being provided with packaging granularity, the long initial position for obtaining next data packet of the packet according to a upper data packet, Including:Upper data packet packet long-pressing packaging granularity rounds up.
17. method described in 3 or 14 according to claim 1, which is characterized in that the data packet by after unpacking is scheduled defeated Out, including:
Each cell of data packet after unpacking is successively read into then scheduling output by group packet sequence from caching.
18. a kind of data Packet Transport Equipment, which is characterized in that the data Packet Transport Equipment includes processor, memory and leads to Believe bus;
The communication bus is for realizing the connection communication between processor and memory;
The processor is for executing the data packet transfer procedure stored in memory, to realize following steps:
The data packet for going to same destination is carried out packaging, the data packet after packaging is then carried out letter as a whole by uplink The cutting of member is sent cell in switching network by the link of selection by scheduling.
19. data Packet Transport Equipment according to claim 18, which is characterized in that the processor is also used to execute storage The data packet transfer procedure stored in device, to realize following steps:
Downlink caches the cell received from switching network, then carries out data package-restructuring and unpacking processing, and will unpack Data packet afterwards is scheduled output.
20. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage have one or Multiple programs, one or more of programs can be executed by one or more processor, to realize following steps:
The data packet for going to same destination is carried out packaging, the data packet after packaging is then carried out letter as a whole by uplink The cutting of member is sent cell in switching network by the link of selection by scheduling.
21. computer readable storage medium according to claim 20, which is characterized in that one or more of programs It can also be executed by one or more processor, to realize following steps:
Downlink caches the cell received from switching network, then carries out data package-restructuring and unpacking processing, and will unpack Data packet afterwards is scheduled output.
CN201710334946.5A 2017-05-12 2017-05-12 A kind of data pack transmission method and equipment Pending CN108881062A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710334946.5A CN108881062A (en) 2017-05-12 2017-05-12 A kind of data pack transmission method and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710334946.5A CN108881062A (en) 2017-05-12 2017-05-12 A kind of data pack transmission method and equipment

Publications (1)

Publication Number Publication Date
CN108881062A true CN108881062A (en) 2018-11-23

Family

ID=64320140

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710334946.5A Pending CN108881062A (en) 2017-05-12 2017-05-12 A kind of data pack transmission method and equipment

Country Status (1)

Country Link
CN (1) CN108881062A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111294292A (en) * 2018-12-10 2020-06-16 深圳市中兴微电子技术有限公司 Data processing method, device, equipment and storage medium
CN113068087A (en) * 2021-03-31 2021-07-02 烽火通信科技股份有限公司 Method and device for realizing distributed cell switching through packet cutting recombination
CN113364862A (en) * 2021-06-03 2021-09-07 上海天旦网络科技发展有限公司 Packet decoding system and method
CN114979041A (en) * 2022-05-18 2022-08-30 芯河半导体科技(无锡)有限公司 Packet splicing method for improving utilization efficiency of on-chip cache
CN116633870A (en) * 2023-05-25 2023-08-22 圣麦克思智能科技(江苏)有限公司 Operation and maintenance data processing system and method based on cloud end-added mode

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100220589A1 (en) * 2008-02-04 2010-09-02 Huawei Technologies Co., Ltd. Method, apparatus, and system for processing buffered data
CN101964751A (en) * 2010-09-30 2011-02-02 华为技术有限公司 Transmission method and device of data packets
WO2013016971A1 (en) * 2011-08-01 2013-02-07 中兴通讯股份有限公司 Method and device for sending and receiving data packet in packet switched network
CN103297350A (en) * 2013-05-24 2013-09-11 华为技术有限公司 Implementing method and switching equipment of cell switching system
WO2016029681A1 (en) * 2014-08-25 2016-03-03 深圳市中兴微电子技术有限公司 Switch access module, cell encapsulating method, switch network system and computer storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100220589A1 (en) * 2008-02-04 2010-09-02 Huawei Technologies Co., Ltd. Method, apparatus, and system for processing buffered data
CN101964751A (en) * 2010-09-30 2011-02-02 华为技术有限公司 Transmission method and device of data packets
WO2013016971A1 (en) * 2011-08-01 2013-02-07 中兴通讯股份有限公司 Method and device for sending and receiving data packet in packet switched network
CN103297350A (en) * 2013-05-24 2013-09-11 华为技术有限公司 Implementing method and switching equipment of cell switching system
WO2016029681A1 (en) * 2014-08-25 2016-03-03 深圳市中兴微电子技术有限公司 Switch access module, cell encapsulating method, switch network system and computer storage medium

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111294292A (en) * 2018-12-10 2020-06-16 深圳市中兴微电子技术有限公司 Data processing method, device, equipment and storage medium
WO2020119418A1 (en) * 2018-12-10 2020-06-18 深圳市中兴微电子技术有限公司 Data processing method, apparatus and device, and storage medium
CN113068087A (en) * 2021-03-31 2021-07-02 烽火通信科技股份有限公司 Method and device for realizing distributed cell switching through packet cutting recombination
CN113068087B (en) * 2021-03-31 2022-03-25 烽火通信科技股份有限公司 Method and device for realizing distributed cell switching through packet cutting recombination
CN113364862A (en) * 2021-06-03 2021-09-07 上海天旦网络科技发展有限公司 Packet decoding system and method
CN114979041A (en) * 2022-05-18 2022-08-30 芯河半导体科技(无锡)有限公司 Packet splicing method for improving utilization efficiency of on-chip cache
CN114979041B (en) * 2022-05-18 2024-03-08 芯河半导体科技(无锡)有限公司 Packaging method for improving utilization efficiency of on-chip cache
CN116633870A (en) * 2023-05-25 2023-08-22 圣麦克思智能科技(江苏)有限公司 Operation and maintenance data processing system and method based on cloud end-added mode
CN116633870B (en) * 2023-05-25 2023-11-14 圣麦克思智能科技(江苏)有限公司 Operation and maintenance data processing system and method based on cloud end-added mode

Similar Documents

Publication Publication Date Title
CN108881062A (en) A kind of data pack transmission method and equipment
CN108833299B (en) Large-scale network data processing method based on reconfigurable switching chip architecture
CN103348640B (en) Relay
US7756990B2 (en) Configurable protocol engine
CN103444141B (en) Grouping scheduling method and equipment
CN106612306A (en) Data sharing method and device of virtual machine
CN101515841B (en) Method for data packet transmission based on RapidIO, device and system
CN101692647B (en) Tunnel forwarding system in which IPv4 packets are encapsulated by IPv6 head in router
CN102130833A (en) Memory management method and system of traffic management chip chain tables of high-speed router
CN110167197A (en) GTP downlink data transmission optimization method and device
CN103986473A (en) Receiver for error-protected packet-based frame
CN103414538A (en) Data package sorting method for network data communication in distributed environment
CN110351286A (en) Link flood attack detects response mechanism in a kind of software defined network
CN108012338A (en) Data transmission method, device, application and base station
CN103178930A (en) Physical layer link convergence transmission method and device
CN107135189A (en) A kind of file transmitting method and physical machine
CN103944880B (en) A kind of method of ZigBee data transfers
CN107040427A (en) A kind of method and device of network card configuration
TWI252001B (en) Method and system for maintaining partial order of packets
CN103490870B (en) A kind of frequency band utilization method and equipment
CN114168315A (en) Multi-core-based message processing method and device, electronic equipment and storage medium
CN107465538A (en) A kind of internet-of-things terminal moving method and gateway
CN104639511B (en) A kind of implementation method and device for saving memory
CN102368742B (en) Multilink data transmission method with good fairness and high efficiency
CN107426314A (en) Data download method and device

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20181123

RJ01 Rejection of invention patent application after publication