CN102624596A - Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network - Google Patents
Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network Download PDFInfo
- Publication number
- CN102624596A CN102624596A CN2012101265320A CN201210126532A CN102624596A CN 102624596 A CN102624596 A CN 102624596A CN 2012101265320 A CN2012101265320 A CN 2012101265320A CN 201210126532 A CN201210126532 A CN 201210126532A CN 102624596 A CN102624596 A CN 102624596A
- Authority
- CN
- China
- Prior art keywords
- reliability
- tree
- node
- topology
- degree
- 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
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention aims at providing a reliability optimal tree-shaped core topological solving method of a P2P live broadcast covering network, which comprises the steps of: converting out-degree and reliability of a backbone node of the P2P live broadcast covering network into weighting reliability through hierarchical out-degree weighting, constructing a tree-shaped core topology by layers by using the weighting reliability as a sequencing basis; optimizing a hierarchical weight set by using an evolutionary programming algorithm, and solving by using the sum of accumulated reliability of all nodes in an evolution process as an evolution index to obtain a tree topology with optimal reliability. According to the reliability optimal tree-shaped core topological solving method of the P2P live broadcast covering network, provided by the invention, the stability of the P2P live broadcast covering network is improved, and the live broadcast time delay is reduced.
Description
Technical field
The present invention relates to network service, more particularly, relate to a kind of optimum tree-shaped core topology method for solving of reliability that adopts the live nerve of a covering of P2P of tree-shaped or tree-like/netted mixed topology.
Background technology
According to investigations; 70% flow is that P2P uses on the internet at present; In the P2P framework, resources shared can directly exchange, and does not need the transfer and the participation of centralized servers; The P2P system has good fault-tolerant ability to the instability and the variable connectedness of overlay network simultaneously, and keeps good reliability.
Current, the live nerve of a covering of P2P is the main ways of distribution of large scale network TV, and the topological structure of the live nerve of a covering of P2P can be divided into four kinds of patterns substantially: (1) is imitated the tree of IP multicast tree merely, and the complementation distribution of many trees occurred.(2) each node initiatively goes to draw data oneself to be the center in the network under demand data drives, and forms the network structure that does not have clear and definite topological structure like this.(3) high efficiency of tree and the robustness of data-driven are combined, form mixed structure.(4) each self-organizing of node administration nerve of a covering and data distribution nerve of a covering is distributed with the node administration vectoring information.
The live nerve of a covering multicast of early stage P2P adopts tree usually, like NICE, and the ESM system.The mode that pushes away is adopted in the data distribution of this type of tree, and overhead is little, and time delay is shorter, and Bullet then utilizes many modes that tree is complementary, has improved the speed of distribution.AnySee sets up many data distribution trees earlier on netted node administration topology, and between many distribution trees, carries out the complementation optimization of transfer resource.But because the structural maintenance that the node dynamic causes difficulty causes the large-scale application of tree nerve of a covering to be restricted.
DONet (Data-driven Overlay Network) realizes the distribution of data through making up pure fully connected topology; Need not to make up the real time flow medium Play System CoolStreaming of complicated control structure based on the DONet agreement, its outstanding result of broadcast, lower delay have obtained confirming and affirming in actual motion.Other are able to the system of large-scale application, like PPLive, and PPStream, UUSee, GridMedia, Sopcast, TVants etc. have also used similar method in data dispatch.The DONet data dispatch mainly adopts the mode of drawing, and needs exchange buffering mapping graph (BM) continually between node for this reason, causes its extra bandwidth consumption bigger, and time delay is also longer.
In order to overcome the deficiency of pull-mode, the mixing distribution mode that push-and-pull combines has appearred again, in the process of drawing, set up local tree, the mode that pushes away then.Be not used for avoiding leaf node to upload bandwidth in the mode that pushes away, often adopt many son streams (Substream), the method for promptly on many trees, transmitting simultaneously.
Use except in the data distribution, carrying out tree-shaped and cancellated mixing, also have the mixed mode that uses different structure in the distribution of node administration and data.And in AnySee2, adopt tree to carry out monitoring nodes and management, and adopt network structure to carry out the method for transmission of flow media data, be called TCMM (Tree-Control-Mesh-Media).
In sum; For the high efficiency of utilizing the tree topology structure and the advantage of low time delay; Avoid again because the frequent too high defective of topological maintenance cost that withdraws from and cause that adds of node; Need a kind of topological structure of optimization, make it promptly have good robustness and reliability, can improve the stability of nerve of a covering again and reduce live time delay.
Summary of the invention
The invention provides the optimum tree-shaped core topology method for solving of reliability of the live nerve of a covering of a kind of P2P; Utilize the high efficiency of tree topology structure and the advantage of low time delay, withdrawed from the too high problem of topological maintenance cost that causes because of the frequent adding of node when avoiding adopting tree topology simultaneously.
The present invention provides the reliability of the live nerve of a covering of a kind of P2P optimum tree-shaped core topology method for solving, and the optimum tree-shaped core topology method for solving of said reliability comprises:
(1) in the live nerve of a covering of said P2P, chooses backbone node according to out-degree and reliability;
(2) according to the quantity of backbone node and the length of average out-degree calculating out-degree weight array;
(3) according to the length of out-degree weight array described in the step (2), produce one group of out-degree weight array at random, with the described one group of out-degree weight array that produces at random as initial population;
(4), and calculate the accumulation reliability sum of all nodes of every tree topology for the corresponding tree topology of each body structure in the said initial population;
(5) with the said initial population of step (4) or the described initial population of step (6) as the evolution population, each individuality of said evolution population is duplicated and makes a variation, form the variation population; According to the corresponding tree topology of said each body structure of variation population, and calculate the accumulation reliability sum of all nodes of every tree topology.
(6) the accumulation reliability sum of said evolution population and said all individual corresponding nodes of variation population is carried out sort descending, the initial population of selecting ordering to evolve as a new round at half preceding individuality;
Whether the initial population of (7) evolving for a said new round that produces in the step (6) satisfies the judgement of evolution termination condition, if do not satisfy said evolution termination condition, repeated execution of steps (5) is to step (7), till satisfying the evolution termination condition;
(8) satisfy the initial population that the said new round of evolution termination condition is evolved in the step (7), be the optimum tree-shaped core topology of reliability.
Preferably, the length of said out-degree weight array is the depth capacity of said tree topology.
Preferably, said satisfied evolution termination condition is that evolutionary generation reaches the upper limit for the maximum of the accumulation reliability sum of all nodes, the variation of mean value less than threshold value or said satisfied evolution termination condition.
Preferably, the accumulation reliability calculation methods of said node comprises:
(1) the accumulation reliability of the root node of said tree topology is himself reliability;
(2) begin from root node described in the step (1), all child nodes of range traversal, to each node set by step (3) calculate its accumulation reliability;
(3) self reliability of said node multiply by the accumulation reliability of the accumulation reliability of its parent node as said node.
Preferably, in the live nerve of a covering of said P2P, choose in the backbone node according to out-degree and reliability, said out-degree is greater than Streaming Media speed, and said reliability is chosen for backbone node greater than the node of reliability thresholds.
Preferably, said reliability thresholds realizes through setting fixed value.
Preferably, said reliability thresholds realizes through the ratio of specifying backbone node quantity to account in total number of nodes.
Preferably, according to the quantity of the said backbone node of choosing and average out-degree, through formula:
Calculate the depth capacity of said tree topology structure, wherein c representes the quantity of the said backbone node of choosing, and d representes the average out-degree of the said backbone node of choosing, and l representes the degree of depth of said tree topology structure.
Preferably, the method for the corresponding tree topology of said structure comprises:
(1) obtains the element of out-degree weight array according to succession, each element is carried out the processing of step (2) to step (3), join in the tree up to all nodes;
(2) calculate all according to said array element and do not add the weighting reliability of the node of in-tree, and carry out ordering from high to low;
(3), ordering is joined in the tree at preceding node one by one according to described node weighting reliability ranking results.Do not have node in the if tree, then only get a node as root, otherwise node is added on the leaf node of original tree, perhaps do not have node to be added up to the out-degree of using up all leaf nodes.
The optimum tree-shaped core topology method for solving of reliability provided by the invention has improved the applicability of tree topology in live nerve of a covering topological structure, promptly brings into play the advantage of tree topology high efficiency, low time delay, reduces the cost that its topology is safeguarded again as far as possible.The optimum tree-shaped core topology method for solving of reliability provided by the invention is used for the live nerve of a covering overall situation or local backbone node is formed tree-shaped core topology, can improve the stability of nerve of a covering, reduces live time delay.With the random configuration tree topology relatively, method provided by the invention can both significantly be improved on the reliability of tree topology and time delay; Compare with out-degree preferential construction tree topology, method reliability provided by the invention is obviously improved, and time delay is approaching; Compare with simple node self reliability preferential construction tree topology, method reliability provided by the invention increases, and time delay significantly improves.
Description of drawings
In order to make the present invention be convenient to understand, combine accompanying drawing to describe specific embodiment of the present invention now.
Fig. 1 shows the topology diagram of the live nerve of a covering of P2P used in the present invention.
Fig. 2 shows the flow chart of the practical implementation step of one embodiment of the present invention.
Fig. 3 shows the step sketch map of computing node accumulation reliability sum.
Fig. 4 shows the program code sketch map of individual (out-degree weighting array) variation in the evolutionary process.
Fig. 5 shows the program code sketch map of the construction process that makes up the overlay tree structure.
Embodiment
Below in conjunction with accompanying drawing and embodiment the present invention is described in further detail.
Fig. 1 shows the topology diagram of the live nerve of a covering of P2P used in the present invention.Wherein, 101 expression backbone nodes, 102 expression ordinary nodes, the limit of the tree-shaped core topology of 103 expressions, the limit of 104 expression mesh topologies.The mode that the topology of the live nerve of a covering distribution of P2P adopts tree topology and mesh topology to mix usually.Because having a few of the efficient high and low time delay of tree topology also has because the excessive shortcoming of topological maintenance cost that node dynamically causes.Tree topology is suitable for the stable node in the live nerve of a covering, and mesh topology is suitable for more highly dynamic fringe nodes.In order to overcome the deficiency that tree topology is safeguarded as far as possible, improve the applicability of its advantage performance, in the tree topology structure, should select partially stabilized backbone node, and be primary goal with the reliability optimization, reduce time delay simultaneously.
The topological structure principle of the topology diagram of the live nerve of a covering of P2P used in the present invention is: according to the out-degree (uploading bandwidth) and the reliability of each node of historical statistics; Select out-degree and reliability in all nodes satisfy setting threshold node be backbone node, other nodes are ordinary node.
Wherein, said backbone node is participated in the structure tree topology, also participates in the mesh topology structure.The out-degree (uploading bandwidth) that backbone node is used for the tree topology transmission is the integral multiple of Streaming Media speed, and remaining bandwidth is used for the transmission of mesh topology.
Said ordinary node and said backbone node fellowship structure mesh topology, wherein backbone node is that mesh topology is only contributed the remaining bandwidth outside the Streaming Media speed integral multiple.
Fig. 2 shows the flow chart of the practical implementation step of one embodiment of the present invention.Backbone node is selected in step 201 expression, selects out-degree (promptly uploading bandwidth) greater than Streaming Media speed according to historical statistics, and reliability is a backbone node greater than the node of setting threshold.Wherein, the reliability thresholds of said setting can realize through following two kinds of methods: the first, and setting fixed numbers is said threshold value, promptly reliability is backbone node greater than the fixed numbers of said setting; The second, setting relative value is said threshold value, promptly through specifying the ratio decision of backbone node quantity in total number of nodes.
Out-degree weight array length is calculated in step 202 expression, and the length of said out-degree weight array is the depth capacity of said tree topology, and the depth capacity of said tree topology structure adopts the mode of taking the logarithm, and formula is following:
Wherein, c representes the quantity of the said backbone node of choosing, and d representes the average out-degree of the said backbone node of choosing, and l representes the degree of depth of said tree topology structure.
(1)
(2)
(3)g≥g
m
Wherein,
g
mBe setup parameter, r '
m(T), r
a' (T) be the optimum and the mean value of previous generation (also be before evolutionary process in) corresponding nodes accumulation reliability sum.
(1) (2) set up all nodes of expression simultaneously the variation of maximum, mean value of accumulation reliability sum less than threshold value; (3) set up the expression evolutionary generation and reach the upper limit.
Fig. 3 shows the step sketch map of computing node accumulation reliability sum.Be to construct the node accumulation reliability sum of setting and calculate this tree according to evolve individual (out-degree weighting array) in the preferred embodiment of the present invention.
Step 301 expression structure tree topology.Strengthen array according to out-degree, carry out the layered structure tree structure, the concrete realization of said construction process is with reference to figure 5, and Fig. 5 shows the program code sketch map of the construction process that makes up the overlay tree structure.
The node accumulation reliability sum of step 302 expression computation tree.According to the tree topology of structure in the step 301, calculate all node accumulation reliability sums of this tree, each node accumulation reliability is calculated through following formula:
r
a(p)＝r(p)*∏
u∈path(p)r(u)
Wherein, all nodes except p on the path of path (p) expression from root node to node p.Said overlay tree reliability is calculated through following formula:
r(T)＝∑
p∈Tr
a(p)
Fig. 4 shows the program code sketch map of individual (out-degree weighting array) variation in the evolutionary process.Wherein, input
Expression out-degree weighting weight array, it is individual promptly to evolve; Input g representes current evolutionary generation; Input r representes to use
The rank of overlay tree in population that makes up; g
mRepresent maximum evolutionary generation; S representes population scale; δ representes the parameter set.
f
gThe expression evolutionary generation factor is through algebraic expression f
g=1-g/g
mObtain, wherein, g
mBe maximum evolutionary generation.
f
rRepresent the individual rank factor, unifier numerical expression f
r=r/s obtains, and s is a population scale.
Fig. 5 shows the program code sketch map of the construction process that makes up the overlay tree structure.The root of the tree constructed covering the source node
said source node
is the backbone nodes.Input
indicates the size of the set of nodes c
(
set node does not contain the source node
).Input
expression out-degree weighting weight array, promptly each in the population evolved individual.
Wherein, each in the population evolved individual
In ω
iRepresent the selection of i node layer (level of root node is 0 layer).
Selection is carried out through node being carried out the ordering of out-degree weighting reliability.The out-degree weighting Calculation of Reliability of node is calculated through following formula:
r
w(p)＝r(p)+(d(p)-1)*w
i
The reliability of r (p) expression node set p, the out-degree of d (p) expression node set p.
Above-mentioned detailed description has been illustrated the various embodiment of system and/or process through embodiment and/or sketch map.With regard to these sketch mapes and/or comprise with regard to one or more functions and/or the operation; It will be understood by those skilled in the art that among these sketch mapes or the embodiment each function and/or operation all can by various hardware, software, firmware or in fact its combination in any come individually and/or jointly realize.
Should be appreciated that method described herein can combined with hardware or software, or combine both combinations to realize in due course.Therefore; Method of the present invention; Can adopt the form that is included in such as the program code in the tangible mediums such as floppy disk, CD-ROM, hard disk drive or any other machinable medium (that is, instruction), wherein; When program code under situation about carrying out on the programmable calculator, computing equipment generally includes processor, readable storage medium (comprising volatile memory and/or memory element), at least one input equipment and at least one output equipment of this processor.One or more programs can be for example, and through using API, reusable control waits realizes or utilize the process that combines the present invention to describe.Such program preferably realizes with high level procedural or Object-Oriented Programming Language, to communicate by letter with computer system.Yet if desired, this program can realize with assembler language or machine language.In any situation, language can be compiler language or interpretative code, and realizes combining with hardware.
Although illustrate and described the present invention with reference to its preferred embodiment particularly, those skilled in the art will appreciate that the various changes on the form of to make and the details and do not break away from the scope of the present invention described in the appended claims.More than combine specific embodiment of the present invention to describe in detail, but be not to be limitation of the present invention.Every foundation technical spirit of the present invention all still belongs to the scope of technical scheme of the present invention to any simple modification that above embodiment did.
Claims (7)
1. the optimum tree-shaped core topology method for solving of the reliability of the live nerve of a covering of P2P, the optimum tree-shaped core topology method for solving of said reliability comprises:
(1) in the live nerve of a covering of said P2P, chooses backbone node according to out-degree and reliability;
(2) with the quantity of the said backbone node of choosing and the length of average out-degree calculating out-degree weight array;
(3) according to the length of out-degree weight array described in the step (2), produce one group of out-degree weight array at random, with the described one group of out-degree weight array that produces at random as initial population;
(4), and calculate the accumulation reliability sum of all nodes of every tree topology for the corresponding tree topology of each body structure in the said initial population;
(5) with the said initial population of step (4) or the described initial population of step (6) as the evolution population, each individuality of said evolution population is duplicated and makes a variation, form the variation population; According to the corresponding tree topology of said each body structure of variation population, and calculate the accumulation reliability sum of all nodes of every tree topology.
(6) the accumulation reliability sum of said evolution population and said all individual corresponding nodes of variation population is carried out sort descending, the initial population of selecting ordering to evolve as a new round at half preceding individuality;
Whether the initial population of (7) evolving for a said new round that produces in the step (6) satisfies the judgement of evolution termination condition, if do not satisfy said evolution termination condition, repeated execution of steps (5) is to step (7), till satisfying the evolution termination condition;
(8) satisfy the initial population that the said new round of evolution termination condition is evolved in the step (7), be the optimum tree-shaped core topology of reliability.
It is characterized in that the length of said out-degree weight array is the depth capacity of said tree topology;
Said satisfied evolution termination condition is that evolutionary generation reaches the upper limit for the maximum of the accumulation reliability sum of all nodes, the variation of mean value less than threshold value or said satisfied evolution termination condition.
2. the optimum tree-shaped core topology method for solving of the reliability of the live nerve of a covering of P2P as claimed in claim 1, wherein, the accumulation reliability calculation methods of said node comprises:
(1) the accumulation reliability of the root node of said tree topology is himself reliability;
(2) begin from root node described in the step (1), all child nodes of range traversal, to each node set by step (3) calculate its accumulation reliability;
(3) self reliability of said node multiply by the accumulation reliability of the accumulation reliability of its parent node as said node.
3. the optimum tree-shaped core topology method for solving of the reliability of the live nerve of a covering of P2P as claimed in claim 1; Wherein, In the live nerve of a covering of said P2P, choose in the backbone node according to out-degree and reliability; Said out-degree is greater than Streaming Media speed, and said reliability is chosen for backbone node greater than the node of reliability thresholds.
4. the optimum tree-shaped core topology method for solving of the reliability of the live nerve of a covering of P2P as claimed in claim 3, wherein, said reliability thresholds realizes through setting fixed value.
5. the optimum tree-shaped core topology method for solving of the reliability of the live nerve of a covering of P2P as claimed in claim 3, wherein, said reliability thresholds realizes through the ratio of specifying backbone node quantity to account in total number of nodes.
6. the optimum tree-shaped core topology method for solving of the reliability of the live nerve of a covering of P2P as claimed in claim 1, wherein, according to the quantity and the average out-degree of the said backbone node of choosing, through formula:
Calculate the depth capacity of said tree topology structure, wherein c representes the quantity of the said backbone node of choosing, and d representes the average out-degree of the said backbone node of choosing, and e representes the degree of depth of said tree topology structure.
7. the optimum tree-shaped core topology method for solving of the reliability of the live nerve of a covering of P2P as claimed in claim 1, wherein, the method for the corresponding tree topology of said structure comprises:
(1) obtains the element of out-degree weight array according to succession, each element is carried out the processing of step (2) to step (3), join in the tree up to all nodes;
(2) calculate all according to said array element and do not add the weighting reliability of the node of in-tree, and carry out ordering from high to low;
(3), ordering is joined in the tree at preceding node one by one according to described node weighting reliability ranking results.Do not have node in the if tree, then only get a node as root, otherwise node is added on the leaf node of original tree, perhaps do not have node to be added up to the out-degree of using up all leaf nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210126532.0A CN102624596B (en) | 2012-04-26 | 2012-04-26 | Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210126532.0A CN102624596B (en) | 2012-04-26 | 2012-04-26 | Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102624596A true CN102624596A (en) | 2012-08-01 |
| CN102624596B CN102624596B (en) | 2014-11-05 |
Family
ID=46564287
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210126532.0A Expired - Fee Related CN102624596B (en) | 2012-04-26 | 2012-04-26 | Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102624596B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104821964A (en) * | 2015-05-13 | 2015-08-05 | 浙江传媒学院 | Method and system for cross channel aid based on IP multicast group |
| CN104901818A (en) * | 2015-05-13 | 2015-09-09 | 浙江传媒学院 | Application layer multicast implementation method with integration of IP multicast in mesh coverage network and system thereof |
| CN105049315A (en) * | 2015-08-07 | 2015-11-11 | 浙江大学 | Improved virtual network mapping method based on virtual network partition |
| CN105897910A (en) * | 2016-05-20 | 2016-08-24 | 广州华多网络科技有限公司 | Data transmission method and equipment |
| CN109951725A (en) * | 2019-03-07 | 2019-06-28 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of recommended method and relevant device of direct broadcasting room |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090268733A1 (en) * | 2004-03-13 | 2009-10-29 | International Business Machines Corporation | Methods and Apparatus for Content Delivery via Application Level Multicast with Minimum Communication Delay |
| CN102395146A (en) * | 2011-12-09 | 2012-03-28 | 中国科学院上海微系统与信息技术研究所 | Multiple-target monitoring oriented method for sensing topology construction in wireless sensor network |
-
2012
- 2012-04-26 CN CN201210126532.0A patent/CN102624596B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090268733A1 (en) * | 2004-03-13 | 2009-10-29 | International Business Machines Corporation | Methods and Apparatus for Content Delivery via Application Level Multicast with Minimum Communication Delay |
| CN102395146A (en) * | 2011-12-09 | 2012-03-28 | 中国科学院上海微系统与信息技术研究所 | Multiple-target monitoring oriented method for sensing topology construction in wireless sensor network |
Non-Patent Citations (5)
| Title |
|---|
| CHAO ZHANG等: ""Anysee: Multicast-based Peer-to-Peer Media Streaming Service System"", 《2005 ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS》, 5 October 2005 (2005-10-05), pages 274 - 278 * |
| 秦丰林，刘琚: ""P2P网络流媒体关键技术"", 《电子学报》, vol. 39, no. 4, 30 April 2011 (2011-04-30) * |
| 贾晓雯，翁建广: ""多网融合承载的P2P直播覆盖网优化关键问题分析"", 《计算机应用于软件》, vol. 28, no. 4, 30 April 2011 (2011-04-30) * |
| 郭彤城，慕春棣: ""并行遗传算法在一类计算机网络可靠性优化问题中的应用"", 《系统工程理论与实践》, no. 1, 31 January 2003 (2003-01-31) * |
| 黄思嘉: ""基于CDN和P2P树网混合的流媒体直播系统设计"", 《中国优秀硕士学位论文全文数据库信息科技辑》, no. 1, 15 January 2012 (2012-01-15) * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104821964A (en) * | 2015-05-13 | 2015-08-05 | 浙江传媒学院 | Method and system for cross channel aid based on IP multicast group |
| CN104901818A (en) * | 2015-05-13 | 2015-09-09 | 浙江传媒学院 | Application layer multicast implementation method with integration of IP multicast in mesh coverage network and system thereof |
| CN104901818B (en) * | 2015-05-13 | 2019-01-01 | 浙江传媒学院 | A kind of IP multicast is blended in the application layer multicast realization method and system of netted nerve of a covering |
| CN104821964B (en) * | 2015-05-13 | 2019-01-01 | 浙江传媒学院 | Across channel assistance method and system based on IP multicast group |
| CN105049315A (en) * | 2015-08-07 | 2015-11-11 | 浙江大学 | Improved virtual network mapping method based on virtual network partition |
| CN105049315B (en) * | 2015-08-07 | 2018-12-07 | 浙江大学 | A kind of virtual network improvement mapping method based on virtual network segmentation |
| CN105897910A (en) * | 2016-05-20 | 2016-08-24 | 广州华多网络科技有限公司 | Data transmission method and equipment |
| CN105897910B (en) * | 2016-05-20 | 2019-10-11 | 广州华多网络科技有限公司 | Data transmission method and transmission device |
| CN109951725A (en) * | 2019-03-07 | 2019-06-28 | 武汉斗鱼鱼乐网络科技有限公司 | A kind of recommended method and relevant device of direct broadcasting room |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102624596B (en) | 2014-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hu et al. | Decentralized federated learning: A segmented gossip approach | |
| CN102624596B (en) | Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network | |
| CN105049536A (en) | Load balancing system and load balancing method in IaaS (Infrastructure As A Service) cloud environment | |
| Liu et al. | Task scheduling in fog enabled Internet of Things for smart cities | |
| Su et al. | Incentive mechanisms in p2p media streaming systems | |
| CN101616074B (en) | Multicast routing optimization method based on quantum evolution | |
| Chmaj et al. | A P2P computing system for overlay networks | |
| CN115907038A (en) | Multivariate control decision-making method based on federated split learning framework | |
| CN102546230B (en) | Overlay-network topological optimization method in P2P (Peer-To-Peer) streaming media system | |
| CN103581329A (en) | Construction method for topological structure based on clustered peer-to-peer network streaming media direct broadcast system | |
| Ezovski et al. | Minimizing average finish time in P2P networks | |
| Shen et al. | CCLBR: Congestion control-based load balanced routing in unstructured P2P systems | |
| Toka et al. | Analysis of user-driven peer selection in peer-to-peer backup and storage systems | |
| CN114118444B (en) | Method for reducing equipment idle running time in federal learning by using heuristic algorithm | |
| CN101741749A (en) | Method for optimizing multi-object multicast routing based on immune clone | |
| Chan et al. | Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution | |
| Lingjun et al. | Improving file distribution performance by grouping in peer-to-peer networks | |
| CN102035656A (en) | Method for realizing multicast system of overlay network based on agency | |
| Li et al. | Progressive forwarding disaster backup among cloud datacenters | |
| Gurses et al. | Maximum utility peer selection for p2p streaming in wireless ad hoc networks | |
| Walkowiak | Network design problem for P2P multicasting | |
| Jamali et al. | Adaptive peer to peer resource discovery in grid computing based on reinforcement learning | |
| Ding et al. | Improved ant colony algorithm with multi-strategies for QoS routing problems | |
| Zhang et al. | Exploiting proximity in cooperative download of large files in peer-to-peer networks | |
| Wu et al. | Maximizing universal streaming rate in peer-to-peer streaming networks |
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: 20141105 Termination date: 20180426 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |