CN102148664B - Inter-multicast network coding control method applied to multi-source multi-destination network - Google Patents

Inter-multicast network coding control method applied to multi-source multi-destination network Download PDF

Info

Publication number
CN102148664B
CN102148664B CN 201110099631 CN201110099631A CN102148664B CN 102148664 B CN102148664 B CN 102148664B CN 201110099631 CN201110099631 CN 201110099631 CN 201110099631 A CN201110099631 A CN 201110099631A CN 102148664 B CN102148664 B CN 102148664B
Authority
CN
China
Prior art keywords
node
data
multicast
network
network code
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
Application number
CN 201110099631
Other languages
Chinese (zh)
Other versions
CN102148664A (en
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.)
University of Shanghai for Science and Technology
Original Assignee
University of Shanghai for Science and Technology
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 University of Shanghai for Science and Technology filed Critical University of Shanghai for Science and Technology
Priority to CN 201110099631 priority Critical patent/CN102148664B/en
Publication of CN102148664A publication Critical patent/CN102148664A/en
Application granted granted Critical
Publication of CN102148664B publication Critical patent/CN102148664B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses an inter-multicast network coding control method applied to a multi-source multi-destination network, which comprises that: an intermediate node of the network judges whether inter-multicast network coding is required or not by comparing a transmission gain obtained by direct data storage and forwarding with the transmission gain obtained by the inter-multicast network coding; and simultaneously, the intermediate node judges whether the inter-multicast network coding can be decoded or not according to data information received by exchange with a downstream node of the intermediate node, and selects an optimal multicast group to perform the inter-multicast network coding. By the method, network throughput can be effectively increased, the decoding performance of the inter-multicast network coding is ensured at the same time, and when the bandwidth of a network link is finite, transmission fairness among the multicast groups can be effectively ensured.

Description

Be applied to network code control method between the multicast of a network with sources and a destination
Technical field
What the present invention relates to is network code control method between a kind of multicast that is applied to a network with sources and a destination, intermediate node in network by more simple storage forwarding data transmission gain and carry out the size of the transmission gain after between multicast, network code increases, can judge whether to carry out network code; Simultaneously the data message received of intermediate node and its downstream node clearing house can judge between multicast, whether network code can decode, and how to carry out network code between multicast.
Technical background
In network service, how to maximize information interaction and improve the focus that network throughput is information theory theory and network technology research always.Network coding technique allows nodes to carry out the data fusion coding, compares with being different from traditional Store and forward, can effectively improve the throughput of network.
General communication network is being deposited a plurality of multicast group usually, and a plurality of source nodes and a plurality of destination node are namely arranged.Each multicast group is initiated by a source node, by middle forward node, the data that gather is sent to a plurality of destination nodes.Traditional network code is normally used network coding technique a multicast group inside, and the intermediate node in network can will receive that the data from same source node carry out linear combination, and the Data dissemination of the generation of encode is gone out.Network code in this multicast can improve the throughput of an independent multicast, and improves not contribution for the throughput of whole network integral body.Because depositing a large amount of public middle forward node between a plurality of multicast group, corresponding link bandwidth is public by a plurality of multicast group, and the throughput that its limited link bandwidth has restricted whole network improves.
Network code in traditional multicast can be regarded as network code between a kind of special multicast.When in network only have a multicast time, between multicast, network code will be degenerated to network code in multicast.Relatively play traditional multicast Intranet network coding, between multicast, network code is more complicated.The multicast group of How to choose coding and the decodability that guarantees network code between multicast are mainly the studying a question of network code between multicast.
Summary of the invention
The object of the invention is to for how the problem of application network coding techniques between a plurality of multicast group, the control method of network code between a kind of multicast that is applied to a network with sources and a destination has been proposed, the method can improve the throughput that link utilization increases network, and guarantees the network code decodability.
For achieving the above object, design of the present invention is: nodes is when the data of receiving from different multicast group, the transmission gain that the comparison storage forwarding obtains and the size of carrying out the transmission gain that between multicast, network code obtains judge whether to carry out network code between multicast; The data message that intermediate node and the exchange of its downstream node are received, the decoding of network code between the judgement multicast, thus select suitable multicast group, their data are carried out network code between multicast.
According to the foregoing invention design, the present invention adopts following technical proposals:
The control method of network code between a kind of many multicasts that are applied to a network with sources and a destination is characterized in that concrete steps are as follows:
Step 1: initialization, the source node image data in each multicast, and the data packing is sent successively;
Step 2: intermediate node receives the packet from different source nodes;
Step 3: intermediate node carries out the correlation judgement to the packet of receiving: linear independence goes to step 5;
Step 4: receive and have linear correlation between packet, show that the packet of receiving carried out network code, intermediate node first carries out the packet that the network code decoding obtains linear independence;
Step 5: receive linear independence between packet, put it into uncorrelated data queue;
Step 6: intermediate node computes forwards merely the transmission gain that each source node data obtains
Figure 201110099631X100002DEST_PATH_IMAGE001
And the transmission gain that between the transmission multicast, the network code data obtain
Figure 933104DEST_PATH_IMAGE002
Step 7: intermediate node obtains forwarding best source node transmission gain
Figure 201110099631X100002DEST_PATH_IMAGE003
And the transmission gain of network code between best multicast
Figure 611603DEST_PATH_IMAGE004
Step 8: intermediate node is both gains relatively
Figure 972178DEST_PATH_IMAGE003
With Size: forward when transmission gain gains more than or equal to coding transmission and go to step 9, otherwise go to step 10
Step 9: intermediate node does not carry out network code but forwards merely source node
Figure 201110099631X100002DEST_PATH_IMAGE005
Data, return and go to step 2, the above-mentioned steps that so circulates until the data in source node be sent;
Step 10: the information of data is received in intermediate node and the exchange of its downstream node;
Step 11: can the judgement downstream node receive the data for network code decoding between multicast: can receive that the data for decoding go to step 12, otherwise go to step 9;
Step 12: network code transmission gain
Figure 978366DEST_PATH_IMAGE004
When forwarding transmission gain, intermediate node is for from source node With
Figure 541382DEST_PATH_IMAGE006
Data carry out network code between multicast;
Step 13: intermediate node sends the data after coding, return and go to step 2, the above-mentioned steps that so circulates until the data in source node be sent.
Between the multicast of a network with sources and a destination in the present invention, the network code control method compared with prior art, has advantages of:
1, in the method, nodes can according to the data from a plurality of multicast group of receiving, by more directly forwarding and carrying out the transmission gain that between multicast, network code brings, judge whether to carry out network code between multicast, energy maximization network transmission gain, the entire throughput of raising network;
2, in the method nodes by with the downstream node swap data, can select best multicast group to carry out network code between multicast, when improving network throughput, guaranteed the decoding performance of network code between multicast;
3, the method can effectively guarantee the transmission fairness between each multicast group when the network link limited bandwidth.
Description of drawings
Fig. 1 the present invention is applied to the flow chart of network code control method between the multicast of a network with sources and a destination.
In Fig. 2 embodiments of the invention, the transmission of data enters the schematic diagram after intermediate node.
Communication network topology schematic diagram in Fig. 3 embodiments of the invention.
Fig. 4 under the fixed link bandwidth condition, multicast group
Figure 150218DEST_PATH_IMAGE008
With The schematic diagram of transmission rate achievable region.
Fig. 5 adopts transmission of the present invention and conventional store pass-through mode transmission performance schematic diagram relatively under the fixed link bandwidth condition.
Fig. 6 adopts transmission of the present invention and conventional store pass-through mode transmission performance schematic diagram relatively under random link bandwidth condition.
Embodiment
Below in conjunction with accompanying drawing and preferred embodiment, embodiments of the invention are described in further detail.
The present embodiment describes as an example of network topology shown in Figure 3 example.
With
Figure 700541DEST_PATH_IMAGE010
Expression multi-source multi-destination communication network, wherein
Figure 201110099631X100002DEST_PATH_IMAGE011
Node set in the expression network,
Figure 586589DEST_PATH_IMAGE012
Link set in the expression network.
Figure 201110099631X100002DEST_PATH_IMAGE013
With
Figure 928446DEST_PATH_IMAGE014
Represent respectively source node set and destination node set in network.Each source node (
Figure 899945DEST_PATH_IMAGE016
) can send data to corresponding destination node by mulitpath
Figure 201110099631X100002DEST_PATH_IMAGE017
Figure 988380DEST_PATH_IMAGE018
Expression
Figure DEST_PATH_IMAGE019
In pair of source node and destination node,
Figure 728934DEST_PATH_IMAGE020
Representative
Figure 867791DEST_PATH_IMAGE018
Between mulitpath.Every link in network
Figure DEST_PATH_IMAGE021
A bandwidth capacity is all arranged
Figure 825121DEST_PATH_IMAGE022
Figure DEST_PATH_IMAGE023
Be expressed as
Figure 950202DEST_PATH_IMAGE024
Individual incoherent random process, each random process represent the data that the collection of respective sources node sends.
Figure DEST_PATH_IMAGE025
The expression source node
Figure 935476DEST_PATH_IMAGE026
Distribute to
Figure DEST_PATH_IMAGE027
The path is to destination node Transmission rate.Each node in network , all have
Figure 568156DEST_PATH_IMAGE030
With
Figure DEST_PATH_IMAGE031
Two set represent respectively node
Figure 995464DEST_PATH_IMAGE032
Upstream node and downstream node.To source node
Figure 835244DEST_PATH_IMAGE026
,
Figure DEST_PATH_IMAGE033
Be empty set.To destination node ,
Figure 483711DEST_PATH_IMAGE034
Be empty set.To the link in network
Figure DEST_PATH_IMAGE035
,
Figure 717640DEST_PATH_IMAGE036
The expression source node
Figure 287293DEST_PATH_IMAGE026
To destination node
Figure 938854DEST_PATH_IMAGE028
Figure 984170DEST_PATH_IMAGE027
The path takies link
Figure 753281DEST_PATH_IMAGE035
Flow, The expression link
Figure 177440DEST_PATH_IMAGE035
The transmission rate of data after upper network code.
In many multicast networks, when each source node sends data to corresponding destination node, there are a large amount of intermediate node and links that share.When intermediate node was received the data of a plurality of multicasts, link bandwidth was shared by a plurality of source nodes, and its limited bandwidth makes link become the throughput that bottleneck link has limited source node transmission rate and network.Definition
Figure 478250DEST_PATH_IMAGE038
Be link
Figure DEST_PATH_IMAGE039
On, node
Figure 620650DEST_PATH_IMAGE027
Directly forward source node
Figure 819550DEST_PATH_IMAGE015
The transmission gain that obtains;
Figure 596751DEST_PATH_IMAGE040
Be link
Figure 855694DEST_PATH_IMAGE039
On, node
Figure 485390DEST_PATH_IMAGE027
Will be to source node
Figure 222401DEST_PATH_IMAGE015
With Data network coding after the transmission gain that obtains, as follows:
Figure DEST_PATH_IMAGE043
Wherein,
Figure 427828DEST_PATH_IMAGE044
It is node
Figure 403874DEST_PATH_IMAGE032
Downstream node,
Figure DEST_PATH_IMAGE045
Representation node
Figure 318479DEST_PATH_IMAGE032
The data traffic that is used for network code decoding between multicast received of downstream node.
The transmission gain set that intermediate node obtains by calculating each source node data of simple forwarding And the transmission gain set that between the many multicasts of transmission, the network code data obtain , can obtain maximum forwarding transmission gain , its best source node is designated as , the transmission gain of network code between maximum many multicasts
Figure DEST_PATH_IMAGE047
, its best source node set is combined into
Figure 855027DEST_PATH_IMAGE048
Maximum forwarding transmission gain
Figure 236461DEST_PATH_IMAGE003
And the transmission gain of network code between many multicasts of maximum
Figure 452678DEST_PATH_IMAGE004
Be defined as respectively:
Figure DEST_PATH_IMAGE049
Figure 709085DEST_PATH_IMAGE050
As shown in Figure 1, 2, should be used for network code control method between many multicasts of a network with sources and a destination, its concrete steps are as follows:
Step 1: initialization, the source node image data in each multicast, and the data packing is sent successively;
Step 2: intermediate node receives the packet from different source nodes;
Step 3: intermediate node carries out the correlation judgement to the packet of receiving: linear independence goes to step 5;
Step 4: receive and have linear correlation between packet, show that the packet of receiving carried out network code, intermediate node first carries out the packet that the network code decoding obtains linear independence;
Step 5: receive linear independence between packet, put it into uncorrelated data queue;
Step 6: intermediate node computes forwards merely the transmission gain that each source node data obtains And the transmission gain that between the transmission multicast, the network code data obtain
Figure 879483DEST_PATH_IMAGE002
Step 7: intermediate node obtains forwarding best source node transmission gain
Figure 317418DEST_PATH_IMAGE003
And the transmission gain of network code between best multicast
Figure 114866DEST_PATH_IMAGE004
Step 8: intermediate node is both gains relatively With
Figure 435306DEST_PATH_IMAGE004
Size: forward when transmission gain gains more than or equal to coding transmission and go to step 9, otherwise go to step 10
Step 9: intermediate node does not carry out network code but forwards merely source node
Figure 235903DEST_PATH_IMAGE005
Data, return and go to step 2, the above-mentioned steps that so circulates until the data in source node be sent;
Step 10: the information of data is received in intermediate node and the exchange of its downstream node;
Step 11: can the judgement downstream node receive the data for network code decoding between multicast: can receive that the data for decoding go to step 12, otherwise go to step 9;
Step 12: network code transmission gain
Figure 460211DEST_PATH_IMAGE004
When forwarding transmission gain, intermediate node is for from source node
Figure 161188DEST_PATH_IMAGE005
With
Figure 445539DEST_PATH_IMAGE006
Data carry out network code between multicast;
Step 13: intermediate node sends the data after coding, return and go to step 2, the above-mentioned steps that so circulates until the data in source node be sent.
The below provides the numerical simulation experiment of using method of the present invention.Suppose that in network, every link has identical fixed-bandwidth capacity
Figure DEST_PATH_IMAGE051
, Fig. 4 has provided multicast group With
Figure DEST_PATH_IMAGE053
The transmission rate achievable region.Do not adopt network code between multicast, source node
Figure 872683DEST_PATH_IMAGE054
With
Figure DEST_PATH_IMAGE055
Can not reach simultaneously maximum multicast transmission capacity; Adopt network code between multicast, multicast group
Figure 54265DEST_PATH_IMAGE052
With
Figure 384884DEST_PATH_IMAGE053
Can reach simultaneously maximum multicast transmission capacity, namely
Figure 284707DEST_PATH_IMAGE056
With
Provided three multicast group in Fig. 5, when between the employing multicast, network code transmission and conventional store pass-through mode transmit, three multicast group throughput separately.Due to multicast group
Figure 224719DEST_PATH_IMAGE058
In, source node
Figure DEST_PATH_IMAGE059
To destination node
Figure 136174DEST_PATH_IMAGE060
The path all to share with another two multicasts, do not carry out network code between multicast, source node
Figure 762327DEST_PATH_IMAGE059
The data that gather can not be sent to destination node
Figure 526277DEST_PATH_IMAGE060
, the throughput of multicast is
Figure DEST_PATH_IMAGE061
Consider the congested and burst error of link in network, the network link bandwidth is random distribution.Provided in Fig. 6 under link bandwidth is random, when between the employing multicast, network code transmission and conventional store pass-through mode transmit, three multicast group throughput separately.Between the employing multicast, network code can improve the throughput of each multicast, thereby has improved the entire throughput of network.
In order to calculate the raising amount of network code to whole network throughput between multicast, the define grid throughput gain is:
Figure 505866DEST_PATH_IMAGE062
Wherein,
Figure DEST_PATH_IMAGE063
Under expression conventional store forward mode, each multicast group throughput sum;
Figure 662041DEST_PATH_IMAGE064
Under expression multicast group network code pattern, each multicast group throughput sum.Table 1 has provided under two kinds of different bandwidths, the gain of the network throughput of multicast group network code.
Link bandwidth (Mbps) Fixing At random
Throughput gain 0.5 0.9440
Table 1The network throughput gain of the present invention's transmission under different link bandwidths
Weigh with the max-min fairness coefficient and represent to adopt between multicast after network code, the fairness between each multicast group:
The max-min fairness coefficient
Figure DEST_PATH_IMAGE065
Wherein, Be the multicast throughput of minimum, Multicast throughput for maximum.Table 2 has provided with the fairness coefficient under three kinds of different transmission meanss (network code mode between shortest path tree mode, max-flow transmission means and multicast).Owing to not adopting the multicast network coding, have at least a multicast group there is no throughput in three multicast group, so the fairness coefficient is zero.And adopting the multicast group network code can guarantee three multicasts the transmission of data liberally, its fairness coefficient is
Figure 317199DEST_PATH_IMAGE008
The fairness coefficient Shortest-path method The max-flow method Network code between multicast
? 0 0 1
Table 2The fairness coefficients comparison of the present invention and other transmission meanss.

