CN103905319A - Multiple-constraint multicast routing algorithm based on iteration coding - Google Patents
Multiple-constraint multicast routing algorithm based on iteration coding Download PDFInfo
- Publication number
- CN103905319A CN103905319A CN201410109422.2A CN201410109422A CN103905319A CN 103905319 A CN103905319 A CN 103905319A CN 201410109422 A CN201410109422 A CN 201410109422A CN 103905319 A CN103905319 A CN 103905319A
- Authority
- CN
- China
- Prior art keywords
- node
- multicast tree
- priori
- multicast
- req
- 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
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the field of network communication, in particular to a multiple-constraint multicast routing algorithm based on iteration coding. The multiple-constraint multicast routing algorithm based on iteration coding is applied to a communication network with multiple-constraint requirements aiming at the problems existing in the prior art. According to the method, a multicast tree coding method capable of eliminating a loop and high in coding and decoding applicability is designed, and meanwhile, the method can also eliminate a loop of a generated multicast tree. According to the method, a new multicast tree is generated by combining two multicast trees, and the new multicast tree is output after it is confirmed that the new multicast tree meets a routing constraint condition or the calculating process reaches iteration times.
Description
Technical field
The present invention relates to field of network communication, especially a kind of multiple constraint multicast routing algorithm based on iteration coding.
Background technology
In current network service, cast communication is a kind of important mode.Cast communication is than unicast communication, more effective in point-to-multipoint data transmission.The key that realizes cast communication is to set up Multicast Routing.Different from the transmission path in unicast communication, the topology of Multicast Routing is a multicast tree.At present, the business of communication network carrying has the Internet Transmission qos requirement of differentiation.These requirements are mainly reflected in several aspects such as propagation delay time, delay variation, throughput and the packet loss in network service process.This makes multicast routing problem under multi-constraint condition become the focus of a research.In existing achievement in research, there are many modes can solve unconfined multicast routing problem, for example dijkstra algorithm and Steiner tree.But these traditional methods can not solve the multicast routing problem under multi-constraint condition.
At present, can utilize some didactic algorithms and Swarm Intelligence Algorithm to solve the multicast routing problem under multi-constraint condition, such as simulated annealing, genetic algorithm, ant group algorithm, particle swarm optimization algorithm and firefly colony optimization algorithm etc.But above-mentioned algorithm is in the time solving multiple constraint multicast routing problem, it is slow that existence solves speed, the shortcomings such as computation complexity height.
Summary of the invention
Technical problem to be solved by this invention is: the problem existing for prior art, having in the telecommunication network of multiple constraint requirement, provides a kind of the present invention a kind of multiple constraint multicast routing algorithm based on iteration coding.Design possesses the multicast tree coding method of removing circuit functionality and having better encoding and decoding applicability, and meanwhile, the method also has the function of cancellation loop for the multicast tree having generated.
The technical solution used in the present invention is as follows:
A kind of multiple constraint multicast routing algorithm based on iteration coding comprises:
Step 1: input network topology structure, and network route restriction condition time delay D e
req, delay variation DJ
req, throughput Th
req, packet loss PLR
req, utilize multicast tree generation method to generate an oriented multicast tree;
Step 2: based on step 1, delete in multicast tree and do not meet packet loss PLR
reqthe node of constraints and the link being connected with these nodes, delete and do not meet time delay D e
req, delay variation DJ
req, throughput Th
reqlink after, generate a multicast tree x
j(t);
Step 3: based on step 1, a multicast tree x of the random generation of recycling multicast tree generation method
i(t);
Step 4: according to multicast tree coding method, combining step 2 and the multicast tree that step 3 obtains, generate new multicast tree
Step 5: if multicast tree x
i(t+1) meet route restriction condition or computational process and reach iterations, perform step 6; Otherwise, t=t+1, execution step 2;
Step 6: output multicast tree x
i(t+1).
Further, described multicast tree generation method specifically comprises:
Step 11: empty multicast tree x of initialization
0=(0
1, 0
2..., 0
n);
Step 12: be itself by the priori Node configuration of source node, i.e. x
s=(0
1, 0
2..., S
s..., 0
n);
Step 13 a: destination node of random selection is as present node from destination node set;
Step 14: from having the node set of annexation and delete immediate successor node with present node.Can generate the priori node set of present node;
Step 15: the random priori node of a node as present node of selecting from the priori node set of present node.Then be present node by the priori Node configuration of selection;
Step 16: if the priori node set of present node is empty, be " 0 ", go to step 14, otherwise go to step S17;
Step S17: if the priori node set of all destination nodes is empty, be " 0 ", go to step S108, otherwise go to step S13.
Step 18: export this oriented multicast tree x=(Prior
1, Prior
2..., Prior
n);
Further, in step 4, multicast tree coding method specifically comprises:
Step 41: select i node as present node from destination node set M, judge whether i is greater than the size of M, if go to step 44, go to step if not 42; Wherein i scope is from 1 to destination node set M quantity;
Step 42: judge whether present node is source node, in the time that present node is not source node, execution step 43; Otherwise, go to step 41, i=i+1;
Step 43: whether the priori number of nodes that judges present node is greater than 1, if priori number of nodes is greater than 1, selects a priori node as present node at random, goes to step 42; Otherwise present node, as priori node, goes to step 42;
Step 44: output does not exist the multicast tree x of loop
i(t+1).
Further, described in
middle operator
be defined as follows: multicast tree x
iand x (t)
j(t) merge into a new multicast tree x
i(t+1), the node set after merging is x
iand x (t)
j(t) all nodes that comprise, link set is x
iand x (t)
j(t) all links that comprise.
Further, described multicast tree refers to from destination node to be recalled to source node, and except source node does not have priori node, other node only has a priori node.
Further, described iterations is to determine according to network condition, manually sets: network size is little can set less iterations, and network size greatly can be set larger iterations.Because small scale iterations is many, the performance boost of multicast tree is not obvious, and calculates very large (efficiency-cost ratio is low) of cost; Network size is large, words difficult multicast tree that obtains better performances on probability that iterations is few.
In sum, owing to having adopted technique scheme, the invention has the beneficial effects as follows:
The present invention can be for any network size and network topology structure with multiple constraint requirement.Can generate efficiently the Multicast Routing tree that meets multiple constraint requirement, thereby solve preferably multiple constraint multicast routing problem.
The present invention, by utilizing a kind of iteration coding thinking, generates efficiently the Multicast Routing tree that meets telecommunication network multiple constraint requirement, thereby solves preferably multiple constraint multicast routing problem.This algorithm is applicable to all current communication network topology structures, and algorithm is realized simple, disposes while use device hardware without particular/special requirement, can ensure existing equipment investment completely.
Brief description of the drawings
Examples of the present invention will be described by way of reference to the accompanying drawings, wherein:
The method of the newly-generated multicast tree of Fig. 1.
Fig. 2 this patent flow chart.
Embodiment
Disclosed all features in this specification, or step in disclosed all methods or process, except mutually exclusive feature and/or step, all can combine by any way.
Disclosed arbitrary feature in this specification (comprising any accessory claim, summary and accompanying drawing), unless narration especially all can be replaced by other equivalences or the alternative features with similar object.,, unless narration especially, each feature is an example in a series of equivalences or similar characteristics.
Related description of the present invention:
1, multicast tree: recall to source node from destination node, except source node does not have priori node, other node only has a priori node.
2, in step 4, merge the multicast tree recycling after multicast tree coding method is combined afterwards and gone loop processed, approached gradually the target multicast tree that meets constraints.
3, multicast tree generation method: be by each network node independently on communication network, form an oriented Multicast Routing tree.
4, iterations: determine according to network condition, manually set: network size is little can set less iterations, and network size greatly can be set larger iterations.Because small scale iterations is many, the performance boost of multicast tree is not obvious, and calculates very large (efficiency-cost ratio is low) of cost; Network size is large, words difficult multicast tree that obtains better performances on probability that iterations is few.
5, multicast tree applying step 41 to the multicast tree coding method of step 44 that is combined generation can be removed loop wherein; For time delay D e
req, delay variation DJ
req, throughput Th
req, packet loss PLR
reqetc. problem, in step 2, the node and the limit that do not meet constraints to be deleted, multicast tree keeps down the part originally satisfying condition after merging, and meanwhile, multicast tree is supplementary complete, and supplementary part may meet again constraints (time delay D e
req, delay variation DJ
req, throughput Th
req, packet loss PLR
req) node and limit, also have the node and the limit that do not satisfy condition, but total effect is better than or equals a multicast tree.
6,
wherein operator
be defined as follows: multicast tree x
iand x (t)
j(t) merge into a new multicast tree x
i(t+1), the node set after merging is x
iand x (t)
j(t) all nodes that comprise, link set is x
iand x (t)
j(t) all links that comprise.
7, x
iand x (t)
j(t) represent two different multicast tree.X=(Prior
1, Prior
2..., Prior
n) be the expression formula of any multicast tree.X
0=(0
1, 0
2..., 0
n) represent the multicast tree of initialization sky.X
s=(0
1, 0
2..., S
s..., 0
n) represent to be itself by the priori Node configuration of source node.X
i(t+1) represent the multicast tree through coding, when it is as input variable by the time, x
i(t)=x
i(t+1).
Embodiment mono-:
For the telecommunication network with multiple constraint requirement, can abstractly be an oriented connected graph, V represents the node set of network, E represents the link set of network, is source routing node, is object routing node, is any link in network.Network route in this network has following QoS constraints: time delay (De
req), delay variation (DJ
req), throughput (Th
req), packet loss (PLR
req).The object of the invention is to generate efficiently a Multicast Routing tree, can meet above-mentioned route restriction condition as far as possible.Clean culture and broadcast can be regarded as two kinds of special circumstances of Multicast Routing, and (singlecast router is a link, there is no bifurcated; Broadcast is that source node carries out data transmission to all nodes in communication network; This is two kinds of extreme cases of multicast tree, and multicast tree is that the part of nodes choosing from source node to whole communication network carries out data transmission, and for this patent, impact is only the difference of choosing of destination node set).Multicast tree product process under multi-constraint condition is as follows:
Step S1: initial phase: input network topology structure, and network route restriction condition De
req, DJ
req, Th
reqand PLR
req.Utilize multicast tree x of multicast tree generation method initialization
0.
Step S2: based on step 1, delete the link that does not meet the node of packet loss constraints and be connected with these nodes in multicast tree, delete the link that does not meet time delay, delay variation and throughput, generate a multicast tree x
j(t);
Step 3: based on step 1, a multicast tree x of the random generation of recycling multicast tree generation method
i(t);
Step 4: according to multicast tree coding method, combining step 2 and the multicast tree that step 3 obtains, generate new multicast tree x
j(t+1)=x
i(t)+x
j(t);
Step 5: if multicast tree x
j(t+1) meet route restriction condition or computational process and reach iterations, perform step 6; Otherwise, t=t+1, execution step 2;
Step 6: output multicast tree x
j(t+1).
Further, multicast tree generation method: need to consider the applicability of Code And Decode when multicast tree is encoded, avoid producing loop in multicast tree.Multicast tree coding details is as follows:
x=(Prior
1,Prior
2,r,Prior
n) （1）
In formula (1), x is a multicast tree, Prior
irepresent the priori node of i node, wherein i scope is 1 to n.For the priori node of node that does not belong to multicast tree, unifiedly represent with " 0 ".The priori node of source node is itself.
The idiographic flow of multicast tree coding method is as described below:
Step 11: empty multicast tree x of initialization
0=(0
1, 0
2..., 0
n).
Step 12: be itself by the priori Node configuration of source node, i.e. x
s=(0
1, 0
2..., S
s..., 0
n).
Step 13 a: destination node of random selection is as present node from destination node set.
Step 14: from having the node set of annexation and delete immediate successor node with present node.Can generate the priori node set of present node.
Step 15: the random priori node of a node as present node of selecting from the priori node set of present node.Then be present node by the priori Node configuration of selection.
Step 16: if the priori node set of present node is empty, be " 0 ", go to step 14, otherwise go to step 17.
Step 17: if the priori node set of all destination nodes is empty, be " 0 ", go to step S108, otherwise go to step 13.
Step 18: export this multicast tree x=(Prior
1, Prior
2..., Prior
n).
Further, meet in the iterative process of multicast tree of multi-constraint condition definition x in generation
iand x (t)
j(t) be two different multicast tree before merging, x
i(t+1) be the multicast tree after merging, merge mode as follows:
In formula (2), operator
be defined as follows: multicast tree x
iand x (t)
j(t) merge into a new multicast tree x
i(t+1), the node set after merging is x
iand x (t)
j(t) all nodes that comprise, link set is x
iand x (t)
j(t) all links that comprise.
Owing to may produce loop in merging process, in order to eliminate these loops, newly-generated multicast tree need to be encoded once again, as follows:
Step 41: from destination node set M, select i node as present node, judge whether i is greater than the size of M, if go to step 44, otherwise, go to step 42; I scope is from 1 to destination node set M quantity;
Step 42: judge whether present node is source node, in the time that present node is not source node, execution step 43; Otherwise, go to step 41, i=i+1;
Step 43: whether the priori number of nodes that judges present node is greater than 1, if priori number of nodes is greater than 1, selects a priori node as present node at random, goes to step 42; Otherwise present node, as priori node, goes to step 42;
Step 44: output does not exist loop multicast tree x
i(t+1).
The present invention is not limited to aforesaid embodiment.The present invention expands to any new feature or any new combination disclosing in this manual, and the arbitrary new method disclosing or step or any new combination of process.
Claims (5)
1. the multiple constraint multicast routing algorithm based on iteration coding, is characterized in that comprising:
Step 1: input network topology structure, and network route restriction condition time delay D e
req, delay variation DJ
req, throughput Th
req, packet loss PLR
req, utilize multicast tree generation method to generate an oriented multicast tree;
Step 2: based on step 1, delete in multicast tree and do not meet packet loss PLR
reqthe node of constraints and the link being connected with these nodes, delete and do not meet time delay D e
req, delay variation DJ
req, throughput Th
reqlink after, generate a multicast tree x
j(t); Wherein t represents iterations, and t is greater than 0 positive integer; I and j represent respectively two different multicast tree;
Step 3: based on step 1, a multicast tree x of the random generation of recycling multicast tree generation method
i(t);
Step 4: according to multicast tree coding method, combining step 2 and the multicast tree that step 3 obtains, generate new multicast tree
Step 5: if multicast tree x
j(t+1) meet route restriction condition or computational process and reach iterations, perform step 6; Otherwise, t=t+1, execution step 2;
Step 6: output multicast tree x
j(t+1).
2. a kind of multiple constraint multicast routing algorithm based on iteration coding according to claim 1, is characterized in that described multicast tree generation method specifically comprises:
Step 11: empty multicast tree x of initialization
0=(0
1, 0
2..., 0
n);
Step 12: be itself by the priori Node configuration of source node, i.e. x
s=(0
1, 0
2..., S
s..., 0
n);
Step 13 a: destination node of random selection is as present node from destination node set;
Step 14: from having the node set of annexation and delete immediate successor node with present node, can generate the priori node set of present node;
Step 15: then the random priori node of a node as present node of selecting from the priori node set of present node be present node by the priori Node configuration of selection;
Step 16: if the priori node set of present node is empty, be " 0 ", go to step 14, otherwise go to step S17;
Step S17: if the priori node set of all destination nodes is empty, be " 0 ", go to step S108, otherwise go to step S13;
Step 18: the x=(Prior that exports this oriented multicast tree
1, Prior
2..., Prior
n).
3. according to claim 1 or 2 one kind of multiple constraint multicast routing algorithm based on iteration coding, it is characterized in that in described step 4, multicast tree coding method specifically comprises:
Step 41: from destination node set M, select i node as present node, judge whether i is greater than the size of M, if so, performs step 44, otherwise, execution step 42; Wherein scope is 1 to destination node set M quantity;
Step 42: judge whether present node is source node, in the time that present node is not source node, execution step 43; Otherwise, go to step 41, i=i+1;
Step 43: whether the priori number of nodes that judges present node is greater than 1, if priori number of nodes is greater than 1, selects a priori node as present node at random, goes to step 42; Otherwise present node, as priori node, goes to step 42;
Step 44: output does not exist the multicast tree x of loop
i(t+1).
4. a kind of multiple constraint multicast routing algorithm based on iteration coding according to claim 3, it is characterized in that described multicast tree refers to from destination node recalls to source node, except source node does not have priori node, other node only has a priori node.
5. according to a kind of multiple constraint multicast routing algorithm based on iteration coding described in right 4, described in it is characterized in that
middle operator
be defined as follows: multicast tree x
iand x (t)
j(t) merge into a new multicast tree x
i(t+1), the node set after merging is x
iand x (t)
j(t) all nodes that comprise, link set is x
iand x (t)
j(t) all links that comprise.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410109422.2A CN103905319B (en) | 2014-03-24 | 2014-03-24 | Multiple-constraint multicast routing algorithm based on iteration coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410109422.2A CN103905319B (en) | 2014-03-24 | 2014-03-24 | Multiple-constraint multicast routing algorithm based on iteration coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103905319A true CN103905319A (en) | 2014-07-02 |
| CN103905319B CN103905319B (en) | 2017-02-01 |
Family
ID=50996474
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410109422.2A Active CN103905319B (en) | 2014-03-24 | 2014-03-24 | Multiple-constraint multicast routing algorithm based on iteration coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103905319B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107005505A (en) * | 2014-09-29 | 2017-08-01 | 法国矿业电信学校联盟 | The method and system decoded for the generation based on solution code tree to data-signal |
| CN107911300A (en) * | 2017-10-25 | 2018-04-13 | 西南交通大学 | Multicast routing optimization method based on whale algorithm and its application on Spark platforms |
| CN113110482A (en) * | 2021-04-29 | 2021-07-13 | 苏州大学 | Indoor environment robot exploration method and system based on priori information heuristic method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006049448A1 (en) * | 2004-11-06 | 2006-05-11 | Electronics And Telecommunications Research Institute | Method and apparatus for configuring and managing a robust overlay multicast tree |
| CN101616074B (en) * | 2009-04-30 | 2011-08-24 | 西安电子科技大学 | Multicast routing optimization method based on quantum evolution |
| CN103346969A (en) * | 2013-07-05 | 2013-10-09 | 中国科学院计算机网络信息中心 | Method for achieving dynamic multicast spanning tree path adjustment based on OpenFlow |
-
2014
- 2014-03-24 CN CN201410109422.2A patent/CN103905319B/en active Active
Non-Patent Citations (2)
| Title |
|---|
| GUOKAI ZENG等: "Multicast Algorithms for Multi-Channel Wireless Mesh Networks", 《2007 IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS》 * |
| 周贤伟等: "一种具有时延约束的组播路由算法研究", 《计算机应用研究》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107005505A (en) * | 2014-09-29 | 2017-08-01 | 法国矿业电信学校联盟 | The method and system decoded for the generation based on solution code tree to data-signal |
| CN107005505B (en) * | 2014-09-29 | 2020-09-22 | 法国矿业电信学校联盟 | Method and system for decoding a data signal based on generation of a decoding tree |
| CN107911300A (en) * | 2017-10-25 | 2018-04-13 | 西南交通大学 | Multicast routing optimization method based on whale algorithm and its application on Spark platforms |
| CN107911300B (en) * | 2017-10-25 | 2020-10-13 | 西南交通大学 | Multicast routing optimization method based on whale algorithm and application of multicast routing optimization method on Spark platform |
| CN113110482A (en) * | 2021-04-29 | 2021-07-13 | 苏州大学 | Indoor environment robot exploration method and system based on priori information heuristic method |
| CN113110482B (en) * | 2021-04-29 | 2022-07-19 | 苏州大学 | Indoor environment robot exploration method and system based on priori information heuristic method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103905319B (en) | 2017-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114143264B (en) | Flow scheduling method based on reinforcement learning under SRv network | |
| CN103905319A (en) | Multiple-constraint multicast routing algorithm based on iteration coding | |
| Wu | A trellis connectivity analysis of random linear network coding with buffering | |
| Hamdan et al. | Multicast routing with delay and delay variation constraints using genetic algorithm | |
| Ghasvari et al. | Optimal sub-graph selection over coded networks with delay and limited-size buffering | |
| Chitra et al. | A nondominated sorting genetic algorithm for shortest path routing problem | |
| JP4589978B2 (en) | Route setting method and route setting device | |
| Jiang et al. | Constructing multiple Steiner trees for software-defined networking multicast | |
| Sahoo et al. | The multi-constrained multicast routing improved by hybrid bacteria foraging-particle swarm optimization | |
| Jiang | An incremental optimal routing strategy for scale-free networks | |
| Liu et al. | A novel fast multi-objective evolutionary algorithm for QoS multicast routing in MANET | |
| CN105306374A (en) | QoS (Quality of Service) broadcast method for Overlay network based on genetic algorithm | |
| Huang et al. | A novel hybrid QoS multicast routing based on clonal selection and artificial fish swarm algorithm | |
| Li et al. | Genetic algorithm-based QoS multicast routing for uncertainty in network parameters | |
| Ajibesin et al. | Energy-efficient Multicast in wired and wireless Networks: Analysis and performance Measures | |
| Wang et al. | QoS multicast routing based on simulated annealing algorithm | |
| Bilbao et al. | On the Application of Bio-inspired Heuristics for Network Routing with Multiple QoS Constraints | |
| Sahoo et al. | A Tree Based Chemical Reaction Optimization Algorithm for QoS Multicast Routing | |
| Sahoo et al. | Multi-objective multicast routing based on bacteria foroaging optimization | |
| Papadimitriou et al. | AnyTraffic labeled routing | |
| Du et al. | Network reduction for coded multiple-hop networks | |
| Run-Liu et al. | Research on shortest path tree algorithm for multicast routing | |
| Amutha et al. | Solution for multicast routing problem using particle swarm optimization | |
| Sheikhshoaei et al. | Low cost ACA-based multicast routing for multi-media applications | |
| CN104283809B (en) | A kind of Active Queue Management method maker based on machine learning |
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 |