CN108521617A - A kind of business routing discovering method and device, computer readable storage medium - Google Patents
A kind of business routing discovering method and device, computer readable storage medium Download PDFInfo
- Publication number
- CN108521617A CN108521617A CN201810673092.8A CN201810673092A CN108521617A CN 108521617 A CN108521617 A CN 108521617A CN 201810673092 A CN201810673092 A CN 201810673092A CN 108521617 A CN108521617 A CN 108521617A
- Authority
- CN
- China
- Prior art keywords
- ctp
- nowadays
- routing iinformation
- node
- hop
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 81
- 238000001514 detection method Methods 0.000 claims abstract description 17
- 230000005540 biological transmission Effects 0.000 claims abstract description 11
- 230000008569 process Effects 0.000 claims description 20
- 230000006870 function Effects 0.000 claims description 10
- 230000003287 optical effect Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 101150005884 ctp1 gene Proteins 0.000 description 5
- 238000007726 management method Methods 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- 239000013307 optical fiber Substances 0.000 description 3
- 230000006872 improvement Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/02—Wavelength-division multiplex systems
- H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0073—Provisions for forwarding or routing, e.g. lookup tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0079—Operation or maintenance aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This application discloses a kind of business routing discovering method and device, computer readable storage medium, it is applied to realize the network element of teleservice transmission, the method includes：Determine effective starting connection, the source port and place port discovery connected respectively from effective starting simultaneously creates top layer's business, if not having top layer's business, discovery procedure terminates；If there is top layer's business, it sets top layer's business to current parent's layer service；Whether detection current parent's layer service carries the Sublayer service of lower level, if not carrying the Sublayer service of lower level, discovery procedure terminates；If there is carrying the Sublayer service of lower level, it sets newfound Sublayer service to current parent's layer service, and whether cycle detection current parent layer service carries the Sublayer service of lower level.The application has found Sublayer service by finding and creating top layer's business from the both ends of effective starting connection based on upper-layer service, improves service discovering speed.
Description
Technical field
The present invention relates to technical field of communication network, and in particular to a kind of business routing discovering method and device, computer
Readable storage medium storing program for executing.
Background technology
Optical transfer network (Optical Transport Network, OTN) is based on wavelength-division multiplex technique, in photosphere
The transmission net for organizing network, is follow-on Backbone Transport Network.OTN Element management systems (Element Management
System, EMS) multiple OTN network elements can be managed.The business information that actual disposition is found and showed in network management system is OTN
One critical function of EMS webmasters.
Traditional service discovering algorithm is calculated based on the configuration data on connection, veneer and port.Business is route
Show and be made of port and optical-fiber connection data.When executing service discovering task, service discovering algorithm is effective from each
Business both port of origination starts to calculate, continuous to find next-hop port, if next-hop port is effective business termination port,
Service discovering success；If not finding suitable next-hop port, service discovering failure.
In an OTN system, often there are multiple network elements and veneers, therefore have a large amount of business starting point, from
During the next-hop that each business starting point calculates backward, if next-hop is obtained from optical-fiber connection data, speed
Degree is very fast；If next-hop is obtained by configuration data, need the algorithm calculating for carrying out complexity from configuration data that could obtain
To next hop information, speed is slow.Therefore, for previous service discovering method when network element single-board amount is bigger, efficiency is low, holds
The row time is long.
Invention content
In order to solve the above technical problem, the present invention provides a kind of business routing discovering methods and device, computer can
Storage medium is read, service discovering speed can be improved.
In order to reach the object of the invention, what the technical solution of the embodiment of the present invention was realized in：
An embodiment of the present invention provides a kind of business routing discovering method, it is applied to realize the net of teleservice transmission
Member, the method includes：
Determine effective starting connection, the source port and place port discovery connected respectively from effective starting simultaneously creates top layer's industry
Business, if not having top layer's business, discovery procedure terminates；If there is top layer's business, top layer's business is set as current
Father's layer service；
Whether detection current parent's layer service carries the Sublayer service of lower level, if not carrying the sublayer industry of lower level
Business, then discovery procedure terminate；If there is carrying the Sublayer service of lower level, it sets newfound Sublayer service to current parent's layer
Business, and whether cycle detection current parent layer service carries the Sublayer service of lower level.
Further, the determination effectively originates connection, including：
If the type of service for the top layer connection end points CTP that the source port connected between network element and egress mouth include is identical
And the type of service belongs to effectively starting type of service, it is determined that effective starting connection is connected as between the network element.
Further, when the type of service for the CTP that each network element port is included is from CTP acquisition of information, in institute
It states before determining effectively starting connection, the method further includes：
Identify that the node for including in all network elements, the node are to belong to same network element and can complete certain a kind of specific work(
One piece of energy or the combination of polylith veneer；
Obtain all CTP of the intra-node of identification and its routing iinformation of information and each node.
It is further, described from the source port and place port discovery of effective starting connection and to create top layer's business respectively,
Including：
The top layer CTP for including using effective starting connection source port and egress mouth respectively searches for next-hop as Nowadays CTP
Routing iinformation branch number is arranged according to qualified routing iinformation number, every when searching the routing iinformation of next-hop
According to the updating route information Nowadays CTP of next-hop in one branch, and search process is repeated, until the route discovery of each branch
Terminate；
Every routing iinformation that effectively starting connection searches out is subjected to parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
Further, the routing iinformation of described search next-hop includes：Include most for effective starting connection egress mouth
The sweep backward of upper layer CTP is searched for, specifically backward since the top layer CTP that the egress mouth of effective starting connection is included
Including：
If Nowadays CTP is termination, latter half of route discovery success；
If Nowadays CTP is not termination and not the first CTP of the routing iinformation inside recognition node, or is not
The CTP on source port connected between connection or network element between node, the then discovery terminate, no effective routing information；
If Nowadays CTP is not termination, and is the first CTP of the routing iinformation inside recognition node, according to all
Qualified routing iinformation number setting branch number, the next-hop of each branch is the tail of a qualified routing iinformation
The next-hop of each branch is updated to Nowadays CTP by CTP, further judge the Nowadays CTP be connect between node or network element between connect
When CTP on the source port connect, by next-hop be updated to connect between the node or network element between match therewith on the egress mouth that connects
To CTP, and Nowadays CTP is updated with this；
When carrying out sweep backward for the first time, Nowadays CTP is by effective top layer for originating the egress mouth connected and including
CTP。
Further, the routing iinformation of described search next-hop includes：Include most for effective starting connection source port
The sweep forward of upper layer CTP is searched for forward, specifically since the top layer CTP that the source port of effective starting connection is included
Including：
If Nowadays CTP is termination, the success of first half route discovery；
If Nowadays CTP is not termination and not the tail CTP of the routing iinformation inside recognition node, or is not
CTP between node between connection or network element on connection egress mouth, the then discovery terminate, no effective routing information；
If Nowadays CTP is not to terminate and is the tail CTP of the routing iinformation inside recognition node, according to all symbols
The routing iinformation number setting branch number of conjunction condition, the next-hop of each branch is the first CTP of a qualified routing iinformation,
The next-hop of each branch is updated to Nowadays CTP, further judges that Nowadays CTP is to connect egress between connection or network element between node
When CTP on mouth, by next-hop be updated to connect between the node or network element between CTP paired on the source port that connects,
And Nowadays CTP is updated with this；
When carrying out sweep forward for the first time, Nowadays CTP is by effective top layer for originating the source port connected and including
CTP。
Further, whether detection current parent's layer service carries the Sublayer service of lower level, including：
If the source CTP and place CTP that have created business routing include sub- CTP, the sub- CTP for including to source CTP and place CTP
Carry out combinations of pairs；If do not include sub- CTP, or comprising sub- CTP pairing it is unsuccessful, discovery procedure terminates；
Otherwise, it takes the both ends CTP of each pair of combinations of pairs as Nowadays CTP respectively, searches for the routing iinformation of next-hop, when searching
Rope to next-hop routing iinformation when, branch number is arranged according to qualified routing iinformation number, on each branch under
The one updating route information Nowadays CTP jumped, and search process is repeated, until the route discovery of each branch terminates；
The routing iinformation that each pair of combinations of pairs is searched out carries out parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
Further, the routing iinformation of described search next-hop, include since the egress CTP of each pair of combinations of pairs backward
Search, specifically includes：
If Nowadays CTP is termination, latter half of route discovery success；
If Nowadays CTP is not termination, and not the first CTP of the routing iinformation inside recognition node, or not
Be connect between network element or node between CTP on the source port that connects when, the father layer CTP of Nowadays CTP is taken, if his father's layer CTP
It is the first CTP for the routing iinformation for having business, then the sub- CTP nodes of routing iinformation tail CTP are found, and in the sub- CTP
When there is CTP matched with Nowadays CTP parameter in node, it is updated to next-hop with the matched CTP of Nowadays CTP parameter by described,
And Nowadays CTP is updated with this；If be not present and the matched CTP of Nowadays CTP parameter, the discovery in the sub- CTP nodes
Terminate, no effective routing information；
If Nowadays CTP is not to terminate and is the first CTP of the routing iinformation inside recognition node, according to all
Qualified routing iinformation number setting branch number, the next-hop of each branch is the tail of a qualified routing iinformation
The next-hop of each branch is updated to Nowadays CTP by CTP, further judge the Nowadays CTP be connect between network element or node between
When CTP on the source port of connection, by next-hop be updated to connect between network element or node between match therewith on the egress mouth that connects
To CTP, and Nowadays CTP is updated with this；
When carrying out sweep backward for the first time, Nowadays CTP is the egress CTP of the combinations of pairs.
Further, the routing iinformation of described search next-hop, include since the source CTP of each pair of combinations of pairs forward
Search, specifically includes：
If Nowadays CTP is termination, the success of first half route discovery；
If Nowadays CTP is not termination, and not the tail CTP of the routing iinformation inside recognition node, or not
Be connect between network element or node between CTP on the egress mouth that connects when, the father layer CTP of Nowadays CTP is taken, if his father's layer CTP
It is the tail CTP for the routing iinformation for having business, then the sub- CTP nodes of this routing iinformation head CTP are found, and in the son
When there is CTP matched with Nowadays CTP parameter in CTP nodes, by it is described be updated to the matched CTP of Nowadays CTP parameter it is next
It jumps, and Nowadays CTP is updated with this；If be not present and the matched CTP of Nowadays CTP parameter, the hair in the sub- CTP nodes
Now terminate, no effective routing information；
If Nowadays CTP is not to terminate and is the tail CTP of the routing iinformation inside recognition node, according to all symbols
The routing iinformation number setting branch number of conjunction condition, the next-hop of each branch is the first CTP of a qualified routing iinformation,
The next-hop of each branch is updated to Nowadays CTP, further judge the Nowadays CTP be connect between network element or node between connect
Egress mouth on CTP when, by next-hop be updated to connect between network element or node between on the source port that connects it is paired
CTP, and Nowadays CTP is updated with this；
When carrying out sweep forward for the first time, Nowadays CTP is the source CTP of the combinations of pairs.
The embodiment of the present invention additionally provides a kind of computer readable storage medium, is deposited on the computer readable storage medium
One or more program is contained, one or more of programs can be executed by one or more processor, to realize such as
The step of business routing discovering method described in any of the above item.
The embodiment of the present invention additionally provides a kind of business route discovery device, including processor and memory, wherein：
The processor is for executing the business route discovery procedure stored in memory, to realize such as any of the above item institute
The step of business routing discovering method stated.
The embodiment of the present invention additionally provides a kind of business route discovery device, is applied to realize the net of teleservice transmission
Member, described device include top layer's search module and low layer search module, wherein：
Top layer's search module, for determining effectively starting connection, respectively from the source port and egress of effective starting connection
Mouth finds and creates top layer's business, if not having top layer's business, discovery procedure terminates；It, will if there is top layer's business
Top layer's business is set as current parent's layer service, notifies low layer search module；
Whether low layer search module, the notice for receiving top layer's search module, detection current parent's layer service carry
The Sublayer service of lower level, if not carrying the Sublayer service of lower level, discovery procedure terminates；If there is carrying lower level
Sublayer service, set newfound Sublayer service to current parent's layer service, and whether cycle detection current parent layer service holds
Carry the Sublayer service of lower level.
Technical scheme of the present invention has the advantages that：
Business routing discovering method and device, computer readable storage medium provided by the invention, by being originated from effective
The both ends of connection find and create top layer's business, and find Sublayer service based on upper-layer service, to the process of service discovering into
Improvement is gone, algorithm is simple, improves service discovering speed；
Further, the present invention is by before business route discovery, carrying out node identification, obtaining each intra-node
CTP attribute informations and its routing iinformation, in business route discovery, the router-level topology for being related to intra-node is very fast, reduces
The hop count of route search.
Description of the drawings
Attached drawing described herein is used to provide further understanding of the present invention, and constitutes the part of the present invention, this hair
Bright illustrative embodiments and their description are not constituted improper limitations of the present invention for explaining the present invention.In the accompanying drawings：
Fig. 1 is a kind of flow diagram of business routing discovering method of the embodiment of the present invention；
After Fig. 2 is proceeded by by the top layer CTP for including from the egress mouth of effective starting connection of the embodiment of the present invention
To the flow diagram of search；
Fig. 3 is a kind of flow diagram proceeding by sweep backward from the place CTP of combinations of pairs of the embodiment of the present invention；
Fig. 4 is the flow diagram of another business routing discovering method of the embodiment of the present invention；
Fig. 5 is a kind of structural schematic diagram of business route discovery device of the embodiment of the present invention；
Fig. 6 is the structural schematic diagram of another business route discovery device of the embodiment of the present invention.
Specific implementation mode
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention
Embodiment be described in detail.It should be noted that in the absence of conflict, in the embodiment and embodiment in the present invention
Feature mutually can arbitrarily combine.
The business routing discovering method that will be described in detail the present invention below, to keep the method for the embodiment of the present invention more clear
Chu, first to the present invention implement involved in several concepts make an explanation：
Connection end points (Connection Termination Point, CTP)：It is that information transmits entity connection reference point
Abstract expression, with G.805 in " connect reference point (Connection Point, CP) " unlike, the CTP of end-to-end system
In addition to the attribute with connection reference point, can also have with properties：Client's layer service is mapped to service layer, is multiplexed and demultiplexes
Support is provided with functions such as, resource allocations (available time slot)；In order to be supported to the multi-level of transmission services, CTP is also point
Layer and CTP can have set membership, such as an ODU2 carry 8 ODU0 by multiplexing and demultiplexing, then this 8
ODU0CTP is exactly the sub- CTP of corresponding ODU2CTP；Each CTP also has the attribute information for indicating whether its own terminates.If
CTP has carried out signal the node of multiplexing and demultiplexing or this CTP inherently signal Shang Lu and lower road, then this CTP
Exactly terminate.
Node (Node)：Node is a logic unit, and a Node is made of one piece or polylith veneer, Node according to
Its service logic realized can be divided into different type, such as terminal Node, relay Node, upper and lower road Node etc..Node and tool
The networking mode of body is unrelated, and the effective networking of any type should can all split into multiple Node.After Node is identified, in Node
The routing iinformation in portion has just secured, and can have a plurality of routing inside Node.One Node includes two class resource informations：When
Routing iinformation inside Node, the other is the CTP information for including in Node, CTP information herein includes its attribute information, example
Such as, whether CTP terminates, set membership etc..Such as：Six pieces of veneers of A, B, C, D, E, F constitute a Node, complete a spy
Fixed function, for finding for algorithm, this Node is an entirety, and the routing iinformation inside Node is identified in Node
When just have determined that.For example, a Node includes two routings, it is the CTP1- of veneer A respectively>The CTP2 of veneer E
The CTP1- of (CTP1 is the first CTP of this routing, and CTP2 is the tail CTP of this routing) and veneer A>CTP3 (the CTP1 of veneer F
It is the first CTP of this routing, CTP3 is the tail CTP of this routing).So when finding that algorithm calculates forward route, if worked as
The node of front jumping is the CTP1 of veneer 1, and next-hop CTP is exactly CTP2 and CTP3.When finding that algorithm calculates reverse route, if
Present node is CTP2, then next-hop is CTP1；If present node is CTP3, next-hop CTP1.It is more described herein as：
When being that more CTP form routing in other examples, then the first CTP and tail of the routing are similarly determined according to routing order
Detailed routing iinformation inside CTP, Node can be determined according to the resource information that Node is included.
Connection：I.e. optical fiber connects.
As shown in Figure 1, a kind of business routing discovering method according to the present invention, is applied to realize teleservice transmission
Network element, described method includes following steps：
Step 101：Determine effectively starting connection；
In the present embodiment, the determination effectively originates connection, including：If the source port and egress mouth packet that are connected between network element
The type of service of the top layer connection end points CTP contained is identical and the type of service belongs to effectively starting type of service (such as OTS
Type), it is determined that effective starting connection is connected as between the network element, specifically：
If there are one the connection end points CTP difference that the source port and egress mouth that are connected between network element include and CTP
Type of service is identical and the type of service belongs to effectively starting type of service (such as OTS types), determine and connect between the network element
It is connected for effective starting；Alternatively,
If have multiple CTP on the source port and egress mouth that are connected between network element, and source port and egress mouth include it is most upper
The type of service of layer CTP is identical and the type of service belongs to effectively starting type of service (such as OTS types), it is determined that the network element
Between be connected as the effective starting connection.
Further, the type of service for the CTP that each network element port is included in this step be from CTP acquisition of information,
Further include before determining effectively starting connection further：
Identify that the node for including in all network elements, the node are to belong to same network element and can complete certain a kind of specific work(
One piece of energy or the combination of polylith veneer；
Obtain all CTP of the intra-node of identification and its routing iinformation of information and each node.
More described herein as, the CTP information determination process that above-mentioned each network element port is included is determining effectively starting connection
It completes before, can be when it needs to be determined that effectively starting connects, can also be when system group network is completed or other
Scene is not specific herein to limit.
It should be noted that the method for the node for including in heretofore described all network elements of identification can be according to practical group
When net, connection relation between function that each piece of veneer is realized and each piece of veneer, each piece of veneer configuration information determine, this
Invention during service discovering, can use node identify as a result, but the present invention only service discovering algorithm is illustrated, no
It illustrates and how to carry out node identification；The type for the specific function that node can be completed is preset, can be general by this field
Logical technical staff realizes that the present invention does not make specific limit yet in conjunction with concrete application scene according to any mode in the prior art
It is fixed.
It should also be noted that, all veneers of a Node are all in the same network element.One business at least will be through
Cross two network elements (business in a network element does not have practical significance).Therefore, an effective business routing will at least pass through one
Connection and two Node between network element.So being connected to the starting connection of search between taking network element.
Step 102：From the source port and place port discovery of effective starting connection and create top layer's business respectively；If not yet
There is top layer's business, goes to step 106；If there is top layer's business, 103 are gone to step；
It should be noted that top layer's business is the business that can not carry out converging and being carried by other business again,
Such as optical transmission section (Optical Transmission Section, OTS) business.
It is described from the source port and place port discovery of effective starting connection and to create top layer's industry respectively in the present embodiment
Business, including：
The top layer CTP for including using effective starting connection source port and egress mouth respectively searches for next-hop as Nowadays CTP
Routing iinformation, when searching the routing iinformation of next-hop, according to all qualified routing iinformation numbers settings branches number,
On each branch according to the updating route information Nowadays CTP of next-hop, and search process is repeated, until the routing of each branch
It was found that terminating；
Every routing iinformation that effectively starting connection searches out is subjected to parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
In this step, the routing iinformation for searching for next-hop includes：For effective starting connection source port and egress mouth packet
The sweep backward and sweep forward of the top layer CTP contained.Sweep backward described herein refers to：From the place of effective starting connection
The top layer CTP that port is included starts to search for backward, and sweep forward described here refers to：From the source of effective starting connection
The top layer CTP that port is included starts to search for forward.
As shown in Fig. 2, wherein：Sweep backward specifically includes：
Step A：When carrying out sweep backward for the first time, by effective top layer for originating the egress mouth connected and being included
CTP is as Nowadays CTP；
Step B：Judge whether Nowadays CTP is that termination goes to step X if Nowadays CTP is termination；If worked as
Preceding CTP is not termination, then goes to step C；
Step C：Judge Nowadays CTP whether be the routing iinformation inside recognition node first CTP, if not having identified
The first CTP of the routing iinformation of intra-node, then go to step Y；If it is the first CTP of the routing iinformation inside recognition node,
Then go to step D；
Step D：It is divided into several branch process herein, branches' number is set according to all qualified routing iinformation numbers,
Branch herein is several to could be provided as 1 or multiple according to condition, and the next-hop of each branch is a qualified road
By the tail CTP of information, the next-hop of each branch is updated to Nowadays CTP, going to step E to each branch calculates separately；(
The processing procedure of a branch is illustrated only in Fig. 2)
It should be noted that the routing iinformation inside the recognition node has been acquired during recognition node
It arrives, during route discovery, need not calculate again under tail CTP is directly determined as by the routing iinformation inside recognition node
One jumps, and therefore, reduces the hop count of route search, accelerates calculating speed.It is described according to all qualified routing iinformations
Number setting branch number, condition therein is the professional qualification pre-defined, such as defines industry according to configuration informations such as wavelength, time slots
Business condition.
Step E：Judge whether Nowadays CTP is that termination goes to step X if Nowadays CTP is termination；If worked as
Preceding CTP is not termination, then goes to step F；
Step F：Judge Nowadays CTP whether be connect between node or network element between CTP on the source port that connects, if not
The CTP on source port connected between connection or network element between node, then go to step Y；If it is between node connection or network element between connect
The CTP on source port is met, then goes to step G；
Step G：Next-hop is updated to CTP paired on connection egress mouth between connection or network element between the node,
And it is Nowadays CTP to update next-hop, and go to step B；
Step X：Latter half of route discovery success, records routing iinformation；
Step Y：The branch finds to terminate, no effective routing information.
Similar, sweep forward specifically includes：
Step A1：When carrying out sweep forward for the first time, by effective top layer for originating the source port connected and being included
CTP is as Nowadays CTP；
Step B1：Judge whether Nowadays CTP is that termination goes to step X1 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step C1；
Step C1：Judge Nowadays CTP whether be the routing iinformation inside recognition node tail CTP, if not having known
The tail CTP of the routing iinformation of other intra-node, then go to step Y1；If it is the tail of the routing iinformation inside recognition node
CTP then goes to step D1；
Step D1：According to all qualified routing iinformation number setting branches number, it is divided into several bifurcations herein
Reason, branch herein is several can be set as 1 or multiple according to condition, and the next-hop of each branch is one eligible
Routing iinformation first CTP, the next-hop of each branch is updated to Nowadays CTP, go to step E1 to each branch counts respectively
It calculates；
Step E1：Judge whether Nowadays CTP is that termination goes to step X1 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step F1；
Step F1：Judge Nowadays CTP whether be connect between node or network element between CTP on connection egress mouth, if not
CTP between node between connection or network element on connection egress mouth, then go to step Y1；If it is between node connection or network element between connect
CTP on egress mouth then goes to step G1；
Step G1：Next-hop is updated to paired on the source port connected between connection or network element between the node
CTP, and it is Nowadays CTP to update next-hop, and go to step B1；
Step X1：The success of first half route discovery, records routing iinformation；
Step Y1：The branch finds to terminate, no effective routing information.
In the present embodiment, every top layer CTP that effectively starting connection source port and egress mouth include is searched forward
Rope and the routing iinformation searched out backward carry out parameter matching, are combined into complete routing iinformation, and to the routing iinformation of combination
It merges.
In the present embodiment, when the routing iinformation to combination merges, the method includes：
Routing iinformation with identical sourcesink merges in same business；
Antipodal two one way traffics of sourcesink are merged into a two-way services.
Step 103：Set top layer's business to current parent's layer service；
Step 104：Whether detection current parent's layer service carries the Sublayer service of lower level, if not carrying lower level
Sublayer service then goes to step 106；If there is carrying the Sublayer service of lower level, then step 105 is gone to；
In the present embodiment, whether detection current parent's layer service carries the Sublayer service of lower level, including：
If the source CTP and place CTP that have created business routing include sub- CTP, the sub- CTP for including to source CTP and place CTP
Carry out combinations of pairs；If do not include sub- CTP, or comprising sub- CTP pairing it is unsuccessful, discovery procedure terminates；
Otherwise, it takes the both ends CTP of each pair of combinations of pairs as Nowadays CTP respectively, searches for the routing iinformation of next-hop, when searching
Rope to next-hop routing iinformation when, according to all qualified routing iinformation numbers settings branches number, root on each branch
According to the updating route information Nowadays CTP of next-hop, and search process is repeated, until the route discovery of each branch terminates；
The routing iinformation that each pair of combinations of pairs is searched out carries out parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
It should be noted that when the sub- CTP for including to source CTP and place CTP carries out combinations of pairs, according to each sub- CTP's
Wavelength information, gap information etc. carry out combinations of pairs.Such as assume that it is optical multiplexing section (Optical to have created business
Multiplex Section, OMS) business, sourcesink OMS CTP include multiple optical channels (Optical Channel, OCH)
Sub- CTP, then the OCH CTP of phase co-wavelength form a combination.Matched group is carried out for the CTP on the sourcesink port of connection
It closes also referring to this principle.
In this step, search for the routing iinformation of next-hop, that is, complete for each pair of combinations of pairs CTP carry out it is preceding to it is rear
To search.Sweep backward described herein refers to：It is searched for backward since the place CTP of combinations of pairs, forward direction described here
Search refers to：It is searched for forward since the source CTP of combinations of pairs.
As shown in figure 3, when carrying out sweep backward, specifically include：
Step A2：When carrying out sweep backward for the first time, using the egress CTP of the combinations of pairs as Nowadays CTP；
Step B2：Judge whether Nowadays CTP is that termination goes to step X2 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step C2；
Step C2：Judge Nowadays CTP whether be the routing iinformation inside recognition node first CTP, if not having known
The first CTP of the routing iinformation of other intra-node, then go to step H2；If it is the first CTP of the routing iinformation inside recognition node,
Then go to step D2；
Step D2：It is divided into several branch process herein, branch is set according to all qualified routing iinformation numbers
Number, branch herein is several to could be provided as 1 or multiple according to condition, and the next-hop of each branch is one qualified
The next-hop of each branch is updated to Nowadays CTP by the tail CTP of routing iinformation, and going to step E2 respectively to each branch carries out
It calculates；(processing procedure for illustrating only a branch in figure 3)
Step E2：Judge whether Nowadays CTP is that termination goes to step X2 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step F2；
Step F2：Judge Nowadays CTP whether be connect between network element or node between CTP on the source port that connects, if
Be not connect between network element or node between CTP on the source port that connects, then go to step H2；If it is between network element connection or
The CTP on source port is connected between node, then goes to step G2；
Step G2：Update next-hop connected between network element or node between CTP paired on the egress mouth that connects, more
New next-hop is Nowadays CTP, and goes to step B2；
Step H2：The father layer CTP of Nowadays CTP is taken, if his father's layer CTP is the first CTP for the routing iinformation for having business, that
Find the sub- CTP nodes of routing iinformation tail CTP；
Step I2：Detect in the sub- CTP nodes with the presence or absence of with the matched CTP of Nowadays CTP parameter, if there is with work as
The preceding matched CTP of CTP parameters is then updated to next-hop by described with the matched CTP of Nowadays CTP parameter, and update next-hop is to work as
Preceding CTP, and go to step B2；If there is no with the matched CTP of Nowadays CTP parameter, then go to step Y2；
Step X2：Latter half of route discovery success, records routing iinformation；
Step Y2：The branch finds to terminate, no effective routing information.
Similar, when carrying out sweep forward, specifically include：
Step A3：When carrying out sweep forward for the first time, using the source CTP of the combinations of pairs as Nowadays CTP；
Step B3：Judge whether Nowadays CTP is that termination goes to step X3 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step C3；
Step C3：Judge Nowadays CTP whether be the routing iinformation inside recognition node tail CTP, if not having known
The tail CTP of the routing iinformation of other intra-node, then go to step H3；If it is the tail CTP of the routing iinformation inside recognition node,
Then go to step D3；
Step D3：It is divided into several branch process herein, branch is set according to all qualified routing iinformation numbers
Number, branch herein is several to could be provided as 1 or multiple according to condition, and the next-hop of each branch is one qualified
The next-hop of each branch is updated to Nowadays CTP by the first CTP of routing iinformation, and going to step E3 respectively to each branch carries out
It calculates；
Step E3：Judge whether Nowadays CTP is that termination goes to step X3 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step F3；
Step F3：Judge Nowadays CTP whether be connect between network element or node between CTP on the egress mouth that connects, if
Be not connect between network element or node between CTP on the egress mouth that connects, then go to step H3；If it is between network element connection or
The CTP on source port is connected between node, then goes to step G3；
Step G3：Update next-hop connected between network element or node between CTP paired on the source port that connects, more
New next-hop is Nowadays CTP, and goes to step B3；
Step H3：The father layer CTP of Nowadays CTP is taken, if his father's layer CTP is the tail CTP for the routing iinformation for having business, that
Find the sub- CTP nodes of routing iinformation head CTP；
Step I3：Detect in the sub- CTP nodes with the presence or absence of with the matched CTP of Nowadays CTP parameter, if there is with work as
The preceding matched CTP of CTP parameters is then updated to next-hop by described with the matched CTP of Nowadays CTP parameter, and update next-hop is to work as
Preceding CTP, and go to step B3；If there is no with the matched CTP of Nowadays CTP parameter, then go to step Y3；
Step X3：The success of first half route discovery, records routing iinformation；
Step Y3：The branch finds to terminate, no effective routing information.
Step 105：It sets newfound Sublayer service to current parent's layer service, and goes to step 104 and continue to execute；
It should be noted that if newfound Sublayer service information is not sky, set newfound Sublayer service to
Current parent's layer service, re-executes step 104, continues to find its Sublayer service.
Step 106：Discovery procedure terminates.
As shown in figure 4, a kind of business routing discovering method according to the present invention, includes the following steps：
Step 401：Node logical resources identify
The present invention can use Node resource identifications as a result, but the present invention only service discovering algorithm is illustrated.Do not have
Body illustrates how to carry out Node resource identifications.
Step 402：It was found that and creating top layer's business；
Top layer's business can not be converged again, the business then carried by other business.Such as OTS business.Such as
Guo You top layers business generates, and sets top layer's business to father's layer service, goes to step 403；If there is no top layer's business
It generates, then finds to complete.
Step 403：Based on father's layer service, the Sublayer service of its carrying is found；
If there is Sublayer service generates, sets Sublayer service to current parent's layer service, go to step 403；If no
Sublayer service generates, then finds to complete.
The embodiment of the present invention additionally provides a kind of computer readable storage medium, is deposited on the computer readable storage medium
One or more program is contained, one or more of programs can be executed by one or more processor, to realize such as
The step of business routing discovering method described in any of the above item.
The embodiment of the present invention additionally provides a kind of business route discovery device, including processor and memory, wherein：
The processor is for executing the business route discovery procedure stored in memory, to realize such as any of the above item institute
The step of business routing discovering method stated.
As shown in figure 5, the embodiment of the present invention additionally provides a kind of business route discovery device, it is applied to realize end-to-end industry
It is engaged in the network element of transmission, described device includes top layer's search module 501 and low layer search module 502, wherein：
Top layer's search module 501, for determining, effectively starting connects, respectively the source port from effective starting connection and place
Port discovery simultaneously creates top layer's business, if not having top layer's business, discovery procedure terminates；If there is top layer's business,
Set top layer's business to current parent's layer service, notice low layer search module 502；
Low layer search module 502, the notice for receiving top layer's search module 501, detection current parent's layer service are
The Sublayer service of no carrying lower level, if not carrying the Sublayer service of lower level, discovery procedure terminates；If there is carrying
The Sublayer service of lower level sets newfound Sublayer service to current parent's layer service, and cycle detection current parent's layer service
Whether the Sublayer service of lower level is carried.
In the present embodiment, as shown in fig. 6, the business route discovery device further includes node discovery module 503, wherein：
Node discovery module 503, the node for including in all network elements for identification, the node are to belong to same network element simultaneously
And one piece of certain a kind of specific function or the combination of polylith veneer can be completed；Obtain identification intra-node all CTP and
The routing iinformation of its information and each node.
It should be noted that the method for the node for including in all network elements of identification of interior joint discovery module 503 of the present invention
When can be according to practical networking, connection relation between function that each piece of veneer is realized and each piece of veneer, each piece of veneer be matched
Confidence breath determines, the present invention during service discovering, it is can using that node identifies as a result, but the present invention only to service discovering
Algorithm is illustrated, and is not illustrated and how to be carried out node identification；The type for the specific function that node can be completed is preset,
It can be realized according to any mode in the prior art in conjunction with concrete application scene by those of ordinary skill in the art, the present invention
Specific restriction is not made.
Top layer's business refers to the business that can not be converged, and be carried by other business again, such as OTS industry
Business.
In the present embodiment, the determination of top layer's search module 501 effectively originates connection, including：If connected between network element
The type of service for the top layer connection end points CTP that the source port connect and egress mouth include is identical and the type of service belongs to effective
Originate type of service (such as OTS types), it is determined that effective starting connection is connected as between the network element.
Specifically, the determination of top layer's search module 501 effectively originates connection, including：
If there are one the connection end points CTP difference that the source port and egress mouth that are connected between network element include and CTP
Type of service is identical and the type of service belongs to effectively starting type of service (such as OTS types), determine and connect between the network element
It is connected for effective starting；Alternatively,
If have multiple CTP on the source port and egress mouth that are connected between network element, and source port and egress mouth include it is most upper
The type of service of layer CTP is identical and the type of service belongs to effectively starting type of service (such as OTS types), it is determined that the network element
Between be connected as the effective starting connection.
It should be noted that all veneers of a Node are all in the same network element.One business will at least pass through
Two network elements (business in a network element does not have practical significance).Therefore, an effective service path will at least pass through one
Connection and two Node between network element.So being connected to the starting connection of search between taking network element.
In the present embodiment, top layer's search module 501 finds and creates from the both ends of effective starting connection respectively
Top layer's business, including：
The top layer CTP for including using effective starting connection source port and egress mouth respectively searches for next-hop as Nowadays CTP
Routing iinformation, when searching the routing iinformation of next-hop, according to all qualified routing iinformation numbers settings branches number,
On each branch according to the updating route information Nowadays CTP of next-hop, and search process is repeated, until the routing of each branch
It was found that terminating；
Every routing iinformation that effectively starting connection searches out is subjected to parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
The search process of top layer's search module 501 is illustrated in detail below.
In the present embodiment, the routing iinformation for searching for next-hop includes：For effective starting connection source port and egress mouth packet
The sweep backward and sweep forward of the top layer CTP contained.Sweep backward described herein refers to：From the place of effective starting connection
The top layer CTP that port is included starts to search for backward, and sweep forward described here refers to：From the source of effective starting connection
The top layer CTP that port is included starts to search for forward.When carrying out sweep backward, after top layer's search module 501
It is specifically included to search process：
Step A：When carrying out sweep backward for the first time, by effective top layer for originating the egress mouth connected and being included
CTP is as Nowadays CTP；
Step B：Judge whether Nowadays CTP is that termination goes to step X if Nowadays CTP is termination；If worked as
Preceding CTP is not termination, then goes to step C；
Step C：Judge Nowadays CTP whether be the routing iinformation inside recognition node first CTP, if not having identified
The first CTP of the routing iinformation of intra-node, then go to step Y；If it is the first CTP of the routing iinformation inside recognition node,
Then go to step D；
Step D：It is divided into several branch process herein, branches' number is set according to all qualified routing iinformation numbers,
Branch herein is several to could be provided as 1 or multiple according to condition, and the next-hop of each branch is a qualified road
By the tail CTP of information, the next-hop of each branch is updated to Nowadays CTP, going to step E to each branch calculates separately；
Step E：Judge whether Nowadays CTP is that termination goes to step X if Nowadays CTP is termination；If worked as
Preceding CTP is not termination, then goes to step F；
Step F：Judge Nowadays CTP whether be connect between node or network element between CTP on the source port that connects, if not
The CTP on source port connected between connection or network element between node, then go to step Y；If it is between node connection or network element between connect
The CTP on source port connect, then go to step G；
Step G：Next-hop is updated to paired on the egress mouth connected between connection or network element between the node
CTP, and it is Nowadays CTP to update next-hop, and go to step B；
Step X：Latter half of route discovery success, records routing iinformation；
Step Y：The branch finds to terminate, no effective routing information.
In the present embodiment, when carrying out sweep forward, the sweep forward process of top layer's search module 501 is specifically wrapped
It includes：
Step A1：When carrying out sweep forward for the first time, using it is described it is effective starting connection source port top layer CTP as
Nowadays CTP；
Step B1：Judge whether Nowadays CTP is that termination goes to step X1 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step C1；
Step C1：Judge Nowadays CTP whether be the routing iinformation inside recognition node tail CTP, if not having known
The tail CTP of the routing iinformation of other intra-node, then go to step Y1；If it is the tail of the routing iinformation inside recognition node
CTP then goes to step D1；
Step D1：According to all qualified routing iinformation number setting branches number, it is divided into several bifurcations herein
Reason, branch herein is several can be set as 1 or multiple according to condition, and the next-hop of each branch is one eligible
Routing iinformation first CTP, the next-hop of each branch is updated to Nowadays CTP, go to step E1 to each branch counts respectively
It calculates；
Step E1：Judge whether Nowadays CTP is that termination goes to step X1 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step F1；
Step F1：Judge Nowadays CTP whether be connect between node or network element between CTP on the egress mouth that connects, if not
Be connect between node or network element between CTP on the egress mouth that connects, then go to step Y1；If it is between node connection or network element between
CTP on the egress mouth of connection, then go to step G1；
Step G1：Next-hop is updated to paired on the source port connected between connection or network element between the node
CTP, and it is Nowadays CTP to update next-hop, and go to step B1；
Step X1：The success of first half route discovery, records routing iinformation；
Step Y1：The branch finds to terminate, no effective routing information.
In the present embodiment, top layer's search module 501 has identical sourcesink when the routing iinformation to combination merges
Routing iinformation merge in same business；Antipodal two one way traffics of sourcesink are merged into a two-way services.
In the present embodiment, whether detection current parent's layer service of the low layer search module 502 carries the sublayer of lower level
Business, including：
If the source CTP and place CTP that have created business routing include sub- CTP, the sub- CTP for including to source CTP and place CTP
Carry out combinations of pairs；If do not include sub- CTP, or comprising sub- CTP pairing it is unsuccessful, discovery procedure terminates；
Otherwise, it takes the both ends CTP of each pair of combinations of pairs as Nowadays CTP respectively, searches for the routing iinformation of next-hop, when searching
Rope to next-hop routing iinformation when, according to all qualified routing iinformation numbers settings branches number, root on each branch
According to the updating route information Nowadays CTP of next-hop, and search process is repeated, until the route discovery of each branch terminates；
The routing iinformation that each pair of combinations of pairs is searched out carries out parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
It should be noted that when the sub- CTP for including to source CTP and place CTP carries out combinations of pairs, according to each sub- CTP's
Wavelength information, gap information etc. carry out combinations of pairs.Such as assuming that it is OMS business to have created business, sourcesink OMS CTP include
The sub- CTP of multiple OCH, then the OCH CTP of phase co-wavelength form a combination.CTP on the sourcesink port of connection is carried out
Pairing is also referring to the principle.
The search process of low layer search module 502 is illustrated in detail below.The routing iinformation of search next-hop herein, i.e., it is complete
In pairs forward and backward search is carried out in each pair of combinations of pairs CTP.Sweep backward described herein refers to：From combinations of pairs
Place CTP starts to search for backward, and sweep forward described here refers to：It is searched for forward since the source CTP of combinations of pairs.
In the present embodiment, when being searched for backward the place CTP since combinations of pairs, the backward of low layer search module 502 is searched
Rope process specifically includes：
Step A2：When carrying out sweep backward for the first time, using the egress CTP of the combinations of pairs as Nowadays CTP；
Step B2：Judge whether Nowadays CTP is that termination goes to step X2 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step C2；
Step C2：Judge Nowadays CTP whether be the routing iinformation inside recognition node first CTP, if not having known
The first CTP of the routing iinformation of other intra-node, then go to step H2；If it is the first CTP of the routing iinformation inside recognition node,
Then go to step D2：
Step D2：It is divided into several branch process herein, branch is set according to all qualified routing iinformation numbers
Number, branch herein is several to could be provided as 1 or multiple according to condition, and the next-hop of each branch is one qualified
The next-hop of each branch is updated to Nowadays CTP by the tail CTP of routing iinformation, and going to step E2 respectively to each branch carries out
It calculates；
Step E2：Judge whether Nowadays CTP is that termination goes to step X2 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step F2；
Step F2：Judge Nowadays CTP whether be connect between network element or node between CTP on the source port that connects, if
Be not connect between network element or node between CTP on the source port that connects, then go to step H2；If it is between network element connection or
The CTP on source port is connected between node, then goes to step G2；
Step G2：Update next-hop connected between network element or node between corresponding CTP on the egress mouth that connects, more
New next-hop is Nowadays CTP, and goes to step B2；
Step H2：The father layer CTP of Nowadays CTP is taken, if his father's layer CTP is the first CTP for the routing iinformation for having business, that
Find the sub- CTP nodes of routing iinformation tail CTP；
Step I2：Detect in the sub- CTP nodes with the presence or absence of with the matched CTP of Nowadays CTP parameter, if there is with work as
The preceding matched CTP of CTP parameters is then updated to next-hop by described with the matched CTP of Nowadays CTP parameter, and update next-hop is to work as
Preceding CTP, and go to step B2；If there is no with the matched CTP of Nowadays CTP parameter, then go to step Y2；
Step X2：Latter half of route discovery success, records routing iinformation；
Step Y2：The branch finds to terminate, no effective routing information.
In the present embodiment, when being searched for forward the place CTP since combinations of pairs, the forward direction of low layer search module 502 is searched
Rope process specifically includes：
Step A3：When carrying out sweep forward for the first time, using the source CTP of the combinations of pairs as Nowadays CTP；
Step B3：Judge whether Nowadays CTP is that termination goes to step X3 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step C3；
Step C3：Judge Nowadays CTP whether be the routing iinformation inside recognition node tail CTP, if not having known
The tail CTP of the routing iinformation of other intra-node, then go to step H3；If it is the tail CTP of the routing iinformation inside recognition node,
Then go to step D3；
Step D3：It is divided into several branch process herein, branch is set according to all qualified routing iinformation numbers
Number, branch herein is several to could be provided as 1 or multiple according to condition, and the next-hop of each branch is one qualified
The next-hop of each branch is updated to Nowadays CTP by the first CTP of routing iinformation, and going to step E3 respectively to each branch carries out
It calculates；
Step E3：Judge whether Nowadays CTP is that termination goes to step X3 if Nowadays CTP is termination；If
Nowadays CTP is not termination, then goes to step F3；
Step F3：Judge Nowadays CTP whether be connect between network element or node between CTP on the egress mouth that connects, if
Be connect between network element or node between CTP on the egress mouth that connects, then go to step H3；If it is connection between network element or save
The CTP on source port is connected between point, then goes to step G3；
Step G3：Update next-hop connected between network element or node between CTP paired on the source port that connects, more
New next-hop is Nowadays CTP, and goes to step B3；
Step H3：The father layer CTP of Nowadays CTP is taken, if his father's layer CTP is the tail CTP for the routing iinformation for having business, that
Find the sub- CTP nodes of routing iinformation head CTP；
Step I3：Detect in the sub- CTP nodes with the presence or absence of with the matched CTP of Nowadays CTP parameter, if there is with work as
The preceding matched CTP of CTP parameters is then updated to next-hop by described with the matched CTP of Nowadays CTP parameter, and update next-hop is to work as
Preceding CTP, and go to step B3；If there is no with the matched CTP of Nowadays CTP parameter, then go to step Y3；
Step X3：The success of first half route discovery, records routing iinformation；
Step Y3：The branch finds to terminate, no effective routing information.
It should be noted that if newfound Sublayer service information is not sky, low layer search module 502 will be newfound
Sublayer service is set as father's layer service, continues to find its Sublayer service.
The invention has the advantages that：
(1) speed is fast
The present invention only needs to use the intersection on veneer, the complicated configuration information such as business mapping when Node is identified.Industry
Business finds that algorithm is not related to the calculating repeatedly of configuration information.After carrying out Node identifications, the routing iinformation inside Node just produces,
It was found that the router-level topology that algorithm is related to when calculating in Node is very fast.Reduce the hop count of route search.
(2) stability is high
Algorithm itself is fairly simple, is not related to specific mesh information.After there is new network model, it is only necessary to its into
Row is split, and increases the Node Model Identifications processing being not present.
One of ordinary skill in the art will appreciate that all or part of step in the above method can be instructed by program
Related hardware is completed, and described program can be stored in computer readable storage medium, such as read-only memory, disk or CD
Deng.Optionally, all or part of step of above-described embodiment can also be realized using one or more integrated circuits, accordingly
Ground, the form that hardware may be used in each module/unit in above-described embodiment are realized, the shape of software function module can also be used
Formula is realized.The present invention is not limited to the combinations of the hardware and software of any particular form.
The foregoing is only a preferred embodiment of the present invention, is not intended to restrict the invention, for the skill of this field
For art personnel, the invention may be variously modified and varied.All within the spirits and principles of the present invention, any made by repair
Change, equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.
Claims (12)
1. a kind of business routing discovering method, which is characterized in that be applied to realize the network element of teleservice transmission, the method
Including：
Determining effective starting connection, the source port and place port discovery connected respectively from effective starting simultaneously creates top layer's business,
If not having top layer's business, discovery procedure terminates；If there is top layer's business, it sets top layer's business to current parent's layer
Business；
Whether detection current parent's layer service carries the Sublayer service of lower level, if not carrying the Sublayer service of lower level,
Discovery procedure terminates；If there is the Sublayer service of carrying lower level, it sets newfound Sublayer service to current parent's layer service,
And whether cycle detection current parent layer service carries the Sublayer service of lower level.
2. according to the method described in claim 1, it is characterized in that, the determination effectively originates connection, including：
If the type of service for the top layer connection end points CTP that the source port connected between network element and egress mouth include is identical and should
Type of service belongs to effectively starting type of service, it is determined that effective starting connection is connected as between the network element.
3. according to the method described in claim 1, it is characterized in that, working as the service class for the CTP that each network element port is included
Type be from CTP acquisition of information when, the determination effectively originate connection before, the method further includes：
Identify that the node for including in all network elements, the node are to belong to same network element and can complete certain a kind of specific function
The combination of one piece or polylith veneer；
Obtain all CTP of the intra-node of identification and its routing iinformation of information and each node.
4. according to the method described in claim 1, it is characterized in that, described respectively from the source port and egress of effective starting connection
Mouth discovery simultaneously creates top layer's business, including：
The top layer CTP for including using effective starting connection source port and egress mouth respectively searches for next-hop as Nowadays CTP
Routing iinformation branch number is arranged according to qualified routing iinformation number, every when searching the routing iinformation of next-hop
According to the updating route information Nowadays CTP of next-hop in one branch, and search process is repeated, until the route discovery of each branch
Terminate；
Every routing iinformation that effectively starting connection searches out is subjected to parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
5. according to the method described in claim 4, it is characterized in that, the routing iinformation of described search next-hop includes：From described
The top layer CTP that the egress mouth of effectively starting connection is included starts to search for backward, specifically includes：
If Nowadays CTP is termination, latter half of route discovery success；
If Nowadays CTP is not termination and not the first CTP of the routing iinformation inside recognition node, or is not node
Between connect or network element between CTP on the source port that connects, then the discovery terminates, no effective routing information；
If Nowadays CTP is not termination, and is the first CTP of the routing iinformation inside recognition node, met according to all
The routing iinformation number setting branch number of condition, the next-hop of each branch is the tail CTP of a qualified routing iinformation, will
The next-hop of each branch is updated to Nowadays CTP, further judge the Nowadays CTP be connect between node or network element between the source that connects
When CTP on port, by next-hop be updated to connect between the node or network element between on the egress mouth that connects it is paired
CTP, and Nowadays CTP is updated with this；
When carrying out sweep backward for the first time, Nowadays CTP is by effective top layer CTP for originating the egress mouth connected and including.
6. according to the method described in claim 4, it is characterized in that, the routing iinformation of described search next-hop includes：From described
The top layer CTP that the source port of effectively starting connection is included starts to search for forward, specifically includes：
If Nowadays CTP is termination, the success of first half route discovery；
If Nowadays CTP is not termination and not the tail CTP of the routing iinformation inside recognition node, or is not node
Between connect or network element between connection egress mouth on CTP, then it is described discovery terminate, no effective routing information；
If Nowadays CTP is not to terminate and is the tail CTP of the routing iinformation inside recognition node, meet item according to all
The routing iinformation number setting branch number of part, the next-hop of each branch is the first CTP of a qualified routing iinformation, will be every
The next-hop of a branch is updated to Nowadays CTP, further judge Nowadays CTP be connect between node or network element between connect on egress mouth
CTP when, by next-hop be updated to connect between the node or network element between CTP paired on the source port that connects, and with
This update Nowadays CTP；
When carrying out sweep forward for the first time, Nowadays CTP is by effective top layer CTP for originating the source port connected and including.
7. according to the method described in claim 1, it is characterized in that, whether detection current parent's layer service carries lower level
Sublayer service, including：
If the source CTP and place CTP that have created business routing include sub- CTP, the sub- CTP that source CTP and place CTP include is carried out
Combinations of pairs；If do not include sub- CTP, or comprising sub- CTP pairing it is unsuccessful, discovery procedure terminates；
Otherwise, it takes the both ends CTP of each pair of combinations of pairs as Nowadays CTP respectively, searches for the routing iinformation of next-hop, when searching
When the routing iinformation of next-hop, branch's number is arranged according to qualified routing iinformation number, on each branch according to next-hop
Updating route information Nowadays CTP, and search process is repeated, until the route discovery of each branch terminates；
The routing iinformation that each pair of combinations of pairs is searched out carries out parameter matching, is combined into complete routing iinformation；
The routing iinformation of combination is merged.
8. the method according to the description of claim 7 is characterized in that the routing iinformation of described search next-hop, including from each pair of
The egress CTP of combinations of pairs starts to search for backward, specifically includes：
If Nowadays CTP is termination, latter half of route discovery success；
If Nowadays CTP is not termination, and not the first CTP of the routing iinformation inside recognition node, or is not net
The father layer CTP of Nowadays CTP is taken, if his father's layer CTP is when CTP on the source port that connects between connection or node between member
There is the first CTP of the routing iinformation of business, then the sub- CTP nodes of routing iinformation tail CTP are found, and in the sub- CTP nodes
It is middle when there is CTP matched with Nowadays CTP parameter, it is updated to next-hop with the matched CTP of Nowadays CTP parameter by described, and with
This update Nowadays CTP；Terminate with the matched CTP of Nowadays CTP parameter, the discovery if be not present in the sub- CTP nodes,
Without effective routing information；
If Nowadays CTP is not to terminate and is the first CTP of the routing iinformation inside recognition node, met according to all
The routing iinformation number setting branch number of condition, the next-hop of each branch is the tail CTP of a qualified routing iinformation, will
The next-hop of each branch is updated to Nowadays CTP, further judge the Nowadays CTP be connect between network element or node between connect
When CTP on source port, by next-hop be updated to connect between network element or node between on the egress mouth that connects it is paired
CTP, and Nowadays CTP is updated with this；
When carrying out sweep backward for the first time, using the egress CTP of the combinations of pairs as Nowadays CTP.
9. the method according to the description of claim 7 is characterized in that the routing iinformation of described search next-hop, including from each pair of
The source CTP of combinations of pairs starts to search for forward, specifically includes：
If Nowadays CTP is termination, the success of first half route discovery；
If Nowadays CTP is not termination, and not the tail CTP of the routing iinformation inside recognition node, or is not net
The father layer CTP of Nowadays CTP is taken, if his father's layer CTP is when CTP on the egress mouth that connects between connection or node between member
There is the tail CTP of the routing iinformation of business, then finding the sub- CTP nodes of this routing iinformation head CTP, and is saved in the sub- CTP
When there is CTP matched with Nowadays CTP parameter in point, it is updated to next-hop with the matched CTP of Nowadays CTP parameter by described, and
Nowadays CTP is updated with this；If be not present in the sub- CTP nodes and the matched CTP of Nowadays CTP parameter, the discovery knot
Beam, no effective routing information；
If Nowadays CTP is not to terminate and is the tail CTP of the routing iinformation inside recognition node, meet item according to all
The routing iinformation number setting branch number of part, the next-hop of each branch is the first CTP of a qualified routing iinformation, will be every
The next-hop of a branch is updated to Nowadays CTP, further judge the Nowadays CTP be connect between network element or node between the place that connects
When CTP on port, by next-hop be updated to connect between network element or node between CTP paired on the source port that connects,
And Nowadays CTP is updated with this；
When carrying out sweep forward for the first time, Nowadays CTP is the source CTP of the combinations of pairs.
10. a kind of computer readable storage medium, which is characterized in that on the computer readable storage medium storage there are one or
The multiple programs of person, one or more of programs can be executed by one or more processor, with realize as claim 1 to
The step of business routing discovering method described in any one of 9.
11. a kind of business route discovery device, which is characterized in that including processor and memory, wherein：
The processor is for executing the business route discovery procedure stored in memory, to realize as appointed in claim 1 to 9
The step of business routing discovering method described in one.
12. a kind of business route discovery device, which is characterized in that be applied to realize the network element of teleservice transmission, the dress
It sets including top layer's search module and low layer search module, wherein：
Top layer's search module, for determining effectively starting connection, respectively from the source port and egress mouth hair of effective starting connection
Now and top layer's business is created, if not having top layer's business, discovery procedure terminates；It, will be most upper if there is top layer's business
Layer service is set as current parent's layer service, notifies low layer search module；
Low layer search module, the notice for receiving top layer's search module, it is lower whether detection current parent's layer service carries
The Sublayer service of layer, if not carrying the Sublayer service of lower level, discovery procedure terminates；If there is carrying the son of lower level
Layer service sets newfound Sublayer service to current parent's layer service, and whether cycle detection current parent layer service carries more
The Sublayer service of low layer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810673092.8A CN108521617B (en) | 2018-06-26 | 2018-06-26 | Service route discovery method and device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810673092.8A CN108521617B (en) | 2018-06-26 | 2018-06-26 | Service route discovery method and device and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108521617A true CN108521617A (en) | 2018-09-11 |
| CN108521617B CN108521617B (en) | 2020-10-23 |
Family
ID=63427830
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810673092.8A Active CN108521617B (en) | 2018-06-26 | 2018-06-26 | Service route discovery method and device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108521617B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110011844A (en) * | 2019-03-29 | 2019-07-12 | 烽火通信科技股份有限公司 | A kind of method and system that network management OTN business quickly creates |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6954790B2 (en) * | 2000-12-05 | 2005-10-11 | Interactive People Unplugged Ab | Network-based mobile workgroup system |
| CN105591887A (en) * | 2014-10-21 | 2016-05-18 | 中兴通讯股份有限公司 | Method and device for generating optical transport network path section |
| CN105763963A (en) * | 2014-12-18 | 2016-07-13 | 中兴通讯股份有限公司 | Service transmission method and device |
| CN106875170A (en) * | 2016-07-22 | 2017-06-20 | 阿里巴巴集团控股有限公司 | A kind of method and device for business processing of intermediate business system |
| US20170187590A1 (en) * | 2015-12-29 | 2017-06-29 | Vmware, Inc. | Monitoring element hierarchies in a cloud computing system |
| CN107528745A (en) * | 2016-06-22 | 2017-12-29 | 中兴通讯股份有限公司 | A kind of service path diagnostic method and device |
-
2018
- 2018-06-26 CN CN201810673092.8A patent/CN108521617B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6954790B2 (en) * | 2000-12-05 | 2005-10-11 | Interactive People Unplugged Ab | Network-based mobile workgroup system |
| CN105591887A (en) * | 2014-10-21 | 2016-05-18 | 中兴通讯股份有限公司 | Method and device for generating optical transport network path section |
| CN105763963A (en) * | 2014-12-18 | 2016-07-13 | 中兴通讯股份有限公司 | Service transmission method and device |
| US20170187590A1 (en) * | 2015-12-29 | 2017-06-29 | Vmware, Inc. | Monitoring element hierarchies in a cloud computing system |
| CN107528745A (en) * | 2016-06-22 | 2017-12-29 | 中兴通讯股份有限公司 | A kind of service path diagnostic method and device |
| CN106875170A (en) * | 2016-07-22 | 2017-06-20 | 阿里巴巴集团控股有限公司 | A kind of method and device for business processing of intermediate business system |
Non-Patent Citations (1)
| Title |
|---|
| FAJUN CHEN: "Routing with uncertainty in wireless mesh networks", 《IEEE》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110011844A (en) * | 2019-03-29 | 2019-07-12 | 烽火通信科技股份有限公司 | A kind of method and system that network management OTN business quickly creates |
| CN110011844B (en) * | 2019-03-29 | 2022-01-18 | 烽火通信科技股份有限公司 | Method and system for rapidly creating network management OTN service |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108521617B (en) | 2020-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7676154B2 (en) | Method and system for configuring a connection-oriented packet network over a wavelength division multiplexed optical network | |
| CN107925613A (en) | It is used for the methods, devices and systems to E-Packet in business function chain SFC | |
| US7366112B2 (en) | Communication network control system, control method, node and program | |
| Chow et al. | A fast distributed network restoration algorithm | |
| Shi et al. | Hierarchical self-healing rings | |
| JP2004535140A (en) | Routing method in telecommunications network | |
| CN100440804C (en) | Method for searching path in network layer and network transmission managing system | |
| CN108521617A (en) | A kind of business routing discovering method and device, computer readable storage medium | |
| CN101136712B (en) | Method for improving path discovery efficiency in network communication transmission | |
| CN101466051B (en) | Method and apparatus for searching business route | |
| CN1567747B (en) | A method for computing best route of multiple constraints service in optical network | |
| CN113691897B (en) | Method and device for reversely creating EOO service end to end | |
| CN106656802B (en) | A kind of end-to-end tunnel generation method | |
| CN108337174B (en) | Method and device for searching end-to-end service route of transmission network and storage medium | |
| CN101243723B (en) | Route selecting method for automatic switching optical network multicast service | |
| KR101660967B1 (en) | Apparatus and method for generating path in transtort network | |
| CN107689916A (en) | A kind of method and system for seeking complete risk sharing link group disjoint paths pair | |
| US7460491B2 (en) | Method and system for discovering circuits in a network | |
| CN108768863B (en) | Transmission network route analysis method and device and computer readable storage medium | |
| CN101102616A (en) | Shortest path searching method and device under multi-restraint conditions in automatic switching optical network | |
| US20120176940A1 (en) | Course searching method and node device | |
| CN116094981B (en) | Cross-layer service creation method and corresponding device | |
| CN113076345B (en) | Method and device for systematized management of business table item information of each layer | |
| KR100327110B1 (en) | Routing method for setup of multimedia service connection on open information network | |
| Drakos et al. | A node clustering algorithm for the CANON architecture |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20180911 Assignee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Assignor: RAISECOM TECHNOLOGY Co.,Ltd. Contract record no.: X2022110000038 Denomination of invention: A service route discovery method and device, computer readable storage medium Granted publication date: 20201023 License type: Exclusive License Record date: 20220927 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A service route discovery method and device, computer readable storage medium Effective date of registration: 20220930 Granted publication date: 20201023 Pledgee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Pledgor: RAISECOM TECHNOLOGY Co.,Ltd. Registration number: Y2022110000254 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Granted publication date: 20201023 Pledgee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Pledgor: RAISECOM TECHNOLOGY Co.,Ltd. Registration number: Y2022110000254 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: CHINA TECHNOLOGY EXCHANGE Co.,Ltd. Assignor: RAISECOM TECHNOLOGY Co.,Ltd. Contract record no.: X2022110000038 Date of cancellation: 20240320 |
|
| EC01 | Cancellation of recordation of patent licensing contract |