
This paper studies optimal allocation of resources to users in a fading broadcast channel (BC) to support heterogeneous traffic. Resource allocation is done in a cross-layer manner for both deadline-sensitive (DS) and best-effort (BE) data to provide users guaranteed Quality of Service (QoS). Given the user queue-states, the proposed algorithm allocates the minimum resource to 'just' meet the deadlines for DS packets a fixed % of time. The remaining resources are then optimally split between the users for their BE data to maximize sum-rate, minimize buffer holding cost or any general utility function. The resource allocation problem is formulated as a linear program (LP) followed by a geometric program (GP) which can be solved very efficiently. Simulation results are presented for Poisson packet arrivals and exponentially distributed packet lengths on a Rayleigh fading channel for both the DS and BE traffic.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
