Abstract: This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.

Abstract: A network resource controller for controlling at least a first group of network elements from among a plurality of network elements in a network, includes at least one processor and at least one memory including computer program code. The at least one memory and the computer program code are configured to, with the at least one processor, cause the network resource controller to: enter a candidate state for electing a leader for the first group of network elements, the first group of network elements including a subset of network elements from among the plurality of network elements; transition from the candidate state to a leader state for the first group of network elements in response to determining that the network resource controller has been elected the leader for the first group of network elements; and control network elements in the first group of network elements.

Abstract: This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.

Abstract: Various exemplary embodiments relate to a method and related network node and machine-readable storage medium including a policy and charging rules node (PCRN) receiving a plurality of related service requests from different devices. The PCRN may establish a Session Binding Identifier (SBI) for each message received. The SBI may include one or more subscriber IDs. Upon receipt of a message, the PCRN may compare the included subscriber IDs against information included in a subscriber database to match with a specific subscriber profile. The PCRN may use the subscriber profile to determine whether existing established sessions are associated with the same subscriber profile, and may bind the sessions together when they are associated with a common subscriber profile.

Abstract: A method of exchanging a rules engine decision tree cache is disclosed. The method provides for provision accepting a command to build a replacement rules engine decision tree cache, replacing the existing cache if the decision tree creation process is successful, retaining the existing cache if the decision tree creation process is not successful, and providing specific error messages in the event that the replacement fails. The method allows an network operator to change the rules for the rule engine without disruption of real-time service and allows for a level of error checking prior to provisioning the new decision tree.

Abstract: Various exemplary embodiments relate to a method and related network node and machine-readable storage medium including a policy and charging rules node (PCRN) receiving a plurality of related service requests from different devices. The PCRN may establish a Session Binding Identifier (SBI) for each message received. The SBI may include one or more subscriber IDs. Upon receipt of a message, the PCRN may compare the included subscriber IDs against information included in a subscriber database to match with a specific subscriber profile. The PCRN may use the subscriber profile to determine whether existing established sessions are associated with the same subscriber profile, and may bind the sessions together when they are associated with a common subscriber profile.

Abstract: Various exemplary embodiments relate to a method and related network node and machine-readable storage medium including a policy and charging rules node (PCRN) receiving a plurality of related service requests from different devices. The PCRN may proceed to generate a policy and charging control (PCC) rule based on at least one service request and other information stored in the PCRN if a mate service request does not arrive during the duration of a waiting timer. If the mate service request arrives subsequent to the expiry of the waiting timer, the PCRN may then generate a subsequent PCC rule to replace the previously generated rule, with the new PCC rule incorporating information from both of the mate service requests.

Abstract: Various exemplary embodiments relate to a method and related network node and machine-readable storage medium including a policy and charging rules node (PCRN) receiving a plurality of related service requests from different devices. The PCRN may establish a Session Binding Identifier (SBI) for each message received. The SBI may include one or more subscriber IDs. Upon receipt of a message, the PCRN may compare the included subscriber IDs against information included in a subscriber database to match with a specific subscriber profile. The PCRN may use the subscriber profile to determine whether existing established sessions are associated with the same subscriber profile, and may bind the sessions together when they are associated with a common subscriber profile.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at a policy and charging rules node (PCRN) from a requesting entity, a message including a request associated with at least one service data flow (SDF); extracting a subscriber identifier and a first identifier from the message; retrieving a subscription record associated with the subscriber identifier, wherein the subscription record is associated with a first plurality of subrecords; identifying an first subrecord from the plurality of subrecords based on the first identifier; and conditionally fulfilling the request based on a first value stored in the first subrecord.

Abstract: A system and method for simplifying management information discovery in a Triple Play provider network involves configuring an element management system (EMS) database to store DHCP information, and configuring the EMS to serve the information to a subscriber service controller or other operations support services component.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at a policy and charging rules node (PCRN) from a requesting entity, a message including a request associated with at least one service data flow (SDF); extracting a subscriber identifier and a first identifier from the message; retrieving a subscription record associated with the subscriber identifier, wherein the subscription record is associated with a first plurality of subrecords; identifying an first subrecord from the plurality of subrecords based on the first identifier; and conditionally fulfilling the request based on a first value stored in the first subrecord.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the policy and charging rules node from a requesting entity, a message including a request associated with at least one service data flow (SDF), wherein the request includes at least one requested bandwidth; extracting at least one subscriber identifier from the message; retrieving a subscription record associated with the at least one subscriber identifier; determining whether the request should be fulfilled by performing at least one comparison of the at least one requested bandwidth for the SDF against at least one field of the subscription record; if the request should be fulfilled, establishing the SDF; and if the request should not be fulfilled: generating a response message that indicates that the request was rejected, and transmitting the response message to the requesting entity.

