NDLI: Framework for analysis of opportunistic schedulers: average sum rate vs. average fairness

Content Provider	IEEE Xplore Digital Library
Author	Jorswieck, E.A. Sezgin, A. Xi Zhang
Copyright Year	2008
Description	Author affiliation: Dresden Univ. of Technol., Dresden (Jorswieck, E.A.)
Abstract	Channel aware and opportunistic scheduling algorithms exploit the channel knowledge and fading to increase the average throughput. The maximum throughput scheduler (MTS) transmits only to the best user at a time. It is unfair to users at the cell edge. Obviously, there is a tradeoff between average throughput and fairness in the system. In this work, we study four representative schedulers, namely the MTS, the proportional fair scheduler (PFS), the (relative) opportunistic round robin scheduler (ORS), and the round robin scheduler (RRS). We show that the average sum rate performance and the average worst-case delay depend strongly on the user distribution within the cell. MTS gains from asymmetrically distributed users whereas the other three schedulers suffer. On the other hand, the average fairness of MTS and PFS decreases with asymmetrical user distribution. The key contribution of this paper is to put these tradeoffs and observations on a solid theoretical basis. The scaling laws of the average sum rate with the number of users as well as of the average worst-case delay are derived. Both the PFS and the ORS provide a reasonable performance in terms of throughput and fairness. However, PFS outperforms ORS for symmetrical user distributions, whereas ORS outperforms PFS for asymmetrical user distributions.
Starting Page	100
Ending Page	105
File Size	298668
Page Count	6
File Format	PDF
ISBN	9789639799189
DOI	10.1109/WIOPT.2008.4586049
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-04-01
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	ICST
Subject Keyword	Fading Channel capacity Laboratories Signal processing algorithms Throughput Solids Round robin Delay Scheduling algorithm Information systems
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Queueing Delay Analysis for Packet Schedulers with/without Multiuser Diversity over a Fading Channel

Queuing delay analysis for packet schedulers with/without multiuser diversity over a fading channel

A new scheduling algorithm and performance with opportunistic beamforming

Maximum sum-rate of MIMO multiuser scheduling with linear receivers

Throughput guarantees for opportunistic scheduling algorithms: A comparative study

Delay considerations for opportunistic scheduling in broadcast fading channels (2007)

Delay considerations for opportunistic scheduling in broadcast fading channels (2007)

Throughput Fairness Round Robin Scheduler for Non-Continuous Flows

Spectral Efficiency and Fairness for Opportunistic Round Robin Scheduling

Framework for analysis of opportunistic schedulers: average sum rate vs. average fairness

Similar Documents

Queueing Delay Analysis for Packet Schedulers with/without Multiuser Diversity over a Fading Channel

Queuing delay analysis for packet schedulers with/without multiuser diversity over a fading channel

A new scheduling algorithm and performance with opportunistic beamforming

Maximum sum-rate of MIMO multiuser scheduling with linear receivers

Throughput guarantees for opportunistic scheduling algorithms: A comparative study

Delay considerations for opportunistic scheduling in broadcast fading channels (2007)

Delay considerations for opportunistic scheduling in broadcast fading channels (2007)

Throughput Fairness Round Robin Scheduler for Non-Continuous Flows

Spectral Efficiency and Fairness for Opportunistic Round Robin Scheduling

Framework for analysis of opportunistic schedulers: average sum rate vs. average fairness