On the Gittins index for multistage jobs

Autor: Ziv Scully, Samuli Aalto

Publikováno v: Queueing Systems. 102:353-371

Optimal scheduling in single-server queueing systems is a classic problem in queueing theory. The Gittins index policy is known to be the optimal nonanticipating policy minimizing the mean delay in the M/G/1 queue. While the Gittins index is thorough

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b99a419b73aef80c63f57114e216cb7e
https://doi.org/10.1007/s11134-022-09760-z

On energy-aware M/G/1-LAS queue with batch arrivals

Autor: Pasi Lassila, Samuli Aalto

Publikováno v: Operations Research Letters. 47:611-617

We analyze an energy-aware M X /G/1 queue under LAS scheduling with a setup delay and an idle timer that controls the delay before the server enters a sleep state. Through a classical busy period analysis, the expression for the mean conditional dela

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80919fcbe425f3175335187f53cb0127
https://doi.org/10.1016/j.orl.2019.10.008

Performance of D2D underlay and overlay for multi-class elastic traffic

Autor: Pasi Lassila, Samuli Aalto, Prajwal Osti

Publikováno v: COMPUTER COMMUNICATIONS. 117:147-163

We explore the performance of different resource allocation schemes for transferring elastic traffic in a cellular network that is either overlaid or underlaid with D2D traffic. To this end, we model a single cell during uplink transmissions and join

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72b574f459244fabe545ab48f9f724f2
http://juuli.fi/Record/0281810017

Performance Degradation in Parallel-Server Systems

Autor: Samuli Aalto, Josu Doncel, Urtzi Ayesta

Publikováno v: IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking, IEEE/ACM, 2019, 27 (2), pp.875-888. ⟨10.1109/TNET.2019.2902531⟩
IEEE/ACM Transactions on Networking, 2019, 27 (2), pp.875-888. ⟨10.1109/TNET.2019.2902531⟩

We consider a parallel-server system with homogeneous servers where incoming tasks, arriving at rate $\lambda $ , are dispatched by $n$ dispatchers, each of them balancing a fraction $1/n$ of the load to $K/n$ servers. Servers are first-come-first-se

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aeac0ed29d5490b9097fd2666fb1d504
https://hal.archives-ouvertes.fr/hal-01635251/file/SITADegradation.pdf

Whittle index approach to size-aware scheduling for time-varying channels with multiple states

Autor: Pasi Lassila, Samuli Aalto, Prajwal Osti

Publikováno v: Queueing Systems. 83:195-225

We consider the optimal opportunistic scheduling problem for downlink data traffic in a wireless cell with time-varying channels. The scheduler itself operates at a very fast time scale of milliseconds, but the objective function is related to minimi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b2174049bf50bcdd1b65a68a60a2043f
https://doi.org/10.1007/s11134-016-9484-z