CN108337174B - Method and device for searching end-to-end service route of transmission network and storage medium - Google Patents

Method and device for searching end-to-end service route of transmission network and storage medium Download PDF

Info

Publication number
CN108337174B
CN108337174B CN201711450609.9A CN201711450609A CN108337174B CN 108337174 B CN108337174 B CN 108337174B CN 201711450609 A CN201711450609 A CN 201711450609A CN 108337174 B CN108337174 B CN 108337174B
Authority
CN
China
Prior art keywords
route
starting point
searched
search
connection
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201711450609.9A
Other languages
Chinese (zh)
Other versions
CN108337174A (en
Inventor
尉海立
孙雅斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Raisecom Technology Co Ltd
Original Assignee
Raisecom Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Raisecom Technology Co Ltd filed Critical Raisecom Technology Co Ltd
Priority to CN201711450609.9A priority Critical patent/CN108337174B/en
Publication of CN108337174A publication Critical patent/CN108337174A/en
Application granted granted Critical
Publication of CN108337174B publication Critical patent/CN108337174B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/22Alternate routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)

Abstract

The application discloses a method and a device for searching an end-to-end service route of a transmission network and a storage medium, wherein the method comprises the following steps: searching a one-way route; and marking the searched unidirectional route as a forward route, reversely traversing all route elements of the forward route to detect whether reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist, and marking the searched route as a bidirectional route if the reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist. The method for searching the service route is simplified and universal by searching the bidirectional service route and the protected service route on the basis of the unidirectional route, so that the service route is quickly and accurately searched.

Description

