Adaptive Token Bank Fair Queuing Scheduling in the Downlink of 4G Wireless Networks

نویسندگان

  • Feroz A. Bokhari
  • Halim Yanikomeroglu
  • William K. Wong
  • Victor Aitken
چکیده

Traditionally, the research on packet scheduling has focused mostly on QoS and fairness for different QoS classes or different applications, while opportunistic scheduling algorithms have focused on exploiting the time-varying nature of the wireless channels and to provide fairness to the different mobile users. This segregation between packet scheduling and radio resource allocation is not efficient since none of the two types of scheduling algorithms focus both on providing QoS for the applications and exploiting the time-varying characteristics of the wireless channel. For these reasons, it is necessary to merge the scheduling of packets and the allocation of radio resources to design cross-layer scheduling algorithms. Adaptive Token Bank Fair Queuing (ATBFQ) algorithm is the proposed algorithm for cross-layer scheduling. The ATBFQ is the modified version of the Token Bank Fair Queuing (TBFQ) algorithm which was initially proposed for single carrier time division multiple access (TDMA) systems. It takes higher layer QoS attributes such as priorities, interflow fairness and delay constraints into account. By selecting the user terminals (UTs) in a certain prioritized manner derived from these QoS attributes, we can improve the performance of the UTs suffering from bad interference conditions and shadowing in particular. The ATBFQ algorithm is designed to accommodate the bursty nature of traffic. This is done by the graceful acceptance of traffic profile violation when bandwidth is available, provided the UT does not exceed its bandwidth allocation in the long term. This prevents sudden degradation of QoS experienced by the end user as a result of traffic profile violations or interference in the wireless environment. For the radio resource allocation, channel feedback is required from every UT at the start of every scheduling instant. Based on the decisions made in the first level of scheduling with QoS provisioning, appropriate resources are assigned to the selected UTs taking into account the channel quality information (CQI). The maximum signal to interference noise ratio (SINR) method is used for the resource allocation where the best chunk is allocated to the selected UT. iv The proposed scheduling algorithm is tested in a multicell environment in the presence of intercell interference. The performance is compared to that of the Score Based (SB) algorithm which is a variation of the Proportional Fair (PF) algorithm (the most widely adapted opportunistic fair scheduling technique) and the round robin (RR) method. The performance is studied in the context of the wide area scenario. QoS issues …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cross-Layer Resource Scheduling for Video Traffic in the Downlink of OFDMA-Based Wireless 4G Networks

Designing scheduling algorithms at the medium access control (MAC) layer relies on a variety of parameters including quality of service (QoS) requirements, resource allocation mechanisms, and link qualities from the corresponding layers. In this paper, we present an efficient cross-layer scheduling scheme, namely, Adaptive Token Bank Fair Queuing (ATBFQ) algorithm, which is designed for packet ...

متن کامل

Soft QoS provisioning using the token bank fair queuing scheduling algorithm

Future-generation wireless packet networks will support multimedia applications with diverse QoS requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibility of the packet-swit...

متن کامل

Soft-qos Provisioning Using the Token Bank Fair Queueing Scheduling Algorithm

Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibili...

متن کامل

Across-layer Resource Scheduling with Qos Guarantees Using Adaptive Token Bank Fair Queuing Algorithm in Wireless Networks

Orthogonal Frequency Division Multiplexing (OFDM) systems are the major cellular platforms for supporting ubiquitous high-speed mobile applications. However, a number of research challenges remain to be tackled. One of the most important challenges is the design of a judicious packet scheduler that will make efficient use of the spectrum bandwidth. Due to the multicarrier nature of the OFDM sys...

متن کامل

Scheduling for heterogeneous traffic in next generation wireless networks

Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. There is a need to develop a packet scheduling scheme for wireless channels that provides QoS guarantees for heterogeneous traffic and is also simple to implement and manage. This paper focuses on packet scheduling on a reservation-based on-demand TDMA/TDD wireless...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008