CN101146035B - Label switching path routing search method and system - Google Patents
Label switching path routing search method and system Download PDFInfo
- Publication number
- CN101146035B CN101146035B CN2007101110668A CN200710111066A CN101146035B CN 101146035 B CN101146035 B CN 101146035B CN 2007101110668 A CN2007101110668 A CN 2007101110668A CN 200710111066 A CN200710111066 A CN 200710111066A CN 101146035 B CN101146035 B CN 101146035B
- Authority
- CN
- China
- Prior art keywords
- node
- search
- present
- label
- source
- 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
- 238000000034 method Methods 0.000 title claims abstract description 15
- 230000002159 abnormal effect Effects 0.000 claims abstract description 12
- 238000012545 processing Methods 0.000 claims description 27
- 230000003252 repetitive effect Effects 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 6
- 238000011144 upstream manufacturing Methods 0.000 description 3
- 230000000295 complement effect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000002950 deficient Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a search method and a system of a label switched path route, wherein, the method includes the following steps: step 1, obtain all nodes messages of the label switched path route and locate source nodes and sink nodes; step 2, search from the sink nodes to the source nodes, according to whether to locate the sink nodes; step 3, search from the source nodes to the sink nodes, according to whether to locate the source nodes; step 4, return to a linked list of searching nodes from the source node to the sink node, abnormal nodes and searching nodes from sink nodes to the source nodes. Therefore, the invention can calculate LSP route and locate abnormal nodes according to the network management configuration or the label message reported by the equipment, providing other operations for LSP with great convenience. In addition, the searching from two ends to the center can reduce calculation times and improve searching efficiency.
Description
Technical field
The present invention relates to field of mobile communication, more specifically, relate to a kind of label switching path routing search method and system.
Background technology
Along with the fast development of internet scale, its route slowly, do not have defective such as service quality (QoS) assurance to manifest gradually, and become the bottleneck of its development.A kind of way of solution is to introduce the thought of hardware-switch, and the route of network layer (the 3rd layer) is converted to the exchange of link layer (the 2nd layer), improves transfer rate greatly, and can also guaranteed qos.(multiple protocol label switching MPLS) is a kind of 2.5 layer protocols between layers 2 and 3 to multiple protocol label switching, and its label by each node place exchanges realizes the forwarding of wrapping.
At first, (line switched router LSR) analyzes the destination address that carries in the packet header to edge labelling exchange route, adds that to bag label sends out to next redirect.Then, when middle LSR receives the bag that has label, go into label as index with bag is entrained, go into, retrieval obtains outgoing label and routing direction in the mapping relations table of outgoing label, and next jumping is mail to after label replaces to effective outgoing label in going into of carrying of bag.When bag left the Edge LSR of this mpls domain, label will be lost, and reverted to the not bag of tape label.
Article one, the label of LSP can pass through the webmaster static configuration, also can generate automatically by equipment.How can on webmaster, see the complete route of LSP, become to be badly in need of a problem of solution.
Summary of the invention
In order to address the above problem, the invention provides a kind of label switching path routing search method and system, wherein, the label that equipment will generate automatically initiatively reports webmaster, webmaster is found the complete route of a LSP by the LSP route search, thereby, can find the complete route of a LSP, and can accurately locate abnormal nodes.
One aspect of the present invention provides a kind of label switching path routing search method, and it may further comprise the steps: step 1 obtains each nodal information of label switched path, and carries out the location of source node and destination node; Step 2 according to whether navigating to destination node, is searched for from the destination node to the source node; Step 3 according to whether navigating to source node, is searched for from the source node to the destination node; And step 4, return according to from source node to the destination node search node, abnormal nodes, from destination node to the source node search node ordering chained list.
Comprise following processing in the step 1: obtain the IP address of source node and the IP address of destination node from the webmaster end; Obtain each IP addresses of nodes of label switched path; And the IP address of source node and the IP address of destination node and each IP address of label switched path compared, with locating source node and destination node.
Wherein, if do not navigate to destination node, then in step 2, stop the search from the destination node to the source node.
And if navigate to destination node, then step 2 comprises following processing: step a, destination node is set to present node; Step b obtains the outgoing label information of present node and goes into label information; Step c, what find out label information and present node goes into the identical node of label information; Steps d if find node, then is inserted into node before the present node, and node is set to present node, and repeating step b to d is up to searching less than node; And step e, will remain before node is inserted into present node, stop the search from the destination node to the source node.
Wherein, if do not navigate to source node, then in step 3, stop the search from the source node to the destination node.
And if navigate to source node, then step 3 comprises following processing: step a, source node is set to present node; Step b obtains the outgoing label information of present node and goes into label information; Step c searches into the label information node identical with the outgoing label information of present node; Steps d if find node, then is inserted into node after the present node, and node is set to present node, and repeating step b to d is up to searching less than node; And step e, will remain after node is inserted into present node, stop search from source to destination.
The present invention also provides a kind of label switching path routing search system, and it can comprise: obtain positioning unit, be used to obtain each nodal information of label switched path, and carry out the location of source node and destination node; First search processing is used for whether navigating to destination node according to obtaining positioning unit, searches for from the destination node to the source node; Second search processing is used for whether navigating to source node according to obtaining positioning unit, searches for from the source node to the destination node; And chained list returns the unit, be used to return according to from source node to the destination node search node, the chained list of abnormal nodes, ordering from destination node to the source node search node.
Obtaining positioning unit comprises: first acquisition module is used for obtaining the IP address of source node and the IP address of destination node from the webmaster end; Second acquisition module is used to obtain each IP addresses of nodes of label switched path; And locating module, be used for the IP address of source node and the IP address of destination node and each IP address of label switched path are compared, with locating source node and destination node.
First search processing is being obtained under the situation that positioning unit do not navigate to destination node, is used to stop the search from the destination node to the source node.
Wherein, first search processing comprises with lower module: first is provided with module, is used for obtaining under the situation that positioning unit navigates to destination node, and destination node is set to present node; The first label acquisition module is used to obtain the outgoing label information of present node and goes into label information; First node is searched module, and what find out label information and present node goes into the identical node of label information; First judge module is used for finding under the situation of node, node is inserted into before the present node, and node is set to present node, and makes the first label acquisition module and first node search the module repetitive operation up to searching less than node; And first insert module, before being used for the residue node is inserted into present node, stop the search from the destination node to the source node.
Second search processing is being obtained under the situation that positioning unit do not navigate to source node, is used to stop the search from the source node to the destination node.
Second search processing comprises with lower module: second is provided with module, is used for obtaining under the situation that positioning unit navigates to source node, and source node is set to present node; The second label acquisition module is used to obtain the outgoing label information of present node and goes into label information; Section Point is searched module, is used to search into the label information node identical with the outgoing label information of present node; Second judge module is used for finding under the situation of node, node is inserted into after the present node, and node is set to present node, and makes the second label acquisition module and Section Point search the module repetitive operation up to searching less than node; And second insert module, after being used for the residue node is inserted into present node, stop the search from the source node to the destination node.
Thereby, by method and system of the present invention, the label information that can report according to network management configuration or equipment, calculate the route of LSP, and can locate abnormal nodes, for other operation at LSP provides great convenience, in addition, owing to adopted two ends, can reduce calculation times, thereby improve the efficient of search to intermediate search.
Other features and advantages of the present invention will be set forth in the following description, and, partly from specification, become apparent, perhaps understand by implementing the present invention.Purpose of the present invention and other advantages can realize and obtain by specifically noted structure in the specification of being write, claims and accompanying drawing.
Description of drawings
Accompanying drawing is used to provide further understanding of the present invention, and constitutes the part of specification, is used from explanation the present invention with embodiments of the invention one, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the flow chart according to label switching path routing search method of the present invention;
Fig. 2 is the schematic flow diagram that the LSP route search is searched for from the place to the source among the present invention;
Fig. 3 is the schematic flow diagram that the LSP route search is searched for from source to destination among the present invention; And
Fig. 4 is the block diagram according to label switching path routing search of the present invention system.
Embodiment
Below in conjunction with accompanying drawing the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein only is used for description and interpretation the present invention, and be not used in qualification the present invention.
Fig. 1 is the flow chart according to label switching path routing search method of the present invention, and Fig. 2 is the schematic flow diagram that the LSP route search is searched for from the place to the source among the present invention, and Fig. 3 is the schematic flow diagram that the LSP route search is searched for from source to destination among the present invention.Describe the process of Fig. 1 in detail below with reference to Fig. 2 and Fig. 3.
Known LSP is by 5 nodes, be respectively node A, B, C, D, E, its LSP index is IP_A+LSP_IDx+IP_E, wherein IP_A represents that the IP address of node A, ID, IP_E that LSP_IDx represents LSP represent the IP address of node E, and it is as shown in the table to find relevant node data according to IP_A+LSP_IDx+IP_E:
| Numbering | Node IP | Inbound port number | Go into label | Outbound port number | Outgoing label |
| 1 | IP_A | Export_A | ExLabel_A | ||
| 2 | IP_B | Inport_B | InLabel_B | Export_B | ExLabel_B |
| 3 | IP-C | Inport_C | InLabel_C | Export_C | ExLabel_C |
| 4 | IP_D | Inport_D | InLabel_D | Export_D | ExLabel_D |
| 5 | IP_E | Inport_E | InLabel_E |
As shown in Figure 1, this method specifically may further comprise the steps:
Step S102 obtains each nodal information of label switched path, and carries out the location of source node and destination node;
Step S104 according to whether navigating to destination node, searches for from the destination node to the source node;
Step S106 according to whether navigating to source node, searches for from the source node to the destination node; And
Step S108, return according to from source node to the destination node search node, abnormal nodes, from destination node to the source node search node ordering chained list.
Comprise following processing among the step S102: obtain the IP address of source node and the IP address of destination node from the webmaster end, wherein, the IP of source node address=LSP source IP address, and the IP of destination node address=IP address, LSP place; Obtain each IP addresses of nodes of label switched path; And the IP address of source node and the IP address of destination node and each IP address of label switched path compared, with locating source node and destination node.
Wherein, if do not navigate to destination node, then in step S104, stop the search from the destination node to the source node.
And if navigate to destination node, then step S104 comprises following processing: step S202, destination node is set to present node; Step S204 obtains the outgoing label information of present node and goes into label information; Step S206, what find out label information and present node goes into the identical node of label information; Step S208 if find node, then is inserted into node before the present node, and node is set to present node, and repeating step S204 to S208 is up to searching less than node; And step S210, will remain before node is inserted into present node, stop the search from the destination node to the source node.
With reference to top form, it is as follows specifically to introduce above-mentioned detailed process of searching for from the place to the source:
If one does not have destination node, stop this direction search;
If two destination nodes are located successfully, obtain the E node and go into label InLabel_E;
Three, search in other node and go into the outgoing label ExLabel_Y that label InLabel_E is complementary;
If four it fails to match, stop this direction search;
If five the match is successful, obtain IP_Y, record IP_Y is the upstream node routing node;
Six, in remaining record clauses and subclauses, continue search by this direction, the search principle is the outgoing label of going into label=upstream node of downstream node; And
If seven IP_Y=IP_A then finish search, and if also have record not to be added in the routing table, then be exception record, the chained list that is returned sorts from source to destination, before exception record is inserted in source node.
In addition, if do not navigate to source node, then in step S106, stop the search from the source node to the destination node.
And if navigate to source node, then step S106 comprises following processing: step S302, source node is set to present node; Step S304 obtains the outgoing label information of present node and goes into label information; Step S306 searches into the label information node identical with the outgoing label information of present node; Step S308 if find node, then is inserted into node after the present node, and node is set to present node, and repeating step S304 to S308 is up to searching less than node; And step S310, will remain after node is inserted into present node, stop search from source to destination.
With reference to top form, the process from the source to destination search as above may further comprise the steps:
1. if passive bus stops this direction search;
2., obtain A node outgoing label ExLabel_A if locate successfully;
3. search with outgoing label ExLabel_A in the residue record clauses and subclauses and be complementary into label InLabel_Z;
4., stop this direction search if it fails to match;
5. if the match is successful, obtain IP_Z, record IP_Z is the downstream node routing node;
6. in remaining record clauses and subclauses, continue search by this direction, the search principle be upstream node outgoing label=downstream node go into label; And
7. if IP_Z=IP_E finishes search, and if also have record not to be added in the routing table, then be exception record, the chained list that is returned be from source to destination search node, abnormal nodes, from the place to the source search node.
Fig. 4 is the block diagram according to label switching path routing search of the present invention system 400.As shown in Figure 4, this system comprises: obtain positioning unit 402, be used to obtain each nodal information of label switched path, and carry out the location of source node and destination node; First search processing 404 is used for whether navigating to destination node according to obtaining positioning unit 402, searches for from the destination node to the source node; Second search processing 406 is used for whether navigating to source node according to obtaining positioning unit 402, searches for from the source node to the destination node; And chained list returns unit 408, be used to return according to from source node to the destination node search node, the chained list of abnormal nodes, ordering from destination node to the source node search node.
Obtaining positioning unit 402 comprises: first acquisition module is used for obtaining the IP address of source node and the IP address of destination node from the webmaster end; Second acquisition module is used to obtain each IP addresses of nodes of label switched path; And locating module, be used for the IP address of source node and the IP address of destination node and each IP address of label switched path are compared, with locating source node and destination node.
First search processing 404 is being obtained under the situation that positioning unit 402 do not navigate to destination node, is used to stop the search from the destination node to the source node.
Wherein, first search processing 404 comprises with lower module: first is provided with module, is used for obtaining under the situation that positioning unit navigates to destination node, and destination node is set to present node; The first label acquisition module is used to obtain the outgoing label information of present node and goes into label information; First node is searched module, and what find out label information and present node goes into the identical node of label information; First judge module is used for finding under the situation of node, node is inserted into before the present node, and node is set to present node, and makes the first label acquisition module and first node search the module repetitive operation up to searching less than node; And first insert module, before being used for the residue node is inserted into present node, stop the search from the destination node to the source node.
Second search processing 406 is being obtained under the situation that positioning unit 402 do not navigate to source node, is used to stop the search from the source node to the destination node.
Second search processing 406 comprises with lower module: second is provided with module, is used for obtaining under the situation that positioning unit navigates to source node, and source node is set to present node; The second label acquisition module is used to obtain the outgoing label information of present node and goes into label information; Section Point is searched module, is used to search into the label information node identical with the outgoing label information of present node; Second judge module is used for finding under the situation of node, node is inserted into after the present node, and node is set to present node, and makes the second label acquisition module and Section Point search the module repetitive operation up to searching less than node; And second insert module, after being used for the residue node is inserted into present node, stop the search from the source node to the destination node.
In sum, by the present invention, the label information that can report according to network management configuration or equipment, calculate the route of LSP, and can locate abnormal nodes, for other operation at LSP provides great convenience, in addition, owing to adopted two ends, can reduce calculation times, thereby improve the efficient of search to intermediate search.
Be the preferred embodiments of the present invention only below, be not limited to the present invention, for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (2)
1. a label switching path routing search method is characterized in that, may further comprise the steps:
Step 1 obtains each nodal information of label switched path, and carries out the location of source node and destination node;
Step 2 according to whether navigating to described destination node, is searched for to described source node from described destination node;
Step 3 according to whether navigating to described source node, is searched for to described destination node from described source node; And
Step 4, return according to from described source node to described destination node search node, the chained list of abnormal nodes, ordering from described destination node to described source node search node; Wherein, comprise following processing in the described step 1:
Obtain the IP address of described source node and the IP address of described destination node from the webmaster end;
Obtain each IP addresses of nodes of described label switched path; And
The IP address of described source node and the IP address of described destination node and each IP address of described label switched path are compared, to locate described source node and described destination node;
Wherein, if do not navigate to described destination node, then in described step 2, stop search from described destination node to described source node;
Wherein, if navigate to described destination node, then described step 2 comprises following processing:
Step a, described destination node is set to present node;
Step b obtains the outgoing label information of described present node and goes into label information;
Step c, what find out label information and described present node goes into the identical node of label information;
Steps d if find described node, then is inserted into described node before the described present node, and described node is set to present node, and repeating step b to d is up to searching less than described node; And
Step e will remain before node is inserted into present node, stop the search from described destination node to described source node;
Wherein, if do not navigate to described source node, then in described step 3, stop search from described source node to described destination node;
Wherein, if navigate to described source node, then described step 3 comprises following processing:
Step a, described source node is set to present node;
Step b obtains the outgoing label information of described present node and goes into label information;
Step c searches into the label information node identical with the outgoing label information of described present node;
Steps d if find described node, then is inserted into described node after the described present node, and described node is set to present node, and repeating step b to d is up to searching less than described node; And
Step e will remain after node is inserted into present node, stop the search from source to destination.
2. a label switching path routing search system is characterized in that, comprising:
Obtain positioning unit, be used to obtain each nodal information of label switched path, and carry out the location of source node and destination node;
First search processing is used for whether navigating to described destination node according to the described positioning unit that obtains, and searches for to described source node from described destination node;
Second search processing is used for whether navigating to described source node according to the described positioning unit that obtains, and searches for to described destination node from described source node; And
Chained list returns the unit, be used to return according to from described source node to described destination node search node, abnormal nodes, chained list from described destination node to described source node search node ordering;
Wherein, the described positioning unit that obtains comprises:
First acquisition module is used for obtaining the IP address of described source node and the IP address of described destination node from the webmaster end;
Second acquisition module is used to obtain each IP addresses of nodes of described label switched path; And
Locating module is used for the IP address of described source node and the IP address of described destination node and each IP address of described label switched path are compared, to locate described source node and described destination node;
Wherein, described first search processing is obtained under the situation that positioning unit do not navigate to described destination node described, is used to stop the search from described destination node to described source node;
Wherein, described first search processing comprises with lower module:
First is provided with module, is used for obtaining under the situation that positioning unit navigates to described destination node described, and described destination node is set to present node;
The first label acquisition module is used to obtain the outgoing label information of described present node and goes into label information;
First node is searched module, and what find out label information and described present node goes into the identical node of label information;
First judge module, be used for finding under the situation of described node, described node is inserted into before the described present node, and described node is set to present node, and makes described first label acquisition module and described first node search the module repetitive operation up to searching less than described node; And
First insert module before being used for the residue node is inserted into present node, stops the search from described destination node to described source node;
Wherein, described second search processing is obtained under the situation that positioning unit do not navigate to described source node described, is used to stop the search from described source node to described destination node;
Wherein, described second search processing comprises with lower module:
Second is provided with module, is used for obtaining under the situation that positioning unit navigates to described source node described, and described source node is set to present node;
The second label acquisition module is used to obtain the outgoing label information of described present node and goes into label information;
Section Point is searched module, is used to search into the label information node identical with the outgoing label information of described present node;
Second judge module, be used for finding under the situation of described node, described node is inserted into after the described present node, and described node is set to present node, and makes described second label acquisition module and described Section Point search the module repetitive operation up to searching less than described node; And
Second insert module after being used for the residue node is inserted into present node, stops the search from described source node to described destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101110668A CN101146035B (en) | 2007-06-13 | 2007-06-13 | Label switching path routing search method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101110668A CN101146035B (en) | 2007-06-13 | 2007-06-13 | Label switching path routing search method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101146035A CN101146035A (en) | 2008-03-19 |
| CN101146035B true CN101146035B (en) | 2010-12-29 |
Family
ID=39208335
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101110668A Active CN101146035B (en) | 2007-06-13 | 2007-06-13 | Label switching path routing search method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101146035B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102654842B (en) * | 2011-03-02 | 2014-07-30 | 深圳市金蝶中间件有限公司 | Method and device for judging whether flow diagram exists in circulation loop |
| CN102143089B (en) * | 2011-05-18 | 2013-12-18 | 广东凯通软件开发有限公司 | Routing method and routing device for multilevel transport network |
| CN107203946B (en) * | 2016-03-15 | 2020-08-07 | 阿里巴巴集团控股有限公司 | Positioning method of community group, positioning method of risk group and positioning device of risk group |
| CN116527561A (en) * | 2022-01-20 | 2023-08-01 | 北京邮电大学 | Residual error propagation method and residual error propagation device of network model |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1510874A (en) * | 2002-12-26 | 2004-07-07 | ��Ϊ��������˾ | A method for establishing a bidirectional label switching path in an optical network |
| CN1520102A (en) * | 2003-01-22 | 2004-08-11 | 华为技术有限公司 | Method of switching routes by setting up and deleting fork marker |
| CN1694431A (en) * | 2005-03-04 | 2005-11-09 | 中国人民解放军理工大学 | The Method of Establishing Two-way Virtual Circuit in Wireless Network |
| WO2006107694A1 (en) * | 2005-04-05 | 2006-10-12 | Cisco Technology, Inc. | Building multipoint-to-multipoint label switch paths |
-
2007
- 2007-06-13 CN CN2007101110668A patent/CN101146035B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1510874A (en) * | 2002-12-26 | 2004-07-07 | ��Ϊ��������˾ | A method for establishing a bidirectional label switching path in an optical network |
| CN1520102A (en) * | 2003-01-22 | 2004-08-11 | 华为技术有限公司 | Method of switching routes by setting up and deleting fork marker |
| CN1694431A (en) * | 2005-03-04 | 2005-11-09 | 中国人民解放军理工大学 | The Method of Establishing Two-way Virtual Circuit in Wireless Network |
| WO2006107694A1 (en) * | 2005-04-05 | 2006-10-12 | Cisco Technology, Inc. | Building multipoint-to-multipoint label switch paths |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101146035A (en) | 2008-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100566299C (en) | The one multi-agreement label exchange business processing method and the network equipment | |
| CN103023773B (en) | Method, device and system for forwarding message in multi-topology network | |
| CN101330466B (en) | Method and device for forwarding multicast message | |
| CN102301663A (en) | Message processing method and associated devices | |
| CN105187259B (en) | A kind of route management system and method generating topological diagram based on GNS tool | |
| CN107770076A (en) | A kind of processing method of hash-collision, device and switching equipment | |
| US20080107114A1 (en) | Method and apparatus for forwarding service in a data communication device | |
| CN110401599A (en) | Data packet processing method and device, storage medium, and electronic device | |
| CN102195844B (en) | Method and equipment for managing forwarding table entry | |
| CN101146035B (en) | Label switching path routing search method and system | |
| CN111711555B (en) | Message processing method and device | |
| CN101299723B (en) | Method and apparatus for managing label switching route tunnel information | |
| CN106453091B (en) | The equivalent route management method and device of router Forwarding plane | |
| CN101159674A (en) | Packet routing switch device and method thereof | |
| CN104486224A (en) | Routing learning method and equipment | |
| CN103379033B (en) | Message forwarding method and packet optical transport network equipment | |
| CN102340446B (en) | Method for realizing Ethernet-tree (E-tree) service in virtual private local area network service (VPLS) network and provider edge (PE) equipment | |
| CN105721312B (en) | It is realized in a kind of network stack equipment and routes isolated chip implementing method and device | |
| CN107888493A (en) | The method for building up and device of a kind of label switched path | |
| CN105743784A (en) | Switching control method and device in deploying high capacity business | |
| CN101938420B (en) | Cluster topological collection method and device | |
| JP4383216B2 (en) | Communication terminal | |
| CN102143076A (en) | Multi-protection stacking protection group realization method and device | |
| KR100785812B1 (en) | Method and apparatus for providing end-to-end USOS data transmission path | |
| US10924395B2 (en) | Seamless multipoint label distribution protocol (mLDP) transport over a bit index explicit replication (BIER) core |
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 |