A delay optimal policy for symmetric broadcast channels

We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality of the Best User Highest Possible Rate (BUHPR) scheduling policy. Such a policy always allocate the whole possible rate to the non-empty queue serving the user with the minimum average packet length. Our analysis can be generalized to the symmetric multiuser broadcast channel.


Published in:
2006 10th International Conference on Communication Technology, Vols 1 and 2, Proceedings, 1430-1432
Presented at:
IEEE International Conference on Communication Technology, China, 27-30 November 2006
Year:
2006
Keywords:
Laboratories:




 Record created 2007-02-12, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)