Modelling and Simulation in Engineering

Modelling and Simulation in Engineering / 2010 / Article

Research Article | Open Access

Volume 2010 |Article ID 804939 |

Darmawaty Mohd Ali, Kaharudin Dimyati, "On the Modelling of the Mobile WiMAX (IEEE 802.16e) Uplink Scheduler", Modelling and Simulation in Engineering, vol. 2010, Article ID 804939, 7 pages, 2010.

On the Modelling of the Mobile WiMAX (IEEE 802.16e) Uplink Scheduler

Academic Editor: Farouk Yalaoui
Received18 May 2010
Revised09 Nov 2010
Accepted22 Dec 2010
Published03 Mar 2011


Packet scheduling has drawn a great deal of attention in the field of wireless networks as it plays an important role in distributing shared resources in a network. The process involves allocating the bandwidth among users and determining their transmission order. In this paper an uplink (UL) scheduling algorithm for the Mobile Worldwide Interoperability for Microwave Access (WiMAX) network based on the cyclic polling model is proposed. The model in this study consists of five queues (UGS, ertPS, rtPS, nrtPS, and BE) visited by a single server. A threshold policy is imposed to the nrtPS queue to ensure that the delay constraint of real time traffic (UGS, ertPS, and rtPS) is not violated making this approach original in comparison to the existing contributions. A mathematical model is formulated for the weighted sum of the mean waiting time of each individual queues based on the pseudo-conservation law. The results of the analysis are useful in obtaining or testing approximation for individual mean waiting time especially when queues are asymmetric (where each queue may have different stochastic characteristic such as arrival rate and service time distribution) and when their number is large (more than 2 queues).

1. Introduction

Mobile WiMAX is a promising Broadband Wireless Access (BWA) that has received great interest due to the need for data access at all time. The salient features of the Mobile WiMAX that are attractive are the capability of handling the quality of service (QoS) and the physical layer (PHY), scalability, and the medium access control (MAC) layer, which are exclusively designed to meet different kinds of traffic. IEEE 802.16e does define the means and method in supporting the different classes of traffic. However, it does not specify how to effectively schedule and guarantee the QoS according to the different types of applications. An extensive numbers of scheduling schemes have been proposed by researchers, and the most common approach has been by means of simulation. Simulation is a widely used technique for computing the performance measures of all kinds of models. With such manner, the performance of the Mobile WiMAX system in terms of delay, throughput, jitter, and packet loss is evaluated. However, despite of the flexibility, simulation may be rather inefficient in many cases and results based on simulation are relatively inaccurate as compared to the mathematical analysis [1].

A number of works have been focusing on evaluating the analytical model of the scheduling scheme in the context of Mobile WiMAX system. The authors in [2] put forward the idea of scheduling algorithm for the voice over IP (VoIP) services. The algorithm is claimed to solve the problem of the waste of the uplink resources algorithm caused by Unsolicited Grant Service (UGS) and MAC overhead and access delay due to the Real-Time Polling Service (rtPS) algorithm. The system model is represented as a one-dimensional Markov chain with an on-off model for the voice traffic. From here the average number of voice users in on-state, the maximum number of users that can be serviced in one MAC frame, the system throughput, and the access delay were established.

In [3] a novel scheduling scheme was presented to provide QoS satisfaction and service differentiation in terms of delay. The time window, , of the Proportional Fairness (PF) is manipulated to distinguish the service and QoS assurance of each queue. The mean queue length and mean waiting time of the system is derived using the M/M/1 Markov model.

The study in [4] concentrates on the performance analysis for the polling (rtPS and Non-Real-Time Polling Service (nrtPS)) service based on an approximation model known as the exhaustive time-limited polling model with vacation. Furthermore, the model assumes that the UGS and polling service (PS) classes are completely partitioned which allow for independent analysis of the PS traffic. The blocking probability, mean residence time, and waiting time distribution are derived from the BMAP/D/1/K model.

The author in [5] formulated the analytical model taking into account the modulation and coding scheme (MCS) as well as the signaling overhead in the downlink. The VoIP packets are scheduled based on the First-In-First-Out (FIFO) policy, and the traffic is modeled as an exponentially distributed on-off model. The aggregate VoIP traffic from the subscriber station (SS) is represented as the two-state Markov-modulated Poisson process (MMPP). The analysis is done independently for the Extended-Real Time Polling Service (ertPS), UGS, and rtPS.

Though the above study focused on the analytical model as part of the findings, the model is derived assuming that the traffic from different classes in the Mobile WiMAX is totally separated which allows for independent analysis. However, this is not always true in the actual condition. Mobile WiMAX networks are designed to allow for the coexistence of various types of traffic ranging from real-time traffic such as VoIP and video conferencing to non-real-time traffic such as file transfer and e-mail service through various scheduling services. Thus, employing a single scheduling service would lead certain applications to fail to function properly. For instance, delay is the most critical issue for the real-time traffic and should not suits with scheduling service without the QoS requirement (such as nrtPS and BE) considering that the performance could deteriorate.

In this paper, different scheduling services of the Mobile WiMAX are combined to obtain the weighted sum of mean waiting time for each queue. Owing to the extreme complexity of the analysis which is due to the amount and asymmetric characteristics of each queue, an approximation model referred to as pseudoconservation law is used. In the case of symmetric queues, the laws give exact expression of the mean waiting times [6, 7]. On the contrary, an accurate approximate model can be obtained as in the case of asymmetric queues. We first describe an uplink scheduling scheme of the Mobile WiMAX which is based on cyclic polling model followed by our mathematical model for the proposed scheme. Then the weighted sum of the mean waiting time for the individual queues or also known as pseudoconservation law for the proposed scheduling algorithm is obtained. The rest of the paper is organized as follows. Section 2 discusses the system model of the proposed scheduling scheme, and Section 3 presents the detailed description. Section 4 is devoted to the derivation of the pseudoconservation law, and finally the paper is concluded in Section 5.

2. System Model

We consider a UL scheduler in Mobile WiMAX BS which acts as a server. The scheduler serves 5 queues where scheduling services Unsolicited Grant Service (UGS), Extended Real-Time Polling Service (ertPS), Real-Time Polling Service (rtPS), Non-Real-Time Polling Service (nrtPS), and Best Effort (BE) are symbolized as , , , , and , respectively. Each queue has an infinite buffer capacity (any number of bandwidth requests can wait without loss upon arrival) to store the waiting or incoming bandwidth requests. Infinite buffer capacity assumption is often the best approximation that helps to assist the analysis [8]. The bandwidth requests or grants arrive at all queues according to the independent Poisson processes with an arrival rate of . The compound arrival rate is given as follows: Though the arrival of UGS and ertPS grants is modeled as a constant bit rate, in the case of multiple session arrival, the Poisson process provides adequate accuracy [9].

Similarly, let be the service time of with the first two moments: The server switches from to the next queue with nonzero walk time with the first moment, , and the second moment, . The first moment of total walk time, , is given as The switchover process is independent, and the arrival and service time is assumed to be independent and identically distributed (iid). The offered traffic at the th queue is , and the total offered traffic is We consider a single server serving queues as . The order of service within each queue is first-come-first-serve (FCFS). The queues are attended by a server in cyclic order and incurs nonzero switchover time. Each queue will be served under exhaustive service discipline in which the server continues to work until the queue becomes empty. When is empty, server immediately begins to switch to . The proposed scheduling algorithm works as follows.

The server serves until there are no more bandwidth requests available. When is empty, the server immediately begins to switch to . is served next and once the queue is empty, the server will move to . At , when the queue is empty, the server will check on the amount of bandwidth request available at . If the amount of bandwidth request exceeds the threshold assigned, , then the server will carry out the service to and subsequently . On the other hand, the server will return to service if the amount of the bandwidth request is less than the threshold assigned.

2.1. Definition of Key Parameters

We define some of the important parameters as a reference to this model. The cycle time, , for is the time between two successive arrivals or visits at by the server. The mean cycle time, , is independent of (do not depend on the successive starting point of the cycle) and is equal to the sum of total switchover time and total mean amount of work departing during a cycle (which is also equal to mean amount of work arrived in a cycle, [10]): Hence, The visit period of , , is defined as the time the server spends serving bandwidth requests at . The server is working at a fraction of the time at , thus, the mean visit period of , , is equal to Intervisit time, , of is the total time the server is unavailable to during a cycle. A cycle time is the sum of visit period, and the intervisit time, , can be derived as follows:

