kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Distributed Join-the-Shortest-Queue with Sparse and Unreliable Information Updates
KTH, School of Electrical Engineering and Computer Science (EECS).
KTH, School of Electrical Engineering and Computer Science (EECS).ORCID iD: 0000-0002-2764-8099
2022 (English)In: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), Institute of Electrical and Electronics Engineers Inc. , 2022, p. 4235-4241Conference paper, Published paper (Refereed)
Abstract [en]

This paper addresses the problem of load-balancing in a typical mobile edge computing scenario, where mobile users need to select one of the edge servers in their vicinity to offload their tasks. To achieve load balancing, while also limiting the control overhead, we propose delta-DJSQ, a fully-distributed joint-the-shortest-queue policy, where servers provide sporadic status updates over unreliable channels, and users select the least loaded server according to their local belief. We formally prove that the necessary conditions of system stability are also sufficient, namely, the system is stable when the task generation rate is lower than the task service rate, the status update rate is positive, and the probability that a user receives a status update is positive as well. We show that delta-DJSQ is robust to update delays and to message losses, and achieves competitive performance results compared to static load-balancing solutions, both for homogeneous and for heterogeneous servers.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc. , 2022. p. 4235-4241
Series
IEEE International Conference on Communications, ISSN 1550-3607
Keywords [en]
Load balancing, join-the-shortest-queue, mobile edge computing
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-322433DOI: 10.1109/ICC45855.2022.9838596ISI: 000864709904070Scopus ID: 2-s2.0-85137260226OAI: oai:DiVA.org:kth-322433DiVA, id: diva2:1719377
Conference
IEEE International Conference on Communications (ICC), MAY 16-20, 2022, Seoul, SOUTH KOREA
Note

Part of proceedings: ISBN 978-1-5386-8347-7

QC 20221215

Available from: 2022-12-15 Created: 2022-12-15 Last updated: 2022-12-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Peris, Jaume AngueraFodor, Viktória

Search in DiVA

By author/editor
Peris, Jaume AngueraFodor, Viktória
By organisation
School of Electrical Engineering and Computer Science (EECS)
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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