Method and device for searching end-to-end service route of transmission network and storage medium
Technical Field
The invention relates to the technical field of communication networks, in particular to a method and a device for searching an end-to-end service route of a transmission network and a storage medium.
Background
In order to reduce the maintenance cost (OPEX) of the transport Network, services carried by the transport Network are managed in an end-to-end manner no matter in a Network management technology or a Software Defined Network (SDN) technology, that is, when a service route is discovered, a user does not need to check the configuration of Network nodes through which the services pass one by one, but shows Network resources (time slots, intersections, optical fibers, ports and the like) which can be applied by the services to the user, and the user checks whether the services to be created occupy planned idle Network resources or not, so as to determine whether further adjustment is needed. Then, the end-to-end function completes the corresponding configuration of each network node in batch. The end-to-end function here specifically means: management functions for all kinds of services (such as Synchronous Digital Hierarchy (SDH) and Optical Transport Network (OTN)) carried by an Optical Transport Network.
The end-to-end functionality is based on the current configuration of the network, which includes: time slot assignment, cross configuration, fiber optic connections, port occupancy, etc. The end-to-end service is created in two steps: firstly, searching a service route; and secondly, performing end-to-end service creation on the service route meeting the user requirement. In the existing transmission network, the management method for end-to-end network resources mostly follows two standards: the specific implementation of the Telecommunications Management Forum (TMF) and SDN varies from one implementation to another, and service routing search is essential. Under the conditions of large network scale and complex configuration, the conventional service route searching method is too complex and consumes much time.
Disclosure of Invention
In order to solve the above technical problems, the present invention provides a method and an apparatus for searching an end-to-end service route of a transmission network, and a storage medium, which can search out a service route simply and efficiently.
In order to achieve the purpose of the invention, the technical scheme of the embodiment of the invention is realized as follows:
the embodiment of the invention provides a method for searching an end-to-end service route of a transmission network, which comprises the following steps:
searching a one-way route;
and marking the searched unidirectional route as a forward route, reversely traversing all route elements of the forward route to detect whether reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist, and marking the searched route as a bidirectional route if the reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist.
Further, the searching for the unidirectional route specifically includes:
setting a first end of a route to be searched as a search starting point;
searching available route elements between the search starting point and the second end of the route to be searched, updating the search starting point according to the route elements when the available route elements are searched, and repeating the search process until the search starting point can reach the second end of the route to be searched.
Further, a first end of the route to be searched is a source end, and a second end of the route to be searched is a sink end; alternatively, the first and second electrodes may be,
the first end of the route to be searched is a sink end, and the second end of the route to be searched is a source end.
Further, the searching for an available route element between the search starting point and the second end of the route to be searched, when the available route element is searched, updating the search starting point according to the route element, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically including:
a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; if the second end of the route to be searched is not reached, executing a second detection process:
and a second detection process: detecting whether the search starting point is a starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the search starting point, and turning to the first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process;
and a third detection process: detecting whether the search starting point is a starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process;
and a fourth detection process: detecting whether parent layer subnet connection capable of bearing the current routing service exists, if so, updating a child connection terminal point of a terminal point of the parent layer subnet connection as the search starting point, and turning to a first detection process to be executed repeatedly; if not, the route is discarded.
Further, the detecting of the fourth detecting process whether there is a parent layer subnet connection capable of carrying the current routing service includes:
detecting whether a parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, whether the end point of the parent layer subnet connection comprises a child connection terminal point, and whether the type of the included child connection terminal point is the same as the service type of the search starting point;
the existence of the parent layer subnet connection capable of bearing the current routing service is as follows: the parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, the end point of the parent layer subnet connection comprises child connection terminal points, and the types of the included child connection terminal points are the same as the service types of the search starting point.
Further, when the service type of the parent layer subnet connection is a service capable of multiplexing and demultiplexing, the detecting whether there is a parent layer subnet connection capable of carrying the current routing service further includes:
and detecting whether the starting point and the end point of the parent layer subnet connection comprise idle time slots, whether the number of the idle time slots included by the starting point and the end point meets the requirement of the service rate, and whether the time slot numbers of the idle time slots included by the starting point and the end point are the same.
Further, the backward traversing all the routing elements of the forward routing to detect whether there is a backward routing element corresponding to all the routing elements of the forward routing one to one, specifically including:
the first reverse detection process: traversing the route elements of the forward route reversely, if the route elements of the forward route are connection terminal points, adding the connection terminal points into a reverse route element list, setting the connection terminal points as the current search starting points, and repeating the first reverse detection process until all the route elements of the forward route are traversed reversely;
the second reverse detection process: if the route elements of the current forward route are connected, detecting whether a connection starting point is the same as the end point of the route elements of the current forward route and the end point of the connection is the same as the starting point of the route elements of the current forward route, if the connection exists, adding the connection into a reverse route element list, setting the end point of the connection as the current search starting point, and turning to a first reverse detection process until all the route elements of the forward route are traversed in a reverse direction; if the connection does not exist, the reverse route does not exist, and the search is finished;
the third reverse detection process: if the route element of the forward route is a link, detecting whether the starting point of the link is the same as the current searching starting point, if so, adding the link into a reverse route element list, setting the end point of the link as the current searching starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed in the reverse direction; if the link does not exist, the reverse route does not exist, and the search is finished;
a fourth reverse detection process: if the route element of the forward route is subnet connection, detecting whether a subnet connection can carry the current route service and the end point of the subnet connection can send the reverse route service to the source end of the forward route, if so, adding the subnet connection into a reverse route element list, setting the end point of the subnet connection as the current search starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed reversely; if the subnet connection does not exist, the reverse route does not exist, and the search is finished.
The embodiment of the invention also provides a method for searching the end-to-end service route of the transmission network, which comprises the following steps:
searching a one-way route;
and taking out any two searched unidirectional routes, sequentially traversing all the route elements to detect whether a pair of connections of a same source and a different sink exist, and marking the two routes as mutually protective routes if the pair of connections of the same source and the different sink exist.
The embodiment of the invention also provides a searching method of the end-to-end service route of the transmission network, wherein the service route is a multiplexing-demultiplexing service route, and the searching method comprises the following steps:
setting a first end of a route to be searched as a search starting point;
detecting whether a parent layer subnet connection exists between the search starting point and the second end of the route to be searched, wherein the parent layer subnet connection satisfies the following conditions: the starting point and the end point of the parent layer subnet connection comprise idle time slots, the number of the idle time slots included by the starting point and the end point meets the requirement of service rate, and the time slot numbers of the idle time slots included by the starting point and the end point are the same;
and if the parent-layer subnet connection meeting the condition exists, marking the parent-layer subnet connection as an available routing element, updating the search starting point, and repeating the detection process until the search starting point can reach the second end of the route to be searched.
An embodiment of the present invention further provides a storage medium, where one or more programs are stored on the storage medium, and the one or more programs are executable by one or more processors to implement the steps of the method for searching an end-to-end traffic route of a transport network according to any one of the above.
The embodiment of the invention also provides a searching device of the end-to-end service route of the transmission network, which comprises a forward searching module and a reverse searching module, wherein:
the forward searching module is used for searching the unidirectional route and outputting the searched unidirectional route to the reverse searching module;
and the reverse searching module is used for marking the searched unidirectional route as a forward route, reversely traversing all route elements of the forward route to detect whether reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist, and marking the searched route as a bidirectional route if the reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist.
The embodiment of the invention also provides a searching device of the end-to-end service route of the transmission network, which comprises a forward searching module and a protection route searching module, wherein:
the forward searching module is used for searching the unidirectional route and outputting the searched unidirectional route to the protection route searching module;
and the protection route searching module is used for taking out any two searched one-way routes and sequentially traversing all the route elements so as to detect whether a pair of connections of a same source and different destinations exist, and if the pair of connections of the same source and different destinations exist, marking the two routes as protection routes.
The embodiment of the invention also provides a searching device of the end-to-end service route of the transmission network, wherein the service route is a multiplexing-demultiplexing service route, the searching device comprises a setting module and a multiplexing-demultiplexing searching module, and the searching device comprises a first searching module and a second searching module, wherein:
the device comprises a setting module, a searching module and a searching module, wherein the setting module is used for setting a first end of a route to be searched as a searching starting point;
the multiplexing and demultiplexing searching module is used for detecting whether a parent layer subnet connection exists between a searching starting point and a second end of the route to be searched and meets the following conditions: the starting point and the end point of the parent layer subnet connection comprise idle time slots, the number of the idle time slots included by the starting point and the end point meets the requirement of service rate, and the time slot numbers of the idle time slots included by the starting point and the end point are the same; and if the parent-layer subnet connection meeting the condition exists, marking the parent-layer subnet connection as an available routing element, updating the search starting point, and repeating the detection process until the search starting point can reach the second end of the route to be searched.
The technical scheme of the invention has the following beneficial effects:
the invention provides a simplified and universal service route searching method and device and a storage medium for searching the service route from end to end of a transmission network by searching a bidirectional service route and searching a protection service route on the basis of a unidirectional route, thereby quickly and accurately searching the service route.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
fig. 1 is a schematic flow chart of a transmission network end-to-end service route searching method according to a first embodiment of the present invention;
fig. 2 is a flowchart illustrating a method for searching an end-to-end service route of a transmission network according to a second embodiment of the present invention;
fig. 3 is a flowchart illustrating a method for searching an end-to-end service route of a transmission network according to a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of an end-to-end service route searching apparatus of a transmission network according to a first embodiment of the present invention;
fig. 5 is a schematic structural diagram of an end-to-end service route searching apparatus of a transmission network according to a second embodiment of the present invention;
fig. 6 is a schematic structural diagram of an end-to-end service route searching apparatus of a transmission network according to a third embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be noted that the embodiments and features of the embodiments in the present application may be arbitrarily combined with each other without conflict.
As shown in fig. 1, an end-to-end service route searching method of a transmission network according to the present invention includes the following steps:
step 101: searching a one-way route;
step 102: and marking the searched unidirectional route as a forward route, reversely traversing all route elements of the forward route to detect whether reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist, and marking the searched route as a bidirectional route if the reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist.
Further, the searching for the unidirectional route in step 101 specifically includes:
setting a first end of a route to be searched as a search starting point;
searching available route elements between the search starting point and the second end of the route to be searched, updating the search starting point according to the route elements when the available route elements are searched, and repeating the search process until the search starting point can reach the second end of the route to be searched.
Further, a first end of the route to be searched is a source end, and a second end of the route to be searched is a sink end; alternatively, the first and second electrodes may be,
the first end of the route to be searched is a sink end, and the second end of the route to be searched is a source end.
Further, searching for an available route element between the search starting point and the second end of the route to be searched, updating the search starting point according to the route element when the available route element is searched, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically including:
a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; and if the second end of the route to be searched is not reached, executing a second detection process:
and a second detection process: detecting whether the search starting point is the starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the current source connection end terminal point, and turning to a first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process;
and a third detection process: detecting whether the search starting point is the starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process;
and a fourth detection process: detecting whether parent layer subnet connection capable of bearing current routing service exists, if so, updating a child connection terminal point of an end point of the parent layer subnet connection as a search starting point, and switching to a first detection process to be executed repeatedly; if not, the route is discarded.
Further, the detecting of the fourth detecting process whether there is a parent layer subnet connection capable of carrying the current routing service includes:
detecting whether a parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, whether the end point of the parent layer subnet connection comprises a child connection terminal point, and whether the type of the included child connection terminal point is the same as the service type of the search starting point;
the existence of the parent layer subnet connection capable of bearing the current routing service is as follows: the parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, the end point of the parent layer subnet connection comprises child connection terminal points, and the types of the included child connection terminal points are the same as the service types of the search starting point.
Further, when the service type of the parent layer subnet connection is a service capable of multiplexing and demultiplexing, the detecting whether there is a parent layer subnet connection capable of carrying the current routing service further includes:
and detecting whether the starting point and the end point of the parent layer subnet connection comprise idle time slots, whether the number of the idle time slots included by the starting point and the end point meets the requirement of the service rate, and whether the time slot numbers of the idle time slots included by the starting point and the end point are the same.
Illustratively, the service type capable of multiplexing and demultiplexing includes a high-order channel Data Unit (ODU) or an Optical Multiplex Section (OMS) type.
Further, traversing all the routing elements of the forward route in a reverse direction to detect whether there is a reverse routing element corresponding to all the routing elements of the forward route one to one, specifically including:
the first reverse detection process: reversely traversing the route elements of the forward route, if the route elements of the current forward route are connection terminal points, adding the connection terminal points into a reverse route element list, setting the connection terminal points as current search starting points, and repeating the first reverse detection process until all the route elements of the forward route are reversely traversed;
the second reverse detection process: if the route elements of the current forward route are connected, detecting whether a connection starting point is the same as the end point of the route elements of the current forward route and the end point of the connection is the same as the start point of the route elements of the current forward route, if the connection exists, adding the connection into a reverse route element list, setting the end point of the connection as the current search starting point, and turning to a first reverse detection process until all the route elements of the forward route are traversed reversely; if the connection does not exist, the reverse route does not exist, and the search is finished;
the third reverse detection process: if the route element of the current forward route is a link, detecting whether the starting point of the link is the same as the current search starting point, if so, adding the link into a reverse route element list, setting the end point of the link as the current search starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed in the reverse direction; if the link does not exist, the reverse route does not exist, and the search is finished;
a fourth reverse detection process: if the route element of the current forward route is subnet connection, detecting whether a subnet connection can carry the current route service and the end point of the subnet connection can send the reverse route service to the source end of the forward route, if so, adding the subnet connection into a reverse route element list, setting the end point of the subnet connection as the current search starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed reversely; if the subnet connection does not exist, the reverse route does not exist, and the search is finished.
As shown in fig. 2, the present invention also provides a method for searching an end-to-end service route of a transmission network, which comprises the following steps:
step 201: searching a one-way route;
step 202: and taking out any two searched unidirectional routes, sequentially traversing all the route elements to detect whether a pair of connections of a same source and a different sink exist, and marking the two routes as mutually protective routes if the pair of connections of the same source and the different sink exist.
As shown in fig. 3, the present invention further provides a method for searching an end-to-end service route of a transmission network, where the service route is a multiplexing-demultiplexing service route, and the method includes the following steps:
step 301: setting a first end of a route to be searched as a search starting point;
step 302: detecting whether a parent layer subnet connection exists between the search starting point and the second end of the route to be searched, wherein the parent layer subnet connection satisfies the following conditions: the starting point and the end point of the parent layer subnet connection comprise idle time slots, the number of the idle time slots included by the starting point and the end point meets the requirement of service rate, and the time slot numbers of the idle time slots included by the starting point and the end point are the same;
step 303: and if the parent-layer subnet connection meeting the condition exists, marking the parent-layer subnet connection as an available routing element, updating the search starting point, and repeating the detection process until the search starting point can reach the second end of the route to be searched.
An embodiment of the present invention further provides a storage medium, where one or more programs are stored on the storage medium, and the one or more programs are executable by one or more processors to implement the steps of the method for searching an end-to-end traffic route of a transport network according to any one of the above.
As shown in fig. 4, an embodiment of the present invention further provides a searching apparatus for end-to-end traffic routing of a transmission network, including a forward searching module 401 and a reverse searching module 402, where:
the forward searching module 401 is configured to search a unidirectional route, and output the searched unidirectional route to the reverse searching module 402;
a reverse searching module 402, configured to mark the searched unidirectional route as a forward route, and traverse all route elements of the forward route in a reverse direction to detect whether there is a reverse route element corresponding to all route elements of the forward route one to one, and mark the searched route as a bidirectional route if there is a reverse route element corresponding to all route elements of the forward route one to one.
Further, the searching for the unidirectional route by the forward search module 401 specifically includes:
setting a first end of a route to be searched as a search starting point;
searching available route elements between the search starting point and the second end of the route to be searched, updating the search starting point according to the route elements when the available route elements are searched, and repeating the search process until the search starting point can reach the second end of the route to be searched.
Further, a first end of the route to be searched is a source end, and a second end of the route to be searched is a sink end; alternatively, the first and second electrodes may be,
the first end of the route to be searched is a sink end, and the second end of the route to be searched is a source end.
Further, the searching module 401 searches for an available route element between the search starting point and the second end of the route to be searched, and when the available route element is searched, updates the search starting point according to the route element, and repeats the searching process until the search starting point can reach the second end of the route to be searched, which specifically includes:
a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; and if the second end of the route to be searched is not reached, executing a second detection process:
and a second detection process: detecting whether the search starting point is the starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the current source connection end terminal point, and turning to a first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process;
and a third detection process: detecting whether the search starting point is the starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process;
and a fourth detection process: detecting whether parent layer subnet connection capable of bearing current routing service exists, if so, updating a child connection terminal point of an end point of the parent layer subnet connection as a search starting point, and switching to a first detection process to be executed repeatedly; if not, the route is discarded.
Further, the detecting of the fourth detecting process whether there is a parent layer subnet connection capable of carrying the current routing service includes:
detecting whether a parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, whether the end point of the parent layer subnet connection comprises a child connection terminal point, and whether the type of the included child connection terminal point is the same as the service type of the search starting point;
the existence of the parent layer subnet connection capable of bearing the current routing service is as follows: the parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, the end point of the parent layer subnet connection comprises child connection terminal points, and the types of the included child connection terminal points are the same as the service types of the search starting point.
Further, when the service type of the parent layer subnet connection is a service capable of multiplexing and demultiplexing, the detecting whether there is a parent layer subnet connection capable of carrying the current routing service further includes:
and detecting whether the starting point and the end point of the parent layer subnet connection comprise idle time slots, whether the number of the idle time slots included by the starting point and the end point meets the requirement of the service rate, and whether the time slot numbers of the idle time slots included by the starting point and the end point are the same.
Illustratively, the service type capable of multiplexing and demultiplexing includes an ODU type or an OMS type.
Further, the backward traversing module 402 of the backward searching module 402 traverses all routing elements of the forward route to detect whether there is a backward routing element corresponding to all routing elements of the forward route one to one, specifically including:
the first reverse detection process: reversely traversing the route elements of the forward route, if the route elements of the current forward route are connection terminal points, adding the connection terminal points into a reverse route element list, setting the connection terminal points as current search starting points, and repeating the first reverse detection process until all the route elements of the forward route are reversely traversed;
the second reverse detection process: if the route elements of the current forward route are connected, detecting whether a connection starting point is the same as the end point of the route elements of the current forward route and the end point of the connection is the same as the start point of the route elements of the current forward route, if the connection exists, adding the connection into a reverse route element list, setting the end point of the connection as the current search starting point, and turning to a first reverse detection process until all the route elements of the forward route are traversed reversely; if the connection does not exist, the reverse route does not exist, and the search is finished;
the third reverse detection process: if the route element of the current forward route is a link, detecting whether the starting point of the link is the same as the current search starting point, if so, adding the link into a reverse route element list, setting the end point of the link as the current search starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed in the reverse direction; if the link does not exist, the reverse route does not exist, and the search is finished;
a fourth reverse detection process: if the route element of the current forward route is subnet connection, detecting whether a subnet connection can carry the current route service and the end point of the subnet connection can send the reverse route service to the source end of the forward route, if so, adding the subnet connection into a reverse route element list, setting the end point of the subnet connection as the current search starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed reversely; if the subnet connection does not exist, the reverse route does not exist, and the search is finished.
As shown in fig. 5, an embodiment of the present invention further provides a device for searching an end-to-end traffic route of a transmission network, including a forward search module 501 and a protection route search module 502, where:
a forward search module 501, configured to search a unidirectional route, and output the searched unidirectional route to a protection route search module;
the protection route searching module 502 is configured to take out any two searched unidirectional routes, sequentially traverse all the route elements, detect whether there is a connection between a pair of homologous different destinations, and mark the two routes as protection routes if there is a connection between a pair of homologous different destinations.
It should be noted that the method for searching the unidirectional route of the forward search module 501 is the same as the method for searching the unidirectional route of the forward search module 401, and is not described herein again.
As shown in fig. 6, an embodiment of the present invention further provides a searching apparatus for end-to-end service routing of a transmission network, where the service routing is a multiplexing-demultiplexing service routing, and the searching apparatus includes a setting module 601 and a multiplexing-demultiplexing searching module 602, where:
a setting module 601, configured to set a first end of a route to be searched as a search starting point;
a multiplexing/demultiplexing search module 602, configured to detect whether there is a parent subnet connection between a search starting point and a second end of the route to be searched, where the parent subnet connection satisfies the following condition: the starting point and the end point of the parent layer subnet connection comprise idle time slots, the number of the idle time slots included by the starting point and the end point meets the requirement of service rate, and the time slot numbers of the idle time slots included by the starting point and the end point are the same; and if the parent-layer subnet connection meeting the condition exists, marking the parent-layer subnet connection as an available routing element, updating the search starting point, and repeating the detection process until the search starting point can reach the second end of the route to be searched.
The present invention is further explained by providing several preferred embodiments, but it should be noted that the preferred embodiments are only for better describing the present invention and should not be construed as unduly limiting the present invention. The following embodiments may exist independently, and technical features in different embodiments may be combined and used in one embodiment.
The following embodiments provide a simplified and general end-to-end service route search method, which adopts a unidirectional route method, supports multiplexing-demultiplexing service route search, supports bidirectional service route search, supports protected service route search, and has high search efficiency.
The method supports the searching of the multiplexing-demultiplexing service route, and means that when the multiplexing-demultiplexing service route is determined, an algorithm can confirm that a source and destination end of a parent layer SNC has a time slot meeting conditions so as to ensure that the finally searched route is a service path.
The slot conditions are: a. the source and the sink have idle time slots b and the number of the idle time slots, which meet the condition that the current routing service rate c and the number of the idle time slots of the source and the sink are the same
The method for confirming the multiplexing-demultiplexing service route in the algorithm comprises the following steps: the currently routed traffic signal and the parent SNC routed traffic signal are multiplexed at a low rate to a high rate, for example, the ODU0 and the ODU2, for example, an Optical Channel (OCH) and an Optical Multiplex Section (OMS).
Specifically, the specific embodiment mainly includes three search steps of unidirectional route search, reverse route search, and protected route search. The unidirectional route searching step is mainly responsible for searching out the unidirectional route capable of bearing the specified service; the reverse route searching step is mainly responsible for searching out a corresponding reverse route on the basis of the unidirectional route; the protective route searching step is mainly responsible for matching mutually protective routes from the unidirectional routes.
The implementation process of the embodiment is as follows:
step A, a user selects a source point (namely, a source end) and a sink point (namely, a sink end) of a service to be created or discovered;
b, the user starts searching through the route searching functional module, the route searching functional module sets the source point as the current searching starting point (namely the searching starting point), and sends a searching command to the route searching algorithm module;
step C, the route searching algorithm module checks whether the current searching starting point is the same as the destination point, if so, the route is searched; if not, executing the step four;
and step D, the route searching algorithm module searches the available route element list between the source point and the destination point selected by the user by using the current searching starting point, and continuously updates the current searching starting point in the searching process.
The specific implementation method comprises the following steps:
in order to achieve independence from specific technologies, information models in g.805, Telecommunications Management Forum (TMF) Multi-Technology Network Management (MTMN) and Open Network Foundation (ONF) TR-512TR-527 are comprehensively referred to, and routing elements on end-to-end service and end-to-end service routes have their own information models.
Since this patent only deals with the problem of route searching of traffic, only the routing of end-to-end traffic and the information model of the routing elements will be described in more detail here.
The abstract objects used by the end-to-end routing related function of the invention are:
connection Termination Point (CTP): is an abstract representation of the reference point to which the information transfer entity is connected. Different from "Connection Point" in g.805, CTP of the end-to-end service system has an attribute of a Connection reference Point, and also provides support for functions of mapping client layer service to service layer, multiplexing and demultiplexing, time slot allocation, and the like; in order to support multi-hierarchy of transport services, CTPs have characteristics of parent-child relationship, for example, an ODU2 carries 8 ODU0 by multiplexing and demultiplexing, and then the 8 ODU0 CTPs are child CTPs corresponding to ODU2 CTPs;
the information model of CTP is:
Figure BDA0001528415470000151
key attributes of the CTP model:
parentId, service client layer service to service layer mapping;
validSlots, serving slot assignments;
mapPara, serving the multiplexing and demultiplexing.
Connection (Connection): a configurable, dynamic abstract representation of the transport entity is a concrete implementation of G.805 "Unidirective Connection". The starting point of the Connection is called a source point CTP, and the ending point is called a sink point CTP; the creation, deletion, and modification of a Connection may cause a change of specific configuration information of the device, for example, for an OTN service, an increase of a Connection of the ODU0 may cause an increase of an ODU0 intersection; on the contrary, if an ODU0 cross is added through the network management system, a corresponding Connection may be newly generated;
the information model of Connection is:
Figure BDA0001528415470000161
link (Link): a fixed transparent transport entity representation, not configurable, is a specific implementation of G.805 "Link". Link has the same active point CTP and sink point CTP as Connection; different from Connection, Link is fixed, and creation, deletion and modification of Link do not cause change of specific configuration information of equipment; the information transmitted through the Link can not be changed, and comprises information such as service types, occupied time slots, expenses and the like; for example: connecting an optical fiber between two equipment ports, a Link is generated between the two ports
The Link information model is:
Figure BDA0001528415470000162
Figure BDA0001528415470000171
subnet connection (SNC): the abstract representation of a segment of transport entity in the subnet range managed by the end-to-end system is a concrete implementation of g.805 "subnet Connection". Unlike g.805, the SNC here merges into the concept of g.805 "path" (Trail), and one SNC and one service are equivalent in implementation; the SNC is a transmission entity connected by CTP, Connection, Link and a parent layer SNC; a path formed by sequentially connecting CTP, Connection, Link and father layer SNC from the source point to the destination point of SNC is called the routing (Route) of SNC; one SNC may have multiple routes, for example, for 1+1 linear protection service, there are two routes, one working and one protection; CTP, Connection, Link, and parent layer SNC forming one Route are collectively referred to as a Route Element (Route Element).
The information model of SNC is:
SNC{
string id; // SNC unique identification
String name; // service name
String serviceType; // type of service
Route routeList; // routing
String direction; // one-way, two-way
}
Node (Node): is the basic unit of control over logical resources. In an end-to-end system, a logical resource on a network element may be divided into one or more nodes according to a networking situation, and a connection relationship of CTP resources of each Node follows a fixed pattern, for example: a wavelength division multiplexing transmitting terminal (WDM _ T) network element comprises an Optical Multiplexing Section (OMS) resource on a wavelength multiplexing unit (DMU), an Optical Transport Section (OTS) resource on an Optical power amplifier (OBA), an OMS, an Optical Supervisory Channel (OSC) resource and an OSC resource on a Network Transmission Unit (NTU), wherein the actual corresponding networking is that the wavelength multiplexing unit is connected with the Optical power amplifier (DMU-OBA) and the network transmission unit is connected with the Optical power amplifier (NTU-OBA).
Route (Route): the information transmission entity is the connection relation of the internal logic resources of the information transmission entity, and the information transmission entity realizes the information transmission processing function through the connection relation.
Preconditions for route search:
establishing a database in advance; the database stores topology information of the entire transport network. This information is described using the information model described above. A route search is conducted based on the database.
Before starting the route search, a user is required to specify information related to a service, a service type, a service direction, a protection type, and the like, and also a source CTP and a sink CTP, as shown in table 1 (where ODUk is an optical channel data unit (k is 0,1,2 … …) at each level, and DSR is a data Signal Rate (Digital Signal Rate)):
Figure BDA0001528415470000181
TABLE 1
Preferred embodiment 1
It should be noted that, if the service is a unidirectional and unprotected service, step one to step four are executed; if the service is a bidirectional and unprotected service, executing the first step to the fifth step; if the service is a unidirectional service with protection, executing the steps from one to four and the step six; and if the service is a bidirectional service with protection, executing the step one to the step six.
The main process of route search is as follows:
step one, starting routing search by taking a source terminal CTP appointed by a user as a current CTP.
And step two, when the current CTP is the same as the host CTP, the route searching is finished.
When the current CTP is different from the sink CTP, all Connection meeting the conditions are searched out. With the following conditions: the source end CTP of the Connection is the same as the current CTP.
When the Connection is found, copying a plurality of routes according to the number of the Connection to be used as a temporary route group, and correspondingly adding the found different connections into the route element lists of different routes; traversing each route in the temporary route group: setting a destination terminal CTP of Connection in a route element list of the route as a current CTP, and respectively executing a step two on each route in a route group;
when the Connection is not found, the current CTP is unchanged, and the step three is executed;
and step three, searching out all links meeting the conditions. With the following conditions: the source CTP of Link is the same as the current CTP.
When the Link is found, adding the Link into a routing element list of the route, setting a host end CTP of the Link as a current CTP, and returning to the step two;
when the Link is not found, the current CTP is not changed, and the step four is executed;
and step four, searching the SNC of the father layer which meets the conditions. With the following conditions: ensuring that the found father layer SNC can bear the service of the current CTP, namely the source end CTP of the father layer SNC can be used as the father CTP of the current CTP, the host end CTP of the father layer SNC has a child CTP, and the child CTP has the same service type as the current CTP; especially when the service type of the parent layer SNC is 'higher order ODU' or 'OMS', the SNC needs to satisfy the condition: the method supports multiplex-demultiplex service route search, namely, SNC source/sink CTP has idle time slots, the number of the idle time slots meets the requirement of service rate, and the time slot numbers of the source/sink idle time slots are the same.
If the SNC of the parent layer is searched, adding the SNC into a routing element list of the route, setting a child CTP of a host CTP of the SNC of the parent layer as a current CTP, and returning to the step two; when the SNC is not searched, the route is discarded.
And step five, for the bidirectional service, reversely traversing all the routing elements of the forward routing, sequentially searching the corresponding reverse routing elements, and if one reverse routing element is not searched, determining that no reverse routing exists.
And step six, searching routes which are mutually protected in all the searched forward routes for the service with protection.
The process of the fifth step specifically comprises the following steps:
step 501, traversing all routing elements of the forward route in a reverse direction;
step 502, if the current forward routing element is a CTP, adding the CTP into a reverse routing element list, setting the CTP as the current CTP, and executing step 501;
step 503, if the current forward routing element is a Connection, searching for a Connection meeting the condition. With the following conditions: the source end CTP of the Connection is the same as the sink end CTP of the current forward routing element, and the sink end CTP of the Connection is the same as the source end CTP of the current forward routing element. If a Connection is searched, adding the found Connection into a reverse routing element list, setting a sink end CTP of the found Connection as a current CTP, and executing step 501; if the Connection is not searched, ending the search;
and step 504, if the current forward routing element is a Link, searching for the Link meeting the condition. With the following conditions: the source CTP of Link is the same as the current CTP. If the Link is searched, adding the Link into the reverse routing element list, setting a sink end CTP of the Link as a current CTP, and executing step 501; if no Link is searched, ending the search;
and 505, if the current forward routing element is the SNC, searching for the SNC meeting the condition. With the following conditions: the source CTP of SNC can be used as the parent CTP of the current CTP; the SNC destination CTP is provided with a child CTP, the child CTP has the same service type with the previous routing element of the current forward routing element, and the child CTP is a source CTP of a certain routing element, and the destination CTP of the certain routing element is the same as the source CTP of the previous routing element of the current forward routing element; particularly when the service type of the current forward routing element SNC is 'higher order ODU' or 'OMS', the SNC needs to satisfy the condition: the SNC source/sink CTP has idle time slots, the number of the idle time slots meets the requirement of service rate, and the time slot numbers of the source/sink idle time slots are the same. If SNC is searched, adding SNC into a reverse routing element list, setting the source CTP of the 'certain routing element' as the current CTP, and executing step 501; and if the SNC is not searched, ending the search.
The process of the sixth step specifically includes:
a eligible Connection is searched for from the two routes. The condition is that the Connection routing element of the first route is the same as the Connection routing element of the second route in source CTP and sink CTP. If the two routes are searched, the two routes are mutually protection routes.
The invention provides a method for searching end-to-end service route, which is not limited by service information model, although the service information models adopted by different manufacturers may have differences, as long as the method is based on one-way route search, supports multiplexing-demultiplexing service route search, supports two-way service route search and supports service route search with protection, and the methods are all in the protection range. All data can be searched by applying the method of the present invention as long as it embodies four model concepts (Connection termination point (CTP) \ Connection (Connection) \ subnet Connection (SNC)).
Preferred embodiment 2
The source and destination of the route, as determined by the traffic (what type of traffic, from which to which traffic … …).
And the unidirectional route search starts from the route source end, and searches one route element by one route element until the route sink end is found.
Any one routing element can be only one of the four model concepts (CTP, Connection, Link, SNC) described above.
The process of unidirectional route search specifically includes:
step one, setting 'search starting point of current routing element'
Step two, judging whether the 'search starting point of the current routing element' can reach a routing sink end, if so, finishing the search, and searching a route; if the current routing element cannot be reached, searching whether a Connection exists, wherein the Connection takes the 'searching starting point of the current routing element' as a source end;
if n (n is 1,2, … …) such Connection is found, copying and storing n Connection respectively, and updating ' the search starting point of the current routing element ' by taking the destination end of the Connection one by one ', executing step two;
if no such Connection is found, performing step three;
step three, searching whether a Link exists, wherein the Link takes a 'searching starting point of the current routing element' as a source end;
if the Link exists, updating the 'search starting point of the current routing element' by using the sink end of the Link, and executing the step two again;
if no such Link exists, performing step four;
step four, searching whether an SNC exists or not, wherein the SNC can bear the current routing service;
if the SNC exists, updating the 'search starting point of the current routing element' by using the sub CTP of the SNC destination end, and executing the step two again;
if no such SNC exists, the route is discarded.
It should be noted that, whether the SNC can carry the current routing service is determined, that is, whether the source and destination end of the SNC can access the current routing service,
the source end and the destination end of the SNC can access the current routing service, that is, the source end of the SNC and the 'search starting point of the current routing element' can establish a parent-child relationship, and the destination end of the SNC can establish a parent-child relationship with such a CTP, which conforms to the type of the current routing service. This process contains processing logic for multiplexing-demultiplexing.
Before the search of the bidirectional service route and the protected service route is started, the search of the unidirectional route needs to be completed.
The process of bidirectional traffic route searching comprises:
and traversing all the routing elements of the forward route in a reverse direction, searching the routing elements corresponding to the forward routing elements one by one, and if all the routing elements corresponding to one by one are found, finding the reverse route, wherein the forward route and the reverse route are the bidirectional service route.
When looking for a reverse SNC routing element, the SNC is required to satisfy two conditions:
a) the current routing service can be borne, namely, the source and destination terminals can access the current routing service;
b) the SNC sink can send the reverse routing traffic to the source of the forward routing, i.e. the sink of the next routing element of the reverse SNC routing element, which is the same as the source of the previous routing element of the forward SNC routing element.
The process of protecting the service route search comprises the following steps:
two routes are taken out from all the forward routes, all the route elements are traversed in sequence, and the two corresponding routes are considered to be protection routes as long as a pair of connections are homologous and different destinations.
The invention provides a new route searching algorithm, based on which distributed route searching can be carried out, and route searching efficiency can be improved; the Connection and the Link are unidirectional, CTP is not concerned about direction, and the direction is defined by the resources such as the Connection and the Link, so that the generation of logic resources is simplified; the invention provides a route search algorithm, which is based on one-way route search, and can search out a reverse route based on the one-way route so as to obtain a two-way service; a new method for generating a strip protection route based on existing unidirectional routes is provided.
It will be understood by those skilled in the art that all or part of the steps of the above methods may be implemented by instructing the relevant hardware through a program, and the program may be stored in a computer readable storage medium, such as a read-only memory, a magnetic or optical disk, and the like. Alternatively, all or part of the steps of the foregoing embodiments may also be implemented by using one or more integrated circuits, and accordingly, each module/unit in the foregoing embodiments may be implemented in the form of hardware, and may also be implemented in the form of a software functional module. The present invention is not limited to any specific form of combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (11)

