Search

SUMMARY The IEEE 802.16e standard specifies the QoS support at the MAC level for wireless broadband access network. To meet the QoS requirements, an efficient scheduling algorithm at base station (BS), which is not defined in the standard, is necessary for slots allocation. In this paper, a Slot-based BS scheduling algorithm with Maximum Latency Guarantee and Capacity First (SMLG-CF) is proposed. With SMLG-CF, the connection request is satisfied with highest slot capacity first. Together with the use of dynamic sub-frame adjustment, the overall system transmission can be efficiently improved. Through the finer slots calculation and accurate transmission time scheduling, the maximum latency guarantee can be better achieved for urgent requests. In the simulation, we compare the proposed mechanism with the deficit fair priority queue scheduling algorithm and the Highest Urgency First scheduling algorithm. The simulation results reveal that SMLG-CF outperforms both algorithms from the aspect of maximum latency violation rate and average transmission rate. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

QoS Routing is crucial for QoS provisioning in high-speed networks. In general, QoS routing can be classified into two paradigms: source routing and hop-by-hop routing. In source routing, the entire path to the destination node of a communication request is locally computed at the source node based on the global state that it maintains, which does not scale well to large networks. In hop-by-hop routing, a path-selecting process is shared among intermediate nodes between the source node and the destination node, which can largely improve the protocol scalability. In this paper, we present the design of hop-by-hop routing with backup route information such that each intermediate node can recursively update the best known feasible path, if possible, by collectively utilizing the routing information gathered thus far and the information that it locally stores. Such a route is kept as a backup route and its path cost is used as a reference to guide the subsequent routing process to search for a lower-cost constrained path and avoid performance degradation. In this way, the information gathered is maximally utilized for improved performance. We prove the correctness of our presented algorithm and deduce its worst message complexity to be O(∣V∣2), where ∣V∣ is the number of network nodes. Simulation results indicate that, however, the designed algorithm requires much fewer messages on average. Therefore it scales well with respect to the network size. Moreover, simulation results demonstrate that the cost performance of our algorithm is near-optimal. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]