• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.370-374
• /
• 2009

In this paper we propose an adjustment algorithm for bandwidth grant interval of UGS class flows the overload status of certain frames occurs due to the pre-defined grant interval mechanism of UGS class. In IEEE 802.16/WiBro systems, UGS class is the highest priority to guaranteed QoS Parameters. However, existing grant interval mechanisms of UGS class do not consider the condition that the grant interval of multiple UGS class flows overlaps with certain frames, and thus it causes the overload status in the system. Therefore, the system cannot be guaranteed QoS for UGS class flows. In this paper, we show the occurrence of the problem through simulation studies and propose an adjustment algorithm to solve the problem. Our simulation results show that there is performance improvement in the proposed algorithm. We expect that the real system in which the proposed scheme is applied can provide more stable QoS services by reducing the delay problem that occurs due to the occurrence of the existing grant interval problem of UGS class.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.225-226
• /
• 2008

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.783-787
• /
• 2008

IEEE 802.16/WiBro, one of the representative Broadband Wireless Access (BWA) systems, defines QoS negotiation between BS and SS and five service classes to guarantee QoS for flows. The five service classes are UGS, ertPS, rtPS, nrtPS, and BE, but the standard does not define how to provide services to flows according to the service classes. Existing research works have been studied about the scheduler architecture to effectively utilize the IEEE 802.16/WiBro systems. These works use the original packet scheduling algorithm for service classes. However, it is necessary to consider bandwidth allocation mechanisms in scheduling algorithms since bandwidth allocation mechanisms are different according to service classes. Especially, bandwidth allocation mechanisms should be considered for the scheduling of rtPS class since rtPS class uses the polling mechanism that takes time to allocate bandwidth and has the minimum latency constraint. Therefore, we propose two stage dropping scheme for rtPS class that is sensitive to latency, and thus it reduces the wasted resources and provides efficient service to rtPS class.