2.2. Stability Criteria

For a system to be ergodic, would be the necessary condition to ensure stability for the exhaustive service.

In sequence to the scheduling services that have been designed by the WiMAX forum to efficiently deliver broadband data services such as video, voice, and data, we have come to the idea that an algorithm implemented in the Mobile WiMAX uplink scheduler must be twofold: (1) able to blend efficiently with the bandwidth request strategy and bandwidth allocation and (26) decide on the algorithm taking into account the implementation and computation complexity. The IEEE 802.16e adopts a centralized based scheduling with the intention that the resources can be dynamically allocated and the scheduler can provide superior QoS for both the UL and downlink (DL). A proper choice of good scheduling algorithm [11] for the UL scheduler is critical as it will ensure that performance is more predictable and the QoS is better enforced [12].

There are five types of scheduling services defined in the standard: UGS, rtPS, ertPS, nrtPS, and BE. UGS is appropriate for a fixed sized packet transmitted at periodic intervals. Thus, bandwidth request is not required. rtPS is suitable for real-time data streaming with variable packet size, and the MSs can send bandwidth request in response to the bandwidth request opportunities assigned by the base station (BS) through polling opportunities. ertPS is added to the IEEE 802.16e to deal with the variable rate of real-time application. The scheduling service is designed with the basis of UGS and rtPS, and BS will provide unicast grants in unsolicited manner to the service. nrtPS suits for a delayed tolerant application with variable packet size. Similar to the rtPS, nrtPS will be polled by the BS on a regular basis (not necessary periodic). Finally BE is recommended for data streaming with no throughput and delayed guarantee. MS may use both, which is either unicast or contention request.

Since the standard does not distinctly define the scheduling algorithm to be applied, we have proposed a UL scheduling algorithm based on the cyclic polling model. The delay property is critical to real-time traffic since any violation to the delay bound may cause the packets to be discarded. One way of accomplishing this is to assign different priorities to the real-time traffic (voice, video) and non-real-time traffic. Thus, a threshold-type of service seems to be suitable for this purpose. In order to assign that, we exploit the nrtPS features to guarantee the delay property of the real-time traffic by imposing a threshold policy. The server visits (polls) the UGS, ertPS, and rtPS in a cyclic manner, serves each queue with exhaustive service strategy, and continues serving if the requests in nrtPS buffer do not exceed the predetermined threshold, , as shown in Figure 1. If the number of requests in nrtPS is greater than or equals , the server will instantly begin to service the requests in nrtPS after serving the rtPS queue with an exhaustive service policy too as shown in Figure 2. This is to ensure that the future opportunities for the non-real-time traffic scheduling services are not starved.

To incorporate the correlation between each of the scheduling services, switchover time is introduced. Switchover time is defined as the amount of time taken by the server to switch from one scheduling service to another. Thus, the analytical model will not be established independently for each scheduling service, instead, it will be established as a whole. In order to do that, the pseudoconservation law will be used to derive the model.

4. Pseudoconservation Law

In the situation of zero switchover times, the server works when there is work in the system and becomes idle if no work is present. Thus, the conservation law holds for the total amount of work in the system. The amount of work in the system is independent of the service policy and, hence, is equal to the amount of work in an M/G/1 queue [1316] with the arrival rate of and service time of : In the case of nonzero switchover times, the amount of work (the weighted sum of the waiting times,. Let be the waiting time, and let it define time between the arrival of bandwidth requests at and the moment at which it starts to receive service with mean ) is no longer independent of the service policy. This is called the pseudoconservation law and established as follows [1316]: where, is the equality in distribution, is the amount of work in a cyclic system at an arbitrary epoch, is the amount of work in a corresponding system at an arbitrary epoch, is the amount of work in a cyclic-service system at an arbitrary epoch in a switching, and period/nonserving interval, where , and are independent.

Here, epoch designates an instant in time.

It follows that Moreover, can be defined as From [15], is composed of three terms: , , and , where is the mean amount of work in at a departure epoch of the server from , is the mean amount of work in the rest of the system at a departure epoch of server from , and is the mean amount of work arrived in the system in the preceding part of the switching interval under consideration: is totally dependent on the choice of service strategies applied to the queue and can only be determined when the service strategy is identified. Therefore, parameter will be investigated in the next section, that is, the mean amount of work in the rest of the system at a departure epoch of server from when the requests in nrtPS are less than and greater than or equal to , respectively.

