CN101572620A - Method for constructing multi-tree topology and root node - Google Patents
Method for constructing multi-tree topology and root node Download PDFInfo
- Publication number
- CN101572620A CN101572620A CNA2008101054499A CN200810105449A CN101572620A CN 101572620 A CN101572620 A CN 101572620A CN A2008101054499 A CNA2008101054499 A CN A2008101054499A CN 200810105449 A CN200810105449 A CN 200810105449A CN 101572620 A CN101572620 A CN 101572620A
- Authority
- CN
- China
- Prior art keywords
- node
- subtree
- upstream bandwidth
- determination module
- tree topology
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for constructing multi-tree topology and a root node, belonging to the field of network management. The method comprises the steps: confirming the role of the node according to uplink bandwidth information and confirming a subtree that the node belongs to according to the principle that subtree uplink bandwidths are equal or similar; and confirming the position of the node in the subtree that the node belongs to according to the uplink bandwidth information of the node. The root node comprises a role confirming module, a subtree attribution confirming module and a position confirming module. During constructing multi-tree topology, the method takes the uplink bandwidth information of the node into consideration and regularly distributes nodes into each subtree according to the uplink bandwidth information of the node, thereby ensuring that the depth of the subtree of the multi-tree topology is easy to control and further being beneficial to improving the transmission efficiency of the multi-tree topology.
Description
Technical field
The present invention relates to field of network management, particularly a kind of method and a kind of root node that makes up multi-tree topology.
Background technology
Along with the continuous development of wideband multimedia network, various broadband networks are used and are emerged in an endless stream.Web TV (InternetProtocol Television, IPTV), the bearing capacity used all existing wideband multimedia network of broadbands such as video conference, data and data distribution, network audio application, Internet video application, multimedia remote education proposed challenge.The legacy network that adopts unicast technique to make up can't satisfy the requirement that emerging broadband network is applied in bandwidth and network service quality aspect, and the thing followed is problems such as network delay, loss of data.Introduce the IP multicasting technology thus, be used to overcome the above problems.The IP multicasting technology is to an important expansion of existing Internet basic " clean culture, transmission as possible " model, and it realizes that between sender and each recipient single-point connects multidrop network.If a sender transmits identical data for simultaneously a plurality of recipients, also only need duplicate a identical data.The IP multicasting technology has improved data-transmission efficiency, has reduced network and congested possibility occurred.At present, carried out big quantity research, but because there is serious problem in the IP multicast in transmission technology and management, the IP multicasting technology is not adopted generally in Internet at present at the IP multicasting technology.
In recent years, application layer multicast (Application Layer Multicast, ALM) technology have appearred in the proposition along with Peer-to-Peer Network (P2P network) and Overlay Network technology such as (overlay networks).Its main thought is: keep Internet original " clean culture, transmission as possible " function, do not change the architecture of original network as far as possible, and mainly realize the function of multicast by the function that increases end system.Adopt application layer multicast only need change end system, and do not need router is carried out any modification, be convenient to realize and promote.In addition, the implementation that application layer multicast is can be at different Application Design different is realized flexibly, needn't must be different application unifications in a model as the IP multicasting technology.
Based on the application layer multicast of multi-tree topology, between multicast member, safeguard a plurality of multicast tree simultaneously.That system utilizes is multiple description coded (Multiple Description Coding, MDC) algorithm becomes N (N is a positive integer) height stream with media data encoding, and wherein, the bandwidth of each height stream is identical.N son stream is propagated along a plurality of multicast tree simultaneously.As long as multicast member is received N any M (M is a positive integer) height stream in the son stream, just can finish decoding, wherein M＜N.Improved the robustness of system greatly based on the application layer multicast scheme of multi-tree topology, the isomery and the terminal that have reduced terminal arbitrarily pass in and out the influence of multicast number to the system transmissions effect.Therefore, when realizing the application layer multicast scheme, how making up multi-tree topology is a very important problem.
Prior art has a variety of about the method that makes up multi-tree topology, representational method is Scribe (Si Kebai) method, the characteristics of the multi-tree topology that makes up according to the Scribe method are: if first, node serves as intermediate node in a subtree, then can only serve as leaf node in other subtree; The second, with node ID (sign) as the input, utilize Pastry (the Paasche spy is auspicious) Algorithm Analysis can obtain the particular location of node.Concrete, it is respectively node A, Node B, node C, node D and node E that 5 nodes are arranged in the system, upstream bandwidth is respectively 256K bit, 512K bit, 1M bit, 2M bit and 4M bit, the upstream bandwidth that current wall scroll stream needs is the 512K bit, and the multi-tree topology that makes up according to the Scribe method as shown in Figure 1.The degree of depth of first subtree of multi-tree topology is that the degree of depth of 4, the second subtrees is 2 among the figure.Because the whole time delay of multi-tree topology is subjected to the influence of the maximum subtree degree of depth, the subtree degree of depth is dark more, and time delay is big more, and the whole time delay of multi-tree topology is also big more.
The inventor finds that in research process the method for existing structure multi-tree topology is not considered the upstream bandwidth information of node, and this can cause the degree of depth of subtree of multi-tree topology wayward.
Summary of the invention
For the subtree degree of depth that makes multi-tree topology is controlled easily, the embodiment of the invention provides a kind of method and a kind of root node that makes up multi-tree topology.Described technical scheme is as follows:
A kind of method that makes up multi-tree topology, described method comprises:
Determine the role of described node according to the upstream bandwidth information of node, and equate or close principle is determined the subtree that described node belongs to according to the subtree upstream bandwidth;
Determine the position of described node in the subtree that is belonged to according to the upstream bandwidth information of described node.
A kind of root node, described root node comprises:
Role's determination module is used for determining according to the upstream bandwidth information of node the role of described node;
Subtree ownership determination module is used for according to the role of described node and the subtree upstream bandwidth equates or close principle is determined the subtree that described node belongs to;
Position determination module is used for determining the position of described node in the subtree that is belonged to according to the upstream bandwidth information of described node.
The embodiment of the invention is when making up multi-tree topology, considered the upstream bandwidth information of node, upstream bandwidth information according to node balancedly is assigned to node in each subtree, guarantees that the subtree degree of depth of multi-tree topology is controlled easily, and then helps to improve the efficiency of transmission of multi-tree topology.
Description of drawings
Fig. 1 is the schematic diagram of the multi-tree topology that makes up based on the Scribe method that provides of prior art;
Fig. 2 is a kind of flow chart that makes up the method for multi-tree topology that the embodiment of the invention provides;
Fig. 3 is the schematic diagram of the level of the subtree that definite node belonged to that provides of the embodiment of the invention;
Fig. 4 and Fig. 5 are the another kind of schematic diagrames of the level of the subtree that definite node belonged to that provides of the embodiment of the invention;
Fig. 6 is the schematic diagram of when node withdraws from multi-tree topology being adjusted that the embodiment of the invention provides;
Fig. 7 is the schematic diagram of the multi-tree topology after structure that the embodiment of the invention provides is finished;
Fig. 8 is the structural representation of a kind of root node of providing of the embodiment of the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
The embodiment of the invention provides a kind of construction method of multi-tree topology, and this method controls the degree of depth of each subtree of multi-tree topology based on the upstream bandwidth information architecture multi-tree topology of node easily, and then helps to improve the efficiency of transmission of multi-tree topology.As shown in Figure 2, the concrete steps of present embodiment are as follows:
101: determine the role of node according to the upstream bandwidth information of node, and equate or close principle is determined the subtree that this node belongs to according to the subtree upstream bandwidth.
Concrete grammar is: root node compares the upstream bandwidth of node and the son stream bandwidth of subtree, if the upstream bandwidth of node then joins this node in all subtrees as leaf node less than the son stream bandwidth of subtree; If the upstream bandwidth of node then joins this node in the subtree of upstream bandwidth minimum greater than the son of subtree stream bandwidth as intermediate node, this node in other subtree as leaf node.The upstream bandwidth of subtree wherein equals the summation of the upstream bandwidth of intermediate node, and the sum value of the upstream bandwidth of intermediate node is big more, and the uplink capacity of subtree is big more.
In embodiments of the present invention, in order to guarantee the influence minimum of node failure,, then can only in other subtrees, serve as leaf node if a node is served as intermediate node in a subtree to system.
102: determine the level of this node in the subtree that is belonged to.
If the role of node is a leaf node, then this node is in the bottom of subtree; If the role of node is an intermediate node, then the upstream bandwidth information with self sends to root node, root node compares the upstream bandwidth of this node and the upstream bandwidth of every node layer, if the upstream bandwidth of this node is less than the maximum upstream bandwidth of node in anterior layer, and minimum upstream bandwidth greater than node in anterior layer, then definite this node ownership is worked as anterior layer, and anterior layer is worked as in adding.Still have spatial accommodation if work as anterior layer, then this node directly adds and works as anterior layer, if when anterior layer spatial accommodation deficiency, then replaces the node adding of upstream bandwidth minimum in anterior layer to work as anterior layer.As shown in Figure 3, node G adds subtree as intermediate node, and node G sends to root node with its upstream bandwidth information.After root node compares the upstream bandwidth of the upstream bandwidth of node G and each node layer, the upstream bandwidth of finding node G is less than the maximum upstream bandwidth of node in the 3rd layer, greater than the minimum upstream bandwidth of node in the 3rd layer, therefore, determine that node G belongs to the 3rd layer.Because the fan out capability of second layer node is 6, shows that it is 6 that second layer node can provide the interstitial content of service downwards, and there are two nodes the 3rd layer of this moment, shows that the 3rd layer still has spatial accommodation, and node G directly adds the 3rd layer like this.As shown in Figure 4 and Figure 5, node H adds subtree as intermediate node, and node G sends to root node with its upstream bandwidth information.After root node compares the upstream bandwidth of the upstream bandwidth of node G and each node layer, the upstream bandwidth of finding node G is less than the maximum upstream bandwidth of node in the 3rd layer, greater than the minimum upstream bandwidth of node in the 3rd layer, therefore, determine that node G belongs to the 3rd layer.Because the 3rd layer fan out capability is 3, show that it is 3 that second layer node can provide the interstitial content of service downwards, and this moment the 3rd layer 3 nodes are arranged, show the 3rd layer spatial accommodation deficiency, node H is extruded into the 4th layer with the node G of upstream bandwidth minimum in the 3rd layer like this, occupies the position of original node G.
103: determine the father node of node in the subtree that is belonged to.
After the level of node in determining its subtree that is belonged to, the test post of self-ability information is carried in generation, and this test post is sent to all nodes of its last layer, the last layer node adds the ability information of self in the test post of reception, and this test post sent to its last layer node, and the like, arrive root node up to test post.It will be appreciated by those skilled in the art that, when node successively sends to upper layer node with its ability information by test post, upper layer node also can be added the ability information of self in the test post to, and sends to its upper layer node, reaches root node up to test post.Root node is according to default selection strategy, the decision systems optimal path, and optimal path returned to this node, it is the optimal path of its selection that this node inserts root node.The self-ability information that need to prove node can be selected as required, for example, the test post that each node will carry the available upstream bandwidth information of self sends to root node, root node receives the available upstream bandwidth information of each node, according to the maximum principle in path, the node on the path of available upstream bandwidth maximum is returned to requesting node as its father node.
After the multi-tree topology structure was finished, root node write down the positional information and the upstream bandwidth information of every node layer.
104: when node withdraws from, multi-tree topology is adjusted.
In actual applications, node can often log off, withdraw from influence in order to reduce node to system, the mechanism that withdraws from is: directly carry its descendants's node by this child nodes that withdraws from node and carry out access procedure, and descendants's node does not change its set membership, the change of node location relation is little like this, greatly reduces node and withdraws from the topology surge that causes.As shown in Figure 6, suppose the upstream bandwidth of the upstream bandwidth of node A greater than Node B.When grandfather's node G of Node B withdrawed from, the child nodes F of node G carried its child node B and carries out adition process again, and the position relation of node F and Node B does not change.Because the upstream bandwidth of node A, is therefore adjusted the position relation of node A and Node B greater than the upstream bandwidth of Node B.Because when grandfather's node withdrawed from, the position of its child node F and descendants's node thereof relation did not change, therefore, help to reduce node and withdraw from the topology concussion that causes.
Node withdraw from adjust finish after, the positional information of node and the upstream bandwidth information of every node layer in the root node record subtree.
Concrete, supposing the system has 9 nodes, be respectively node A, Node B, node C, node D, node E, node F, node G, node H, node I, the upstream bandwidth of each node is respectively 256K, 256K, 2M, 4M, 4M, 256K, 256K, 2M, 1M, the son stream bandwidth of subtree is 1M, and root node is 2 at the fan out capability of each subtree, and the subtree number of user preset is 2.The multi-tree topology that makes up according to the technical scheme of present embodiment is shown in 7, and among the figure, node A, Node B, node F and node G are as leaf node, and node C, node D, node E, node H, node I can be used as intermediate node.Intermediate node C, E in first subtree, the upstream bandwidth summation of I are 256K+1M+4M, the upstream bandwidth summation of intermediate node D, H in second subtree is 4M+2M, the upstream bandwidth of such two subtrees is approximate, and the degree of depth of two subtrees all is 2, so the efficiency of transmission of multi-tree topology is improved.
The embodiment of the invention is when making up multi-tree topology, considered the upstream bandwidth information of node, and balancedly node is assigned in each subtree according to the upstream bandwidth information of node, guarantee that the subtree degree of depth of multi-tree topology is controlled easily, and then help to provide the efficiency of transmission of multi-tree topology.
The embodiment of the invention provides a kind of root node, and as shown in Figure 8, this root node comprises:
Role's determination module is used for determining according to the upstream bandwidth information of node the role of node;
Subtree ownership determination module is used for according to the role of node and the subtree upstream bandwidth equates or close principle is determined the subtree that this node belongs to;
Position determination module is used for determining the position of this node in the subtree that is belonged to according to the upstream bandwidth information of node.
Wherein, position determination module comprises:
The level determination module is used for determining the level of this node in the ownership subtree;
The father node determination module is used for determining the father node of this node in the ownership subtree.
Further, this root node also comprises:
Trigger module is used for when node withdraws from, and triggers role's determination module, subtree ownership determination module and position determination module;
Role's determination module determines to withdraw from the role of child node in subtree of node; Subtree ownership determination module determines to withdraw from the subtree that child node belonged to of node; Position determination module determines to withdraw from the position of child node in the subtree that is belonged to of node.
The embodiment of the invention is when making up multi-tree topology, considered the upstream bandwidth information of node, and balancedly node is assigned in each subtree according to the upstream bandwidth information of node, guarantee that the subtree degree of depth of multi-tree topology is controlled easily, and then help to improve the efficiency of transmission of multi-tree topology.
The technical scheme that above embodiment provides can realize that software is stored on the storage medium that can read by hardware and software, as the floppy disk of computer, and hard disk or CD etc.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1, a kind of method that makes up multi-tree topology is characterized in that, described method comprises:
Determine the role of described node according to the upstream bandwidth information of node, and equate or close principle is determined the subtree that described node belongs to according to the subtree upstream bandwidth;
Determine the position of described node in the subtree that is belonged to according to the upstream bandwidth information of described node.
2, the method for structure multi-tree topology as claimed in claim 1, it is characterized in that, describedly determine the role of present node, and equate or close principle determines that the step of the subtree that described node belongs to specifically comprises according to the subtree upstream bandwidth according to the upstream bandwidth information of node:
The upstream bandwidth of described node and the son of subtree are flowed bandwidth ratio, if the upstream bandwidth of described node is greater than the son stream bandwidth of subtree, then described node is joined the subtree of upstream bandwidth minimum as intermediate node, in other subtree as leaf node, if the upstream bandwidth of described node then joins all subtrees with described node as leaf node less than the son stream bandwidth of subtree.
3, the method for structure multi-tree topology as claimed in claim 1 is characterized in that, described upstream bandwidth information according to described node determines that the step of the position of described node in the subtree that is belonged to specifically comprises:
Determine the level of described node in the ownership subtree;
Determine the father node of described node in the ownership subtree.
4, the method for structure multi-tree topology as claimed in claim 3 is characterized in that, describedly determines that the step of the level of described node in the ownership subtree specifically comprises:
The upstream bandwidth of described node and the upstream bandwidth of every node layer are compared, if the upstream bandwidth of described node is less than the maximum upstream bandwidth of node in anterior layer, and greater than the minimum upstream bandwidth of node in anterior layer, then definite described node ownership is worked as anterior layer.
5, the method for structure multi-tree topology as claimed in claim 4 is characterized in that, describedly determines that the step of the father node of described node in the ownership subtree specifically comprises:
Receive the detecting information that self produces that carries that the upper layer node of described node and described node sends, and be that described node is selected father node according to preset strategy.
As the method for any described structure multi-tree topology of claim of claim 1-5, it is characterized in that 6, described method also comprises:
When node withdrawed from, the described child node that withdraws from node was carried its child node and is carried out adition process.
7, a kind of root node is characterized in that, described root node comprises:
Role's determination module is used for determining according to the upstream bandwidth information of node the role of described node;
Subtree ownership determination module is used for according to the role of described node and the subtree upstream bandwidth equates or close principle is determined the subtree that described node belongs to;
Position determination module is used for determining the position of described node in the subtree that is belonged to according to the upstream bandwidth information of described node.
8, root node as claimed in claim 7 is characterized in that, described position determination module comprises:
The level determination module is used for determining the level of described node in the ownership subtree;
The father node determination module is used for determining the father node of described node in the ownership subtree.
9, as claim 7 or 8 described root nodes, it is characterized in that described root node also comprises:
Trigger module is used for when node withdraws from, and triggers described role's determination module, subtree ownership determination module and position determination module;
Described role's determination module is determined the described role of child node in subtree who withdraws from node; Subtree ownership determination module is determined the described subtree that child node belonged to that withdraws from node; Described position determination module is determined the described position of child node in the subtree that is belonged to of withdrawing from node.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101054499A CN101572620B (en) | 2008-04-29 | 2008-04-29 | Method for constructing multi-tree topology and root node |
| PCT/CN2009/071196 WO2009132545A1 (en) | 2008-04-29 | 2009-04-08 | Root node and method for constructing multi-tree topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101054499A CN101572620B (en) | 2008-04-29 | 2008-04-29 | Method for constructing multi-tree topology and root node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101572620A true CN101572620A (en) | 2009-11-04 |
| CN101572620B CN101572620B (en) | 2012-01-04 |
Family
ID=41231858
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101054499A Expired - Fee Related CN101572620B (en) | 2008-04-29 | 2008-04-29 | Method for constructing multi-tree topology and root node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101572620B (en) |
| WO (1) | WO2009132545A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001884A (en) * | 2012-12-12 | 2013-03-27 | 清华大学 | Distributed energy-saving routing traffic adjusting method |
| CN105916185A (en) * | 2016-03-30 | 2016-08-31 | 中国科学院信息工程研究所 | Uplink scheduling method based on double-tree routing and device |
| CN106034106A (en) * | 2015-03-10 | 2016-10-19 | 中国电信股份有限公司 | Networking method, networking management method, networking device, networking management device and networking system |
| CN109618381A (en) * | 2018-11-27 | 2019-04-12 | 国网山东省电力公司济宁供电公司 | Ad hoc network communication method and ad hoc network communication system |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112104558B (en) * | 2020-10-30 | 2021-09-07 | 上海交通大学 | Method, system, terminal and medium for implementing block chain distribution network |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6961319B2 (en) * | 2001-07-16 | 2005-11-01 | International Business Machines Corporation | Methods and arrangements for distribution tree development |
| CN1216491C (en) * | 2003-10-16 | 2005-08-24 | 上海交通大学 | Application tier combined playing method for multi-point video conference system based on reciprocal interconnection |
| JP4370995B2 (en) * | 2004-07-26 | 2009-11-25 | ブラザー工業株式会社 | Connection mode setting device, connection mode setting method, connection mode control device, connection mode control method, etc. |
| CN100461740C (en) * | 2007-06-05 | 2009-02-11 | 华为技术有限公司 | Customer end node network topological structure method and stream media distributing system |
-
2008
- 2008-04-29 CN CN2008101054499A patent/CN101572620B/en not_active Expired - Fee Related
-
2009
- 2009-04-08 WO PCT/CN2009/071196 patent/WO2009132545A1/en active Application Filing
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001884A (en) * | 2012-12-12 | 2013-03-27 | 清华大学 | Distributed energy-saving routing traffic adjusting method |
| CN103001884B (en) * | 2012-12-12 | 2015-08-19 | 清华大学 | Distributed energy-efficient routing flow method of adjustment |
| CN106034106A (en) * | 2015-03-10 | 2016-10-19 | 中国电信股份有限公司 | Networking method, networking management method, networking device, networking management device and networking system |
| CN106034106B (en) * | 2015-03-10 | 2019-06-25 | 中国电信股份有限公司 | Network-building method, networking management method and device and system |
| CN105916185A (en) * | 2016-03-30 | 2016-08-31 | 中国科学院信息工程研究所 | Uplink scheduling method based on double-tree routing and device |
| CN105916185B (en) * | 2016-03-30 | 2019-07-12 | 中国科学院信息工程研究所 | A kind of uplink dispatch method and device based on double tree routings |
| CN109618381A (en) * | 2018-11-27 | 2019-04-12 | 国网山东省电力公司济宁供电公司 | Ad hoc network communication method and ad hoc network communication system |
| CN109618381B (en) * | 2018-11-27 | 2022-05-13 | 国网山东省电力公司济宁供电公司 | Ad hoc network communication method and ad hoc network communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101572620B (en) | 2012-01-04 |
| WO2009132545A1 (en) | 2009-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8477658B2 (en) | Intelligent peer-to-peer media streaming | |
| US8295203B2 (en) | Methods and systems to store state used to forward multicast traffic | |
| CN101572620B (en) | Method for constructing multi-tree topology and root node | |
| Xiao et al. | Layerp2p: A new data scheduling approach for layered streaming in heterogeneous networks | |
| CN101707568B (en) | Method and system for controller user multicast service and multicast main control device | |
| CN101521583B (en) | Resource admission control method, system and device | |
| Fodor et al. | Resilience in live peer-to-peer streaming [Peer-to-Peer Multimedia Streaming] | |
| CN101267541A (en) | A stream media distribution server applicable to online VoD or living broadcast | |
| Huang et al. | Bandwidth-efficient packet scheduling for live streaming with network coding | |
| CN103139607B (en) | A kind of real-time network monitoring system and method thereof | |
| CN109729307A (en) | A kind of multicast desktop video conferencing system based on fountain codes | |
| CN102170364B (en) | Multicast communication method and device for broadband remote access server | |
| Thomos et al. | Randomized network coding for UEP video delivery in overlay networks | |
| Guo et al. | P2Cast: peer-to-peer patching for video on demand service | |
| Kobayashi et al. | Reliable application layer multicast over combined wired and wireless networks | |
| CN104618247B (en) | A kind of transmission method and device of multicast message | |
| CN101848224B (en) | Network coding method for streaming media of peer-to-peer network | |
| CN103701827A (en) | Method for realizing stream media play based on self-adaption stream media service gateway system | |
| Xu | Resource-efficient delivery of on-demand streaming data using UEP codes | |
| CN107566992B (en) | Method for constructing and recovering multicast tree of mobile application layer based on comprehensive performance of nodes | |
| Xiao et al. | Toward systematical data scheduling for layered streaming in peer-to-peer networks: Can we go farther? | |
| Kim et al. | Sever Selection Schemes Considering Node Status For a Fault-Tolerant Streaming Service on a Peer-to-Peer Network | |
| Li et al. | An effective transmission scheduling mechanism with network coding for adaptive P2P streaming | |
| Cores et al. | A fully scalable and distributed architecture for video-on-demand | |
| Xiaochuan et al. | A hypercubic event-dissemination overlay using structure-aware addressing for distributed xml-based pub/sub system |
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: 20120104 Termination date: 20150429 |
|
| EXPY | Termination of patent right or utility model |