Graph based flexible service discovery and management system and method

A method, comprising the steps of:

• storing an identifier into a database stored on one or more non-transitory computer readable mediums, the identifier identifying a candidate service within a telecommunication network;
• receiving information indicative of managed entities of the candidate service;
• for each managed entity,
• generating graphing data including at least one of an edge and a vertex;
• storing the graphing data in the database with the identifier;
• and
• for the identifier,
• determining whether the telecommunication network is configured to execute the candidate service based on predetermined rules,
• wherein the predetermined rules include primary rules to determine whether the graphing data for each candidate service meets physical and logical requirements of a service object, and service rules to determine whether the graphing data for each candidate service meets one or more service requirements of the service object,
• wherein the one or more processors execute the computer executable code to generate graphing data including at least one of an edge and a vertex for each managed entity, and store the graphing data in the database with the unique identifier,
• wherein the managed entities are selected from a group consisting of a port, a termination point of a link, a termination point of a manual circuit, a sub-network connection, and a switch,
• wherein the graphing data indicative of an edge is stored in an edge table, and wherein the graphing data indicative of a vertex is stored in a vertex table,
• wherein the vertex table includes a protection group field and wherein the predetermined rules include a protection group validation rule determining whether vertexes identified within the vertex table as a protection group by the protection group field have two incoming edges,
• wherein the predetermined rules further include an edge validation rule wherein for a particular identifier the one or more processors identifies all terminating edges, and determines whether all the terminating edges is an entity capable of receiving a signal into the telecommunication network.

An article, comprising:

• at least one non-transitory computer readable medium storing a network management application comprising computer executable code that upon execution by one or more processors causes the one or more processors to receive and execute the computer executable code of the network management application to store an identifier indicative of a candidate service in a database, receive the information indicative of managed entities from the one or more input devices, store graphing data indicative of the managed entities in the database, and determine whether the telecommunication network is configured to execute the candidate service based on predetermined rules,
• wherein the predetermined rules include primary rules to determine whether the graphing data for each candidate service meets physical and logical requirements of a service object, and service rules to determine whether the graphing data for each candidate service meets one or more service requirements of the service object,
• wherein the one or more processors execute the computer executable code to generate graphing data including at least one of an edge and a vertex for each managed entity, and store the graphing data in the database with the unique identifier,
• wherein the managed entities are selected from a group consisting of a port, a termination point of a link, a termination point of a manual circuit, a sub-network connection, and a switch,
• wherein the graphing data indicative of an edge is stored in an edge table, and wherein the graphing data indicative of a vertex is stored in a vertex table,
• wherein the vertex table includes a protection group field and wherein the predetermined rules include a protection group validation rule determining whether vertexes identified within the vertex table as a protection group by the protection group field have two incoming edges,
• wherein the predetermined rules further include an edge validation rule wherein for a particular identifier the one or more processors identifies all terminating edges, and determines whether all the terminating edges is an entity capable of receiving a signal into the telecommunication network.

An article, comprising:

• at least one non-transitory computer readable medium storing a network management application comprising computer executable code that upon execution by one or more processors causes the one or more processors to (1) receive and execute the computer executable code of the network management application to store an identifier indicative of a candidate service in a database, (2) receive the information indicative of managed entities selected from a group consisting of a port, a termination point of a link, a termination point of a manual circuit, a sub-network connection, and a switch from the one or more input devices, (3) store graphing data including edges and vertices indicative of the managed entities in the database with data indicative of edges being stored in an edge table, and with data indicative of vertices stored in a vertex table, (4) determine whether the telecommunication network is configured to execute the candidate service based on primary rules to determine whether the graphing data for each candidate service meets physical and logical requirements of a service object, and service rules to determine whether the graphing data for each candidate service meets one or more service requirements of the service object, and (5) store data indicative of the service object in a service object database,
• wherein the one or more processors execute the computer executable code to generate graphing data including at least one of an edge and a vertex for each managed entity, and store the graphing data in the database with the unique identifier,
• wherein the managed entities are selected from a group consisting of a port, a termination point of a link, a termination point of a manual circuit, a sub-network connection, and a switch,
• wherein the graphing data indicative of an edge is stored in an edge table, and wherein the graphing data indicative of a vertex is stored in a vertex table,
• wherein the vertex table includes a protection group field and wherein the predetermined rules include a protection group validation rule determining whether vertexes identified within the vertex table as a protection group by the protection group field have two incoming edges,
• wherein the predetermined rules further include an edge validation rule wherein for a particular identifier the one or more processors identifies all terminating edges, and determines whether all the terminating edges is an entity capable of receiving a signal into the telecommunication network.