Abstract: Embodiments of the present disclosure relate to software-defined networks, and particularly, but not exclusively to programmable packet data processing systems, methods and computer readable products for use therein.

Abstract: Key data is processed using a hash table data structure. Control data storage locations have a write-availability indicated by a first write-availability state indicating that the location is available to be written to, and a second write-availability state indicating that the location is not available to be written to. A temporary label value is stored in a selected control data storage location to render the selected location and a corresponding key data storage location inactive for read-out. The write-availability of the control data storage location is changed to the second write-availability state in association with the storage of the processed label value in the selected location. A read-out label value is obtained and the temporary label value stored in the selected control data storage location is over-written with the obtained read-out label value, to render the selected control data storage location and corresponding key data storage location active for read-out.

Abstract: Measures for providing timer services in a network including a cluster of nodes responsible for providing timer services to clients. At a given node in the cluster, a request to provide a timer is received from a client. Configuration of a primary replica of the requested timer on a first node in the cluster to pop after a first time has elapsed is initiated. A first timer replication message is transmitted to a second node in the cluster, the first timer replication message indicating that the second node should configure a first backup replica of the requested timer. A second timer replication message is transmitted to a third node in the cluster, the second timer replication message indicating that the third node should configure a second backup replica of the requested timer. Popping of the primary, first backup or second backup timer replicas includes initiating callback of a given client.

Abstract: Embodiments of the present disclosure relate to software-defined networks, and particularly, but not exclusively to programmable packet data processing systems, methods and computer readable products for use therein.

Abstract: A packet processing system comprises a packet processing graph comprising classifier nodes including a root classifier node and leaf classifier nodes. The root classifier node is connected to each of the classifier nodes through a respective packet processing path in the graph. Each classifier node stores node match data indicative of at least one match to be applied by the respective classifier node. The classifier nodes comprise first and second classifier nodes arranged in a first packet processing path of said plurality of packet processing paths. The first classifier node stores node match data indicative of a match corresponding to content from a plurality of packet header field types, including first and second, different packet header field types. The second classifier node stores node match data indicative of a match corresponding to content from at least one packet header field type, including the first packet header field type.

Abstract: A graph data structure for a packet processing system is generated. The structure comprises graph data objects representing classifier nodes of a packet processing graph. The classifier nodes include a root node and leaf nodes. The root node is connected to each of the leaf nodes through respective corresponding packet processing paths through the graph. Each graph data object includes node match data indicative of at least one match to be applied by the respective classifier node. One or more n-type match graph data objects are identified, which include node match data indicative of an n-type match corresponding to content from n header field types. One or more (n+m)-type match graph data objects are identified, which include node match data indicative of an (n+m)-type match corresponding to a combination of content from a (n+m) different header field types. n and m are integer values of 1 or more.

Abstract: The techniques disclosed herein improve existing systems by receiving a packet to process and determining an associated packet processing graph for the packet. In response to determining that the associated packet processing graph contains an action comprising a set of rules for modifying the packet processing graph, a table to modify in the packet processing graph is accessed based on a table identifier in the action. The accessed table is modified by inserting one or more table rows into the packet processing graph and for each inserted table row, inserting a set of template actions containing prepopulated fields. The modified table is used to process subsequent packets.

Abstract: A packet classifier and methods of processing data packets in a data communications network can include receiving a data packet comprising packet header data; performing rule-based classification of the received data packet to generate rule-based classification data; and processing the data packet in accordance with the rule-based classification data.

Abstract: A packet processing system comprises a packet processing graph comprising classifier nodes including a root classifier node and leaf classifier nodes. The root classifier node is connected to each of the classifier nodes through a respective packet processing path in the graph. Each classifier node stores node match data indicative of at least one match to be applied by the respective classifier node. The classifier nodes comprise first and second classifier nodes arranged in a first packet processing path of said plurality of packet processing paths. The first classifier node stores node match data indicative of a match corresponding to content from a plurality of packet header field types, including first and second, different packet header field types. The second classifier node stores node match data indicative of a match corresponding to content from at least one packet header field type, including the first packet header field type.

