Esa Hyytiä
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Esa Hyytiä has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
Jorma Virtamo
Department of Communications and Networking, Aalto University, Finland
15 shared publications- Jussi Kangasharju
University of Helsinki, Finland
10 shared publications Rhonda Righter
10 shared publicationsJörg Ott
Technical University of Munich, Germany
9 shared publicationsPasi Lassila
Aalto University
9 shared publications- Rhonda Righter
Department of Industrial Engineering and Operations Research, University of California, Berkeley, USA
9 shared publications
Latest Publications
- Open Access
Size-Aware Dispatching to Fluid Queues
We develop a fluid-flow model for routing problems, where fluid consists of different size particles and the task is to route the incoming fluid to $n$ parallel servers using the size information in order to minimize the mean latency. The problem corresponds to the dispatching problem of (discrete) jobs arriving according to a stochastic process. In the fluid model the problem reduces to finding an optimal path to empty the system in $n$-dimensional space. We use the calculus of variation to characterize the structure of optimal policies. Numerical examples shed further light on the fluid routing problem and the optimal control of large distributed service systems.Open AccessSize-Aware Dispatching to Fluid Queues
We develop a fluid-flow model for routing problems, where fluid consists of different size particles and the task is to route the incoming fluid to $n$ parallel servers using the size information in order to minimize the mean latency. The problem corresponds to the dispatching problem of (discrete) jobs arriving according to a stochastic process. In the fluid model the problem reduces to finding an optimal path to empty the system in $n$-dimensional space. We use the calculus of variation to characterize the structure of optimal policies. Numerical examples shed further light on the fluid routing problem and the optimal control of large distributed service systems. - Open Access
Optimal Size-Aware Dispatching Rules via Value Iteration and Some Numerical Investigations
This technical report explains how optimal size-aware dispatching policies can be determined numerically using value iteration. It also contains some numerical examples that shed light to the nature of the optimal policies itself. The report complements our ``Towards the Optimal Dynamic Size-aware Dispatching'' article that will appear in Elsevier's Performance Evaluation in 2024.
Open AccessOptimal Size-Aware Dispatching Rules via Value Iteration and Some Numerical Investigations
This technical report explains how optimal size-aware dispatching policies can be determined numerically using value iteration. It also contains some numerical examples that shed light to the nature of the optimal policies itself. The report complements our ``Towards the Optimal Dynamic Size-aware Dispatching'' article that will appear in Elsevier's Performance Evaluation in 2024.
- 26 January 2024
- Published by Elsevier in Performance Evaluation
- Vol. 164
Towards the optimal dynamic size-aware dispatching
- 26 January 2024
- Published by Elsevier in Performance Evaluation
- Vol. 164
Towards the optimal dynamic size-aware dispatching
- 1 April 2022
- Published by Springer Nature in Queueing Systems
- Vol. 100 (3-4) , 441-443
Routing with too much information?
- 1 April 2022
- Published by Springer Nature in Queueing Systems
- Vol. 100 (3-4) , 441-443
Routing with too much information?
- 8 December 2021
- Published by Springer Nature
- p. 171-184
Dynamic Routing Problems with Delayed Information
- 8 December 2021
- Published by Springer Nature
- p. 171-184
Dynamic Routing Problems with Delayed Information
- 1 April 2020
- Published by Elsevier in Performance Evaluation
- Vol. 138, 102083
On value functions for FCFS queues with batch arrivals and general cost structures
- 1 April 2020
- Published by Elsevier in Performance Evaluation
- Vol. 138, 102083
On value functions for FCFS queues with batch arrivals and general cost structures
- Open Access
Towards Designing Cost-Optimal Policies to Utilize IaaS Clouds under Online Learning
Many businesses possess a small infrastructure that they can use for their computing tasks, but also often buy extra computing resources from clouds. Cloud vendors such as Amazon EC2 offer two types of purchase options: on-demand and spot instances. As tenants have limited budgets to satisfy their computing needs, it is crucial for them to determine how to purchase different options and utilize them (in addition to possible self-owned instances) in a cost-effective manner while respecting their response-time targets. In this paper, we propose a framework to design policies to allocate self-owned, on-demand and spot instances to arriving jobs. In particular, we propose a near-optimal policy to determine the number of self-owned instance and an optimal policy to determine the number of on-demand instances to buy and the number of spot instances to bid for at each time unit. Our policies rely on a small number of parameters and we use an online learning technique to infer their optimal values. Through numerical simulations, we show the effectiveness of our proposed policies, in particular that they achieve a cost reduction of up to 64.51% when spot and on-demand instances are considered and of up to 43.74% when self-owned instances are considered, compared to previously proposed or intuitive policies.
Open AccessTowards Designing Cost-Optimal Policies to Utilize IaaS Clouds under Online Learning
Many businesses possess a small infrastructure that they can use for their computing tasks, but also often buy extra computing resources from clouds. Cloud vendors such as Amazon EC2 offer two types of purchase options: on-demand and spot instances. As tenants have limited budgets to satisfy their computing needs, it is crucial for them to determine how to purchase different options and utilize them (in addition to possible self-owned instances) in a cost-effective manner while respecting their response-time targets. In this paper, we propose a framework to design policies to allocate self-owned, on-demand and spot instances to arriving jobs. In particular, we propose a near-optimal policy to determine the number of self-owned instance and an optimal policy to determine the number of on-demand instances to buy and the number of spot instances to bid for at each time unit. Our policies rely on a small number of parameters and we use an online learning technique to infer their optimal values. Through numerical simulations, we show the effectiveness of our proposed policies, in particular that they achieve a cost reduction of up to 64.51% when spot and on-demand instances are considered and of up to 43.74% when self-owned instances are considered, compared to previously proposed or intuitive policies.
- 1 June 2019
- Published by Elsevier in Performance Evaluation
- Vol. 131, 22-42
A little redundancy goes a long way: Convexity in redundancy systems
- 1 June 2019
- Published by Elsevier in Performance Evaluation
- Vol. 131, 22-42
A little redundancy goes a long way: Convexity in redundancy systems
- 17 October 2018
- Published by Springer Nature
- p. 29-46
Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers
- 17 October 2018
- Published by Springer Nature
- p. 29-46
Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers