The Differentiated Services architecture aims at providing scalable network Quality of Service by means of aggregate scheduling.
However, in aggregate scheduling networks such delay bounds suffer significantly from effects that are due to multiplexing of flows to aggregates.
In summary, to the best knowledge of the authors, the N-PF is the first uplink centralised algorithm to address the problem of scheduling competing scheduled users accounting for the effects of the uncoordinated users in the aggregate scheduling metric.
Now, research areas for the network calculus include mostly QoS control, resource allocation and scheduling, and buffer/delay dimensioning in the virtual circuit switched networks, the guaranteed service networks and the aggregate scheduling networks [5].
The N-PF algorithm considers the uplink channel state conditions and the number of uncoordinated nodes neighboring each scheduled node in the aggregate scheduling metric, in order to maximize packet transmission success probability.
However, that work assumes that each individual consumer's action can be perfectly observed, while in this work, only the aggregate scheduling of a set of participating consumers can be observed with noise.
At time instant s, our proposed algorithm N-PF selects the user, denoted as j ∗, with the largest aggregate scheduling metric given as: {frac{R_{j}(s)}{T_{j}(s)}}*bigg({frac{1}{{Omega}_{j}(s)}}bigg)^{rho} (8).
In order to reduce these collisions, we propose and evaluate through simulations a novel scheduling algorithm, called Neighbor-Aware Proportional Fair (N-PF), which takes into account both channel state conditions and the number of uncoordinated nodes neighboring each scheduled node in the aggregate scheduling metric.
Specifically, aggregated scheduled and emergency outpatient visits and aggregated laboratory and radiographic tests performed.
In this paper, we propose scheduling algorithms that aggregate the scheduling slack of instructions and communication slack of data values to exploit the low-power modes of functional units and interconnects.
On default, data is aggregated according to the basic aggregation scheduling strategy.