1. A method for searching an end-to-end service route of a transmission network is characterized by comprising the following steps:
searching a one-way route;
marking the searched unidirectional route as a forward route, reversely traversing all route elements of the forward route to detect whether reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist, and marking the searched route as a bidirectional route if the reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist;
the searching the unidirectional route specifically includes: setting a first end of a route to be searched as a search starting point; searching available route elements between the search starting point and the second end of the route to be searched, updating the search starting point according to the route elements when the available route elements are searched, and repeating the search process until the search starting point can reach the second end of the route to be searched;
searching for an available route element between the search starting point and the second end of the route to be searched, updating the search starting point according to the route element when the available route element is searched, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically comprising:
a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; if the second end of the route to be searched is not reached, executing a second detection process;
and a second detection process: detecting whether the search starting point is a starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the search starting point, and turning to the first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process;
and a third detection process: detecting whether the search starting point is a starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process;
and a fourth detection process: detecting whether parent layer subnet connection capable of bearing the current routing service exists, if so, updating a child connection terminal point of a terminal point of the parent layer subnet connection as the search starting point, and turning to a first detection process to be executed repeatedly; if not, the route is discarded, and the subnet connection is an abstract expression of a segment of transmission entity in the range of the subnet managed by the end-to-end system.
2. The searching method according to claim 1, wherein the first end of the route to be searched is a source end, and the second end of the route to be searched is a sink end; alternatively, the first and second electrodes may be,
the first end of the route to be searched is a sink end, and the second end of the route to be searched is a source end.
3. The searching method according to claim 1, wherein the detecting of whether there is a parent layer subnet connection capable of carrying the current routing service by the fourth detecting process comprises:
detecting whether a parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, whether the end point of the parent layer subnet connection comprises a child connection terminal point, and whether the type of the included child connection terminal point is the same as the service type of the search starting point;
the existence of the parent layer subnet connection capable of bearing the current routing service is as follows: the parent layer connection terminal point of the search starting point is a starting point of parent layer subnet connection, the end point of the parent layer subnet connection comprises child connection terminal points, and the types of the included child connection terminal points are the same as the service types of the search starting point.
4. The searching method according to claim 3, wherein when the service type of the parent layer subnet connection is a service capable of multiplexing and demultiplexing, the detecting whether there is a parent layer subnet connection capable of carrying the current routing service further comprises:
and detecting whether the starting point and the end point of the parent layer subnet connection comprise idle time slots, whether the number of the idle time slots included by the starting point and the end point meets the requirement of the service rate, and whether the time slot numbers of the idle time slots included by the starting point and the end point are the same.
5. The searching method according to claim 1, wherein the backward traversing all routing elements of the forward route to detect whether there is a backward routing element corresponding to all routing elements of the forward route in a one-to-one manner, specifically comprises:
the first reverse detection process: traversing the route elements of the forward route reversely, if the route elements of the forward route are connection terminal points, adding the connection terminal points into a reverse route element list, setting the connection terminal points as current search starting points, and repeating the first reverse detection process until all the route elements of the forward route are traversed reversely;
the second reverse detection process: if the route elements of the current forward route are connected, detecting whether a connection starting point is the same as the end point of the route elements of the current forward route and the end point of the connection is the same as the starting point of the route elements of the current forward route, if the connection exists, adding the connection into a reverse route element list, setting the end point of the connection as the current search starting point, and turning to a first reverse detection process until all the route elements of the forward route are traversed in a reverse direction; if the connection does not exist, the reverse route does not exist, and the search is finished;
the third reverse detection process: if the route element of the forward route is a link, detecting whether the starting point of the link is the same as the current searching starting point, if so, adding the link into a reverse route element list, setting the end point of the link as the current searching starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed in the reverse direction; if the link does not exist, the reverse route does not exist, and the search is finished;
a fourth reverse detection process: if the route element of the forward route is subnet connection, detecting whether a subnet connection can carry the current route service and the end point of the subnet connection can send the reverse route service to the source end of the forward route, if so, adding the subnet connection into a reverse route element list, setting the end point of the subnet connection as the current search starting point, and turning to a first reverse detection process until all route elements of the forward route are traversed reversely; if the subnet connection does not exist, the reverse route does not exist, and the search is finished.
6. A method for searching an end-to-end service route of a transmission network is characterized by comprising the following steps:
searching a one-way route;
taking out any two searched one-way routes, sequentially traversing all route elements to detect whether a pair of connections of a same source and a different sink exist, and marking the two routes as mutually protective routes if the pair of connections of the same source and the different sink exist;
the searching the unidirectional route specifically includes: setting a first end of a route to be searched as a search starting point; searching available route elements between the search starting point and the second end of the route to be searched, updating the search starting point according to the route elements when the available route elements are searched, and repeating the search process until the search starting point can reach the second end of the route to be searched;
searching for an available route element between the search starting point and the second end of the route to be searched, updating the search starting point according to the route element when the available route element is searched, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically comprising:
a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; if the second end of the route to be searched is not reached, executing a second detection process;
and a second detection process: detecting whether the search starting point is a starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the search starting point, and turning to the first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process;
and a third detection process: detecting whether the search starting point is a starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process;
and a fourth detection process: detecting whether parent layer subnet connection capable of bearing the current routing service exists, if so, updating a child connection terminal point of a terminal point of the parent layer subnet connection as the search starting point, and turning to a first detection process to be executed repeatedly; if not, the route is discarded, and the subnet connection is an abstract expression of a segment of transmission entity in the range of the subnet managed by the end-to-end system.
7. A method for searching end-to-end service route of transmission network, wherein the service route is multiplexing-demultiplexing service route, the searching method comprises:
setting a first end of a route to be searched as a search starting point;
searching available route elements between a search starting point and a second end of a route to be searched, when the available route elements are searched, updating the search starting point according to the route elements, and repeating the search process until the search starting point can reach the second end of the route to be searched, wherein the searched route elements comprise a connection terminal point, a connection, a link and a parent layer subnet connection which form a route, and the subnet connection is an abstract expression of a section of transmission entity in a subnet range managed by an end-to-end system;
when the searched routing element is the parent-layer subnet connection, whether a parent-layer subnet connection meets the following conditions is detected: the starting point and the end point of the parent layer subnet connection comprise idle time slots, the number of the idle time slots included by the starting point and the end point meets the requirement of service rate, and the time slot numbers of the idle time slots included by the starting point and the end point are the same; if the parent-layer subnet connection meeting the condition exists, marking the parent-layer subnet connection as an available routing element;
searching for an available route element between the search starting point and the second end of the route to be searched, updating the search starting point according to the route element when the available route element is searched, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically comprising:
a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; if the second end of the route to be searched is not reached, executing a second detection process;
and a second detection process: detecting whether the search starting point is a starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the search starting point, and turning to the first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process;
and a third detection process: detecting whether the search starting point is a starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process;
and a fourth detection process: detecting whether parent layer subnet connection capable of bearing the current routing service exists, if so, updating a child connection terminal point of a terminal point of the parent layer subnet connection as the search starting point, and turning to a first detection process to be executed repeatedly; if not, the route is discarded.
8. A storage medium having one or more programs stored thereon, the one or more programs being executable by one or more processors for implementing the steps of the method for searching for end-to-end traffic routing of a transport network according to any of claims 1 to 6.
9. A searching device for end-to-end service routing of a transmission network is characterized by comprising a forward searching module and a reverse searching module, wherein:
the forward searching module is used for searching the unidirectional route and outputting the searched unidirectional route to the reverse searching module; the searching the unidirectional route specifically includes: setting a first end of a route to be searched as a search starting point; searching available route elements between the search starting point and the second end of the route to be searched, updating the search starting point according to the route elements when the available route elements are searched, and repeating the search process until the search starting point can reach the second end of the route to be searched; searching for an available route element between the search starting point and the second end of the route to be searched, updating the search starting point according to the route element when the available route element is searched, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically comprising: a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; if the second end of the route to be searched is not reached, executing a second detection process; and a second detection process: detecting whether the search starting point is a starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the search starting point, and turning to the first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process; and a third detection process: detecting whether the search starting point is a starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process; and a fourth detection process: detecting whether parent layer subnet connection capable of bearing the current routing service exists, if so, updating a child connection terminal point of a terminal point of the parent layer subnet connection as the search starting point, and turning to a first detection process to be executed repeatedly; if not, discarding the route, wherein the subnet connection is an abstract expression of a segment of transmission entity in the subnet range managed by the end-to-end system;
and the reverse searching module is used for marking the searched unidirectional route as a forward route, reversely traversing all route elements of the forward route to detect whether reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist, and marking the searched route as a bidirectional route if the reverse route elements which are in one-to-one correspondence with all the route elements of the forward route exist.
10. A searching device for end-to-end service routing of a transmission network is characterized by comprising a forward searching module and a protection route searching module, wherein:
the forward searching module is used for searching the unidirectional route and outputting the searched unidirectional route to the protection route searching module; the searching the unidirectional route specifically includes: setting a first end of a route to be searched as a search starting point; searching available route elements between the search starting point and the second end of the route to be searched, updating the search starting point according to the route elements when the available route elements are searched, and repeating the search process until the search starting point can reach the second end of the route to be searched; searching for an available route element between the search starting point and the second end of the route to be searched, updating the search starting point according to the route element when the available route element is searched, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically comprising: a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; if the second end of the route to be searched is not reached, executing a second detection process; and a second detection process: detecting whether the search starting point is a starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the search starting point, and turning to the first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process; and a third detection process: detecting whether the search starting point is a starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process; and a fourth detection process: detecting whether parent layer subnet connection capable of bearing the current routing service exists, if so, updating a child connection terminal point of a terminal point of the parent layer subnet connection as the search starting point, and turning to a first detection process to be executed repeatedly; if not, discarding the route, wherein the subnet connection is an abstract expression of a segment of transmission entity in the subnet range managed by the end-to-end system;
and the protection route searching module is used for taking out any two searched one-way routes and sequentially traversing all the route elements so as to detect whether a pair of connections of a same source and different destinations exist, and if the pair of connections of the same source and different destinations exist, marking the two routes as protection routes.
11. A searching device for end-to-end service routing of a transmission network is characterized in that the service routing is a multiplexing-demultiplexing service routing, and the searching device comprises a setting module and a multiplexing-demultiplexing searching module, wherein:
the device comprises a setting module, a searching module and a searching module, wherein the setting module is used for setting a first end of a route to be searched as a searching starting point;
the multiplexing and demultiplexing search module is used for searching available route elements between a search starting point and a second end of a route to be searched, when the available route elements are searched, the search starting point is updated according to the route elements, the search process is repeated until the search starting point can reach the second end of the route to be searched, the searched route elements comprise a connection terminal point, a connection, a link and a parent layer subnet connection which form a route, and the subnet connection is an abstract expression of a section of transmission entity in a subnet range managed by an end-to-end system; when the searched routing element is the parent-layer subnet connection, whether a parent-layer subnet connection meets the following conditions is detected: the starting point and the end point of the parent layer subnet connection comprise idle time slots, the number of the idle time slots included by the starting point and the end point meets the requirement of service rate, and the time slot numbers of the idle time slots included by the starting point and the end point are the same; if the parent-layer subnet connection meeting the condition exists, marking the parent-layer subnet connection as an available routing element; searching for an available route element between the search starting point and the second end of the route to be searched, updating the search starting point according to the route element when the available route element is searched, and repeating the search process until the search starting point can reach the second end of the route to be searched, specifically comprising: a first detection process: detecting whether the search starting point reaches the second end of the route to be searched, if so, ending the route search; if the second end of the route to be searched is not reached, executing a second detection process; and a second detection process: detecting whether the search starting point is a starting point of one or more connections; if the connection is the starting point of one or more connections, storing the one or more connections, updating the ending point of the one or more connections one by one to be the search starting point, and turning to the first detection process to be repeatedly executed; if the connection is not the starting point of any connection, executing a third detection process; and a third detection process: detecting whether the search starting point is a starting point of a link or not; if the link is the starting point of the link, the link is stored, the end point of the link is updated to be the search starting point, and the first detection process is switched to be executed repeatedly; if the link is not the starting point of any link, executing a fourth detection process; and a fourth detection process: detecting whether parent layer subnet connection capable of bearing the current routing service exists, if so, updating a child connection terminal point of a terminal point of the parent layer subnet connection as the search starting point, and turning to a first detection process to be executed repeatedly; if not, the route is discarded.
CN201711450609.9A 2017-12-27 2017-12-27 Method and device for searching end-to-end service route of transmission network and storage medium Active CN108337174B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711450609.9A CN108337174B (en) 2017-12-27 2017-12-27 Method and device for searching end-to-end service route of transmission network and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711450609.9A CN108337174B (en) 2017-12-27 2017-12-27 Method and device for searching end-to-end service route of transmission network and storage medium

