CN101365150B - Method and node enhancing multicast transmission efficiency based on random network code - Google Patents
Method and node enhancing multicast transmission efficiency based on random network code Download PDFInfo
- Publication number
- CN101365150B CN101365150B CN2007101380794A CN200710138079A CN101365150B CN 101365150 B CN101365150 B CN 101365150B CN 2007101380794 A CN2007101380794 A CN 2007101380794A CN 200710138079 A CN200710138079 A CN 200710138079A CN 101365150 B CN101365150 B CN 101365150B
- Authority
- CN
- China
- Prior art keywords
- generation
- multicast
- source node
- decoding
- signaling
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for improving multicast transmission efficiency based on random network coding, a source node and a sink node. The source node receives a decoding result signaling that each sink node decodes the first generation of a multicast grouping. The decoding result signaling can be defined as a successful decoding signaling when decoding is made successfully or an unsuccessful decoding signaling when decoding is made unsuccessfully; the source node adjusts a generation sending continuous width of the multicast grouping according to the decoding result signaling. The invention ensures that the source node can know the network condition of the multicast transmission immediately, thereby adjusting the generation sending continuous width of the multicast grouping and improving the transmission efficiency.
Description
Technical field
The present invention relates to the network coding technique field, be specifically related to improve method and source node and destination node based on the multicast transmission efficiency of random network code.
Background technology
So-called network code just is meant that the node that allows in the network not only has the ability that packet is transmitted in storage, can also carry out encoding operation to information, thereby can increase substantially throughput and the bandwidth availability ratio of network when carrying out multicast and use.
Fig. 1 has provided one and has improved the network topological diagram of network throughput by network code, as shown in Figure 1, suppose that the transmission rate of all circuits is the 1bit/ unit interval among the figure, and node S will utilize this network simultaneously to node Y and node Z multicast information.Suppose in a certain unit interval that S sends bit b respectively to T and U
1And b
2If each node all has only the storage forwarding capability, then node W can only be from b
1And b
2Nodes X is passed in one of middle selection, and obviously node Y and node Z can't receive b simultaneously
1And b
2, network offer node S to the multicast speed of node Y and Z less than the 2bit/ unit interval.And if in the node of this network, introduce encoding function, promptly allow node W with b
1And b
2The result who makes XOR passes to nodes X, by X this result is passed to Y and Z respectively again, and then node Y can solve the bit that node S sends to U by this result and the own bit of receiving from node T.And node Z also can receive that S issues the bit of T by similar mode.Thereby make S reach the 2bit/ unit interval to the speed of Y and Z multicast.
Prior art is verified: in any network, suppose that the source is to each acceptance point { T when carrying out clean culture
1, T
2..., T
nMaximum rate be respectively { MF
1, MF
2..., MF
n, then this source must be with min{MF
m(m=1,2 ..., n) } speed is carried out multicast to all receiving nodes simultaneously, with min{MF
m(m=1,2 ..., n) } be called the minimum value of source node in the max-flow of all destination nodes.And as seen from Figure 1, if node does not possess encoding function, this speed min{MF
m}=2bit/ the unit interval normally is beyond one's reach, and has introduced network code and have only, and this speed just can reach.Prior art also proves: if the node in the network has the ability of digital coding, then no matter carry out multicast, theoretic min{MF in the network of which kind of topology
mAll can reach.
Network coding technique is divided into random network code and two branches of deterministic network coding.Random network code is meant that the coding vector of all links in the network all is time dependent, and promptly each node all carries out encoding operation to the data of having received randomly and sends after obtaining send opportunity.
Used the notion in " generation " in the network of use random network code, that is: all original data blocks that data source need be multicasted to destination node are divided into some groups, remove last group, every group of original data block that contains equal amount.In whole multicast process, the encoding operation of node all only carries out belonging between the new data block of same group original data block and they carrying out generating after the linear combination.Claim that one group of original data block and the set of being made up of whole new data block that their linear combination generates are a generation.As seen, the encoding operation in the whole multicast process all is to carry out between the data block of belonging to the same generation.
Provide existing multicast flow chart based on random network code according to above description, as shown in Figure 2, its concrete steps are as follows:
Step 201: before multicast process begins, on the basis of existing network, calculate the logical sub topology that a multicast process is used.
Step 202: in preestablish a per generation multicast grouping lasting sum of generation transmission or generation, send lasting duration.
The generation transmission continues sum and refers to, and the number that source node sends per generation multicast grouping is called for sending lasting sum.For example: continue to add up to D if generation sends, then source node continue to send the D number after former generation multicast grouping, will change the process of transmitting that multicast of future generation is divided into groups over to.
The generation transmission continues duration and refers to, and the lasting duration that source node sends per generation multicast grouping is called for sending lasting duration.For example: if generation send to continue duration is Δ t, then source node continue to send Δ t duration after former generation multicast grouping, will change the process of transmitting that multicast of future generation is divided into groups over to.
In the generation of setting in this step, sends and continues to add up to d* (H/h), and it is d*l/h that generation sends lasting duration.Wherein, d is the number of per generation original data block, H be source node all go out speed summation to link, l is the length of each multicast grouping, the minimum value that h is a source node in the max-flow of destination node, this value can calculate in the process of constructing the multicast topology.
Step 203: the source node in the multicast logical sub topology determines to send a multicast grouping, continue sum according to number of transmission and the transmission of predefined generation when former generation multicast grouping, perhaps continue duration according to lasting duration of transmission and the transmission of predefined generation when former generation multicast grouping, judge whether to enter the new former generation of working as, if, execution in step 204; Otherwise, execution in step 205.
Particularly, if when the number of transmission of former generation multicast grouping sends lasting sum less than predefined generation, perhaps, continue duration when the lasting duration of the transmission of former generation multicast grouping sent less than predefined generation, then source node is proceeded the process of transmitting when former generation multicast grouping; Otherwise source node begins the process of transmitting of multicast grouping of future generation.
Step 204: source node will be worked as the next generation of former generation as the new former generation of working as.
Step 205: source node generates a d dimensional vector at random, calculate this d dimensional vector and represent that this generation remains to be sent out the initial data vector of original data block, the data block that obtains is encapsulated into grouping, after the generation numbering of this data block and the d dimension coding vector that generates inserted packet header, this grouping is sent.
Suppose that source node is h piece/unit interval to the minimum value in all destination node max-flows in this subtopology, then outwards to send the speed of data are h piece/unit interval to source node.
The form of multicast grouping mainly is made up of packet header and packet content as shown in Figure 3, and wherein, packet header comprises: generation number and coding vector as: vector element 1, vector element 2 ..., vector element d, packet content promptly: data block.
Step 206: intermediate node is received the multicast grouping, judges whether this multicast grouping has carried fresh information, if, execution in step 207; Otherwise, execution in step 208.
Judge whether this grouping has been carried the detailed process of fresh information and be: suppose before receiving this grouping, this intermediate node has been received a grouping of belonging to the same generation with this grouping altogether, wherein, (coding vector that encapsulates in the individual packet header of b≤d) is a linear independence to total b, then receive after this grouping, a+1 altogether of vector in coding vector in this packet header and the original packet header if there be b+1 SYSTEM OF LINEAR VECTOR irrelevant in this a+1 vector, then claims this grouping to carry fresh information.
Step 207: intermediate node is saved in this grouping in the spatial cache, goes to step 209.
Step 208: intermediate node abandons this grouping, execution in step 209.
Step 209: one of intermediate node goes out to link to obtain a send opportunity, intermediate node carries out once linear combination at random with in the spatial cache all when the packaged data block of grouping of former generation, generate a data block, and the coding vector in each packet header carried out identical linear combination at random, obtain a new coding vector, the data block of this generation is encapsulated into a grouping, that will work as former generation inserts this packet header for the new coding vector of numbering and obtain, and will divide into groups then to send from the link that send opportunity is arranged.
Intermediate node receives when first belongs to follow-on grouping when former generation, empty in the buffer memory when the former generation grouping, enter the process of transmitting of grouping of future generation, that is: after this next generation becomes the new former generation of working as, if receive former grouping again, directly abandon later on, no longer handle when former generation.
Step 210: destination node is received the multicast grouping of carrying the generation numbering that intermediate node is sent, according to preserved with corresponding all groupings of this numbering in generation in coding vector and this grouping in coding vector, judging whether can be to the multicast packet decoding success in corresponding generation of this generation numbering, if, grouping to this generation is decoded, and the original data block that obtains is sent to upper layer entity; Otherwise, continue to wait for next multicast grouping.
Particularly, number in the multicast grouping in corresponding generation with this generation if destination node is paid-in, comprise the coding vector of d linear independence, then destination node is definite can be to this generation multicast packet decoding success.
As can be seen, source node is to continue sum or generation and send and continue the duration judgement according to being sent to the generation that the minimum value in the max-flow of each destination node calculates by source node when judging whether to change over to new transmission when the former generation grouping.In fact, what per generation multicast groupings source node continues to send after or after continuing to send per generation multicast grouping of how many durations, changes the transmission of multicast grouping of future generation again over to, is a key factor of decision systems performance.If it is too much to continue per generation multicast packet count of transmission, can cause the waste of bandwidth, and the per generation multicast packet count that continues to send is crossed the reliability decrease that can cause system at least, even cause destination node to be correctly decoded.And in the multicast packet transmission, network condition is constantly to change, and source node also will change to the minimum value in the max-flow of each destination node thereupon in the network, and source node should be adjusted for sending and continue sum this moment.And in the prior art, in case determine for behind lasting transmission sum or lasting transmission of the generation duration to the minimum value in the max-flow of each destination node according to the source node that obtains in the structure multicast logical sub topology, in generation, continues to send sum or will no longer change for continuing to send duration, this just can't adapt to network change, has reduced multicast transmission efficiency.
Summary of the invention
The embodiment of the invention provides method and source node and the destination node of raising based on the multicast transmission efficiency of random coded network, to improve multicast transmission efficiency.
The technical scheme of the embodiment of the invention is achieved in that
A kind of method that improves based on the multicast transmission efficiency of random network code comprises:
Source node receives the decoded result signaling that each destination node is decoded to generation multicast grouping, and described decoded result signaling be successful signaling of decoding when successfully decoding or the successful signaling of non-decoding can not successfully decode the time;
Source node is according to described decoded result signaling, and the generation of adjusting described multicast grouping sends and continues width;
Source node sends according to adjusted generation and continues width, sends the multicast grouping of suceeding generation.
A kind of source node that improves based on the efficiency of transmission of random network code, this source node comprises:
Decoded result signaling receiver module, receive the decoded result signaling that each destination node is decoded to generation multicast grouping, described decoded result signaling is decoding success signaling when successfully decoding or the successful signaling of non-decoding can not successfully decode the time, the decoded result signaling is sent to generation send and continue the width adjustment module;
In generation, sends and continues the width adjustment module, and according to the decoded result signaling that decoded result signaling receiver module is sent, the generation of adjusting the multicast grouping sends and continues width, sends according to adjusted generation to continue width, carries out the transmission of multicast grouping of future generation.
A kind of destination node that improves based on the efficiency of transmission of random network code, this destination node comprises:
Average received rate calculations module is calculated the place of place destination node and is gone into to link to receive each average received speed for the multicast grouping;
Decoder module, when multicast divides into groups successfully to decode to a generation, take out each average received speed from respectively going into to the average received rate calculations module of link of place destination node,, gained and value be carried in the successful signaling of decoding send to source node each average received speed addition.
A kind of destination node that improves based on the efficiency of transmission of random network code, this destination node comprises:
In generation, divided group of received number counting module, the place destination node received each count for the number of multicast grouping;
Decoder module when multicast divides into groups successfully to decode to a generation, takes out the number that has received this generation multicast grouping the branchs group of received number counting module from the generation of place destination node, this number is carried in the successful signaling of decoding sends to source node.
Compared with prior art, in the embodiment of the invention, destination node is to the success of a generation multicast packet decoding time, and the successful signaling of will decoding feeds back to source node; When failing to a generation that multicast divides into groups successfully to decode, then the successful signaling of non-decoding is fed back to source node, make source node can in time learn the network condition of multicast transmission, thereby the lasting width of generation transmission of multicast grouping is in time adjusted, thereby improved multicast transmission efficiency.
Description of drawings
Fig. 1 is the network topology schematic diagram that existing network code improves network throughput;
Fig. 2 is existing multicast flow chart based on random network code;
Fig. 3 is the existing structural representation that divides into groups based on the multicast of random network code;
The raising that Fig. 4 provides for the embodiment of the invention one is based on the flow chart of the multicast transmission efficiency of random network code;
The raising that Fig. 5 provides for the embodiment of the invention two is based on the flow chart of the multicast transmission efficiency of random network code;
The raising that Fig. 6 provides for the embodiment of the invention one is based on system's composition diagram of the multicast transmission efficiency of random network code;
The raising that Fig. 7 provides for the embodiment of the invention three is based on the flow chart of the multicast transmission efficiency of random network code;
The raising that Fig. 8 provides for the embodiment of the invention four is based on the flow chart of the multicast transmission efficiency of random network code;
The raising that Fig. 9 provides for the embodiment of the invention three is based on system's composition diagram of the multicast transmission efficiency of random network code.
Embodiment
The present invention is further described in more detail below in conjunction with drawings and the specific embodiments.
For the purpose of convenient the description, at first provide the definition of the employed major technique term of the embodiment of the invention:
The data volume register: destination node is gone into to data volume register of link maintenance for each bar of oneself, is used to write down each length C for the multicast grouping that this link is received
In generation, numberThis length is used for each the reception duration T for the multicast grouping with timer record
In generation, numberTogether, estimate that source node was to the average max-flow V of this destination node when this link received per generation multicast grouping
In generation, number
Timer: destination node is gone into to timer of link maintenance for each bar of oneself, is used to write down this link and receives the used duration T of per generation multicast grouping
In generation, numberThe length C of this generation multicast grouping that this link that this duration is used for writing down with the data volume register is received
In generation, numberTogether, estimate that source node was to the average max-flow V of this destination node when this link received per generation multicast grouping
In generation, number
The average received speed recorder: destination node is gone into to average received speed recorder of link maintenance for oneself each bar, in this register with V
In generation, numberForm storing average received speed during this link receives the multicast grouping of per generation, wherein, V
In generation, number=C
In generation, number/ T
In generation, number
The successful signaling of decoding: destination node divides into groups after the successfully decoding for multicast to certain, to source node feedback decoding success signaling.
The not enough signaling of amount of information: destination node if finish former when former generation to new when former generation change, still to former when the former generation multicast successfully decoding of divide into groups, then indicate the amount of information deficiency signaling of decoding not successful to the source node transmission.
The raising that Fig. 4 provides for the embodiment of the invention one is based on the flow chart of the multicast transmission efficiency of random network code, and as shown in Figure 4, its concrete steps are as follows:
Step 401: source node is at clock of self maintained, and the initial value of establishing clock is 0, and initialization continues duration Δ t=d*l/h for sending.
Wherein, l is the length of each multicast grouping, and h is the minimum value of source node in the max-flow of all destination nodes in the multicast logical sub topology.
In this step, source node also can not safeguarded a clock, and safeguard a counter, and begin to send each for the multicast grouping before, this counter is initialized as 0, multicast grouping of the every transmission of source node after this, the value of counter adds 1, and the source node initialization continues to add up to d* (H/h) for transmission, wherein, H be source node all go out speed summation to link.
Step 402: destination node is that self every goes into to link to safeguard a data volume register, a timer and an average received speed recorder respectively, and the initial value C of setting data amount register
m=0, the initial value T of timer
m=0, the initial value V of average received speed recorder
m=0, wherein, m represents generation numbering, initialization m=1.
Step 403: source node sends first multicast grouping when former generation, starts clock.
Step 404: destination node goes into to link to receive a multicast grouping that the generation numbering m according in this multicast grouping judges this goes into whether preserved V in the receiving velocity register of link from one
mIf,, execution in step 405; Otherwise, execution in step 406.
Step 405: destination node is when receiving this multicast grouping, with the C that has preserved in the data volume register
mAdd the length of this multicast grouping, replace C with value with what obtain
m, calculate the C after this replacement then
mClocking value T with timer
mValue V after being divided by
m, with this V
mValue is replaced the V that has preserved in the average received speed recorder
mValue, go to step 407.
Step 406: destination node restarts timer and picks up counting, and when this multicast grouping receives, writes down the length C of this multicast grouping
m, calculate V
m=C
m/ T
m, wherein, T
mBe the clocking value of timer, with this V
mBe recorded in this and go in the average received speed recorder of link, then with described C
mBeing recorded in this goes in the data volume register of link.
Step 407: destination node judges whether and can successfully decode for m to this multicast grouping place, if, execution in step 408; Otherwise, execution in step 409.
Step 408: destination node goes into to the average received speed recorder of link to take out V respectively from self every
m, with all V that take out
mAddition, with gained with value put into the decoding successful signaling, this signaling is sent to source node by singlecast router mechanism, and goes into to the average received speed recorder of link to remove V from every
m, go into to the data volume register of link to remove C from every
m, go to step 412.
Step 409: destination node judges self whether to have finished m generation to the m+1 conversion in generation, if, execution in step 410; Otherwise, execution in step 411.
If all of destination node go into to link to have received that all m+1 divides into groups for multicast, go into to link to have received that m+2 divides into groups for multicast perhaps that then destination node determines self to have finished m generation to the m+1 conversion in generation for existing one.
Step 410: destination node is according to the coding vector in the multicast grouping in all m generation that has received, calculate the coding vector that successfully decoding also needs, the coding vector that calculates is carried in the not enough signaling of amount of information sends to source node, and go into to the average received speed recorder of link to remove V from every
m, go into to the data volume register of link to remove C from every
m, go to step 412.
Step 411: destination node is waited for next multicast grouping, goes to step 404.
Step 412: source node receives the control signaling that destination node is sent, and judges that this signaling still is the not enough signaling of amount of information for the successful signaling of decoding, if decode successful signaling, and execution in step 414; If the not enough signaling of amount of information, execution in step 413.
Step 413: source node is according to the generation numbering of carrying in the not enough signaling of amount of information, from self taking out and the corresponding original data block of this generation numbering, coding vector and the original data block that the decoding of carrying in the not enough signaling of this amount of information is successfully also needed multiplies each other respectively then, each data block that obtains is put into a multicast grouping, each multicast grouping is sent to destination node by singlecast router mechanism.
Step 414: source node judges whether to collect all destination nodes send the m control signaling in generation: the not enough signaling of successful signaling or the amount of information of decoding, if, execution in step 416; Otherwise, execution in step 415.
Step 415: source node continues to wait for next control signaling, goes to step 412.
Step 416: source node judges whether that the control signaling that all destination nodes are sent all is the successful signaling of decoding, if, execution in step 417; Otherwise, execution in step 418.
Step 417: source node is adjusted the generation transmission and continued duration: Δ t '=d*l/v+k* (l/H) goes to step 419.
Wherein, Δ t ' sends to continue duration in adjusted generation; D is the number of per generation original data block; L is the length of each multicast grouping, its unit and C
mIdentical; The V of v for being comprised in each successful signaling of decoding
mMinimum value; H is that all of source node go out the speed summation to link; K is a constant, and k 〉=0, and the effect of k is the throughput of balance sysmte and the contradiction between the real-time, when k=0, and the throughput maximum of system, the every increase 1 of k, source node send a multicast grouping with pilosity when transmission multicast of per generation grouping.
If in the step 401, source node sends lasting sum to generation and has carried out initialization, then in this step, source node can further calculate Δ e '=" H* Δ t '/l ", wherein after having adjusted the lasting duration of generation transmission, Δ e ' sends to continue sum in adjusted generation, and " " is the operator that rounds up.
Step 418: source node is adjusted the generation transmission and is continued duration: Δ t '=Δ t* (d/ (d-n))+k* (l/H).
Wherein, Δ t is for send continuing duration when former generation, n for the successful decoding that comprised in the not enough signaling of each amount of information also need the maximum number of coding vector, the implication of all the other each variablees is identical with step 417.
Equally, if in the step 401, source node sends lasting sum to generation and has carried out initialization, then in this step, source node can further calculate Δ e '=" H* Δ t '/l ", wherein after having adjusted the lasting duration of generation transmission, Δ e ' sends to continue sum in adjusted generation, and " " is the operator that rounds up.
Step 419: source node detects clock value and equals Δ t, then determines to finish when former generation multicast grouping process of transmitting, makes Δ t=Δ t '; And send when the next generation of former generation promptly: newly when first multicast of former generation is divided into groups, restart clock, go to step 404.
If in the step 401, source node has carried out initialization to continuing sum for transmission, and then this step is: source node detects Counter Value and equals to adjust the preceding lasting total Δ e of generation transmission, then determines to work as the end of former generation multicast grouping process of transmitting, makes Δ e=Δ e '; And send when the next generation of former generation promptly: newly when first multicast of former generation is divided into groups, restart counter, go to step 404.
Big or source node is in destination node distance multicast logical sub topology far away at network transfer delay, after occurring source node probably and carrying out adjustment that generation send to continue duration Δ t for the control signaling, at the process of transmitting that carries out q+k (k＞1) generation grouping according to q.Like this, before receiving that q+k is for the control signaling, source node also will be received q+1 to the q+k-1 control signaling in generation, and obviously these control signalings can not reflect the reception condition of adjusted destination node, so can not control signaling according to these and carry out the adjustment that generation sends lasting duration.Below provide the present invention and realize dynamically adjusting the embodiment two that sends lasting duration:
The raising that Fig. 5 provides for the embodiment of the invention two is based on the flow chart of the multicast transmission efficiency of random network code, and as shown in Figure 5, its concrete steps are as follows:
Step 501～511 are identical with step 401～411.
Step 512: source node is received the control signaling that destination node is sent, and judges whether this control signaling is the not enough signaling of amount of information, if, execution in step 513; Otherwise, execution in step 514.
Step 513: source node multiplies each other coding vector and the original data block that the decoding of carrying in the not enough signaling of this amount of information successfully also needs respectively, each data block that obtains is put into a multicast grouping, each multicast grouping is sent to destination node by singlecast router mechanism.
Step 514: it is identical for numbering n that source node judges whether the generation numbering in this control signaling has write down with self, if, execution in step 515; Otherwise, continue to wait for next control signaling, go to step 512.
Step 515: source node judges whether to collect the corresponding control signaling of generation numbering n that all destination nodes are sent with write down, if, execution in step 517; Otherwise, execution in step 516.
Step 516: source node continues to wait for next control signaling, goes to step 512.
Step 517: source node judges whether that all control signalings all are the successful signaling of decoding, if, execution in step 518; Otherwise, execution in step 519.
Step 518: source node is adjusted the generation transmission and is continued duration: Δ t '=d*l/v+k* (l/H), and upgrades n=p+1, goes to step 520.
Wherein, the implication of each variable in the computing formula of Δ t ' is identical with step 417, and p is the generation numbering in generation under the multicast grouping that sending of source node.
Step 519: source node is adjusted the generation transmission and is continued duration: Δ t '=Δ t* (d/ (d-n))+k* (l/H), and upgrade n=p+1.
Wherein, the implication of each variable in the computing formula of Δ t ' is identical with step 418, and p is the generation numbering in generation under the multicast grouping that sending of source node.
Step 520: source node detects clock value and equals Δ t, then determines to finish when former generation multicast grouping process of transmitting, makes Δ t=Δ t '; And send when the next generation of former generation promptly: newly when first multicast of former generation is divided into groups, restart clock, go to step 504.
The raising that Fig. 6 provides for the embodiment of the invention one is based on system's composition diagram of the multicast transmission efficiency of random network code, and as shown in Figure 6, it mainly comprises: destination node and source node, wherein:
Destination node comprises: average received rate calculations module 61, decoder module 62 and disappearance coding vector computing module 63, go into to the corresponding average received rate calculations module 61 of link for one of a destination node, each destination node has a decoder module 62 and a disappearance coding vector computing module 63, and the function of each module is specific as follows:
Average received rate calculations module 61: calculate the place and go into to link to receive each average received speed for the multicast grouping.
Decoder module 62: receive the multicast grouping, judge whether and to divide into groups successfully to decode to this multicast, if, then from going into the average received speed that receives this generation multicast grouping to link with every of to each corresponding average received rate calculations module 61 of link, obtaining the place destination node of respectively going into of place destination node, each average received speed addition is obtained the average received speed that this destination node receives this generation multicast grouping, and the average received speed that this destination node is received this generation multicast grouping sends to source node; Otherwise, judge whether to finish from this multicast grouping place generation to follow-on conversion, if finish, then the generation numbering with this multicast grouping place generation sends to disappearance coding vector computing module 63, receive this generation multicast grouping of successful decoding that disappearance coding vector computing module 63 sends also need coding vector, this coding vector is carried in the amount of information deficiency signaling sends to source node; If do not finish, then continue to wait for the next multicast grouping in this generation.
Disappearance coding vector computing module 63: be used in generation that receives that decoder module 62 sends after the numbering, what received according to the place destination node numbers corresponding multicast grouping with this generation, calculate the coding vector that this generation multicast grouping of successfully decoding also needs, this coding vector is sent to decoder module 62.
Source node comprises: in decoded result signaling receiver module 64 and generation, send and continue duration adjusting module 65, wherein:
Decoded result signaling receiver module 64: receive decoding success signaling and the not enough signaling of amount of information that each destination node is sent, the not enough signaling of the successful signaling of should decoding or amount of information sends to the generation transmission and continues duration adjusting module 65.
In generation, sends and continues duration adjusting module 65: receive decoding success signaling and the not enough signaling of amount of information that decoded result signaling receiver module 64 is sent, when determining to have collected the decoded result signaling that destination node is sent: after the not enough signaling of successful signaling and/or the amount of information of decoding at generation multicast grouping, judge whether the decoded result signaling at this generation multicast grouping that destination node is sent all is the successful signaling of decoding, if, according to the average received speed of each destination node in each successful signaling of decoding, adjust when the lasting duration of former generation transmission; Otherwise the number of the coding vector that also needs according to the successful decoding in the not enough signaling of each amount of information is adjusted when the lasting duration of former generation transmission.Continue duration according to adjusted generation transmission, carry out the transmission of multicast grouping of future generation.
In generation, sends lasting duration adjusting module 65 and also can replace for sending lasting total adjusting module, in generation, sends lasting total adjusting module and is used for, receive decoding success signaling or the not enough signaling of amount of information that decoded result signaling receiver module 64 is sent, when determining to have collected the decoded result signaling that destination node is sent: after the not enough signaling of successful signaling or the amount of information of decoding at generation multicast grouping, judge whether the decoded result signaling at this generation multicast grouping that destination node is sent all is the successful signaling of decoding, if, according to the average received speed of each destination node in each successful signaling of decoding, adjust when the lasting sum of former generation transmission; Otherwise the number of the coding vector that also needs according to the successful decoding in the not enough signaling of each amount of information is adjusted and is sent lasting total when former generation.Continue sum according to adjusted generation transmission, carry out the transmission of multicast grouping of future generation.
As shown in Figure 6, average received rate calculations module 61 mainly comprises: block length logging modle 611, reception duration timing module 612 and average receiving velocity determination module 613, wherein:
Block length logging modle 611: be used to write down the place and go into each the length that receives to link for the multicast grouping.
Receive duration timing module 612: be used for the place is gone into to receive each to link and carry out timing for duration that the multicast grouping is spent.
Average received speed determination module 613: when whenever receiving multicast grouping of a generation, calculate the merchant of this generation multicast block length and the clocking value that receives this generation multicast grouping in the duration timing module 612 in the block length logging modle 611, upgrade the average received rate value of this generation multicast grouping of self preserving with this quotient.
As shown in Figure 6, source node also can comprise: adjust for number record module 66, be used to write down adjust generation send continue duration institute at generation of multicast grouping number.
And, in generation, sends lasting duration adjusting module 65 and adjusting after former generation sends lasting duration, obtain the generation numbering of the current multicast grouping that is sending, determine the generation numbering of the multicast grouping of future generation that will send, should be follow-on generation number record adjustment for number record module 66 in.
And, generation send to continue duration adjusting module 65 determine to have collected destination node sends at record in adjusting for number record module 66 generation numbering the decoded result signaling of multicast grouping: after the not enough signaling of successful signaling and/or the amount of information of decoding, according to the corresponding decoded result signaling of this numbering in generation adjust with this generation numbering corresponding generation for the lasting duration of transmission.
The raising that Fig. 7 provides for the embodiment of the invention three is based on the flow chart of the multicast transmission efficiency of random network code, and as shown in Figure 7, its concrete steps are as follows:
Step 701: the source node initialization continues to add up to D=d* (H/h) for transmission.
Step 702: destination node is that each that receive is safeguarded a pickup contracture group number counter N respectively for multicast grouping
M, i, and initialization N
M, i=0.
Wherein, m is the generation numbering, and i is the destination node numbering.
Step 703: source node determines to send the multicast grouping, whether judges the multicast grouping number of working as former generation that has sent less than D, if, execution in step 705; Otherwise, execution in step 704.
Step 704: source node will be worked as the next generation of former generation as the new former generation of working as.
Step 705: source node structure multicast grouping, and send.
Step 706: destination node i goes into to link to receive a multicast grouping that the generation numbering m that carries in dividing into groups according to this multicast will be from the N that safeguards for the multicast grouping as m from one
M, iBe adjusted into: N
M, i=N
M, i+ 1.
Step 707: destination node i judges whether and can successfully decode for m to this multicast grouping place, if, execution in step 708; Otherwise, execution in step 709.
Step 708: destination node i will carry N
M, iDecoding success signaling be sent to source node, go to step 712.
Step 709: destination node i judges self whether to have finished m generation to the m+1 conversion in generation, if, execution in step 710; Otherwise, execution in step 711.
Step 710: destination node i calculates the also coding vector of need of successfully decoding, with coding vector and the N that calculates according to the coding vector in the multicast grouping in all m generation that has received
M, iBe carried in the not enough signaling of amount of information and send to source node, go to step 712.
Step 711: destination node i waits for next multicast grouping, goes to step 706.
Step 712: source node receives the control signaling that destination node i sends, and judges that this signaling still is the not enough signaling of amount of information for the successful signaling of decoding, if decode successful signaling, and execution in step 714; If the not enough signaling of amount of information, execution in step 713.
Step 713: source node is according to the generation numbering of carrying in the not enough signaling of amount of information, from self taking out and the corresponding original data block of this generation numbering, coding vector and the original data block that the decoding of carrying in the not enough signaling of this amount of information is successfully also needed multiplies each other respectively then, each data block that obtains is put into a multicast grouping, each multicast grouping is sent to destination node i by singlecast router mechanism.
Step 714: source node judges whether to collect all destination nodes send the m control signaling in generation: the not enough signaling of successful signaling or the amount of information of decoding, if, execution in step 716; Otherwise, execution in step 715.
Step 715: source node continues to wait for next control signaling, goes to step 712.
Step 716: source node judges whether that the control signaling that all destination nodes are sent all is the successful signaling of decoding, if, execution in step 717; Otherwise, execution in step 718.
Step 717: source node is adjusted the generation transmission and is continued sum: D=D-1 or D=Max (N
M, i), this flow process finishes.
Wherein, maximum is got in Max () expression.
Step 718: source node is adjusted the generation transmission and is continued sum: D=D+Max (R
M,, i) or D=D*Max (d/ (d-R
M,, i)) or D=D*Max ((N
M, i+ R
M,, i)/N
M, i).
Wherein, R
M,, iRepresent the number that carries the coding vector that successfully also needs for the decoding of carrying in the not enough signaling of the amount of information of numbering m that i destination node sent.
The raising that Fig. 8 provides for the embodiment of the invention four is based on the flow chart of the multicast transmission efficiency of random network code, and as shown in Figure 8, its concrete steps are as follows:
Step 801～811 are identical with step 701～711.
Step 812: source node is received the control signaling that destination node is sent, and judges whether this control signaling is the not enough signaling of amount of information, if, execution in step 813; Otherwise, execution in step 814.
Step 813: source node multiplies each other coding vector and the original data block that the decoding of carrying in the not enough signaling of this amount of information successfully also needs respectively, each data block that obtains is put into a multicast grouping, each multicast grouping is sent to destination node by singlecast router mechanism.
Step 814: it is identical for numbering n that source node judges whether the generation numbering in this control signaling has write down with self, if, execution in step 815; Otherwise, execution in step 816.
Step 815: source node judges whether to collect the corresponding control signaling of generation numbering n that all destination nodes are sent with write down, if, execution in step 817; Otherwise, execution in step 816.
Step 816: source node continues to wait for next control signaling, goes to step 812.
Step 817: source node judges whether that all control signalings all are the successful signaling of decoding, if, execution in step 818; Otherwise, execution in step 819.
Step 818: source node is adjusted the generation transmission and is continued sum: D=D-1 or D=Max (N
M, i), this flow process finishes.
Wherein, maximum is got in Max () expression.
Step 819: source node is adjusted the generation transmission and is continued sum: D=D+Max (R
M,, i) or D=D*Max (d/ (d-R
M,, i)) or D=D*Max ((N
M, i+ R
M,, i)/N
M, i).
Wherein, R
M,, iRepresent the number that carries the coding vector that successfully also needs for the decoding of carrying in the not enough signaling of the amount of information of numbering m that i destination node sent.
The raising that Fig. 9 provides for the embodiment of the invention three is based on system's composition diagram of the multicast transmission efficiency of random network code, and as shown in Figure 9, it mainly comprises: destination node and source node, wherein:
Destination node comprises: for branch group of received number counting module 91, decoder module 92, disappearance coding vector computing module 93, destination node correspondence generation branch group of received number counting module 91, each destination node has a decoder module 92 and a disappearance coding vector computing module 93, and the function of each module is specific as follows:
Generation branchs group of received number counting module 91: statistics place destination node receives number that each divides into groups for multicast.
Decoder module 92: receive the multicast grouping, judge whether and to divide into groups successfully to decode to this multicast, if, then obtain generation the branchs group of received number that the place destination node receives this generation multicast grouping the branchs group of received number counting module 91 from the generation of place destination node, this number and generation are numbered to be carried in the successful signaling of decoding send to source node; Otherwise, judge whether to finish from this multicast grouping place generation to follow-on conversion, if finish, then from the generation of place destination node obtain the branchs group of received number counting module 91 the place destination node receive this generation multicast grouping for branch group of received number, and to lacking the generation numbering that coding vector computing module 93 sends this generation multicast grouping, receive the coding vector that this generation multicast grouping of successful decoding that disappearance coding vector computing module 93 sends also needs, this number, this coding vector and generation are numbered to be carried in the amount of information deficiency signaling send to source node; If do not finish, then continue to wait for the next multicast grouping in this generation.
Disappearance coding vector computing module 93: be used in generation that receives that decoder module 92 sends after the numbering, what received according to the place destination node numbers corresponding multicast grouping with this generation, calculate the coding vector that this generation multicast grouping of successfully decoding also needs, this coding vector is sent to decoder module 92.
Source node comprises: in decoded result signaling receiver module 94 and generation, send and continue total adjusting module 95, wherein:
Decoded result signaling receiver module 94: receive decoding success signaling and the not enough signaling of amount of information that each destination node is sent, the not enough signaling of the successful signaling of should decoding or amount of information sends to the generation transmission and continues total adjusting module 95.
In generation, sends and continues total adjusting module 95: receive decoding success signaling or the not enough signaling of amount of information that decoded result signaling receiver module 94 is sent, when determining to have collected the decoded result signaling that destination node is sent: after the not enough signaling of successful signaling or the amount of information of decoding at generation multicast grouping, judge whether the decoded result signaling at this generation multicast grouping that destination node is sent all is the successful signaling of decoding, if, according to this branch group of received number of each destination node in each successful signaling of decoding in generation, adjust when former generation sends and continue sum; Otherwise in the number and/or the generation of the coding vector that also needs according to the successful decoding in the not enough signaling of each amount of information, divided the group of received number, adjust to send lasting total when former generation.Continue sum according to adjusted generation transmission, carry out the transmission of multicast grouping of future generation.
In addition, the source node in the present embodiment also can comprise: adjust for number record module 96, be used to write down adjust generation send continue sum institute at generation of multicast grouping number.
And, in generation, sends lasting total adjusting module 95 and adjusting after former generation sends lasting sum, obtain the generation numbering of the current multicast grouping that is sending, determine the generation numbering of the multicast grouping of future generation that will send, should be follow-on generation number record adjustment for number record module 96 in.
And, generation send to continue total adjusting module 95 determine to have collected destination node sends at record in adjusting for number record module 96 generation numbering the decoded result signaling of multicast grouping after, according to adjusting with the generation transmission in this generation numbering corresponding generation lasting total with the corresponding decoded result signaling of this numbering in generation.
From Fig. 4～6 illustrated embodiments as can be seen, when all destination nodes can divide into groups successfully to decode to the multicast of certain generation, source node receives the minimum receiving velocity that this generation multicast is divided into groups according to each destination node, reduces the generation transmission and continues duration, thereby reduced the transmission that redundant multicast divides into groups; When having only the part destination node or can divide into groups successfully to decode to certain generation multicast without any destination node, the number of the maximum coding vector that the successful decoding that source node is then sent according to each destination node that can not successfully decode also needs, increase the generation transmission and continue duration, thereby improved the probability of successful decoding, improved the multicast transmission reliability.
From Fig. 7～9 illustrated embodiments as can be seen, when all destination nodes can divide into groups successfully to decode to the multicast of certain generation, source node receives the number that this generation multicast is divided into groups according to each destination node, and it is lasting total to reduce the generation transmission, thereby has reduced the transmission of redundant multicast grouping; When having only the part destination node or can divide into groups successfully to decode to certain generation multicast without any destination node, the successful decoding that source node is then sent according to each destination node that can not successfully decode also the maximum coding vector of need number and/or receive the number that this generation multicast is divided into groups, increase the generation transmission and continue duration, thereby improved the probability of successful decoding, improved the multicast transmission reliability.
In the embodiment of the invention, will be for sending lasting duration and can being referred to as the lasting width of generation transmission for sending lasting number.
The above only is process of the present invention and method embodiment, in order to restriction the present invention, all any modifications of being made within the spirit and principles in the present invention, is not equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (21)
1. a raising is characterized in that based on the method for the multicast transmission efficiency of random network code, comprising:
Source node receives the decoded result signaling that each destination node is decoded to generation multicast grouping, and described decoded result signaling be successful signaling of decoding when successfully decoding or the successful signaling of non-decoding can not successfully decode the time;
Source node is according to described decoded result signaling, and the generation of adjusting described multicast grouping sends and continues width,
It is that the generation transmission continues duration or the generation transmission continues number that described generation sends lasting width.
2. the method for claim 1 is characterized in that, described source node further comprises before receiving the successful signaling of decoding:
Destination node goes into to link to receive multicast grouping from one, calculates this and goes into the average received speed that receives the multicast grouping in this multicast grouping place generation to link;
And, when destination node when multicast divides into groups successfully to decode to a generation, destination node calculate self all go into to link receive this generation multicast grouping average received speed and, with this average received speed be carried in the successful signaling of decoding and send to source node.
3. method as claimed in claim 2 is characterized in that,
In the generation that described source node is adjusted described multicast grouping, sends and continues width and be: when source node is determined to have collected when all destination nodes send at the decoding success signaling of generation multicast grouping, then according to the average received speed in each successful signaling of decoding with adjust generation and send and continue width.
4. method as claimed in claim 2 is characterized in that, described generation sends lasting width to be represented with duration,
The lasting width of generation transmission that described source node is adjusted the multicast grouping comprises:
Source node calculates Δ t '=d*l/v+k* (l/H),
Wherein, Δ t ' sends to continue width in adjusted generation; D is the number of per generation original data block; L is the length of each multicast grouping; V for the average received speed in each successful signaling of decoding and in minimum value; H is that all of source node go out the speed summation to link; K is a constant, and k 〉=0, and the effect of k is the throughput of balance sysmte and the contradiction between the real-time, when k=0, and the throughput maximum of system, the every increase 1 of k, source node send a multicast grouping with pilosity when transmission multicast of per generation grouping.
5. the method for claim 1 is characterized in that, described source node further comprises before receiving the successful signaling of non-decoding:
Destination node is determined can not be to the generation multicast successfully decoding of divide into groups, calculates successfully decode this generation multicast grouping also need coding vector, with this successfully decode also need coding vector be carried in the successful signaling of non-decoding and send to source node.
6. method as claimed in claim 5 is characterized in that,
The generation that described source node is adjusted described multicast grouping sends and continues width and be: determine to have collected when all destination nodes send at the decoded result signaling of generation multicast grouping when source node, then the coding vector that also needs according to the successful decoding in the successful signaling of each non-decoding is adjusted the lasting width of generation transmission.
7. method as claimed in claim 5 is characterized in that, described generation sends lasting width to be represented with duration,
The lasting width of generation transmission that described source node is adjusted the multicast grouping comprises:
Source node calculates Δ t '=Δ t* (d/ (d-n))+k* (l/H),
Wherein, Δ t ' sends to continue width in adjusted generation; Δ t sends to continue width in current generation, and d is the number of per generation original data block; N is the successful decoding of carrying in the successful signaling of each the non-decoding maximum number of the coding vector of need also, and l is the length that each multicast is divided into groups; H is that all of source node go out the speed summation to link; K is a constant, and k 〉=0, and the effect of k is the throughput of balance sysmte and the contradiction between the real-time, when k=0, and the throughput maximum of system, the every increase 1 of k, source node send a multicast grouping with pilosity when transmission multicast of per generation grouping.
8. method as claimed in claim 5 is characterized in that, described generation sends lasting width to be represented with number,
The lasting width of generation transmission that described source node is adjusted the multicast grouping comprises:
Source node calculates D=D+Max (R
M,, i) or D=D*Max (d/ (d-R
M,, i));
Wherein, D sends to continue width in generation; R
M,, iThe number of representing the coding vector that the decoding at carrying in the successful signaling of non-decoding of m for the multicast grouping that i destination node send successfully also needs; D is the number of original data block; Maximum is got in Max () expression.
9. the method for claim 1 is characterized in that, described source node further comprises before receiving the successful signaling of decoding:
Destination node receives the multicast grouping, calculate the number of the multicast grouping that self has received this multicast grouping place generation, and when determining that multicast divide into groups successfully to decode to a generation, the number that this destination node has been received this generation multicast grouping is carried in the successful signaling of decoding and sends to source node.
10. method as claimed in claim 9 is characterized in that,
The generation that described source node is adjusted the multicast grouping sends and continues width and be: when source node is determined to have collected when all destination nodes send at the decoding success signaling of generation multicast grouping, in adjust described multicast grouping according to the number that receives this generation multicast grouping that carries in each successful signaling of decoding generation, sends and continues width.
11. method as claimed in claim 9 is characterized in that, described generation sends lasting width to be represented with number,
The generation that described source node is adjusted the multicast grouping sends and continues width and comprise: source node sends the maximum of the number that receives this generation multicast grouping that carries in each successful signaling of decoding and continues width as adjusted generation.
12. the method for claim 1 is characterized in that, described source node further comprises before receiving the successful signaling of non-decoding:
Destination node receives multicast grouping, calculates the number of the multicast grouping that self has received this multicast grouping place generation;
When destination node can not divide into groups successfully to decode to generation multicast, calculate the coding vector that this multicast grouping of successfully decoding also needs in generation, the number that this is successfully decoded the coding vector that also needs and has received this generation multicast grouping is carried in the successful signaling of non-decoding and sends to source node.
13. method as claimed in claim 12 is characterized in that,
The generation that described source node is adjusted the multicast grouping sends and continues width and be: when source node is determined to have collected when all destination nodes send at the decoded result signaling of generation multicast grouping, coding vector that also needs according to the successful decoding of carrying in the successful signaling of each non-decoding and the number that has received this generation multicast grouping are adjusted for the lasting width of transmission.
14. method as claimed in claim 12 is characterized in that, described generation sends lasting width to be represented with number,
The lasting width of generation transmission that described source node is adjusted the multicast grouping comprises:
Source node calculates D=D*Max ((N
M, i+ R
M,, i)/N
M, i);
Wherein, D sends to continue width in generation; R
M,, iThe number of representing the coding vector that the decoding at carrying in the successful signaling of non-decoding of m for the multicast grouping that i destination node send successfully also needs; N
M, iRepresent that i destination node send at the number that receives this generation multicast grouping that carries in the successful signaling of non-decoding of m for the multicast grouping; D is the number of original data block; Maximum is got in Max () expression.
15. the method for claim 1 is characterized in that, described source node is adjusted further comprising of multicast grouping after sending lasting width: in the follow-on generation in generation, identified under the multicast that the source node record is sending was divided into groups;
The generation that described source node is adjusted the multicast grouping sends and continues width and comprise: source node is sent according to destination node and the corresponding decoded result signaling of generation sign that write down, in adjust the multicast grouping generation, send lasting width.
16. a raising is characterized in that based on the source node of the efficiency of transmission of random network code this source node comprises:
Decoded result signaling receiver module, receive the decoded result signaling that each destination node is decoded to generation multicast grouping, described decoded result signaling is decoding success signaling when successfully decoding or the successful signaling of non-decoding can not successfully decode the time, the decoded result signaling is sent to generation send and continue the width adjustment module;
In generation, sends and continues the width adjustment module, and according to the decoded result signaling that decoded result signaling receiver module is sent, the generation of adjustment multicast grouping sends and continues width, and it is to send in generation to continue duration or continue number for sending that described generation transmission continues width.
17. source node as claimed in claim 16 is characterized in that, described source node further comprises:
Adjustment is for the identification record module, be used to write down adjust generation send continue width institute at generation identify;
In described generation, sends and continues the width adjustment module after determining to have collected the decoded result signaling that destination node sends at the multicast grouping in generation sign corresponding generation of writing down in adjusting for the identification record module, according to the corresponding decoded result signaling of this generation sign, in adjust the multicast grouping generation, sends and continues width, adjustment finishes, obtain the generation sign of the current multicast grouping that is sending, according to this in generation sign determine the generation sign of the multicast grouping of future generation that will send, should be follow-on generation identification record adjustment for the identification record module in.
18. a raising is characterized in that based on the destination node of the efficiency of transmission of random network code this destination node comprises:
Average received rate calculations module is calculated the place of place destination node and is gone into to link to receive each average received speed for the multicast grouping;
Decoder module, when multicast divides into groups successfully to decode to a generation, take out each average received speed from respectively going into to the average received rate calculations module of link of place destination node,, gained and value be carried in the successful signaling of decoding send to source node each average received speed addition.
19. destination node as claimed in claim 18, it is characterized in that, this destination node further comprises: disappearance coding vector computing module, receive the generation sign that decoder module is sent, calculate successfully decoding and the multicast in this generation sign corresponding generation also coding vector of need that divides into groups, this coding vector is sent to decoder module;
And, decoder module in the time can not dividing into groups successfully to decode to generation multicast, the generation sign of this generation multicast grouping is sent to disappearance coding vector computing module, receive the coding vector that disappearance coding vector computing module is sent, this coding vector is carried in the successful signaling of non-decoding sends to source node.
20. a raising is characterized in that based on the destination node of the efficiency of transmission of random network code this destination node comprises:
In generation, divided group of received number counting module, the place destination node received each count for the number of multicast grouping;
Decoder module when multicast divides into groups successfully to decode to a generation, takes out the number that has received this generation multicast grouping the branchs group of received number counting module from the generation of place destination node, this number is carried in the successful signaling of decoding sends to source node.
21. destination node as claimed in claim 20, it is characterized in that, this destination node further comprises: disappearance coding vector computing module, receive the generation sign that decoder module is sent, calculate successfully decoding and the multicast in this generation sign corresponding generation also coding vector of need that divides into groups, this coding vector is sent to decoder module;
And, decoder module in the time can not dividing into groups successfully to decode to generation multicast, take out the branchs group of received number counting module from the generation of place destination node and to have received the number that this generation multicast is divided into groups, and the generation sign that will be somebody's turn to do for the multicast grouping sends to disappearance coding vector computing module, receive the coding vector that disappearance coding vector computing module is sent, this coding vector and the described number that has received this generation multicast grouping are carried in the successful signaling of non-decoding send to source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101380794A CN101365150B (en) | 2007-08-08 | 2007-08-08 | Method and node enhancing multicast transmission efficiency based on random network code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101380794A CN101365150B (en) | 2007-08-08 | 2007-08-08 | Method and node enhancing multicast transmission efficiency based on random network code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101365150A CN101365150A (en) | 2009-02-11 |
| CN101365150B true CN101365150B (en) | 2011-08-24 |
Family
ID=40391239
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101380794A Expired - Fee Related CN101365150B (en) | 2007-08-08 | 2007-08-08 | Method and node enhancing multicast transmission efficiency based on random network code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101365150B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP4024911A4 (en) * | 2019-09-23 | 2022-11-23 | Huawei Technologies Co., Ltd. | Multicast transmission control method and related device |
| CN111769907B (en) * | 2020-07-08 | 2021-07-27 | 清华大学 | Data transmission method and device for ad hoc network communication |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1828551A (en) * | 2006-04-13 | 2006-09-06 | 电子科技大学 | High speed synergy emulation method for transaction-grade software and hardware |
-
2007
- 2007-08-08 CN CN2007101380794A patent/CN101365150B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1828551A (en) * | 2006-04-13 | 2006-09-06 | 电子科技大学 | High speed synergy emulation method for transaction-grade software and hardware |
Non-Patent Citations (1)
| Title |
|---|
| JP特开2007-106469A 2007.04.26 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101365150A (en) | 2009-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101621353B (en) | Method, device and system for random linear network encoding | |
| CN100576785C (en) | Forward error correction coding in the Ethernet | |
| JP5442816B2 (en) | Streaming and buffering using variable FEC overhead and protection period | |
| FI106493B (en) | A method and system for reliably transmitting packet data | |
| JP5989346B2 (en) | Data retransmission method and apparatus | |
| CN101436917A (en) | Method and apparatus for encoding and decoding data | |
| CN103023813B (en) | Wobble buffer | |
| CN105450357A (en) | Adjustment method of encoding parameters, adjustment device of encoding parameters, processing method of feedback information and processing device of feedback information | |
| CN102497248B (en) | Data retransmission method based on network coding | |
| US20120185748A1 (en) | Method and Apparatus for Applying Forward Error Correction in 66B Systems | |
| CN101877620B (en) | Method, apparatus and system for forward error correction | |
| CN101826937B (en) | Link layer error control system suitable for next generation mobile Internet and method thereof | |
| CN102223683A (en) | Data transmission method, node and system in wireless sensor network | |
| CN111917512A (en) | High-efficiency coding design method based on BATS code in multi-hop transmission system | |
| CN101325540A (en) | Method and apparatus for improving multicast transmission efficiency based on random network encoding | |
| CN102025448A (en) | Common public radio interface service transmitting/receiving method and device | |
| CN101729194B (en) | Methods, devices and system for coding and decoding data | |
| JPH0897825A (en) | Data transmitter | |
| CN101365150B (en) | Method and node enhancing multicast transmission efficiency based on random network code | |
| CN101207552A (en) | Method for scheduling of data block and network node | |
| CN101312385B (en) | Information encoding and decoding method and apparatus | |
| CN101051880B (en) | Transmitting, receiving and repeating method and its device for data frame | |
| WO2019085634A1 (en) | Method for processing data in ethernet, physical layer chip, and a storage medium | |
| Shacham | Packet recovery and error correction in high-speed wide-area networks | |
| CN100512290C (en) | Method for generating transmission data block |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110824 Termination date: 20190808 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |