CN102148664A - 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
CN102148664A
CN102148664A CN201110099631XA CN201110099631A CN102148664A CN 102148664 A CN102148664 A CN 102148664A CN 201110099631X A CN201110099631X A CN 201110099631XA CN 201110099631 A CN201110099631 A CN 201110099631A CN 102148664 A CN102148664 A CN 102148664A
Authority
CN
China
Prior art keywords
node
multicast
data
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.)
Granted
Application number
CN201110099631XA
Other languages
Chinese (zh)
Other versions
CN102148664B (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

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

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 multi-source and converge network code control method between the multicast of network more
Technical field
What the present invention relates to is that a kind of multi-source that is applied to converges network code control method between the multicast of network more, intermediate node in the network is transmitted the transmission gain of data by relatively simple storage and is carried out the size of the transmission gain after network code increases between multicast, can judge whether to carry out network code; The data message that receive while intermediate node and its downstream node clearing house can judge whether network code can decode between multicast, 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 the network intermediate node to carry out the data fusion coding, compares with being different from traditional storage retransmission technique, can improve the throughput of network effectively.
General communication network is being deposited a plurality of multicast group usually, and multiple source node and a plurality of destination node are promptly arranged.Each multicast group is initiated by a source node, by middle forward node, the data of gathering 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 the network can will receive that the data from same source node carry out linear combination, and the data branch of the generation of will encode sends 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, the 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 the network only have a multicast time, network code will be degenerated to network code in the multicast between multicast.Relatively play traditional multicast Intranet network coding, network code is more complicated between multicast.The decodability of how selecting the multicast group of encoding and guaranteeing network code between multicast is mainly the studying a question of network code between multicast.
Summary of the invention
The objective of the invention is at how the problem of application network coding techniques between a plurality of multicast group, propose a kind of multi-source that is applied to and converged the control method of network code between the multicast of network more, this 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: the network intermediate node is when the data of receiving from different multicast group, relatively store the size of transmitting the transmission gain that obtains and carrying out the transmission gain that network code obtains between multicast, judge whether to carry out network code between multicast; The data message that intermediate node and the exchange of its downstream node are received is judged the decoding of network code between multicast, thereby is selected suitable multicast group, and their data are carried out network code between multicast.
According to the foregoing invention design, the present invention adopts following technical proposals:
A kind of multi-source that is applied to converges the control method of network code between many multicasts of network more, it is characterized in that concrete steps are as follows:
Step 1: initialization, the source node image data in each multicast, and packing data sent successively;
Step 2: intermediate node receives the packet from different source nodes;
Step 3: intermediate node carries out correlation to the packet of receiving and judges: linear independence then goes to step 5;
Step 4: receive and have linear correlation between the packet, show that the packet of receiving carried out network code, then intermediate node carries out the packet that the network code decoding obtains linear independence earlier;
Step 5: receive linear independence between the packet, put it into uncorrelated data queue;
Step 6: intermediate node computes is transmitted the transmission gain that each source node data obtains merely and is sent the transmission gain that the network code data obtain between multicast;
Step 7: intermediate node obtains transmitting 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
Figure 234663DEST_PATH_IMAGE004
Size: transmit 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 transmits the data of source node merely, then returns and goes to step 2, and the data of the above-mentioned steps that so circulates in source node send and finish;
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 that are used for network code decoding between multicast: can receive that the data that are used to decode then go to step 12, otherwise go to step 9;
Step 12: network code transmission gain When transmitting transmission gain, intermediate node for from source node and data carry out network code between multicast;
Step 13: intermediate node sends the data behind the coding, then returns and goes to step 2, and the data of the above-mentioned steps that so circulates in source node send and finish.
Multi-source among the present invention converges between the multicast of network the network code control method compared with prior art more, the advantage that has:
1, the network intermediate node can by more directly transmitting and carrying out the transmission gain that network code brings between multicast, judge whether to carry out network code between multicast according to the data of receiving from a plurality of multicast group in this method, energy maximization network transmission gain, the entire throughput of raising network;
2, in this method the network intermediate node 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, this 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 multi-source and converges the flow chart of network code control method between the multicast of network more.
Transmit the schematic diagram after data enter intermediate node in Fig. 2 embodiments of the invention.
Communication network topology schematic diagram in Fig. 3 embodiments of the invention.
Fig. 4 under the fixed link bandwidth condition, multicast group and
Figure 201110099631X100002DEST_PATH_IMAGE009
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 link bandwidth condition at random.
Embodiment
Below in conjunction with accompanying drawing and preferred embodiment embodiments of the invention are described in further detail.
Present embodiment is that example describes with network topology shown in Figure 3.
With representing the many tandem communication networks of multi-source, 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 source node set and destination node set in the network respectively.Each source node () can send data to the corresponding target node by mulitpath.Pair of source node and destination node in the expression, the mulitpath between representative.Every link all has a bandwidth capacity in the network.
Figure 201110099631X100002DEST_PATH_IMAGE023
Be expressed as
Figure 950202DEST_PATH_IMAGE024
The data that on behalf of the collection of respective sources node, individual incoherent random process, each random process send.
Figure 201110099631X100002DEST_PATH_IMAGE025
The expression source node
Figure 935476DEST_PATH_IMAGE026
Distribute to
Figure 201110099631X100002DEST_PATH_IMAGE027
The path is to the transmission rate of destination node.Each node in the network all has upstream node and the downstream node of representing node with two set respectively.To source node
Figure 835244DEST_PATH_IMAGE026
, be empty set.For destination node, be empty set.For the link in the network,
Figure 717640DEST_PATH_IMAGE036
The expression source node
Figure 287293DEST_PATH_IMAGE026
To the of destination node
Figure 984170DEST_PATH_IMAGE027
The path takies the flow of link,
Figure 201110099631X100002DEST_PATH_IMAGE037
The transmission rate of data behind the network code on the expression link.
In many multicast networks, when each source node sends data to corresponding destination node, there are a large amount of shared intermediate node and links.When intermediate node was received the data of a plurality of multicasts, link bandwidth was shared by the multiple source node, and its limited bandwidth makes link become the throughput that bottleneck link has limited source node transmission rate and network.Definition On link, node
Figure 620650DEST_PATH_IMAGE027
Directly transmit the transmission gain that source node obtains;
Figure 596751DEST_PATH_IMAGE040
On link, node
Figure 485390DEST_PATH_IMAGE027
Will to source node and the transmission gain that obtains of data network coding back, as follows:
Figure 122618DEST_PATH_IMAGE042
Figure 201110099631X100002DEST_PATH_IMAGE043
Wherein, be the downstream node of node,
Figure 201110099631X100002DEST_PATH_IMAGE045
The data traffic that is used for network code decoding between multicast that the downstream node of representation node is received.
Intermediate node is by the transmission gain set of calculating each source node data of simple forwarding and obtaining and send the transmission gain set that the network code data obtain between many multicasts, can obtain maximum forwarding transmission gain
Figure 901404DEST_PATH_IMAGE046
, its best source node is designated as, the transmission gain of network code between maximum many multicasts
Figure 201110099631X100002DEST_PATH_IMAGE047
, its best source node set is combined into.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 709085DEST_PATH_IMAGE050
As shown in Figure 1, 2, should be used for multi-source and converge network code control method between many multicasts of network more, its concrete steps are as follows:
Step 1: initialization, the source node image data in each multicast, and packing data sent successively;
Step 2: intermediate node receives the packet from different source nodes;
Step 3: intermediate node carries out correlation to the packet of receiving and judges: linear independence then goes to step 5;
Step 4: receive and have linear correlation between the packet, show that the packet of receiving carried out network code, then intermediate node carries out the packet that the network code decoding obtains linear independence earlier;
Step 5: receive linear independence between the packet, put it into uncorrelated data queue;
Step 6: intermediate node computes is transmitted the transmission gain that each source node data obtains merely and is sent the transmission gain that the network code data obtain between multicast;
Step 7: intermediate node obtains transmitting 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
Figure 587436DEST_PATH_IMAGE003
With Size: transmit 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 transmits the data of source node merely, then returns and goes to step 2, and the data of the above-mentioned steps that so circulates in source node send and finish;
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 that are used for network code decoding between multicast: can receive that the data that are used to decode then go to step 12, otherwise go to step 9;
Step 12: network code transmission gain
Figure 460211DEST_PATH_IMAGE004
When transmitting transmission gain, intermediate node for from source node and data carry out network code between multicast;
Step 13: intermediate node sends the data behind the coding, then returns and goes to step 2, and the data of the above-mentioned steps that so circulates in source node send and finish.
Provide the numerical simulation experiment of using method of the present invention below.Suppose that every link has identical fixed-bandwidth capacity in the network, Fig. 4 provided multicast group and
Figure 201110099631X100002DEST_PATH_IMAGE053
The transmission rate achievable region.Do not adopt network code between multicast, source node and
Figure 201110099631X100002DEST_PATH_IMAGE055
Can not reach maximum multicast transmission capacity simultaneously; Adopt network code between multicast, multicast group and
Figure 384884DEST_PATH_IMAGE053
Can reach maximum multicast transmission capacity simultaneously, promptly With
Provided three multicast group among Fig. 5, when network code transmission and conventional store pass-through mode transmit between the employing multicast, three multicast group throughput separately.Because in the multicast group, source node is all shared with other two multicasts to the path of destination node, does not carry out network code between multicast, source node can not send to destination node with the data of gathering, and the throughput of multicast is.
Consider link congestion and burst error in the network, the network link bandwidth is a random distribution.Provided among Fig. 6 at random down at link bandwidth, when network code transmission and conventional store pass-through mode transmit between the employing multicast, three multicast group throughput separately.Network code can improve the throughput of each multicast between the employing multicast, thereby has improved the entire throughput of network.
Network code is to the raising amount of whole network throughput between multicast in order to calculate, and the define grid throughput gain is:
Figure 505866DEST_PATH_IMAGE062
Wherein, under the expression conventional store forward mode, each multicast group throughput sum; Under the 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
The network throughput gain of the present invention's transmission under the different link bandwidths of table 1
Weigh with minimax fairness coefficient and to represent to adopt between multicast behind the network code fairness between each multicast group:
Minimax fairness coefficient
Wherein, be the multicast throughput of minimum, be the multicast throughput of 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 do not adopt the multicast network coding, have at least a multicast group not have throughput in three multicast group, so the fairness coefficient is zero.And adopting the multicast group network code can guarantee that three multicasts transmit data liberally, its fairness coefficient is.
The fairness coefficient Shortest-path method The max-flow method Network code between multicast
0 0 1
The fairness coefficient ratio of table 2 the present invention and other transmission meanss.

Claims (3)

1. one kind is applied to multi-source and converges network code control method between the multicast of network more, it is characterized in that concrete steps are as follows:
Step 1: initialization, the source node image data in each multicast, and packing data sent successively;
Step 2: intermediate node receives the packet from different source nodes;
Step 3: intermediate node carries out correlation to the packet of receiving and judges: linear independence then goes to step 5;
Step 4: receive and have linear correlation between the packet, show that the packet of receiving carried out network code, then intermediate node carries out the packet that the network code decoding obtains linear independence earlier;
Step 5: receive linear independence between the packet, put it into uncorrelated data queue;
Step 6: intermediate node computes is transmitted the transmission gain that each source node data obtains merely and is sent the transmission gain that the network code data obtain between multicast;
Step 7: intermediate node obtains transmitting best source node transmission gain
Figure 680198DEST_PATH_IMAGE003
And the transmission gain of network code between best multicast
Step 8: intermediate node is both gains relatively With
Figure 597229DEST_PATH_IMAGE004
Size: transmit 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 transmits the data of source node merely, then returns and goes to step 2, and the data of the above-mentioned steps that so circulates in source node send and finish;
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 that are used for network code decoding between multicast: can receive that the data that are used to decode then go to step 12, otherwise go to step 9;
Step 12: network code transmission gain
Figure 437064DEST_PATH_IMAGE004
When transmitting transmission gain, intermediate node for from source node and data carry out network code between multicast;
Step 13: intermediate node sends the data behind the coding, then returns and goes to step 2, and the data of the above-mentioned steps that so circulates in source node send and finish.
2. the multi-source that is applied to according to claim 1 converges network code control method between the multicast of network more, it is characterized in that, and is described
Figure 96212DEST_PATH_IMAGE007
On link, node Directly transmit the transmission gain that source node obtains; On link, node Will to source node and the transmission gain that obtains of data network coding back, as follows:
Figure 223830DEST_PATH_IMAGE013
Figure 354598DEST_PATH_IMAGE014
Wherein, for the link in the network,
Figure 188135DEST_PATH_IMAGE015
The expression source node
Figure 703430DEST_PATH_IMAGE016
To the of destination node The path takies the flow of link, the downstream node set of expression node, the mulitpath between representative; Be the downstream node of node,
Figure 463321DEST_PATH_IMAGE024
The data traffic that is used for network code decoding between multicast that the downstream node of representation node is received; The transmission rate of data behind the network code on the expression link.
3. the multi-source that is applied to according to claim 1 converges network code control method between the multicast of network more, it is characterized in that, described intermediate node is by the transmission gain set of calculating each source node data of simple forwarding and obtaining and send the transmission gain set that the network code data obtain between many multicasts, can obtain maximum forwarding transmission gain
Figure 242501DEST_PATH_IMAGE026
, its best source node is designated as, the transmission gain of network code between maximum many multicasts , 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 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 true CN102148664A (en) 2011-08-10
CN102148664B 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)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102572952A (en) * 2011-12-15 2012-07-11 北京航空航天大学 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
CN106332287A (en) * 2015-07-01 2017-01-11 西安中兴新软件有限责任公司 Data transmission method and communication nodes
CN107147470A (en) * 2016-03-01 2017-09-08 中兴通讯股份有限公司 A kind of network code forwarding rate On-Line Control Method and device