Abstract: A method of exchanging a rules engine decision tree cache is disclosed. The method provides for provision accepting a command to build a replacement rules engine decision tree cache, replacing the existing cache if the decision tree creation process is successful, retaining the existing cache if the decision tree creation process is not successful, and providing specific error messages in the event that the replacement fails. The method allows an network operator to change the rules for the rule engine without disruption of real-time service and allows for a level of error checking prior to provisioning the new decision tree.

Abstract: A method of optimizing a rules engine rule set is disclosed. The method provides for identifying groups of rule conditions within a rule table that are repetitive; determining a hash function that will effectively summarize in a condensed form the set of criteria, operations and values that distinguish the group for each respective group of the identified groups; calculating hash values per the hash functions for each row of the rule table; storing the derived hash functions, the calculated hash values, and the original rule in memory when loading; and then at run time when the rule engine is invoked: calculating the hash values using the respective hash functions associated with the rule table using the attributes provided at invocation; and skipping all rows whose hash values are different from the calculated invocation hash values. The method of optimizing rule entities is particularly useful for overcoming the longer calculation times associated with un-optimized rule tables known in the art.

Abstract: Various exemplary embodiments relate to a method and related network node and machine-readable storage medium including a policy and charging rules node (PCRN) receiving a plurality of related service requests from different devices. The PCRN may establish a Session Binding Identifier (SBI) for each message received. The SBI may include one or more subscriber IDs. Upon receipt of a message, the PCRN may compare the included subscriber IDs against information included in a subscriber database to match with a specific subscriber profile. The PCRN may use the subscriber profile to determine whether existing established sessions are associated with the same subscriber profile, and may bind the sessions together when they are associated with a common subscriber profile.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the policy and charging rules node from a requesting entity, a message including a request associated with at least one service data flow (SDF), wherein the request includes at least one requested bandwidth; extracting at least one subscriber identifier from the message; retrieving a subscription record associated with the at least one subscriber identifier; determining whether the request should be fulfilled by performing at least one comparison of the at least one requested bandwidth for the SDF against at least one field of the subscription record; if the request should be fulfilled, establishing the SDF; and if the request should not be fulfilled: generating a response message that indicates that the request was rejected, and transmitting the response message to the requesting entity.

Abstract: Various exemplary embodiments relate to a method and related network node and machine-readable storage medium including a policy and charging rules node (PCRN) receiving a plurality of related service requests from different devices. The PCRN may proceed to generate a policy and charging control (PCC) rule based on at least one service request and other information stored in the PCRN if a mate service request does not arrive during the duration of a waiting timer. If the mate service request arrives subsequent to the expiry of the waiting timer, the PCRN may then generate a subsequent PCC rule to replace the previously generated rule, with the new PCC rule incorporating information from both of the mate service requests.

Abstract: An embodiment of the present invention provides a method for network management that allows the configuration of IP links in one step, via a GUI form, even though the management protocols available at the two end links (routers) may differ. According to one embodiment, the method comprises gathering information from the user, validating this information, and then sending this information to the appropriate router(s). According to one embodiment, the method enables a user to specify various configurations when provisioning an IP link, for example, the type of IP link (Point-to-Point, Point-to-IP, or Point-to-Subnet), the numbering type (Numbered or Unnumbered), the application type (MPLS and/or IP Forwarding), and the sub-layer interfaces to be used (Packet Over Sonet, Asynchronous Transfer Mode, GigEthernet, and others).

Abstract: A framework for connectivity verification is provided. The framework includes a connectivity verification server performing unattended connectivity verification, and a connectivity verification application, both the connectivity verification server and connectivity verification application operating in a network management context. Connectivity verification jobs are defined via the connectivity verification application and the connectivity verification server is configured accordingly. Connectivity verification jobs can also be scheduled. The connectivity verification application also provides a display of connectivity verification results. The results of each connectivity verification job may be compared against a desired connectivity profile and deviations from the connectivity profile being used to raise alarms.

Abstract: A system and method for simplifying management information discovery in a Triple Play provider network involves configuring an element management system (EMS) database to store DHCP information, and configuring the EMS to serve the information to a subscriber service controller or other operations support services component.