This work is based on the user satisfaction metric: a metric of the network response time, in terms of serving the decision-making requests, defined in our previous work in [3].
The cluster and path arrival times can be modeled as Poisson random variables.
The bandwidth demands for each request is defined in run time.
Combined free DAMA [21, 22] is the protocol chosen from all DAMA types since it allows the allocation of free capacity, which is a design requirement due to the existence of the FCA capacity request type defined in DVB-RCS specification.
Both kinds of capacity requests are defined in this implementation in order to allow the agent choose the most suitable option for each specific traffic type, and also to allow the study of the differences between RBDC and VBDC during the experimental phase of this work.
We use the same formalism for specifying a request; that is, a request r is defined in terms of tuple (i,o,p r e,p o s t), with i and o denoting input and output, respectively, pre denoting the preconditions and post denoting the postconditions.
According to the above two situations happened freqently, two request types are defined in the following.
Active terminals send a "corrective" request every superframe (defined in our work as equal to 11 channel frames, to account for the propagation delay) to correct any mistakes (due to either overassignment or underassignment of slots) of the models produced at the NCC via online simulation.
In the conventional PDP, each request defines the shipping of a given load from a specified pickup site to a given customer.
We apply the Jain's Fairness index on the satisfaction factor which is in function of granted resources and requested resources as defined in Equation 7.