Citations (6)

* 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
CN101325540A (en) * 2007-06-11 2008-12-17 华为技术有限公司 Method and apparatus for improving multicast transmission efficiency based on random network encoding
US20090067533A1 (en) * 2007-08-27 2009-03-12 Nortel Networks Limited Mimo based network coding network
CN101764675A (en) * 2009-12-23 2010-06-30 北京邮电大学 Coding resource adaptive scheduling algorithm in distributed network
CN101945339A (en) * 2010-07-02 2011-01-12 哈尔滨工程大学 Cognitive radio self-organization network message multicast transmission method

Patent Citations (6)

* 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
CN101325540A (en) * 2007-06-11 2008-12-17 华为技术有限公司 Method and apparatus for improving multicast transmission efficiency based on random network encoding
US20090067533A1 (en) * 2007-08-27 2009-03-12 Nortel Networks Limited Mimo based network coding network
CN101764675A (en) * 2009-12-23 2010-06-30 北京邮电大学 Coding resource adaptive scheduling algorithm in distributed network
CN101945339A (en) * 2010-07-02 2011-01-12 哈尔滨工程大学 Cognitive radio self-organization network message multicast transmission method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
邹君妮 等: "《网络编码技术在分布式内容分发中的应用》", 《上海大学学报(自然科学版) 》, vol. 13, no. 4, 30 April 2007 (2007-04-30) *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102572952A (en) * 2011-12-15 2012-07-11 北京航空航天大学 Network-coding-based fair service method for streaming media of wireless MESH network
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
CN104704760A (en) * 2012-09-24 2015-06-10 北京大学深圳研究生院 Method and apparatus for multi-source dynamic network coding
CN104704760B (en) * 2012-09-24 2018-01-05 北京大学深圳研究生院 The method and device of multiple source dynamic network coding
CN106332287A (en) * 2015-07-01 2017-01-11 西安中兴新软件有限责任公司 Data transmission method and communication nodes
CN107147470A (en) * 2016-03-01 2017-09-08 中兴通讯股份有限公司 A kind of network code forwarding rate On-Line Control Method and device
CN107147470B (en) * 2016-03-01 2020-06-05 中兴通讯股份有限公司 Network coding forwarding rate on-line control method and device

