Insensitivity in processor-sharing networks
Performance Evaluation
Insensitive, maximum stable allocations converge to proportional fairness
Queueing Systems: Theory and Applications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study pricing models for bandwidth sharing that do not depend on detailed statistical knowledge of network traffic. For a multiclass, processor sharing server, we show that three common pricing models, namely fixed rate pricing, Vickrey-Clarke-Groves pricing, and congestion-based pricing, are linked to the zeroth, first, and second moments, respectively, of the number of users in the system. We derive expressions for these quantities and provide insights into the operator's revenue and user payments.