Controlling network resource allocation

A computer implemented method for generating optimal control policy for controlling network resource allocation, comprising:

• storing a dictionary set, comprising simplex dictionaries, for saving processing time when calculating an optimal control policy for at least one linearly time dependent value function of a plurality of variables complying with a plurality of linearly time dependent constraints
• calculating a storage limit for the dictionary set, based on a number of the plurality of variables, the plurality of constraints, and size of a memory;
• and
• removing at least one of the plurality of simplex dictionaries from the dictionary set in accordance with the storage limit, while maintaining a neighbor density measure, wherein:
• the neighbor density measure is based on a distance between the at least one of the plurality of simplex dictionaries and at least one non-removed simplex dictionary;
• and
• the distance corresponds to a number of simplex pivots required to construct the at least one of the plurality of simplex dictionaries from the at least one non-removed simplex dictionary.

A computer program product for generating optimal control policy for controlling network resource allocation, comprising:

• one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions comprising:
• program instructions to store a dictionary set, comprising simplex dictionaries, for saving processing time when calculating an optimal control policy for at least one linearly time dependent value function of a plurality of variables complying with a plurality of linearly time dependent constraints;
• program instructions to calculate a storage limit for the dictionary set, based on a number of the plurality of variables, the plurality of constraints, and size of a memory;
• and
• program instructions to remove at least one of the plurality of simplex dictionaries from the dictionary set in accordance with the storage limit, while maintaining a neighbor density measure, wherein:
• the neighbor density measure is based on a distance between the at least one of the plurality of simplex dictionaries and at least one non-removed simplex dictionary;
• and
• the distance corresponds to a number of simplex pivots required to construct the at least one of the plurality of simplex dictionaries from the at least one non-removed simplex dictionary.