Also Published As

Publication number Publication date
CN102148664B (en) 2013-06-05

Similar Documents

Publication Publication Date Title
Li et al. Reliable multicast with pipelined network coding using opportunistic feeding and routing
CN103493445B (en) A kind of layering distribution method, system of IP multicast packet
US8520556B2 (en) Terminal and N-tree constructing method
Altman et al. Dynamic control of coding in delay tolerant networks
CN108075861B (en) Multipath-based network coding transmission method in software defined FiWi network
CN104767694A (en) Data stream forwarding method facing Fat-Tree data center network architecture
AU2011379362B2 (en) Peer-to-peer communications in AMI with source-tree routing
US8948051B2 (en) System and method for efficient MVPN source redundancy with S-PMSI
CN103428803B (en) A kind of chance method for routing of combination machine meeting network code
CN102148664B (en) Inter-multicast network coding control method applied to multi-source multi-destination network
CN103346969A (en) Method for achieving dynamic multicast spanning tree path adjustment based on OpenFlow
CN101965031B (en) Maximum probability-based cognitive radio multi-path multicast routing method
CN105472484A (en) Wave channel balancing route wavelength allocation method of power backbone optical transport network
CN103609064A (en) Protocol independent multicast with quality of service support
CN108184175B (en) MC node limitation-based elastic optical network multicast routing and spectrum allocation method
ParandehGheibi et al. Optimal reverse carpooling over wireless networks-a distributed optimization approach
CN102325009A (en) Forward error correction-based method for reliably transmitting network coding multicast data stream
CN113131982A (en) Low-orbit satellite distributed dynamic multipath routing method based on network coding
CN103619047B (en) A kind of chance method for routing in many concurrently stream wireless mesh networks
CN109450809B (en) Data center scheduling system and method
CN105306374A (en) QoS (Quality of Service) broadcast method for Overlay network based on genetic algorithm
Sun et al. Novel dynamic ant genetic algorithm for QoS routing in wireless mesh networks
Bulira Multicast-based dynamic routing of many-to-many flows in elastic optical networks
Wang et al. Multipath routing and spectrum allocation for network coding enabled elastic optical networks
CN115086720B (en) Network path calculation method and device for live broadcast service

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130605