Packet Scheduling Scheme for Multiple Services in Mobile WiMAX System

Lee, Eun-Young; Park, Hyung-Kun

doi:10.1109/iccnt.2010.56

Cited by 6 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The resource scheduling and allocation problems in different wireless access networks have been widely investigated in previous work . Lee and Park [2] propose a packet scheduling algorithm in the IEEE 802.16e mobile network. The scheduler first selects a service class by considering the maximum allowable delay constraints of each kind of classes, and then chooses a user from the selected class which has the maximum carrier-tointerference ratio.…”

Section: Introductionmentioning

confidence: 99%

Delay‐scheduler coupled throughput‐fairness resource allocation algorithm in the long‐term evolution wireless networks

Wang

Huang

2014

IET Communications

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Delay‐scheduler coupled throughput‐fairness resource allocation algorithm in the long‐term evolution wireless networks

Wang

Huang

2014

IET Communications

View full text Add to dashboard Cite

“…Thus, many researchers have been working in this field [1]- [4]. Some schedu ling algorithm in former research can adapt to the average load of the queue [5].…”

Section: Introductionmentioning

confidence: 99%

The bandwidth allocation by queue length (BA-QL) for WiMAX network

Chern

2013

2013 IEEE Third International Conference on Information Science and Technology (ICIST)

View full text Add to dashboard Cite

Worldwide Interoperability for Microwave Access (WiMAX) is a broadband wireless access (BWA) technology. It provides high data rate and multimedia service. It also supports Quality of Service (QoS) for various types of application. In this network, it is important to allocate appropriate resource to different class of service to guarantee the delay of real-time service and avoid the starvation of non real-time service. In IEEE 802.16, this part is remained opened to be explored. There is a connection admission control (CAC) mechanism in this network to allow a connection reserving bandwidth beforehand. However, a good prediction of the required bandwidth is not easy. A reserved bandwidth may not always meet its load. Thus, an algorithm adaptive to the load is proposed here.In this paper, a reserved bandwidth is allocated to each connection in the first stage. Then, two possible weighted fair queue (WFQ) algorithms are proposed. In the first one, the weight is decided by the left queue length of the connection. In the second one, the weight is decided by the left queue length and class of the connection. In this stage, the allocation will continue until the bandwidth of the frame is exhausted or all packets in the queue have been scheduled. The simulation will be done and compared with the round robin algorithm for both methods. The results show these algorithms can adapt to the load of the connection.I.

show abstract

“…the maximum allowable delay and minimum data rate [3]. A feasible solution is to decide on a service class first according to the characteristics of each class and next choose an appropriate user in the selected class [26]. In the second phase, the packet scheduling of different users among a given class may consider some performance metrics such as throughput and fairness, while the maximum rate scheduling (greedy algorithm) and Proportional Fairness (PF) scheduling can be applied, respectively.…”

Section: Packet Scheduling Mechanismmentioning

confidence: 99%

Dynamic admission control and bandwidth reservation for IEEE 802.16e mobile WiMAX networks

Wang

Yan

2012

J Wireless Com Network

View full text Add to dashboard Cite

The article presents a dynamic connection admission control (CAC) and bandwidth reservation (BR) scheme for IEEE 802.16e Broadband Wireless Access networks to simultaneously improve the utilization efficiency of network resources and guarantee QoS for admitted connections. The proposed CAC algorithm dynamically determines the admission criteria according to network loads and adopts an adaptive QoS strategy to improve the utilization efficiency of network resources. After new or handoff connections enter the networks based on current admission criteria, the proposed adaptive BR scheme adjusts the amount of reserved bandwidth for handoffs according to the arrival distributions of new and handoff connections in order to increase the admission opportunities of new connections and provide handoff QoS as well. We conduct simulations to compare the performance of our proposed CAC algorithm and BR scheme with that of other approaches. The results illustrate that our approach can effectively improve the network efficiency in terms of granting more connections by as large as about 22% in comparison with other schemes, and can also guarantee adaptive QoS for admitted new and handoff connections.

show abstract

Packet Scheduling Scheme for Multiple Services in Mobile WiMAX System

Cited by 6 publications

References 6 publications

Delay‐scheduler coupled throughput‐fairness resource allocation algorithm in the long‐term evolution wireless networks

Delay‐scheduler coupled throughput‐fairness resource allocation algorithm in the long‐term evolution wireless networks

The bandwidth allocation by queue length (BA-QL) for WiMAX network

Dynamic admission control and bandwidth reservation for IEEE 802.16e mobile WiMAX networks

Contact Info

Product

Resources

About