Abstract: Embodiments of the present disclosure relate to software-defined networks, and particularly, but not exclusively to programmable packet data processing systems, methods and computer readable products for use therein.

Abstract: A media gateway and method with a media session manager function, a media processor function, and a media session state datastore function. The functions are provided by one or more instantiations which allow for independent scalability of the functions in the media gateway.

Abstract: Measures for providing timer services in a network including a cluster of nodes responsible for providing timer services to clients. At a given node in the cluster, a request to provide a timer is received from a client. Configuration of a primary replica of the requested timer on a first node in the cluster to pop after a first time has elapsed is initiated. A first timer replication message is transmitted to a second node in the cluster, the first timer replication message indicating that the second node should configure a first backup replica of the requested timer. A second timer replication message is transmitted to a third node in the cluster, the second timer replication message indicating that the third node should configure a second backup replica of the requested timer. Popping of the primary, first backup or second backup timer replicas includes initiating callback of a given client.

Abstract: Measures for providing timer services in a network including a cluster of nodes responsible for providing timer services to clients. At a given node in the cluster, a request to provide a timer is received from a client. Configuration of a primary replica of the requested timer on a first node in the cluster to pop after a first time has elapsed is initiated. A first timer replication message is transmitted to a second node in the cluster, the first timer replication message indicating that the second node should configure a first backup replica of the requested timer. A second timer replication message is transmitted to a third node in the cluster, the second timer replication message indicating that the third node should configure a second backup replica of the requested timer. Popping of the primary, first backup or second backup timer replicas includes initiating callback of a given client.

Abstract: A media gateway and method with a media session manager function, a media processor function, and a media session state datastore function. The functions are provided by one or more instantiations which allow for independent scalability of the functions in the media gateway.

Abstract: A packet classifier and methods of processing data packets in a data communications network can include receiving a data packet comprising packet header data; performing rule-based classification of the received data packet to generate rule-based classification data; and processing the data packet in accordance with the rule-based classification data.

Abstract: Measures for use in processing data in a telecommunications network. A request message is received in relation to establishment of a communication session involving a given subscriber. Subscriber configuration data is received in relation to the establishment. The subscriber configuration data includes a set of one or more trigger points at which one or more application services should be invoked in relation to communication sessions for the given subscriber. At least one trigger point from the set of trigger points is encoded into an identifier for the communication session within the request message. The request message including the identifier for the communication session in which the at least one trigger point has been encoded is transmitted.

Abstract: A media gateway and method with a media session manager function, a media processor function, and a media session state datastore function. The functions are provided by one or more instantiations which allow for independent scalability of the functions in the media gateway.

Abstract: A packet processing system comprises a packet processing graph comprising classifier nodes including a root classifier node and leaf classifier nodes. The root classifier node is connected to each of the classifier nodes through a respective packet processing path in the graph. Each classifier node stores node match data indicative of at least one match to be applied by the respective classifier node. The classifier nodes comprise first and second classifier nodes arranged in a first packet processing path of said plurality of packet processing paths. The first classifier node stores node match data indicative of a match corresponding to content from a plurality of packet header field types, including first and second, different packet header field types. The second classifier node stores node match data indicative of a match corresponding to content from at least one packet header field type, including the first packet header field type.

Abstract: Embodiments of the present disclosure relate to software-defined networks, and particularly, but not exclusively to programmable packet data processing systems, methods and computer readable products for use therein.

Abstract: A graph data structure for a packet processing system is generated. The structure comprises graph data objects representing classifier nodes of a packet processing graph. The classifier nodes include a root node and leaf nodes. The root node is connected to each of the leaf nodes through respective corresponding packet processing paths through the graph. Each graph data object includes node match data indicative of at least one match to be applied by the respective classifier node. One or more n-type match graph data objects are identified, which include node match data indicative of an n-type match corresponding to content from n header field types. One or more (n+m)-type match graph data objects are identified, which include node match data indicative of an (n+m)-type match corresponding to a combination of content from a (n+m) different header field types. n and m are integer values of 1 or more.