Publications (2)

Publication Number Publication Date
CN108337174A CN108337174A (en) 2018-07-27
CN108337174B true CN108337174B (en) 2020-10-23

Family

ID=62924315

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711450609.9A Active CN108337174B (en) 2017-12-27 2017-12-27 Method and device for searching end-to-end service route of transmission network and storage medium

Country Status (1)

Country Link
CN (1) CN108337174B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113890669B (en) * 2020-07-03 2023-08-15 中国移动通信集团湖南有限公司 Method and device for acquiring service signal flow of transmission network and electronic equipment

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0998077A2 (en) * 1998-10-30 2000-05-03 Nortel Networks Corporation Trail explorer and method for exploring trails in a communication network
CN1614934A (en) * 2003-11-06 2005-05-11 华为技术有限公司 Path searching method
CN1825820A (en) * 2005-02-22 2006-08-30 华为技术有限公司 Method of path selecting in intelligent optical network
CN101136712A (en) * 2006-09-22 2008-03-05 中兴通讯股份有限公司 Method for improving path discovery efficiency in network communication transmission
CN101247200A (en) * 2007-02-15 2008-08-20 华为技术有限公司 OTU signal multiplexing/de-multiplexing system and method
CN101547382A (en) * 2009-05-06 2009-09-30 烽火通信科技股份有限公司 Separation method for active-Standby service resource of different source and sink for grid network
CN101667972A (en) * 2009-10-19 2010-03-10 国网信息通信有限公司 Power communication network service routing method and device
CN102123471A (en) * 2010-12-15 2011-07-13 北京理工大学 Stub network of Internet of things and seepage data transmission method thereof
WO2012055631A1 (en) * 2010-10-25 2012-05-03 Telefonica, S.A. Procedure to set up routes over the transmission network efficiently

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3737385B2 (en) * 2001-06-07 2006-01-18 富士通株式会社 Optimization path setting method and network management system using the same
US20030174656A1 (en) * 2002-01-18 2003-09-18 Rodrigo Fernandez APS identification allocation in communication networks
US7263290B2 (en) * 2002-06-06 2007-08-28 Lucent Technologies Inc. Network operating system with distributed data architecture

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0998077A2 (en) * 1998-10-30 2000-05-03 Nortel Networks Corporation Trail explorer and method for exploring trails in a communication network
CN1614934A (en) * 2003-11-06 2005-05-11 华为技术有限公司 Path searching method
CN1825820A (en) * 2005-02-22 2006-08-30 华为技术有限公司 Method of path selecting in intelligent optical network
CN101136712A (en) * 2006-09-22 2008-03-05 中兴通讯股份有限公司 Method for improving path discovery efficiency in network communication transmission
CN101247200A (en) * 2007-02-15 2008-08-20 华为技术有限公司 OTU signal multiplexing/de-multiplexing system and method
CN101547382A (en) * 2009-05-06 2009-09-30 烽火通信科技股份有限公司 Separation method for active-Standby service resource of different source and sink for grid network
CN101667972A (en) * 2009-10-19 2010-03-10 国网信息通信有限公司 Power communication network service routing method and device
WO2012055631A1 (en) * 2010-10-25 2012-05-03 Telefonica, S.A. Procedure to set up routes over the transmission network efficiently
CN102123471A (en) * 2010-12-15 2011-07-13 北京理工大学 Stub network of Internet of things and seepage data transmission method thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
G.805;ITU-T第13研究组;《国际电信联盟》;20000310;1-60 *

