CN101009636B - Dynamic management method for the multicast service members of the automatic switching optical network - Google Patents
Dynamic management method for the multicast service members of the automatic switching optical network Download PDFInfo
- Publication number
- CN101009636B CN101009636B CN2006100334313A CN200610033431A CN101009636B CN 101009636 B CN101009636 B CN 101009636B CN 2006100334313 A CN2006100334313 A CN 2006100334313A CN 200610033431 A CN200610033431 A CN 200610033431A CN 101009636 B CN101009636 B CN 101009636B
- Authority
- CN
- China
- Prior art keywords
- node
- multicast
- multicast tree
- tree
- resource
- 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.)
- Active
Links
Images
Abstract
The dynamic management method for ASON multicast business member comprises: based on original P2P business, by the advantage that ASON can automatic find network resource and topology, using resource pre-adding/pre-subtracting and multicast tree grafting/pruning techniques, calculating the optimal patch, and providing well-efficient point-to-multi-point communication connection. This invention is benefit to share bandwidth resource, and reduces total-patch cost.
Description
Technical field
The present invention relates to optical communication technique, relate in particular to a kind of ASON (Automatic SwitchOptical Network, ASON) method of multicast member dynamic management.
Background technology
ASON is the optical transfer network of new generation that can intelligentizedly finish optical-fiber network exchange linkage function automatically.The so-called connection of exchange automatically is meant: on the basis of Internet resources and automatic discovery of topological structure; call dynamic and intelligent routing algorithm; handle with mutual by distributed signaling; support the automatic establishment of teleservice; feasible reliable protection Restoration Mechanism is provided simultaneously; be implemented in when fault takes place and can protect automatically and recover, its maximum characteristics are to transmit in the net in tradition to introduce control plane.
The ASON multicast is meant the explicit multicast tree of setting up by the ASON control plane with traffic engineering in transmitting the plane.So-called multicast tree be a source to the unidirectional tree-shaped connection between a plurality of places with fixed-bandwidth, the source of multicast tree is called root, each place of multicast is called leaf.The ASON multicast can provide very effective point-to-multipoint delivery to connect in large scale network, such as: the content distribution, (Virtual Private Network, VPN) application such as multicast all needs network that multicast is had good support for interactive multimedia and Virtual Private Network.Traditional Internet protocol (Internet Protocol, IP) multicast also can provide the support of point-to-multipoint, but because the characteristic that IP network is done one's best, existing IP multicast protocol can't support that (Quality of Service QoS) guarantees for traffic engineering and quality of service.Though and can solve the problem of point-to-multipoint communication in the method that source node is set up many unicast channel,, the non-constant of the extensibility of this method, utilization of network bandwidth is very low.
Employing is set up the multicast tree with traffic engineering in transmission network by control plane, is the enhancing that point-to-point communication connects, and with point-to-point mode and deposit, the adding of dynamic management multicast member and leave (grafting and the beta pruning process that are called multicast tree).The unique sign of the overall situation of member's needs that belongs to same multicast tree is distinguished, the while intelligent route selection, when constraints (bandwidth, hierarchical resource) shortest path is satisfied in calculating, need to consider that bandwidth resources are shared as far as possible in the same multicast, so that can share time slot when really connecting, make full use of resource.
Prior art
At present in the point-to-point service, the method of obtaining optimal path commonly used is to come the computing service path by classical dijkstra's algorithm, this method is with traffic engineering (Traffic Engineering, TE) attributes such as the link range of link, bandwidth resources are reflected in the TE Link cost, calculate path from source node to destination node cost minimum as optimal path.
The shortcoming of prior art:
For multicast service, utilize dijkstra's algorithm to calculate the shortest path of some members from the source node to the destination node, concerning this path, this is the optimal path from the source node to the destination node in the current network topology separately; But concerning whole multicast tree, this path is optimal path not necessarily, and after soon this path joined multicast service, the cost of whole multicast tree was not necessarily minimum.This is owing to resource among the multicast tree member is to share, if if the part bandwidth resources on the just a certain TE Link are taken by some multicast members, this part resource shares still can in fact other members in the same multicast.The Dikstra algorithm is not considered and is shared the shared resource of already present same multicast service as far as possible.
Summary of the invention
In view of above-mentioned existing in prior technology problem, the object of the invention is to provide the method for a kind of ASON multicast member dynamic management, on original basis of setting up point to point service, PTP, utilize ASON to find the advantage of Internet resources and topological structure automatically, adopt resource to add in advance/subtract in advance, technology such as multicast tree grafting/beta pruning calculate optimal path.In same multicast tree, this method can guarantee to make on the basis of each bar member path cost minimum resource-sharing as far as possible between each member, so that whole multicast tree takies the total bandwidth resource relatively still less, the total path cost is littler, to solve the cost minimum problem that service path that the classical dijkstra's algorithm of available technology adopting calculates not necessarily makes whole multicast tree.
The method of a kind of automatic switching optical network multicast service member dynamic management,
When new multicast member dynamically adds multicast tree, may further comprise the steps:
A, source node are initiated the foundation request of described new multicast member;
B, multicast tree is carried out resource add in advance; Described resource adds specifically in advance and comprises: by bandwidth resources and the addition of flow engineering link available resources with all have taken on the multicast tree;
C, calculate the individual path of destination node, and on multicast tree, finish branch's grafting from source node to described new multicast member;
D, multicast tree is carried out resource subtract in advance; Described resource subtracts specifically in advance and comprises: will deduct the flow engineering link available resources of resource after adding in advance through resource that all have taken on the multicast tree;
When existing multicast member dynamically leaves multicast tree, multicast tree is carried out beta pruning.
Described step C specifically comprises:
The direction of the destination node of C1, described new multicast member along described destination node to described source node begins search;
Node on the individual path of C2, the described new multicast member of traversal;
The node that travels through on C3, the individual path to described new multicast member is investigated one by one, according to the position of father node on multicast tree of investigating node, finishes the multicast tree grafting.
Described step C3 specifically comprises:
If the father node of described investigation node is present on the multicast tree, then the branch of described investigation node to described destination node joined on the multicast tree;
If the father node of described investigation node is not present on the multicast tree, show that multicast tree is empty, then will continue search to described source node, the initialization multicast tree, and described source node extremely the branch of described destination node join on the multicast tree.
Described initialization multicast tree comprises: for multicast tree is distributed a new multicast sign.
This method also comprises: after treating that the multicast tree grafting is finished, all multicast service members are shared a multicast sign in described new multicast member and the former multicast tree.
Described beta pruning specifically comprises:
The direction of the destination node of described existing multicast member along described destination node to described source node begins to investigate;
Travel through the node on the individual path of described existing multicast member, the node that travels through on the individual path to described existing multicast member is investigated one by one, according to investigating the position of node on multicast tree, need to judge whether the described investigation node of deletion, until the beta pruning of finishing multicast tree.
According to the position of described investigation node on multicast tree, the situation of processing comprises:
If described investigation node has child node, then described investigation node is not deleted;
If described investigation node do not have child node, and the described investigation node destination node that is another multicast member, then described investigation node is not deleted;
If described investigation node do not have child node, and the described investigation node destination node that is not another multicast member, then described investigation node is directly deleted.
The beneficial effect of technical solution of the present invention is as follows:
Utilize the method for the invention, adopt resource to add in advance/subtract in advance, the optimal path that technique computes such as multicast tree grafting/beta pruning go out, can guarantee to make on the basis of each bar member path cost minimum in same multicast tree resource-sharing as far as possible between each member, so that whole multicast tree takies the total bandwidth resource relatively still less, the total path cost is littler, can accomplish in the time of real like this connecting to share time slot, makes full use of resource.
Description of drawings
Fig. 1 is topologic network figure;
Fig. 2 is member's 01 grafting process schematic diagram;
Fig. 3 is member's 02 grafting process schematic diagram;
Fig. 4 is member's 03 grafting process schematic diagram;
Fig. 5 is member's 02 grafting process schematic diagram;
Fig. 6 is primary multicast tree schematic diagram;
Fig. 7 sets up flow chart for multicast service.
Embodiment
For making the purpose, technical solutions and advantages of the present invention express clearlyer, the present invention is further described in more detail below in conjunction with drawings and the specific embodiments.
Main thought of the present invention is: on original basis of setting up point to point service, PTP, utilize ASON to find the advantage of Internet resources and topological structure automatically, when having the newcomer to add on this multicast tree at every turn, need carry out the pre-adduction of resource and finish route and calculate; After the success to be calculated, need this member is joined on the multicast tree, just realize the grafting of multicast tree; Carry out resource subsequently and subtract in advance, the bandwidth resources that multicast tree takies are removed from TE Link.Adopt resource to add in advance/subtract in advance, technology such as multicast tree grafting/beta pruning calculate optimal path, can provide communicating to connect of very effective point-to-multipoint for multicast service, the adding of dynamic management multicast member and leaving.Optimal path in the technology of the present invention refers to and makes resource-sharing as far as possible between each member on the basis that guarantees each bar member path cost minimum, the littler path of cost of realizing whole multicast tree.Following elder generation adds in advance/subtracts in advance at above-mentioned resource, and technology such as multicast tree grafting/beta pruning are specifically addressed.
(1) resource adds in advance
Because multicast service is the business that point arrives multiple spot, the one way traffic that sends and arrive a plurality of destination nodes from source node is same business in fact, therefore in the same multicast between each member bandwidth resources share as far as possible, make bandwidth resources that whole multicast tree takies still less, cost is littler.That is to say as if the part bandwidth resources on the TE Link and taken by some multicast members, this part resource shares still can for other members in the same multicast, promptly when in the same multicast service other member's routings the time, this part resource is available.So when calculating the newcomer path, need recover the bandwidth resources that all have taken on the multicast tree, even can directly do certain processing, reduce link cost these links, so that select for use when calculating the newcomer path, reach the interior bandwidth resources of same multicast and share.
(2) grafting of multicast tree
After branch's route of new multicast member is calculated successfully, this branch need be joined on the multicast tree, we are called the grafting of multicast tree.Its basic thought is: the direction of newcomer's destination node along destination node to source node begins search, travel through each node in this member path, the father node of a certain node exists in former multicast tree in described member path, then the component of this node to described destination node is added on the multicast tree, as the subtree of the above node of multicast tree.According to the position of father node on former multicast tree, comprise following several situation:
Situation A: father node does not exist on former multicast tree.
Case B: father node is the source node of former multicast tree.
Situation C: father node is the intermediate node or the leaf node of multicast tree.
Corresponding situation A, owing to just begin there is not multicast member, multicast tree is empty, newly-built first multicast member, the initialization multicast tree directly all adds this member branch in the multicast tree.
Corresponding case B and situation C travel through each node in this member path, and the father node of a certain node exists in former multicast tree in described member path, then the component of this node to described destination node is added on the multicast tree.
(3) resource subtracts in advance
Be slower than the problem that route is calculated in order to solve network convergence speed in the route calculating (link of TE database upgrades), adopted the method for accelerating network convergence, utilizing this method to calculate in route needs resource is subtracted in advance after finishing, and is about to the resource that service path takies and deducts.Therefore, calculate, also need to carry out resource and subtract processing in advance, promptly TE Links all on the same multicast tree is carried out resource and subtract in advance for the route of multicast service.
(4) beta pruning of multicast tree
When some multicast members will leave multicast tree, need be with the deletion of corresponding multicast tree branch, the beta pruning of multicast tree just.For the multicast tree cut operator, its basic thought is similar to the multicast tree grafting, promptly from destination node, direction along multicast member branch destination node to source node, travel through each node in this member path, investigate one by one and delete, when certain node can not be deleted, finish cut operator.According to the position of node on multicast tree of investigating, the situation of processing comprises:
Situation A: if the node of current investigation has child node, then the node of described investigation is not deleted;
Case B: if the node of current investigation does not have child node, and the node of described investigation is the destination node of another multicast member, and then the node of described investigation is not deleted;
Situation C: if the node of current investigation does not have child node, and the node of described investigation is not the destination node of another multicast member, and then the node of described investigation is directly deleted.
For the present invention there being further understanding, below will at resource of the present invention add in advance and subtract in advance, the grafting and the beta pruning of multicast tree be illustrated.
At first, as shown in Figure 1, when multicast member dynamically added multicast tree, the multicast service that source node is initiated was set up request, adopted that resource adds in advance, multicast tree grafting and resource subtract the foundation one by one that realizes multicast member in advance.Concrete steps are as follows:
Step S001, source node are initiated the multicast service of point-to-multipoint and are set up request;
Step S002, judge the multicast sign (identification, whether ID) identical multicast tree exists, if exist, then forwards step S003 to; If do not exist, then do not need to carry out resource and add in advance, directly forward step S004 to;
Step S003, owing to there is the identical multicast tree of multicast ID, add in advance so described multicast tree is carried out resource, be about to all bandwidth resources that taken and the addition of TE Link available resources on the multicast tree, the bandwidth resources that existing multicast member is taken obtain recovery;
Step S004, the optimal path of calculating from source node to destination node;
Step S005, judge whether success of path computing,, then forward step S006 to if calculate successfully; If calculate failure, then forward step S010 to, return failure;
Step S006, if there is the identical multicast tree of multicast ID, then obtain new multicast tree member by path computing;
If there is not an identical multicast tree of multicast ID, then by calculating new multicast member, and the initialization multicast tree, be current multicast tree and distribute a new multicast ID;
Step S007, the new multicast member that will calculate carry out grafting to described multicast tree;
Step S008, described multicast tree is carried out resource subtract in advance, be about to that all resources that taken deduct on this multicast tree from the TE Link available resources;
Step S009, output new multicast member path, finish the professional link road of a multicast member by foundation;
Step S010, return the optimal path computation failure result of source node to destination node;
Because what source node was initiated is the multicast member foundation request of point-to-multipoint, so more described multicast tree being carried out resource adds in advance, the optimal path of calculating from source node to follow-up node, and carry out multicast tree grafting and resource and subtract in advance, finish follow-up all based on the professional link road of the member of same multicast ID by foundation.
In conjunction with concrete example, the detailed process that a multicast service is set up is described, as follows:
As shown in Figure 2, suppose that originally the path cost metric on every TE Link is 10, above without any business, promptly in the multicast tree without any the member.
As shown in Figure 3, at first setting up multicast ID is 1, the member 01 from source node A to destination node D, the path that calculates is A-＞B-＞D, because there is not the member in the primary multicast, multicast tree is empty, so member 01 branch is directly joined (as multicast tree grafting situation A) in the multicast tree.
As shown in Figure 4, next sets up the member 02 from node A to node E.Need at first that (bandwidth resources of A-＞B-＞D) take are recovered to member 01, carrying out route then calculates, suppose that the path that calculates is A-＞C-＞E, then along the direction of destination node E to source node A, node E begins inquiry, find the node A that on former multicast tree, has existed, the part of C-＞E is transplanted to (as multicast tree grafting case B) on the multicast tree, then all resources that taken on this multicast tree being carried out resource subtracts in advance, promptly (A-＞B-＞D) (A-＞C-＞E) deduct from the TE Link available resources realizes that resource subtracts in advance with member 02 member 01.
As shown in Figure 5, the member 03 of foundation from node A to node F, need at first that ((bandwidth resources of A-＞C-＞E) take are recovered for A-＞B-＞D) and member 02 to member 01, carrying out route then calculates, suppose that the path that calculates is A-＞B-＞D-＞F, then along the direction of destination node F to source node A, node F begins inquiry, find the node D that on former multicast tree, has existed, F is transplanted to (as multicast tree grafting situation C) on the multicast tree, then all resources that taken on this multicast tree being carried out resource subtracts in advance, promptly member 01 (A-＞B-＞D), (A-＞C-＞E) (A-＞B-＞D-＞F) deduct from the TE Link available resources realizes that resource subtracts in advance to member 02 with member 03.
Need to prove in addition, if the member's who calculates path separately from point-to-point, is the optimal path of cost minimum between these 2,, this path considers that it is the optimal path from source node to this member's destination node in the multicast tree not necessarily but being put into whole multicast tree.Because resource can be shared among the multicast tree member, must make up the last routed path of multicast member according to multicast tree.Such as: in the above example, as being made into following mode, the foundation of multicast service realizes: at first newly add multicast member 01:A-＞B-＞D; Secondly, set up the unicast service of A-＞B-＞D, A-＞B like this, the path cost metric of B-＞D can become greatly accordingly; Newly-built once more multicast ID is 1 the multicast member 02 from A-＞F, and obviously, A-＞C-＞D-＞F is littler than the metric of A-＞B-＞D-＞F, so the shortest path that calculates should be A-＞C-＞D-＞F.With this branch's grafting, from upwards inquiry of destination node, find the node D that on former multicast tree, has existed, F is moved on on the multicast tree.The grafting process as shown in Figure 6, the path of the multicast member 02 that makes up according to multicast tree is A-＞B-＞D-＞F rather than A-＞C-＞D-＞F because A-＞B, B-＞D is a multicast member shared bandwidth resource, its total resources that take will be littler.
Secondly, the detailed process of multicast tree beta pruning is described as follows.As shown in Figure 7, multicast ID is that 1 multicast service members has:
01：A-＞B-＞C；
02：A-＞B-＞D；
03：A-＞E；
04：A-＞E-＞F。
If removing members 02:A-＞B-＞D, direction along the destination node D of multicast member branch to source node A, begin to investigate from destination node D, because D does not have child node, and be not the destination node of other any one multicast member, then node D can delete (as the situation C of multicast tree beta pruning); Next investigates the father node B of node D, and is so far so Node B can not be deleted (as the situation A of multicast tree beta pruning) because Node B also has child node C, no longer investigates node A, and deletion finishes.
If removing members 04:A-＞E-＞F, direction along the destination node F of multicast member branch to source node A, begin to investigate from destination node F, because node F does not have child node, and be not the destination node of other any one multicast member, then F can delete (as the situation C of multicast tree beta pruning); Next investigates the father node E of node F, though because node E does not have other child node except node F, it is the destination node of member 03:A-＞E, so this node can not be deleted (as the case B of multicast tree beta pruning), so far, no longer investigate node A, deletion finishes.
Claims (7)
1. the method for ASON multicast member dynamic management is characterized in that,
When new multicast member dynamically adds multicast tree, may further comprise the steps:
A, source node are initiated the foundation request of described new multicast member;
B, multicast tree is carried out resource add in advance; Described resource adds specifically in advance and comprises: by bandwidth resources and the addition of flow engineering link available resources with all have taken on the multicast tree;
C, calculate the individual path of destination node, and on multicast tree, finish branch's grafting from source node to described new multicast member;
D, multicast tree is carried out resource subtract in advance; Described resource subtracts specifically in advance and comprises: will deduct the flow engineering link available resources of resource after adding in advance through resource that all have taken on the multicast tree;
When existing multicast member dynamically leaves multicast tree, multicast tree is carried out beta pruning.
2. the method for ASON multicast member according to claim 1 dynamic management is characterized in that, described step C specifically comprises:
The direction of the destination node of C1, described new multicast member along described destination node to described source node begins search;
Node on the individual path of C2, the described new multicast member of traversal;
The node that travels through on C3, the individual path to described new multicast member is investigated one by one, according to the position of father node on multicast tree of investigating node, finishes the multicast tree grafting.
3. the method for ASON multicast member according to claim 2 dynamic management is characterized in that, described step C3 specifically comprises:
If the father node of described investigation node is present on the multicast tree, then the branch of described investigation node to described destination node joined on the multicast tree;
If the father node of described investigation node is not present on the multicast tree, show that multicast tree is empty, then will continue search to described source node, the initialization multicast tree, and described source node extremely the branch of described destination node join on the multicast tree.
4. the method for ASON multicast member according to claim 3 dynamic management is characterized in that, described initialization multicast tree comprises: for multicast tree is distributed a new multicast sign.
5. the method for ASON multicast member according to claim 1 dynamic management is characterized in that, this method also comprises: after treating that the multicast tree grafting is finished, all multicast members are shared a multicast sign in described new multicast member and the former multicast tree.
6. the method for ASON multicast member according to claim 1 dynamic management is characterized in that, described beta pruning specifically comprises:
The direction of the destination node of described existing multicast member along described destination node to described source node begins to investigate;
Travel through the node on the individual path of described existing multicast member, the node that travels through on the individual path to described existing multicast member is investigated one by one, according to investigating the position of node on multicast tree, need to judge whether the described investigation node of deletion, until the beta pruning of finishing multicast tree.
7. the method for ASON multicast member according to claim 6 dynamic management is characterized in that, according to the position of described investigation node on multicast tree, the situation of processing comprises:
If described investigation node has child node, then described investigation node is not deleted;
If described investigation node do not have child node, and the described investigation node destination node that is another multicast member, then described investigation node is not deleted;
If described investigation node do not have child node, and the described investigation node destination node that is not another multicast member, then described investigation node is directly deleted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100334313A CN101009636B (en) | 2006-01-26 | 2006-01-26 | Dynamic management method for the multicast service members of the automatic switching optical network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100334313A CN101009636B (en) | 2006-01-26 | 2006-01-26 | Dynamic management method for the multicast service members of the automatic switching optical network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101009636A CN101009636A (en) | 2007-08-01 |
| CN101009636B true CN101009636B (en) | 2010-08-25 |
Family
ID=38697782
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006100334313A Active CN101009636B (en) | 2006-01-26 | 2006-01-26 | Dynamic management method for the multicast service members of the automatic switching optical network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101009636B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101374061A (en) * | 2007-08-24 | 2009-02-25 | 华为技术有限公司 | Method, system and apparatus for controlling multicast or unicast admission |
| CN101895482A (en) | 2009-05-18 | 2010-11-24 | 华为技术有限公司 | Method and device for abstracting logic topology information of peer-to-peer technological network |
| CN102118405B (en) * | 2009-12-31 | 2014-07-30 | 比亚迪股份有限公司 | P2P (Peer-to-Peer) network system applied to real-time video data transmission |
| CN102868624B (en) * | 2011-07-07 | 2015-10-07 | 株式会社日立制作所 | The control device of electro-optical composite network node, control system and control method |
| CN103595631B (en) * | 2013-10-31 | 2016-12-07 | 华为技术有限公司 | The method and apparatus that a kind of path is set up |
| CN104954264B (en) * | 2014-03-24 | 2018-07-13 | 华为技术有限公司 | Multicast connection identification accords with distribution method, device |
| CN107147593A (en) * | 2016-03-01 | 2017-09-08 | 中兴通讯股份有限公司 | It is managed collectively the method and device of passive light network terminal bandwidth |
| CN106789631B (en) * | 2017-01-20 | 2020-04-03 | 深圳市风云实业有限公司 | Multicast routing reconstruction method and routing equipment |
| CN108494597B (en) * | 2018-03-23 | 2020-09-29 | 北京邮电大学 | Intelligent optical network simulation system and method |
| CN111245720B (en) * | 2020-01-03 | 2021-10-26 | 烽火通信科技股份有限公司 | Path calculation method and system |
| CN112398733B (en) * | 2020-11-24 | 2022-03-25 | 新华三大数据技术有限公司 | Traffic scheduling forwarding method and device |
| CN115174582B (en) * | 2022-09-06 | 2022-11-18 | 中国中金财富证券有限公司 | Data scheduling method and related device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1472968A (en) * | 2002-07-31 | 2004-02-04 | 华为技术有限公司 | Acquriing method for protecting path of terminal to terminal in optical network |
| CN1549521A (en) * | 2003-05-07 | 2004-11-24 | 华为技术有限公司 | Method for realizing universal multi-protocol mark exchange in network |
| CN1588890A (en) * | 2004-10-08 | 2005-03-02 | 烽火通信科技股份有限公司 | Method for controlling plane participation protective rotation in ASON network |
-
2006
- 2006-01-26 CN CN2006100334313A patent/CN101009636B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1472968A (en) * | 2002-07-31 | 2004-02-04 | 华为技术有限公司 | Acquriing method for protecting path of terminal to terminal in optical network |
| CN1549521A (en) * | 2003-05-07 | 2004-11-24 | 华为技术有限公司 | Method for realizing universal multi-protocol mark exchange in network |
| CN1588890A (en) * | 2004-10-08 | 2005-03-02 | 烽火通信科技股份有限公司 | Method for controlling plane participation protective rotation in ASON network |
Non-Patent Citations (1)
| Title |
|---|
| 孙俊.应用于ASON的反向最近树节点优先的受限组播路由算法.《全国第十二次光纤通信暨第十三届集成光学学术会议论文集》.2005,第102-106页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101009636A (en) | 2007-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101009636B (en) | Dynamic management method for the multicast service members of the automatic switching optical network | |
| USRE47260E1 (en) | System and method for point to multipoint inter-domain MPLS traffic engineering path calculation | |
| CN103548325B (en) | Expanded cloud service control and management framework to connect network level | |
| CN108781182B9 (en) | Communication method and network element between SDN controllers by using BGP protocol | |
| EP1865661B1 (en) | A method of fast-multicast and a system thereof | |
| US8750287B2 (en) | Traffic-engineered connection establishment across resource domains for data transport | |
| US6556544B1 (en) | Method and system for provisioning network resources for dynamic multicast groups | |
| US8310957B1 (en) | Minimum-cost spanning trees of unicast tunnels for multicast distribution | |
| CN1716905B (en) | Multicast packet relay device adapted for virtual router | |
| US11362941B2 (en) | Stateless multicast in label switched packet networks | |
| US7995569B2 (en) | Virtual routers for GMPLS networks | |
| CN102238443B (en) | Method for establishing cross-domain path meeting wavelength-continuity constraints | |
| EP1713199A1 (en) | Architecture for provisioning broadcast services over managed multicast virtual private LAN trees | |
| CN106982157B (en) | Traffic engineering tunnel establishment method and device | |
| US20110286450A1 (en) | Multicast hello on demand | |
| WO2007054032A1 (en) | Communication network system and leaf-node network element of the multicasting tree signal transmission method and node network element thereof | |
| CN100481817C (en) | Multi-domain multicast integration data distributing structure and method based on IP/MPLS/BGP | |
| US20130028094A1 (en) | Fiber chanel device | |
| WO2015108106A1 (en) | Packet transfer device, control device, communication system, communication method, and program | |
| CN104980355A (en) | Source controllable multicast data transmission method and system thereof under SDN Environment | |
| CN101552716B (en) | Method, device and system for calculating service path | |
| JP3801953B2 (en) | Multicast MPLS communication method and system and network | |
| Gifre et al. | Experimental assessment of ABNO-driven multicast connectivity in flexgrid networks | |
| US11296980B2 (en) | Multicast transmissions management | |
| JP2013038647A (en) | Message transfer system, control device, message transfer node, message transfer method, and program |
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 |