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 network device comprising: a processor; and a memory comprising instructions which when executed by the processor cause the device to allocate a packet to a Media Session Controller (MSC) by receiving the packet; inspecting a port number in the packet header of the packet; comparing the port number with one or more MSC-port allocations in a database; selecting based on the comparison an MSC from a plurality of MSCs; and forwarding the received packet to the selected MSC.

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: 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 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: 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: Certain examples are described relating to resource allocation for one or more digital signal processors in a media gateway. Processing of telecommunication calls are allocated to different digital signal processor cores in the media gateway. When more processing resources are required for a call, a determination is made as to whether any of a set of digital signal processor cores are able to provide these resources. Responsive to a particular digital signal processor core being unable to provide the further processing resources, a reallocation process is initiated. This may involve reserving resources on a further digital processor core, releasing the original set of processing resources and allocating the processing of the call to the further digital processor core.

Abstract: Certain examples are described relating to resource allocation for one or more digital signal processors in a media gateway. Processing of telecommunication calls are allocated to different digital signal processor cores in the media gateway. When more processing resources are required for a call, a determination is made as to whether any of a set of digital signal processor cores are able to provide these resources. Responsive to a particular digital signal processor core being unable to provide the further processing resources, a reallocation process is initiated. This may involve reserving resources on a further digital processor core, releasing the original set of processing resources and allocating the processing of the call to the further digital processor core.