Claims (2)

1. network code control method between a multicast that is applied to a network with sources and a destination is characterized in that concrete steps are as follows:
Step 1: initialization, the source node image data in each multicast, and the data packing is sent successively;
Step 2: intermediate node receives the packet from different source nodes;
Step 3: intermediate node carries out the correlation judgement to the packet of receiving: linear independence goes to step 5;
Step 4: receive and have linear correlation between packet, show that the packet of receiving carried out network code, intermediate node first carries out the packet that the network code decoding obtains linear independence;
Step 5: receive linear independence between packet, put it into uncorrelated data queue;
Step 6: intermediate node computes forwards merely the transmission gain that each source node data obtains And the transmission gain that between the transmission multicast, the network code data obtain
Figure 657884DEST_PATH_IMAGE002
Described
Figure 96212DEST_PATH_IMAGE007
Be link
Figure 466014DEST_PATH_IMAGE008
On, node
Figure 999020DEST_PATH_IMAGE009
Directly forward source node
Figure 796074DEST_PATH_IMAGE010
The transmission gain that obtains; Be link
Figure 188190DEST_PATH_IMAGE008
On, node
Figure 198871DEST_PATH_IMAGE009
Will be to source node
Figure 540728DEST_PATH_IMAGE010
With
Figure 636860DEST_PATH_IMAGE012
Data network coding after the transmission gain that obtains, as follows:
Figure 354598DEST_PATH_IMAGE014
Wherein, to the link in network
Figure 493455DEST_PATH_IMAGE008
,
Figure 188135DEST_PATH_IMAGE015
The expression source node
Figure 703430DEST_PATH_IMAGE016
To destination node
Figure 564069DEST_PATH_IMAGE017
Figure 873828DEST_PATH_IMAGE018
The path takies link
Figure 678973DEST_PATH_IMAGE008
Flow,
Figure 106281DEST_PATH_IMAGE019
The expression node
Figure 946061DEST_PATH_IMAGE020
The downstream node set, Representative
Figure 860107DEST_PATH_IMAGE022
Between mulitpath;
Figure 451626DEST_PATH_IMAGE023
It is node Downstream node, Representation node
Figure 118425DEST_PATH_IMAGE020
The data traffic that is used for network code decoding between multicast received of downstream node;
Figure 513634DEST_PATH_IMAGE025
The expression link The transmission rate of data after upper network code;
Step 7: intermediate node obtains forwarding best source node transmission gain
Figure 680198DEST_PATH_IMAGE003
And the transmission gain of network code between best multicast
Figure 708197DEST_PATH_IMAGE004
Step 8: intermediate node is both gains relatively
Figure 266611DEST_PATH_IMAGE003
With
Figure 597229DEST_PATH_IMAGE004
Size: forward when transmission gain gains more than or equal to coding transmission and go to step 9, otherwise go to step 10
Step 9: intermediate node does not carry out network code but forwards merely source node
Figure 497052DEST_PATH_IMAGE005
Data, return and go to step 2, the above-mentioned steps that so circulates until the data in source node be sent;
Step 10: the information of data is received in intermediate node and the exchange of its downstream node;
Step 11: can the judgement downstream node receive the data for network code decoding between multicast: can receive that the data for decoding go to step 12, otherwise go to step 9;
Step 12: network code transmission gain
Figure 437064DEST_PATH_IMAGE004
When forwarding transmission gain, intermediate node is for from source node
Figure 473153DEST_PATH_IMAGE005
With
Figure 99306DEST_PATH_IMAGE006
Data carry out network code between multicast;
Step 13: intermediate node sends the data after coding, return and go to step 2, the above-mentioned steps that so circulates until the data in source node be sent.
2. network code control method between the multicast that is applied to a network with sources and a destination according to claim 1, is characterized in that the transmission gain set that described intermediate node obtains by calculating each source node data of simple forwarding
Figure 399736DEST_PATH_IMAGE001
And the transmission gain set that between the many multicasts of transmission, the network code data obtain
Figure 666770DEST_PATH_IMAGE002
, can obtain maximum forwarding transmission gain
Figure 242501DEST_PATH_IMAGE026
, its best source node is designated as
Figure 911380DEST_PATH_IMAGE005
, the transmission gain of network code between maximum many multicasts
Figure 904743DEST_PATH_IMAGE027
, its best source node set is combined into Maximum forwarding transmission gain
Figure 537030DEST_PATH_IMAGE003
And the transmission gain of network code between many multicasts of maximum
Figure 434317DEST_PATH_IMAGE004
Be defined as respectively:
Figure 598582DEST_PATH_IMAGE029
Figure 840207DEST_PATH_IMAGE030
。
CN 201110099631 2011-04-21 2011-04-21 Inter-multicast network coding control method applied to multi-source multi-destination network Expired - Fee Related CN102148664B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110099631 CN102148664B (en) 2011-04-21 2011-04-21 Inter-multicast network coding control method applied to multi-source multi-destination network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110099631 CN102148664B (en) 2011-04-21 2011-04-21 Inter-multicast network coding control method applied to multi-source multi-destination network

