Achievable QoS and scheduling policies for integrated services wireless networks

Networks are expected to support applications with diverse traffic characteristics and Quality of Service (QoS) requirements, such as voice, data, video and multi-media. In this environment it is important to determine whether a given QoS vector is achievable (for call admission control), and if it is, design efficient resource allocation policies that deliver it. s paper a system of T resources (wireless channels) shared by a number of un-buffered applications is considered. Packets which are not allocated a channel within the current assignment cycle are dropped. The QoS vector is equivalently described in terms of (diverse) packet dropping probabilities (pi), or (diverse) packet dropping rates (di). The region of achievable QoS vectors is precisely determined and easy to implement scheduling policies that deliver the achievable QoS vectors are derived. Some applications to call admission control and resource management are presented along with some numerical examples.