NETWORK TRAFFIC SCHEDULER AND ASSOCIATED METHOD, COMPUTER PROGRAM AND COMPUTER PROGRAM PRODUCT

It is presented a method for a network traffic scheduler to select a winning input node using a node hierarchy comprising: a plurality of input nodes; an output node; a plurality of intermediate nodes, wherein a subset of the intermediate nodes comprises intermediate nodes being connected to at least one lower level node and one higher level node. The method comprises the steps of: selecting a lower level node as a winning node; obtaining a set of input parameters, the input parameters comprising input data being associated with the winning node; obtaining output parameters by finding a matching row in a lookup table using the input parameters as a key; and providing the output parameters to the higher level node, wherein, when the higher level node is an intermediate node, at least a subset of the output parameters are used as input parameters for the higher level node. By using lookup tables, the relationship between input parameters and output parameters is much more flexible. This allows for implementation of all currently known useful functions, but also allows definition of completely new functions in the future.