Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Fairness and user assignment in cloud-RAN
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-9442-671X
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
Show others and affiliations
2018 (English)In: IEEE Vehicular Technology Conference, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 1-5Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we extend our previous work on user assignment in Cloud-RAN, where we proposed an algorithm for user assignment (UA). We motivate the inherent fairness issue that is present in the latter UA scheme, since some users in the system will never get served. To improve the fairness, we propose that the UA scheme is preceded by a user scheduling step which aims at selecting at any time the users that should be considered by the UA algorithm for scheduling (in the next time slot). Two user scheduling approaches have been studied. The first scheme improves the minimum throughput (MT), by selecting at any time the users with the lowest throughput. The second scheme is based on round-robin (RR) scheduling, where the set of potentially scheduled users for the next slot, is done by excluding all the previously served users, in that round. Moreover, the subset of actual users to be served, is determined using the UA algorithm. We evaluate their fairness and sumrate performance, via extensive simulations. While one might have expected a tradeoff between the sum-rate performance and fairness, our results show that MT improves both metrics, when compared to the original UA algorithm (without fairness), for some choice of parameter values. This implies that both fairness and aggregate system performance can be improved, by a careful choice of the number of assigned and served users.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc. , 2018. p. 1-5
Keywords [en]
Cloud radio access networks, Fairness scheduling, User assignment, Communication channels (information theory), Routers, Scheduling, Choice of parameters, Extensive simulations, Round Robin, Time slots, User scheduling, Scheduling algorithms
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:kth:diva-227440DOI: 10.1109/VTCFall.2017.8288047Scopus ID: 2-s2.0-85045234015ISBN: 9781509059355 OAI: oai:DiVA.org:kth-227440DiVA, id: diva2:1210413
Conference
86th IEEE Vehicular Technology Conference, VTC Fall 2017, 24 September 2017 through 27 September 2017
Note

Conference code: 134637; Export Date: 9 May 2018; Conference Paper; CODEN: IVTCD. QC 20180528

Available from: 2018-05-28 Created: 2018-05-28 Last updated: 2018-05-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Ghauch, HadiSkoglund, MikaelGross, James

Search in DiVA

By author/editor
Ghauch, HadiImtiaz, S.Skoglund, MikaelGross, James
By organisation
ACCESS Linnaeus Centre
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 19 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf