CN102035656A - Method for realizing multicast system of overlay network based on agency - Google Patents
Method for realizing multicast system of overlay network based on agency Download PDFInfo
- Publication number
- CN102035656A CN102035656A CN2010102721976A CN201010272197A CN102035656A CN 102035656 A CN102035656 A CN 102035656A CN 2010102721976 A CN2010102721976 A CN 2010102721976A CN 201010272197 A CN201010272197 A CN 201010272197A CN 102035656 A CN102035656 A CN 102035656A
- Authority
- CN
- China
- Prior art keywords
- node
- tree
- network
- limit
- expression
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for realizing a multicast system of an overlay network based on agency. The method is characterized in that a balance is reached between the time-delay characteristics and the network resource utilization rate of the nodes of a video conference system under the condition of constraining the satisfaction degree; and the method simultaneously focuses on the stability problem of the multicast tree of the video conference system and enhances the stability and the robustness of the multicast.
Description
Technical field
This patent relates to the cover network multicasting field, relates in particular to a kind of overlay network based on video conferencing system and acts on behalf of method of multicasting.
Background technology
Along with Internet development, overlay network multicast systems such as video conference, video monitoring are used more and more widely.Because cover network multicasting is in flexibility, the advantage of aspects such as deployable makes it to substitute gradually the IP multicast, becomes the one preferred technique scheme that realizes implementing the multi-media network multicast functionality.But because overlay network is the virtual network that is based upon on the bottom unicast networks, the information that often lacks the bottom-layer network topological structure, simultaneously because different network application models has different QoS demands, how at different network environments, different network applications and demand, the efficient high-quality multicast services of design is the hot issue of a research.
In the past few years, the industry research personnel have proposed multiple cover network multicasting method and corresponding model based on the agency at video conferencing system.For example minimum diameter degree constraint generates tree-model, is constrained to the method for routing model of minimum cost spanning tree as cover network multicasting with diameter, at the model of the distributed firm generation tree of sensor network etc.But existing above video conferencing system is acted on behalf of the weak point of method of multicasting and has been to expend the degree that higher cost is come distribution node, and the difference that does not make full use of node degree makes the load of node and the degree constraint maintenance balance of node, has influenced its performance; For the diameter of Dynamic Maintenance video conferencing system multicast tree, expended massive band width simultaneously.
Summary of the invention
The objective of the invention is at the deficiencies in the prior art, a kind of overlay network multicast system implementation method based on the agency is provided.
The objective of the invention is to be achieved through the following technical solutions:
A kind of overlay network multicast system implementation method based on the agency may further comprise the steps:
(1) overlay network multicast system initialization: overlay network is the virtual network that is structured on the bottom-layer network.Suppose that the bottom IP network can provide transparent end-to-end singlecast router, network link is symmetrical, the network model of cover network multicasting can be with a total indirected graph G (V so, E) describe, wherein V is the set of node, expression nerve of a covering node, E=V * V is the set on limit, expression nerve of a covering virtual link, each bar virtual link comprises one or more of physical links corresponding to the unicast path of a bottom.For node v ∈ V, be defined as follows parameter: the bandwidth B of node
v(v) ∈ R
+, the maximum bandwidth capacity of expression node; The cost C of node
v(v) ∈ R
+, the expense expense of expression node etc.For limit e ∈ E, be defined as follows parameter: the bandwidth B on limit
e(e) ∈ R
+, the bandwidth capacity of expression virtual link; The time-delay D on limit
e(e) ∈ R
+, the end-to-end delay of expression virtual link; The cost C on limit
e(e) ∈ R
+, the Internet resources that the expression virtual link takies etc.
(2) agent node adds overlay network multicast system: based on agency's cover network multicasting, be made up of group transmitting service node MSN and client computer Client.MSN is responsible for constructing the core multicast distribution tree, and Client connects MSN, obtains multicast services.
(3) overlay network multicast system is built the multicast tree internal structure based on the agency: in the BRST method, overlay network multicast system never add to generate successively chooses a node in the node of tree and corresponding limit is added in the tree, till all nodes all add in-tree.For candidate's limit e (u, v) (v) adopt following integrate-cost Γ (e) from the node u of tree T to the node of Cheng Shu not:
Γ(e)＝(K·D
e(e)+(1-K)·D
p(r，v))·I
d(u)
Wherein,
For from root node r to both candidate nodes v; (r v) is along the path that generates tree T from node r to node v to P;
The invention has the beneficial effects as follows that the overlay network multicast system implementation method that the present invention is based on the agency can be under the condition of satisfaction constraint, make between the time-delay characteristics of video conferencing system node and the network resource utilization to reach a balance; And method has been taken into account the steadiness problem of video conferencing system multicast tree, has increased the stability and the robustness of multicast.
Description of drawings
Fig. 1 is the network model of cover network multicasting, wherein, (a) is the bottom-layer network structure, (b) is the overlay network structure;
Fig. 2 is that overlay network is acted on behalf of the method for multicasting model.
Embodiment
The present invention is based on agency's overlay network multicast system implementation method, may further comprise the steps:
1 overlay network multicast system initialization
Overlay network is the virtual network that is structured on the bottom-layer network.Suppose that the bottom IP network can provide transparent end-to-end singlecast router, network link is symmetrical, the network model of cover network multicasting can be with a total indirected graph G (V so, E) describe, wherein V is the set of node, expression nerve of a covering node, E=V * V is the set on limit, expression nerve of a covering virtual link, each bar virtual link comprises one or more of physical links corresponding to the unicast path of a bottom.For node v ∈ V, be defined as follows parameter: the bandwidth B of node
v(v) ∈ R
+, the maximum bandwidth capacity of expression node; The cost C of node
v(v) ∈ R
+, the expense expense of expression node etc.For limit e ∈ E, be defined as follows parameter: the bandwidth B on limit
e(e) ∈ R
+, the bandwidth capacity of expression virtual link; The time-delay D on limit
e(e) ∈ R
+, the end-to-end delay of expression virtual link; The cost C on limit
e(e) ∈ R
+, the Internet resources that the expression virtual link takies etc.
Fig. 1 has provided the network model of a cover network multicasting.The network topology structure of Fig. 1 (a) expression bottom; The corresponding overlay network topological structure of Fig. 1 (b) expression.Virtual link comprises one or more physical link corresponding to a unicast path of bottom.All defined relevant parameters for nerve of a covering node and virtual link.Because the virtual link of nerve of a covering can be shared the physical link of bottom-layer network, this makes the bandwidth control of cover network multicasting become very complicated.A kind of mode of simplification is, the bandwidth bottleneck of supposing cover network multicasting is the bandwidth ability of node, the bandwidth ability B of virtual link
e(e) bandwidth capacity by node determines.For the bandwidth ability of node, can be to each node degree of setting constraint d
Max(represent that v) node can transmit the number of grouping at most to downstream node.d
Max(v) determine jointly by the capacity of node and the Media Stream bandwidth of multicast services.
2 agent nodes add overlay network multicast system
Based on agency's cover network multicasting, by group transmitting service node (Multicast Service Node, MSN) and client computer (Client) composition.MSN is responsible for constructing the core multicast distribution tree, and Client connects MSN, obtains multicast services.Because MSN has higher disposal ability, stability and fail safe, this type systematic often can provide more stable and high quality services.Therefore, this model is suitable for making up general multicast services platform, has using value preferably.Fig. 2 is an example based on agency's cover network multicasting.
3 overlay network multicast systems are built the multicast tree internal structure based on the agency
In the BRST method, overlay network multicast system never add to generate successively chooses a node in the node of tree and corresponding limit is added in the tree, till all nodes all add in-tree.In the process of choosing node and corresponding limit, we wish and can Optimization Dept. divide the cost that generates tree that node satisfies the degree constraint of father node simultaneously to the time-delay of root node.Obviously, these two conditions are always consistent.So, we for candidate's limit e (u, v) (v) adopt following integrate-cost Γ (e) from the node u of tree T to the node of Cheng Shu not:
Γ(e)＝(K·D
e(e)+(1-K)·D
p(r，v))·I
d(u)(1)
Wherein,
For from root node r to both candidate nodes v;
(r v) is along the path that generates tree T from node r to node v to P;
(1) formula of utilization, we can choose minimum both candidate nodes of integrate-cost Γ (e) and corresponding limit thereof successively, add generating in the tree to, finish up to the structure that generates tree.But also there are following two problems in this method: (1) can't guarantee that the tree T that generates satisfies diameter constraint B, though when structure generates tree and optimized time-delay characteristics; (2) do not consider the steadiness problem that generates tree.
For problem (1), a kind of solution intuitively is that during node of every interpolation, whether the diameter that all generates tree behind the node of calculating interpolation earlier surpasses diameter retrains B.Then, because the diameter of tree changes, safeguard that the diameter of the tree of a variation need expend o (n
2) computation complexity.So we adopt a kind of scheme of compromise: when generation tree structure was finished, whether the diameter that detects tree satisfied maximum constrained B, and as if satisfying, method is finished; Otherwise, revise parameter K=K/2; , re-constructs and generate tree, or satisfying diameter constraints up to the tree of structure reaches fail condition (as K＜δ, δ is a threshold value).
For problem (2), (Expected Data Loss EDL), represents when node or link failure the desired value of the data that multicast group is lost to have index-information dropout of the steadiness that generates tree to expect.And our known minimum hop count (FH, fewest hops) method can obtain optimum EDL performance.The shape of if tree T is round, each node to the jumping figure (hop) of root node hour, the EDL performance is more excellent; Conversely, the shape of if tree T is more slender, and each node is to the jumping figure (hop) of root node when big, the EDL poor-performing.
Because it is closely related to the jumping figure (hop) of root node to generate steadiness and each node of tree, so we adopt a kind of like this mode optimization method.When the both candidate nodes of choosing the integrate-cost minimum and corresponding limit thereof, choose optimum limit e
BestWith suboptimum limit e
Next_best, if the normalized value of the difference of both costs is less than threshold value Ω (but value 0.1,0.05 etc.), i.e. (Γ (e
Next_best)-Γ (e
Best))/Γ (e
BestDuring)＜Ω, think that two candidates' limit all is optimum limit; Relatively the node of two optimum limit introducings is chosen the less node and the corresponding optimum limit thereof of jumping figure (hop) of root node to the jumping figure of root node then.
To sum up, the BRST method step is as follows:
1) initialization generates tree and candidate's limit set;
2) choose two candidate limits that make integrate-cost Γ (e) minimum;
3) whether the integrate-cost of judging both is than less than threshold value, and then both are optimum limit if satisfy, otherwise the limit of getting minimum cost is optimum limit;
4) if optimum limit has two, then judge node that both introduce jumping figure to root node, select less limit;
5) the best candidate limit of choosing is added among the generation tree T;
6) if tree T does not construct fully, then upgrade the set of candidate limit, get back to step 2; Otherwise enter step 7;
7) judge that structure generates tree completely and whether satisfies diameter constraint B,, otherwise enter step 8 if satisfying method successfully releases;
8) undated parameter K judges whether less than threshold value Ω, if the method failure, otherwise reenter step 1 with updated parameters K.
The BRST method is to combine node to generate tree to root node time-delay, the integrate-cost optimization that generates the tree cost, simultaneously, when having a plurality of best candidate limit, chooses according to the index to the jumping figure (hop) of root node.The advantage of BRST is to combine a plurality of optimization aim (can select to stress different optimization aim by regulating parameter), owing to need not bring in constant renewal in and safeguard the diameter value that generates tree in the process of choosing, has reduced computation complexity simultaneously.The method complexity of BRST is o (n
2).
Claims (1)
1. the overlay network multicast system implementation method based on the agency is characterized in that, may further comprise the steps:
(1) overlay network multicast system initialization: overlay network is the virtual network that is structured on the bottom-layer network.Suppose that the bottom IP network can provide transparent end-to-end singlecast router, network link is symmetrical, the network model of cover network multicasting can be with a total indirected graph G (V so, E) describe, wherein V is the set of node, expression nerve of a covering node, E=V * V is the set on limit, expression nerve of a covering virtual link, each bar virtual link comprises one or more of physical links corresponding to the unicast path of a bottom.For node v ∈ V, be defined as follows parameter: the bandwidth B of node
v(v) ∈ R
+, the maximum bandwidth capacity of expression node; The cost C of node
v(v) ∈ R
+, the expense expense of expression node etc.For limit e ∈ E, be defined as follows parameter: the bandwidth B on limit
e(e) ∈ R
+, the bandwidth capacity of expression virtual link; The time-delay D on limit
e(e) ∈ R
+, the end-to-end delay of expression virtual link; The cost C on limit
e(e) ∈ R
+, the Internet resources that the expression virtual link takies etc.
(2) agent node adds overlay network multicast system: based on agency's cover network multicasting, be made up of group transmitting service node MSN and client computer Client.MSN is responsible for constructing the core multicast distribution tree, and Client connects MSN, obtains multicast services.
(3) overlay network multicast system is built the multicast tree internal structure based on the agency: in the BRST method, overlay network multicast system never add to generate successively chooses a node in the node of tree and corresponding limit is added in the tree, till all nodes all add in-tree.For candidate's limit e (u, v) (v) adopt following integrate-cost Γ (e) from the node u of tree T to the node of Cheng Shu not:
Γ(e)＝(K·D
e(e)+(1-K)·D
p(r，v))·I
d(u)
Wherein,
For from root node r to both candidate nodes v; (r v) is along the path that generates tree T from node r to node v to P;
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102721976A CN102035656A (en) | 2010-09-03 | 2010-09-03 | Method for realizing multicast system of overlay network based on agency |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102721976A CN102035656A (en) | 2010-09-03 | 2010-09-03 | Method for realizing multicast system of overlay network based on agency |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102035656A true CN102035656A (en) | 2011-04-27 |
Family
ID=43888029
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102721976A Pending CN102035656A (en) | 2010-09-03 | 2010-09-03 | Method for realizing multicast system of overlay network based on agency |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102035656A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102595548A (en) * | 2012-03-26 | 2012-07-18 | 中南大学 | Minimum cost multicast route method in cognitive wireless Mesh network |
| CN103957267A (en) * | 2014-05-08 | 2014-07-30 | 中国人民解放军总参谋部气象水文空间天气总站 | Multi-network multi-task multi-node data distribution method |
| CN112492255A (en) * | 2020-11-20 | 2021-03-12 | 杭州叙简科技股份有限公司 | Low-delay spanning tree audio and video conference method based on 5G |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1716955A (en) * | 2005-06-15 | 2006-01-04 | 北京交通大学 | Covering network group broadcast protocol technology |
| CN1719894A (en) * | 2005-06-15 | 2006-01-11 | 北京交通大学 | Method for implementing video request program under cover network multicasting |
-
2010
- 2010-09-03 CN CN2010102721976A patent/CN102035656A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1716955A (en) * | 2005-06-15 | 2006-01-04 | 北京交通大学 | Covering network group broadcast protocol technology |
| CN1719894A (en) * | 2005-06-15 | 2006-01-11 | 北京交通大学 | Method for implementing video request program under cover network multicasting |
Non-Patent Citations (1)
| Title |
|---|
| 《中国优秀硕士学位论文全文数据库 信息科技辑》 20100815 华能威 覆盖网组播协议研究 第9页，第19-23页 1 , 2 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102595548A (en) * | 2012-03-26 | 2012-07-18 | 中南大学 | Minimum cost multicast route method in cognitive wireless Mesh network |
| CN102595548B (en) * | 2012-03-26 | 2014-11-05 | 中南大学 | Minimum cost multicast route method in cognitive wireless Mesh network |
| CN103957267A (en) * | 2014-05-08 | 2014-07-30 | 中国人民解放军总参谋部气象水文空间天气总站 | Multi-network multi-task multi-node data distribution method |
| CN112492255A (en) * | 2020-11-20 | 2021-03-12 | 杭州叙简科技股份有限公司 | Low-delay spanning tree audio and video conference method based on 5G |
| CN112492255B (en) * | 2020-11-20 | 2022-07-05 | 杭州叙简科技股份有限公司 | Low-delay spanning tree audio and video conference method based on 5G |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xiang et al. | QoS routing based on genetic algorithm | |
| US20070280255A1 (en) | Intelligent Peer-to-Peer Media Streaming | |
| Ren et al. | On reducing mesh delay for peer-to-peer live streaming | |
| CN100477641C (en) | Data dispatching method of stream medium request broadcast system | |
| US20090034434A1 (en) | Interior-Node-Disjoint Multi-Tree Topology Formation | |
| Tian et al. | Robust and efficient path diversity in application-layer multicast for video streaming | |
| Birrer et al. | FatNemo: Building a resilient multi-source multicast fat-tree | |
| Dan et al. | On the performance of multiple-tree-based peer-to-peer live streaming | |
| CN102624596B (en) | Reliability optimal tree-shaped core topological solving method of P2P live broadcast covering network | |
| CN102035656A (en) | Method for realizing multicast system of overlay network based on agency | |
| Montana et al. | Adaptive reconfiguration of data networks using genetic algorithms | |
| CN102148664B (en) | Inter-multicast network coding control method applied to multi-source multi-destination network | |
| Huang et al. | Enhancing P2P overlay network architecture for live multimedia streaming | |
| Zhu et al. | Multicast flow aggregation in IP over optical networks | |
| CN101931543A (en) | Method for efficiently managing dynamic node based on overlay network multicast system | |
| Besharati et al. | A topology-aware application layer multicast protocol | |
| Lingjun et al. | Improving file distribution performance by grouping in peer-to-peer networks | |
| CN107800567B (en) | Method for establishing P2P streaming media network topology model of mixed mode | |
| Xie et al. | Reliable multicast routing with uncertain sources | |
| Walkowiak | Survivability of P2P multicasting | |
| He et al. | Distributed rate allocation in p2p streaming | |
| Gong et al. | A small-world fault-tolerant model for P2P media streaming network | |
| Ouali et al. | Revisiting peering strategies in push-pull based P2P streaming systems | |
| Tan et al. | Performance analysis and improvement of overlay construction for peer-to-peer live media streaming | |
| Liu et al. | Application layer multicast technology of streaming media |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110427 |