Download now Free registration required
This paper consider the problem of centralized routing and scheduling for IEEE 802.16 mesh networks so as to provide Quality of Service (QoS) to individual real and interactive data applications. First an optimal and fair routing and scheduling decision is obtained for aggregate demands for different source-destination pairs. This paper then present scheduling algorithms which provide per flow QoS guarantees while utilizing the network resources efficiently. These algorithms are also scalable: they do not require per flow processing and queueing and the computational requirements are modest. The paper also discusses admission control policies which ensure that sufficient resources are available.
- Format: PDF
- Size: 211.4 KB