A bandwidth allocation algorithm for soft real time periodic tasks

Since now, some bandwidth allocation algorithms have been presented to guarantee the time constrains of soft real-time tasks, but most of them have some drawbacks. The first drawback of them is that allocating decisions are based on parameters which are assumed to be crisp; the second one is biased behavior with some tasks. In this paper, a new bandwidth allocation algorithm for soft real-time tasks, such as multimedia applications, is proposed to overcome some of these disadvantages. It is suitable for packet switching networks. In the proposed algorithm, the priority of tasks is determined based on difference between average of jitter and their periods. To evaluate this proposed algorithm, its performance was compared with EDF algorithm as well as one of recent works in this context by simulation. Simulation results showed that the new algorithm generally outperformed the two other algorithms in terms of system utilization, output jitter and specially fairness.