CN100387026C - Method for searching connected routes with target node set of pointed service routes - Google Patents
Method for searching connected routes with target node set of pointed service routes Download PDFInfo
- Publication number
- CN100387026C CN100387026C CNB2004101025479A CN200410102547A CN100387026C CN 100387026 C CN100387026 C CN 100387026C CN B2004101025479 A CNB2004101025479 A CN B2004101025479A CN 200410102547 A CN200410102547 A CN 200410102547A CN 100387026 C CN100387026 C CN 100387026C
- Authority
- CN
- China
- Prior art keywords
- unicom
- subgraph
- path
- route
- search
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The present invention relates to a method for searching routes and especially provides a method for searching communicating routes with appointed service routes of a target node set, which causes the search for the communicating routes to become simple, convenient and reliable. The present invention comprises the following steps: all available service routes between the target nodes are inquired and are used as edges to establish a route-searching topological graph, communicating subgraphs are established according to appointed service routes, and each communicating subgraph comprises one appointed service route; all communicating subgraphs are converged into a communicating graph comprising all target nodes by combination. In the process of combination, the searched available service routes for connecting isolated nodes and the communicating subgraphs, available service routes for connecting the communicating subgraphs, and the appointed routes form the communicating route. When the isolated nodes exist or no service route exists between the communicating subgraphs, no satisfactory communicating route exists. The method of the present invention can be used for searching the communicating routes of target nodes with appointed necessary routes in an ether special local area network.
Description
Technical field
The present invention relates to routing search method, a kind of UNICOM's routing search method of the destination node collection with the specified services path is provided especially.
Background technology
EPLn (Ethernet Private LAN, ether private local area network) be that SDH (SynchronousDigital Hierarchy is arranged, SDH (Synchronous Digital Hierarchy)) Cheng Zai ether private local area network, service layer's route of EPLn is TRUNK, TRUNK is the service layer path that has encapsulated the SDH channel data business of certain bandwidth, in the EPLn constructive process, at first will the user specify some wings by situation under search out the TRUNK route that can connect into all nodes that the user selects a figure of UNICOM, wherein the limit can only take a TRUNK, can not stride many TRUNK.If explain with mathematical linguistics, then be: the user has selected plurality of nodes on a non-directed graph, and specify some two ends all must be included in the Search Results on the limit in destination node set, under condition like this, search out wing that these destination nodes can UNICOM be got up by.
In data structure associated class books, all can mention the Di Jiesitela algorithm, this algorithm solves be search a pair of internodal shortest path by.Can to this algorithm make amendment or encapsulate solve band specify must through wing by EPLn UNICOM route search problem, specific implementation is as follows:
1, it is right at first N destination node to be formed N (N-1)/2 node;
2, the node at the two ends of the M bar of user's appointment service TRUNK to as the node of finishing search to mark in addition;
3, use the Di Jiesitela algorithm to search for remaining N (N-1)/2-M node to needs, if certain is not to searching for success between node, current route search returns failure;
4, all in twos node to searched route of coming out altogether, and the route that repeats of deletion has just obtained UNICOM's route of EPLn.
The shortcoming of prior art is that time complexity is O (n3), and search performance is bad, and UNICOM's route that search is come out has bulk redundancy.
Summary of the invention
The invention provides band specify wing by UNICOM's routing search method of destination node collection, make UNICOM's route search more easy to be reliable.
A kind of destination node UNICOM routing search method with the specified services path, realize through the following steps:
A: all the available service paths in the query aim set of node between any two destination nodes are the topological diagram that described destination node collection is constructed on the limit with described service path;
B: a plurality of UNICOMs of structure subgraph in described topological diagram makes each UNICOM's subgraph only comprise a specified services path;
C: will have UNICOM's subgraph of common node to merge into UNICOM's subgraph respectively;
D: search and the UNICOM subgraph node that has the available service path to be connected respectively, and these nodes are merged to respectively in the UNICOM's subgraph that is connected, write down the available service path of these nodes of connection and UNICOM's subgraph;
E: judge whether to exist isolated node, described isolated node is the node that does not have the available service path to be connected with any one UNICOM's subgraph, if, then concentrate the UNICOM's route that does not have band specified services path at described destination node, finish search; Otherwise, continue step F;
F: UNICOM's subgraph that will have the available service path to connect is respectively merged into UNICOM's subgraph, and record connects the available service path of any two UNICOM's subgraphs;
G: judge whether to exist the isolated UNICOM subgraph that can not merge, there is not the available service path to be connected between described isolated UNICOM subgraph and other UNICOM's subgraph, if, then concentrate the UNICOM's route that does not have band specified services path at described destination node, finish search; Otherwise, continue step H;
H: determine UNICOM's route of described destination node collection, described UNICOM route comprises described specified services path and all available service paths of being write down in step D and step F.
Based on UNICOM's routing search method in a kind of destination node collection band specified services path of same design, realize through the following steps:
A: all the available service paths in the query aim set of node between any two destination nodes are the topological diagram that described destination node collection is constructed on the limit with described service path;
B: a plurality of UNICOMs of structure subgraph in described topological diagram makes each UNICOM's subgraph only comprise a specified services path;
C: will have UNICOM's subgraph of common node to merge into UNICOM's subgraph respectively;
D: search and the UNICOM subgraph node that has the available service path to be connected respectively, and these nodes are merged to respectively in the UNICOM's subgraph that is connected, write down the available service path of these nodes of connection and UNICOM's subgraph;
E: UNICOM's subgraph that will have the available service path to connect is respectively merged into UNICOM's subgraph, and record connects the available service path of any two UNICOM's subgraphs;
F: judge whether all UNICOM's subgraphs have been merged into the figure of UNICOM, and the described figure of UNICOM comprises all destination nodes, if then continue step g; Otherwise, concentrate the UNICOM's route that does not have band specified services path at described destination node, finish search;
G: determine UNICOM's route of described destination node collection, described UNICOM route comprises described specified services path and the available service path that is recorded.
The service path that described method also is included in the described topological diagram deletion or the described appointed service path of mark or has write down is not used it in the search of back.
Described method also comprises the step of returning the route search result, and described route search result is: described destination node is concentrated the UNICOM's route that does not have band specified services path, definite UNICOM's route.
When described method was used in ether private local area network, described service path was the service layer path that has encapsulated the SDH (Synchronous Digital Hierarchy) passage of certain bandwidth.
The difference of above-mentioned two kinds of methods is that first method is compared second method, when merging UNICOM's subgraph, judges that stage by stage whether route search is successful, can improve user-responsiveness.
Use the method for the invention and can receive following beneficial effect:
1, during first step initialization composition directly at the target joint, the some composition has been avoided dispersing in the later stage route search, is very beneficial for improving search performance;
2, the topology of searching for out according to mode like this is a sparse graph, has reduced UNICOM's route cost;
3, utilize first method, the search wing by process in, can judge stage by stage that wing by search failure, improves user's response speed.
Description of drawings
Fig. 1 is an embodiment of the invention flow chart;
Fig. 2 is a step S1 schematic diagram;
Fig. 3 is a step S2 schematic diagram;
Fig. 4 is a step S3 schematic diagram;
Fig. 5 is a step S4 schematic diagram;
Fig. 6 merges schematic diagram for the first time for step S6;
Fig. 7 merges schematic diagram for the second time for step S6.
Embodiment
Below with a concrete example and be described with reference to the accompanying drawings UNICOM's route search process.Use-case explanation: extremely shown in Figure 7 as Fig. 2, the destination node collection that node1～node6 need search for for the user, internodal limit is all available service TRUNK that does not have the carrying client path (the service layer path of EPLn) on the destination node collection that inquires from database, between wherein the node2 and node3, between node3 and the node4, between node5 and the node6 and the TRUNK between node7 and the node8 be user's appointment must be through TRUNK.Solid line among the figure is alternative available service TRUNK, and dotted line is occupied TRUNK in search procedure.
As shown in Figure 1, whole search procedure can be divided into seven steps:
Step S1: from available service TRUNK database, inquire all available TRUNK service paths on the destination node collection, standard form map＜int shown in leaving in, MOC_EDGE_C〉in the mapId2Trunk data structure, form topological relation figure, also can select other data structure to preserve this topological relation.
As shown in Figure 2, utilize available TRUNK service path to form the topological structure graph of a relation of destination node, the limit among Fig. 2 is the available TRUNK service path that inquires in this step.
Step S2: leave set＜set＜int in specified services path configuration SCC (Subgraph Connected, UNICOM's subgraph)〉〉 in the setSubConnectedComponent data structure, also can select other data structure to preserve.
As shown in Figure 3, that uses appointment must construct four subgraph SCC1 of UNICOM, SCC2, SCC3, SCC4 through TRUNK, wherein the limit of appointment becomes dotted line, dotted line is represented that this service path is searched and is arrived, the record searching result, simultaneously can in topological diagram, carry out mark or deletion, in the route search step of back, not re-use this service path, below will be by merging the service path that searches out other step by step.
class?MOC_EDGE_C
{
public：
MOC_EDGE_C(_EDGEID?id，_MO_ID_src_node，
_MO_ID?dst_node，int?cost，PL_LEVEL_E?level，int?res，
_EDGEID?pair_id，_PATH?path)；
MOC_EDGE_C(MOC_EDGE_C＊new_one)；
protected：
_EDGEID _id；
_MO_ID _src_node；
_MO_ID _dst_node；
int _cost；
PL_LEVEL_E?_level；
int _res；
_EDGEID _pair_id；
_PATH _path；
public：
_EDGEID?Getld()const{return_id；}
...
MOC_EDGE_C&?operator＝(const?MOC_E?DGE_C
&)；
}；
Table one: topological data structure
If this method be used for searching for do not specify wing by the UNICOM route of destination node the time, can be in this step, the wing that any TRUNK available more than two is assumed to appointment is by structure SCC, step by the back still can obtain the route search result of UNICOM, and the appointment wing of supposing is selected according to actual conditions by number.
Step S3: the SCC that is associated with common node.
As shown in Figure 4, in this step, the SCC that common node is arranged is merged, merged among the SCC1 by the node among the current merging SCC2, so far remaining three SCC1, SCC3, SCC4 do not have in twos to occur simultaneously.
Step S4: the isolated node that does not belong to SCC is merged among the SCC that has existed.
As shown in Figure 5, in this step, it is this node that isolated node merges to principle among the SCC has the limit to link to each other with certain node among the SCC, merges through this minor node, and nodel has merged among the SCC1.The limit that connects is one the service path that searches, if isolated node connects more than one of the limit of UNICOM's subgraph, selects map＜int, MOC_EDGEC〉ordering among mapId2Trunk service path the preceding.
Step S5: judge whether, to illustrate the isolated node that can not merge not have the UNICOM's route that comprises the specified services path, finish search and also return the result of wing by the search failure if having.
In this step, if find to have the isolated node that can not merge among any SCC that has existed, then return in this search and do not find qualified UNICOM route.
Step S6: merge SCC.
The combination principle of this step is: if there is the limit to link to each other between two SCC, then these two SCC just can merge, if there are many Connection Service paths, selection map＜int, MOC_EDGE_C〉ordering among mapId2Trunk service path the preceding.
Step S7: judge whether to search for successfully.
Final this step wing by the successful criterion of search is: all SCC merge into one at last, and all destination nodes are all in that last SCC.
As shown in Figure 6, during the SCC first time of step 6 merged, SCC4 was integrated among the SCC3; As shown in Figure 7, during the SCC second time of this step merges, SCC3 is integrated among the SCC1, so far all SCC have merged and have finished, and the destination node of appointment all in SCC1, is recorded as the service path that searches with the fillet of using at every turn, the record searching result, simultaneously can in topological diagram, carry out mark or deletion, in the route search step of back, not re-use this service path.As shown in phantom in FIG., all service paths that search by top step and specified services path together UNICOM all destination nodes, so wing by searching for successfully, dotted line is exactly all service paths that UNICOM's route comprises.
Carrying out in the process existing and not having the limit to connect between two SCC at step S6, perhaps step S6 does not comprise all nodes after having merged all SCC that has the limit to connect, form a complete figure of UNICOM, then do not find qualified UNICOM route in this search.
The of the present invention convergence by UNICOM's subgraph realized the method for wing by search, is not limited to the EPLn business, all is suitable for for other networks with similar characteristics, and present embodiment does not limit protection scope of the present invention.
Claims (10)
1. the UNICOM's routing search method with the destination node collection in specified services path is characterized in that: comprise the following steps:
A: all the available service paths in the query aim set of node between any two destination nodes are the topological diagram that described destination node collection is constructed on the limit with described service path;
B: a plurality of UNICOMs of structure subgraph in described topological diagram makes each UNICOM's subgraph only comprise a specified services path;
C: will have UNICOM's subgraph of common node to merge into UNICOM's subgraph respectively;
D: search and the UNICOM subgraph node that has the available service path to be connected respectively, and these nodes are merged to respectively in the UNICOM's subgraph that is connected, write down the available service path of these nodes of connection and UNICOM's subgraph;
E: judge whether to exist isolated node, described isolated node is the node that does not have the available service path to be connected with any one UNICOM's subgraph, if, then concentrate the UNICOM's route that does not have band specified services path at described destination node, finish search; Otherwise, continue step F;
F: UNICOM's subgraph that will have the available service path to connect is respectively merged into UNICOM's subgraph, and record connects the available service path of any two UNICOM's subgraphs;
G: judge whether to exist the isolated UNICOM subgraph that can not merge, there is not the available service path to be connected between described isolated UNICOM subgraph and other UNICOM's subgraph, if, then concentrate the UNICOM's route that does not have band specified services path at described destination node, finish search; Otherwise, continue step H;
H: determine UNICOM's route of described destination node collection, described UNICOM route comprises described specified services path and all available service paths of being write down in step D and step F.
2. the method for claim 1, it is characterized in that: in search procedure, the available service path of progressively deleting described specified services path or having write down is not used it in the search of back.
3. the method for claim 1, it is characterized in that: in search procedure, the available service path that progressively marks appointed service path or write down is not used it in the search of back.
4. the method for claim 1, it is characterized in that: also comprise the step of returning the route search result, described route search result is: the destination node described in step e and the step G is concentrated the UNICOM's route that does not have band specified services path, or UNICOM's route of determining among the step H.
5. the method for claim 1, it is characterized in that: in the time of in ether private local area network, described service path is the service layer path that has encapsulated the SDH (Synchronous Digital Hierarchy) passage of certain bandwidth.
6. the UNICOM's routing search method with the destination node collection in specified services path is characterized in that: comprise the following steps:
A: all the available service paths in the query aim set of node between any two destination nodes are the topological diagram that described destination node collection is constructed on the limit with described service path;
B: a plurality of UNICOMs of structure subgraph in described topological diagram makes each UNICOM's subgraph only comprise a specified services path;
C: will have UNICOM's subgraph of common node to merge into UNICOM's subgraph respectively;
D: search and the UNICOM subgraph node that has the available service path to be connected respectively, and these nodes are merged to respectively in the UNICOM's subgraph that is connected, write down the available service path of these nodes of connection and UNICOM's subgraph;
E: UNICOM's subgraph that will have the available service path to connect is respectively merged into UNICOM's subgraph, and record connects the available service path of any two UNICOM's subgraphs;
F: judge whether all UNICOM's subgraphs have been merged into the figure of UNICOM, and the described figure of UNICOM comprises all destination nodes, if then continue step g; Otherwise, concentrate the UNICOM's route that does not have band specified services path at described destination node, finish search;
G: determine UNICOM's route of described destination node collection, described UNICOM route comprises described specified services path and the available service path that is recorded.
7. method as claimed in claim 6 is characterized in that: in search procedure, the available service path of progressively deleting described specified services path or having write down is not used it in the search of back.
8. method as claimed in claim 6 is characterized in that: in search procedure, the available service path that progressively marks appointed service path or write down is not used it in the search of back.
9. method as claimed in claim 6, it is characterized in that: also comprise the step of returning the route search result, described route search result is: the destination node described in the step f is concentrated the UNICOM's route that does not have band specified services path, or UNICOM's route of determining in the step g.
10. method as claimed in claim 6 is characterized in that: in the time of in ether private local area network, described available service path is the service layer path that has encapsulated the SDH (Synchronous Digital Hierarchy) passage of certain bandwidth.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004101025479A CN100387026C (en) | 2004-12-24 | 2004-12-24 | Method for searching connected routes with target node set of pointed service routes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004101025479A CN100387026C (en) | 2004-12-24 | 2004-12-24 | Method for searching connected routes with target node set of pointed service routes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1798095A CN1798095A (en) | 2006-07-05 |
| CN100387026C true CN100387026C (en) | 2008-05-07 |
Family
ID=36818879
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004101025479A Expired - Fee Related CN100387026C (en) | 2004-12-24 | 2004-12-24 | Method for searching connected routes with target node set of pointed service routes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100387026C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102542074B (en) * | 2012-02-17 | 2013-10-30 | 清华大学 | Demonstration and search tool of topological relationship of elements |
| CN111343241B (en) * | 2015-07-24 | 2022-12-09 | 创新先进技术有限公司 | Graph data updating method, device and system |
| CN105141524B (en) * | 2015-09-16 | 2018-06-01 | 武汉烽火技术服务有限公司 | A kind of topological diagram optimal path algorithm of Problem with Some Constrained Conditions |
| CN109033383B (en) * | 2018-07-27 | 2021-11-16 | 成都网丁科技有限公司 | Route completion method and device based on bidirectional search cross collision detection |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1416243A (en) * | 2002-12-30 | 2003-05-07 | 清华大学 | Adjustable heuristic routing method of quality of service based on width first search |
| US6717920B1 (en) * | 1998-06-29 | 2004-04-06 | Cisco Technology, Inc. | Dynamically created service class-based routing tables |
| US20040105389A1 (en) * | 1998-12-21 | 2004-06-03 | Huang Baosheng D. | Method for hybrid network planning |
-
2004
- 2004-12-24 CN CNB2004101025479A patent/CN100387026C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6717920B1 (en) * | 1998-06-29 | 2004-04-06 | Cisco Technology, Inc. | Dynamically created service class-based routing tables |
| US20040105389A1 (en) * | 1998-12-21 | 2004-06-03 | Huang Baosheng D. | Method for hybrid network planning |
| CN1416243A (en) * | 2002-12-30 | 2003-05-07 | 清华大学 | Adjustable heuristic routing method of quality of service based on width first search |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1798095A (en) | 2006-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101965715B (en) | Tie-Breaking in Shortest Path Determination | |
| CN103379032B (en) | The acquisition methods and device, sub-route computational entity of cross-domain end-to-end route | |
| US8243604B2 (en) | Fast computation of alterative packet routes | |
| JP6117911B2 (en) | Optimization of 3-stage folded CLOS for 802.1AQ | |
| JPH0832620A (en) | Improved routing for hierarchical communication net and hierarchical communication net with improved routing | |
| CN101562568B (en) | Method and device for generating alternate routes of coverage network | |
| JPH07177143A (en) | Link metric assignment method | |
| US8165038B2 (en) | Network physical connection inference for IP tunnels | |
| CN113242179B (en) | SDN-based SR path calculation and label stack generation method and SDN controller | |
| JP2002513244A (en) | Combination of trunk lines | |
| JP2005512393A (en) | Method and system for routing in packet networks | |
| CN107547333B (en) | Method and apparatus for implementing a combined virtual private network VPN | |
| Gerstel et al. | The layout of virtual paths in ATM networks | |
| KR20150030644A (en) | Tie-breaking in shortest path determination | |
| CN110535763A (en) | A kind of route backup method, apparatus, server and readable storage medium storing program for executing | |
| CN102710507B (en) | Method and network equipment for achieving consistency of message forwarding paths | |
| CN100387026C (en) | Method for searching connected routes with target node set of pointed service routes | |
| CN111934866A (en) | Multi-layer path automatic reduction method and system of quantum communication network | |
| CN107733719B (en) | Software defined survivable network lossless path recovery method | |
| JPWO2006059787A1 (en) | Overlay link computing device and its computing method and program | |
| CN111800339B (en) | Route optimization method with path number constraint in hybrid SDN scene | |
| CN109962846A (en) | The processing method and processing device of routing protocol packet | |
| US20080013948A1 (en) | Method and System for Managing Data Service Network of Metropolitan Area Network | |
| CN104412548B (en) | The method and apparatus for keeping user equipment (UE) IP address to fix | |
| CN105049345A (en) | Method and system for fusing BGP route traffic data |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: HUAWEI TECH CO., LTD., SHANGHAI Free format text: FORMER OWNER: HUAWEI TECHNOLOGY CO., LTD. Effective date: 20081017 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20081017 Address after: No. 615 Nanjing Road, Shanghai, Pudong New Area Patentee after: Shanghai Huawei Technologies Co., Ltd. Address before: Bantian HUAWEI headquarters office building, Longgang District, Shenzhen, Guangdong Patentee before: Huawei Technologies Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080507 Termination date: 20141224 |
|
| EXPY | Termination of patent right or utility model |