Publications (2)

Publication Number Publication Date
CN102148664A CN102148664A (en) 2011-08-10
CN102148664B true CN102148664B (en) 2013-06-05

Family

ID=44422689

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110099631 Expired - Fee Related CN102148664B (en) 2011-04-21 2011-04-21 Inter-multicast network coding control method applied to multi-source multi-destination network

Country Status (1)

Country Link
CN (1) CN102148664B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102572952B (en) * 2011-12-15 2014-04-09 北京航空航天大学 Network-coding-based fair service method for streaming media of wireless MESH network
CN103312443A (en) * 2012-03-16 2013-09-18 上海交通大学 Data transmission method
WO2014043908A1 (en) * 2012-09-24 2014-03-27 北京大学深圳研究生院 Method and apparatus for multi-source dynamic network coding
CN106332287B (en) * 2015-07-01 2022-03-18 西安中兴新软件有限责任公司 Data transmission method and communication node
CN107147470B (en) * 2016-03-01 2020-06-05 中兴通讯股份有限公司 Network coding forwarding rate on-line control method and device

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101325540A (en) * 2007-06-11 2008-12-17 华为技术有限公司 Method and apparatus for improving multicast transmission efficiency based on random network encoding
CN101945339A (en) * 2010-07-02 2011-01-12 哈尔滨工程大学 Cognitive radio self-organization network message multicast transmission method

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040077379A1 (en) * 2002-06-27 2004-04-22 Martin Smith Wireless transmitter, transceiver and method
CN101286823A (en) * 2007-04-12 2008-10-15 中兴通讯股份有限公司 Data-transmission method and system for MIMO system
KR101652608B1 (en) * 2007-08-27 2016-08-30 애플 인크. Communication system using mimo based network coding
CN101764675B (en) * 2009-12-23 2013-06-19 北京邮电大学 Coding resource adaptive scheduling algorithm in distributed network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101325540A (en) * 2007-06-11 2008-12-17 华为技术有限公司 Method and apparatus for improving multicast transmission efficiency based on random network encoding
CN101945339A (en) * 2010-07-02 2011-01-12 哈尔滨工程大学 Cognitive radio self-organization network message multicast transmission method

