Skip to main content

EN
ÍS

Forsíða

Forsíða

Esa Olavi Hyytiä - Professor

Esa Olavi Hyytiä

–

School of Engineering and Natural Sciences

Esa Olavi Hyytiä

Professor

Location
Gróska / Gr-308
Phone
525-4603
Email
esa [at] hi.is

Unit
Faculty of Industrial Engineering, Mechanical Engineering and Computer Science
Website
http://hi.is/~esa

Published works

2024

Towards the optimal dynamic size-aware dispatchingPerformance Evaluation

2023

PrefaceLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

2022

On Sequential Dispatching Policies
Performance degradation in parallel-server systems with shared resources and lack of coordinationPerformance Evaluation
Routing with too much information?Queueing Systems

2021

Dynamic Routing Problems with Delayed Information

2020

Performance Degradation in Parallel-Server Systems with Shared Resources
Toward designing cost-optimal policies to utilize IaaS clouds with online learningIEEE Transactions on Parallel and Distributed Systems
STAR and RATS
Admission Control to M/G/1 Subject to General Class-Specific Admission and Rejection Costs
On value functions for FCFS queues with batch arrivals and general cost structuresPerformance Evaluation

2019

Last in lineOperations Research Letters
Controlling Queues with Constant Interarrival Times
Simulation and performance evaluation of mission critical dispatching systemsPerformance Evaluation
Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers
A little redundancy goes a long wayPerformance Evaluation

2018

Practical opportunistic content dissemination performance in dense network segmentsComputer Communications
Dynamic Control of Running Servers
Evaluating rare events in mission critical dispatching systems
Applying reinforcement learning to basic routing problem

2017

Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers
Towards Designing Cost-Optimal Policies to Utilize IaaS Clouds with Online Learning
On the sensitivity of geo-based content sharing to location errors
Meeting soft deadlines in single- and multi-server systems
Beyond shortest queue routing with heterogeneous servers and general cost functions
Scheduling for efficiency and fairness in systems with redundancyPerformance Evaluation
Value (Generating) Functions for the M^X/G/1 Queue

2016

On Round-Robin routing with FCFS and LCFS schedulingPerformance Evaluation
Queueing with redundant requestsQueueing Systems
On search and content availability in opportunistic networksComputer Communications
Search in digital pocketsIEEE Wireless Communications
Analysis of the indexing gain when searching in spontaneous wireless networks
Opportunistic content dissemination performance in dense network segments
Routing jobs with deadlines to heterogeneous parallel serversOperations Research Letters

2015

Reducing latency via redundant requestsPerformance Evaluation Review
Analysis of hop limit in opportunistic networks by static and time-aggregated graphs
Fairness through Linearly Increasing Holding Costs in Systems of Parallel Servers with Setup Delays
Offload (only) the right jobs
Two hops or more

2014

Value driven load balancingPerformance Evaluation
Searching a needle in (linear) opportunistic networks
Efficient neighbor discovery in mobile opportunistic networking using mobility awareness
Energy-aware job assignment in server farms with setup delays under LCFS and PS
Task assignment in a heterogeneous server farm with switching delays and general energy-aware cost structurePerformance Evaluation

2013

Criticality of large delay tolerant networks via directed continuum percolation in space-time
Characterizing content sharing properties for mobile users in open city squares
Criticality condition for information floating with random walk of nodesPerformance Evaluation
Seeker-assisted information search in mobile clouds
To split or not to splitOperations Research Letters
Round-Robin routing policy
Evaluating (Geo) content sharing with the ONE simulator
Optimal routing of fixed size jobs to two parallel serversINFOR
Lookahead actions in dispatching to parallel queuesPerformance Evaluation

2012

Continuum percolation threshold for permeable aligned cylinders and opportunistic networkingIEEE Communications Letters
On the value function of the M/G/1 FCFS and LCFS queuesJournal of Applied Probability
Minimizing slowdown in heterogeneous size-aware dispatching systems
Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectivesComputers and Operations Research
Floating information with stationary nodes
Size- and state-aware dispatching problem with queue-specific job sizesEuropean Journal of Operational Research

2011

Floating content
The Travelling Salesman Problem with Differential Neighborhood
M/M/1-PS queue and size-aware task assignmentPerformance Evaluation
Why urban mass demand responsive transport?
When does content float? Characterizing availability of anchored information in opportunistic content sharing
Dispatching problem with fixed size jobs and processor sharing discipline
Floating content for probabilistic information sharingPervasive and Mobile Computing
BeachNet
Energy-aware dispatching in parallel queues with on-off energy consumption

2010

Hybrid secret key escrow mechanisms as counters
A stochastic model for a vehicle in a dial-a-ride systemOperations Research Letters
Congestive collapse and its avoidance in a dynamic dial-a-ride system with time windows
Key escrow schemes with sliding window for privacy-aware anomaly detection system
Simulation of a large scale dynamic pickup and delivery problem

2009

Privacy-Preserving Network Monitoring Architecture for the Future Internet
Detection and tracking of skype by exploiting cross layer information in a live 3G network
On the optimality of field-line routing in massively dense wireless multi-hop networksPerformance Evaluation

2008

Near-optimal load balancing in dense wireless multi-hop networks

2007

Random waypoint mobility model in cellular networksWireless Networks
Optimal degree distribution for LT codes with small message length
On traffic load distribution and load balancing in dense wireless multihop networksEurasip Journal on Wireless Communications and Networking
On optimality of single-path routes in massively dense wireless multi-hop networks

2006

A Markovian waypoint mobility model with application to hotspot modeling
Spatial node distribution of the random waypoint mobility model with applicationsIEEE Transactions on Mobile Computing
Connectivity properties of random waypoint mobility model for ad hoc networks
Traffic matrix estimation in a dense multihop wireless network
A model for TCP congestion control capturing the correlations in times between the congestion events
On load balancing in a dense wireless multihop network
Optimizing the Degree Distribution of LT Codes with an Importance Sampling Approach
Complementary analysis and numerical results foran elementary fluid flow model of TCP

2005

Random waypoint model in n-dimensional spaceOperations Research Letters
Traffic load in a wireless multihop network

2004

Linear program formulation for routing problem in OBS networksProceedings - International Symposium on Computers and Communications
Analytical Loss Models for MAC protocols in Optical Ring Network Operating under a Static Traffic Load

2003

Performance of the JET protocol with optical delay lines
Maximization of Single Hop traffic with Greedy Heuristics

2002

Adaptive importance sampling in routing and wavelength assignment problemEuropean Transactions on Telecommunications

2001

Optimal importance sampling in Markov process simulation

2000

Dynamic Routing and Wavelength Assignment Using First Policy Iteration, Inhomogeneous Traffic Case
Dynamic routing and wavelength assignment using first policy iteration

Keywords for Specialisation:

Performance analysis

Queueing theory

Probability theory