IEEE Transactions on Wireless Communications, Volume 6, N°12, December 2007
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with a given mean and variance of the bit-rate in a time-slot, and a given distribution for the number of time-slots allocated within a time-window. Based on this general result, we evaluate closedform expressions for the TGVPs for four well-known scheduling algorithms. Through simulations we also show that our TGVP approximation is tight for a realistic network with moving users with correlated channels and realistic throughput guarantees.
Type:
Journal
Date:
2007-12-01
Department:
Systèmes de Communication
Eurecom Ref:
2388
Copyright:
© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also: