Controlling mean queuing delay under multi-class bursty and correlated traffic
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In this paper, we study how to design algorithms of a satellite queuing system so that all the users have self-interest in controlling congestion when it happens. Most of the algorithms proposed to accomplish this in terrestrial Internet may not be implemented in satellite router due to satellite hardware constraints or performance differences. After investigating characteristics of satellite traffic traces, we propose a new fair AQM algorithm, called Selective Differentiated Penalization. SDP use the recent buffer resources allocation history to differentially penalize misbehaving flows by dropping more of their packets to make a tradeoff between scalability and fairness. The first principle of SDP is that the resulting throughput of each flow should be bounded by the max-min fair share bandwidth. The performance of SDP is aided by the fact that the recent history of buffer resource allocations can provide accurate rate estimates of active flow and the fair share threshold. Simulated results suggest that SDP provides a reasonable degree of max-min fair bandwidth allocation in a wide variety of operating conditions.