Generalized Weighted Fairness and its application for resource allocation in IEEE 802.16e Mobile WiMAX

So-In, Chakchai; Jain, Raj; Al-Tamimi, Abdel-Karim

doi:10.1109/iccae.2010.5451235

Cited by 12 publications

(12 citation statements)

References 8 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To demonstrate the flow scheduler customization, we conduct experiments for uplink and downlink directions with two slices running different kinds of flow schedulers. For brevity, we demonstrate the results of three flow schedulers: a weighted-fair scheduler (WF) that allocates bandwidth to flows in proportion to their minimum reserved rates, a Priority with Round Robin (PRR) scheduler that allocates resources in the priority order of QoS classes and uses RR policy for flows within the same class, and finally a Generalized Weighted Fairness (GWF) scheduler [48]. …”

Section: B Customizationmentioning

confidence: 99%

NVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks

Kokku

Mahindra²,

Zhang³

et al. 2012

IEEE/ACM Trans. Networking

303

212

View full text Add to dashboard Cite

This paper describes the design and implementation of a network virtualization substrate ( ) for effective virtualization of wireless resources in cellular networks. Virtualization fosters the realization of several interesting deployment scenarios such as customized virtual networks, virtual services, and widearea corporate networks, with diverse performance objectives. In virtualizing a base station's uplink and downlink resources into slices, meets three key requirements-isolation, customization, and efficient resource utilization-using two novel features: 1) introduces a provably optimal slice scheduler that allows existence of slices with bandwidth-based and resource-based reservations simultaneously; and 2) includes a generic framework for efficiently enabling customized flow scheduling within the base station on a per-slice basis. Through a prototype implementation and detailed evaluation on a WiMAX testbed, we demonstrate the efficacy of . For instance, we show for both downlink and uplink directions that can run different flow schedulers in different slices, run different slices simultaneously with different types of reservations, and perform slice-specific application optimizations for providing customized services.

show abstract

Section: B Customizationmentioning

confidence: 99%

NVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks

Kokku

Mahindra²,

Zhang³

et al. 2012

IEEE/ACM Trans. Networking

303

212

View full text Add to dashboard Cite

show abstract

“…We require this resource allocator in order to use the resources in an efficient manner. [3,[5][6][7] …”

Section: Issuesmentioning

confidence: 99%

“…So-In et al, [7] have defined the Generalized Weighted Fairness (GWF) criterion that allows carriers to implement and apply either of the two fairness criteria to a Mobile WiMAX environment. Through this approach we can overcome the throughput fairness which is favorable to customers with a poor channel condition or those at a far distance.…”

Section: Literature Reviewmentioning

confidence: 99%

Dynamic Power Efficient Resource Allocation for 802.16 WiMAX Networks

Meyyappan¹,

Marthandan²,

Eswaran³

2017

IJIES

View full text Add to dashboard Cite

Abstract:In our previous work we have proposed a fuzzy based scheduling technique for multiple service flows in 802.16 WiMAX. This technique involves two entities namely evaluator and slot allocator. Where the evaluator arranges the real time and non real time service flows in two sub queues and then sorts them by their priority levels. The slot allocator obtains the priority information of service flows from the evaluator to allocate slots. For this work for we propose an extension which allocates the resources for the WiMAX Networks. This allocation is done based on the fairness of the node. During the allocation the approach considers the lifetime, transmission power, outrage probability and the power gain of the nodes. Based on these constraints the power and the bits are allocated to the source nodes in the network.

show abstract

“…Round-Robin scheduling algorithms [9] are the simplest scheduling algorithms designed especially for time sharing systems. The RR algorithm can be considered the very first simple RR and it fairly assigns allocation one by one to all connections.…”

Section: Related Workmentioning

confidence: 99%

Packet Scheduling with QoS and Fairness for Downlink Traffic in WiMAX Networks

Nie¹,

Wang²,

Park³

2011

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station has a number of users, and each mobile subscriber station has different channel conditions. The same mobile subscriber station may have different service requirements at different times in the WiMAX network. Based on OPNET simulation, the results show our scheduling algorithm can increase the network throughput, maintain relative fairness, and lower delay over the round robin and weighted round robin algorithms.

show abstract

Generalized Weighted Fairness and its application for resource allocation in IEEE 802.16e Mobile WiMAX

Cited by 12 publications

References 8 publications

NVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks

NVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks

Dynamic Power Efficient Resource Allocation for 802.16 WiMAX Networks

Packet Scheduling with QoS and Fairness for Downlink Traffic in WiMAX Networks

Contact Info

Product

Resources

About