4.1. Derivation of When Requests in nrtPS Are Less Than

As discussed in the previous section, when the bandwidth request in is less than , the server will only carry out the service for , , and cyclically with an exhaustive service policy. In this case, and will not be attended by the server as if the queues do not exist in the scheduler. Thus, a cycle in the condition when requests in nrtPS are less than consists of server visits to , , and in a cyclic order. The total switchover time and total offered traffic are defined as and , respectively. From (7), the mean visit time of is that is, is visited once in a cycle.

Thus, the total amount of work at the departure epoch of server from , , and can be derived as follows: where Solving (16) and expanding (15) yield which can then be simplified into

4.2. Derivation of When Requests in nrtPS Are Greater Than or Equal to

When the bandwidth request in is greater than or equal to , the server will visit after the completion ( is empty) of and subsequently . and will be served according to the exhaustive service strategy. Thus, a cycle in the condition when requests in nrtPS are greater than or equal to consists of server visits to , , , , and in a cyclic order. The total switchover time and total offered traffic in the condition that requests in nrtPS are greater than or equal to are and , respectively.

Even though the server visits and at times when the requests of nrtPS are greater than or equal to , the amount of work that arrives in a cycle still holds for and in view of the fact that the definition of the cycle time for and is still valid ( and are visited by the server once in a cycle). As a result, the amount of work in can be derived as follows.

Let be the steady-state probability that the queue length of is when the server arrives.

Therefore, . is the probability that less than bandwidth requests are served in a visit period. is the probability that greater than or equal to bandwidth requests are served in a visit period. is the mean number of bandwidth request arrival during a visit period.

We obtained the expression of the mean number of messages served in a visit period which is also equal to the mean number of message arriving during a cycle: The amount of work in can be established as follows: The first term denotes the amount of work when less than bandwidth requests arrive at and the server is still serving , , and . The second term reflects the amount of work when the request is greater than or equal to . At this point, the server switches to at the completion of and later . The third term represents the amount of work that arrives in a cycle or a visit period to . Consequently, the amount of work that arrives in is denoted as

Equation (21) also holds for the amount of work that arrives in . Thus the total amount of work at the departure epoch of server from , , , , and can be obtained fromBy noting that is given by (16) and solving (22) which then can be simplified to:

4.3. Derivation of Pseudoconservation Law for the Uplink Scheduler

With reference to (11), is defined as [8, 14] Solving (11) from (9) and (24), From (12), which is consequently composed of where is derived based on the condition of the amount of bandwidth requests in nrtPS which are less than n and greater than or equals to n. depends on the service strategy applied to the queues. For exhaustive service, = 0 since there are no bandwidth requests left behind the server leaving the queue.

Thus, is defined as follows:

By inserting (28) into (25), finally, the weighted sum of the mean waiting times for the individual queues or pseudoconservation law can be written as follows: It is worth mentioning that the order of the queues in the cycle does not influence the mean workload of the system or the weighted sum of mean waiting times as in (29) as long as it does not affect and appears to be linearly dependent on the mean total switchover time [17].

5. Concluding Remarks

In this paper, we have presented the use of the pseudoconservation law to derive the weighted sum of the mean waiting times for the proposed scheduling algorithm of the Mobile WiMAX uplink scheduler. The proposed scheduling algorithm is based on a cyclic polling model with the threshold policy imposed on or nrtPS and each queue is served under the exhaustive discipline. We have obtained the weighted sum of the mean waiting times for the individual queues, in view of the fact that the explicit expression for individual waiting times was in general very complicated. From the derivation in Section 4.2, of work at and , that is, when the threshold is greater than or equal to, condition is equivalent to the amount of work that arrives in a cycle (that is the amount of work that arrives in a cycle still holds for and ).