Also Published As

Publication number Publication date
CN102148664A (en) 2011-08-10

Similar Documents

Publication Publication Date Title
CN103493445B (en) A kind of layering distribution method, system of IP multicast packet
US8520556B2 (en) Terminal and N-tree constructing method
CN102148664B (en) Inter-multicast network coding control method applied to multi-source multi-destination network
Altman et al. Dynamic control of coding in delay tolerant networks
CN108075861B (en) Multipath-based network coding transmission method in software defined FiWi network
CN103346969A (en) Method for achieving dynamic multicast spanning tree path adjustment based on OpenFlow
AU2011379362B2 (en) Peer-to-peer communications in AMI with source-tree routing
CN103428803B (en) A kind of chance method for routing of combination machine meeting network code
CN104221323A (en) Method for multicast flow routing selection
CN104767694A (en) Data stream forwarding method facing Fat-Tree data center network architecture
CN102217238A (en) Service instance applied to mpls networks
CN102577277A (en) Providing a logical aggregated point-to-point data link incorporating a multi-point link
CN105450741B (en) Provisioning server selection and repair data transmission method in distributed memory system
CN103354529A (en) Path selecting method and device
CN101965031A (en) Maximum probability-based cognitive radio multi-path multicast routing method
CN106059861B (en) System and method for constructing minimum dynamic aggregation tree of Internet of things in distributed mode
CN103609064A (en) Protocol independent multicast with quality of service support
CN111132236B (en) Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol
Sable et al. An Efficient and Reliable Data Transmission Service using Network Coding Algorithms in Peer-to-Peer Network
US8014371B1 (en) System, model and method for evaluating a network
ParandehGheibi et al. Optimal reverse carpooling over wireless networks-a distributed optimization approach
CN102438207A (en) Real-time multicast method in wireless multi-hop network
Teo et al. Exploration of genetic algorithm in network coding for wireless sensor networks
CN103619047A (en) Opportunistic routing method in multiple-concurrent-flow wireless mesh network
CN107302497B (en) Power line carrier communication route self-adaptive optimization method based on genetic algorithm

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

CF01 Termination of patent right due to non-payment of annual fee