Also Published As

Publication number Publication date
CN108337174A (en) 2018-07-27

Similar Documents

Publication Publication Date Title
US7899326B2 (en) System for utilizing wavelength reachability and wavelength occupation status information to describe cross-connection capabilities in optical networks
CN1816217B (en) Route setting method based on node address changing
US8264967B2 (en) Bit-field-encoded resource record for determining a transmission path in a communications network
EP1814247B1 (en) Identification methods of domain-to-domain link based on automatically switched optical network
CN106487548B (en) Method and device for processing POTN virtual interface
US9112638B2 (en) OSS support for control plane technology
EP3038302B1 (en) Grooming method and device for packet optical transport network
EP1890436A1 (en) Method and apparatus for managing and transmitting fine granularity services
JP2004535140A (en) Routing method in telecommunications network
CN101888573B (en) Method and system for automatically discovering resource state between adjacent nodes
CN114301793A (en) Path generation method and device in optical transmission network
CN108337174B (en) Method and device for searching end-to-end service route of transmission network and storage medium
Iqbal et al. Technology-aware multi-domain multi-layer routing
CN103795641A (en) Optical network resource management method based on multi-dimensional frame mapping
CN101567743B (en) Computation method and device for multiplex section sharing guard ring misconnection squelching table
CN105049965B (en) A kind of OTN circuits method for routing and system
WO2005022823A1 (en) A method for achieving a path with protection entity in the intelligent optical network
WO2005091539A1 (en) Automatic update of squelch tables for optical network applications
CN108768863B (en) Transmission network route analysis method and device and computer readable storage medium
WO2008011770A1 (en) System for utilizing wavelength reachability and wavelength occupation status information to describe cross-connection capabilities in optical networks
CN101998184B (en) Adapting device and method
JP2017216684A (en) Shortest route search having restriction in network
CN108521617B (en) Service route discovery method and device and computer readable storage medium
Lu et al. Asymmetric CDC ROADM architecture for efficient support of bi-directional asymmetric traffic demands
CN107888282B (en) Circuit whole-course route calculation method of optical transmission network

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