Pseudoconservation law seems to be very useful in several purposes. In many complex systems, they are the only meaningful exact relations that can be obtained [13]. Thus, they provide important insight such as measure of overall performance, demonstration on the effects of various parameters on ’s, and a basis of approximation and bounds [1, 18]. Note that this work is different from that in [14, 15] where mixed service strategies are considered for a discrete-time and continuous-time cyclic service.


  1. A. Roubus, Polling systems and their applications, M.S. thesis, Vrije Universiteit Amsterdam, 2007.
  2. H. Lee, T. Kwon, and D. H. Cho, “An efficient uplink scheduling algorithm for VoIP services in IEEE 802.16 BWA systems,” in Proceedings of the 60th IEEE Vehicular Technology Conference (VTC '04), pp. 3070–3074, September 2004. View at: Google Scholar
  3. F. Hou, P.-H. Ho, X. (Sherman) Shen, and A.-Y. Chen, “A novel QoS scheduling scheme in IEEE 802.16 networks,” in Wireless Communications and Networking Conference, pp. 2457–2462, Kowloon, Hong Kong, March 2007. View at: Google Scholar
  4. H. Abu-Ghazaleh, J. Chai, and A. S. Alfa, “Performance analysis for polling service in IEEE 802.16 networks under PMP mode,” in Wireless Communicatins and Mobile Computing Conference, pp. 819–824, Crete Island, Greece, 2008. View at: Google Scholar
  5. J. W. So, “Performance analysis of uplink scheduling algorithms for VoIP services in the IEEEE 802.16e OFDMA system,” Wireless Personal Communications, vol. 47, no. 2, pp. 247–263, 2008. View at: Publisher Site | Google Scholar
  6. O. J. Boxma and D. G. Down, “Dynamic server assignment in a two-queue model,” European Journal of Operational Research, vol. 103, no. 3, pp. 595–609, 1997. View at: Google Scholar
  7. J. F. Hayes and T. V. J. Ganesh Babu, Modeling and Analysis of Telecommunication Network, Wiley-Interscience, New York, NY, USA, 2004.
  8. S. C. Borst, “Polling Systems,” CWI Tract, CWI Amsterdam, 2006. View at: Google Scholar
  9. F. Hou, P. H. Ho, and X. (Sherman) Shen, “Performance evaluation for unsolicited grant service flows in 802.16 networks,” in Proceedings of the International Wireless Communications and Mobile Computing Conference (IWCMC '06), pp. 991–996, Vancouver, Canada, July 2006. View at: Publisher Site | Google Scholar
  10. K. Chang and D. Sandhu, “Pseudo-conservation laws in cyclic-server, multiqueue systems with a class of limited service policies,” in Proceedings of the 9th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '90), pp. 260–267, San Francisco, Calif, USA, June 1990. View at: Google Scholar
  11. WiMAX Forum, “WiMAX System Evaluation Methodology. Version 2.1,” July 2008. View at: Google Scholar
  12. C. So-In, R. Jain, and A. K. Tamimi, “Scheduling in IEEE 802.16e mobile WiMAX networks: key issues and a survey,” IEEE Journal on Selected Areas in Communications, vol. 27, no. 2, pp. 156–171, 2009. View at: Publisher Site | Google Scholar
  13. H. Levy and M. Sidi, “Polling systems: applications, modeling, and optimization,” IEEE Transactions on Communications, vol. 38, no. 10, pp. 1750–1760, 1990. View at: Google Scholar
  14. O. J. Boxma and W. P. Groenendijk, “Waiting times in discrete-time cyclic-service systems,” IEEE Transactions on Communications, vol. 36, no. 2, pp. 164–170, 1988. View at: Google Scholar
  15. O. J. Boxma and W. P. Groenendijk, “Pseudo-conservation laws in cyclic-service systems,” Journal of Applied Probability, vol. 24, pp. 949–964, 1987. View at: Google Scholar
  16. Y. Takahashi and B. K. Kumar, “Pseudo-conservation law for a priority polling system with mixed service strategies,” Performance Evaluation, vol. 23, no. 2, pp. 107–120, 1995. View at: Google Scholar
  17. O. J. Boxma, H. Levy, and J. A. Weststrate, “Efficient visit orders for polling systems,” Tech. Rep. BS-R9017, Centre for Mathematics and Computer Science, 1990. View at: Google Scholar
  18. H. Takagi, “Analysis of polling systems,” Research Reports and Notes, Computer Systems Series MIT Press, 1986. View at: Google Scholar

Copyright © 2010 Darmawaty Mohd Ali and Kaharudin Dimyati. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles