Esa Hyytiä

Esa Hyytiä

Auto-generated profile, based on publicly available information

Esa Hyytiä

Department of Computer Science, University of Iceland, Reykjavík, Iceland

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 April 2006 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
EHE. Hyytia
E. Hyytia
PLP. Lassila
P. Lassila
JVJ. Virtamo
J. Virtamo
The random waypoint model (RWP) is one of the most widely used mobility models in performance analysis of ad hoc networks. We analyze the stationary spatial distribution of a node moving according to the RWP model in a given convex area. For this, we give an explicit expression, which is in the form of a one-dimensional integral giving the density up to a normalization constant. This result is also generalized to the case where the waypoints have a nonuniform distribution. As a special case, we study a modified RWP model, where the waypoints are on the perimeter. The analytical results are illustrated through numerical examples. Moreover, the analytical results are applied to study certain performance aspects of ad hoc networks, namely, connectivity and traffic load distribution.

7 June 2006 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
EHEsa Hyytiä
Esa Hyytiä
JVJorma Virtamo
Jorma Virtamo

2 July 2016 in Queueing Systems
Verified
Journal Article
Closed access
PDF file
KGKristen Gardner
Kristen Gardner
SZSamuel Zbarsky
Samuel Zbarsky
SDSherwin Doroudi
Sherwin Doroudi
MHMor Harchol-Balter
Mor Harchol-Balter
EHEsa Hyytiä
Esa Hyytiä
ASAlan Scheller-Wolf
Alan Scheller-Wolf

1 March 2011
Verified
Conference Paper
Closed access
JOJorg Ott
Jorg Ott
EHEsa Hyytia
Esa Hyytia
PLPasi Lassila
Pasi Lassila
TVTobias Vaegs
Tobias Vaegs
JKJussi Kangasharju
Jussi Kangasharju
Content sharing using personal web pages, blogs, or online social networks is a common means for people to maintain contact with their friends, colleagues, and acquaintances. While such means are essential to overcome distances, using infrastructure services for location-based services may not be desirable. In this paper, we analyze a fully distributed variant of an ephemeral content sharing service, solely dependent on the mobile devices in the vicinity using principles of opportunistic networking. The net result is a best effort service for floating content in which: 1) information dissemination is geographically limited; 2) the lifetime and spreading of information depends on interested nodes being available; 3) content can only be created and distributed locally; and 4) content can only be added, but not explicitly deleted. First we present our system design and summarize its analytical modeling. Then we perform extensive evaluation for a map-based mobility model in downtown Helsinki to assess the operational range for floating content, which, at the same time also validate the analytical results obtained for a more abstract model of the system.

15 June 2015 in ACM SIGMETRICS Performance Evaluation Review
Verified
Journal Article
Open access
KGKristen Gardner
Kristen Gardner
SZSamuel Zbarsky
Samuel Zbarsky
SDSherwin Doroudi
Sherwin Doroudi
MHMor Harchol-Balter
Mor Harchol-Balter
EHEsa Hyytia
Esa Hyytia
Recent computer systems research has proposed using redundant requests to reduce latency. The idea is to run a request on multiple servers and wait for the first completion (discarding all remaining copies of the request). However there is no exact analysis of systems with redundancy. This paper presents the first exact analysis of systems with redundancy. We allow for any number of classes of redundant requests, any number of classes of non-redundant requests, any degree of redundancy, and any number of heterogeneous servers. In all cases we derive the limiting distribution on the state of the system. In small (two or three server) systems, we derive simple forms for the distribution of response time of both the redundant classes and non-redundant classes, and we quantify the "gain" to redundant classes and "pain" to non-redundant classes caused by redundancy. We find some surprising results. First, the response time of a fully redundant class follows a simple Exponential distribution and that of the non-redundant class follows a Generalized Hyperexponential. Second, fully redundant classes are "immune" to any pain caused by other classes becoming redundant. We also compare redundancy with other approaches for reducing latency, such as optimal probabilistic splitting of a class among servers (Opt-Split) and Join-the-Shortest-Queue (JSQ) routing of a class. We find that, in many cases, redundancy outperforms JSQ and Opt-Split with respect to overall response time, making it an attractive solution.

1 April 2011
Verified
Conference Paper
Closed access
EHEsa Hyytia
Esa Hyytia
JVJorma Virtamo
Jorma Virtamo
PLPasi Lassila
Pasi Lassila
JKJussi Kangasharju
Jussi Kangasharju
JOJorg Ott
Jorg Ott
We consider an opportunistic content sharing system designed to store and distribute local spatio-temporal “floating” information in uncoordinated P2P fashion relying solely on the mobile nodes passing through the area of interest, referred to as the anchor zone. Nodes within the anchor zone exchange the information in opportunistic manner, i.e., whenever two nodes come within each others' transmission range. Outside the anchor zone, the nodes are free to delete the information, since it is deemed relevant only for the nodes residing inside the anchor zone. Due to the random nature of the operation, there are no guarantees, e.g., for the information availability. By means of analytical models, we show that such a system, without any supporting infrastructure, can be a viable and surprisingly reliable option for content sharing as long as a certain criterion, referred to as the criticality condition, is met. The important quantity is the average number of encounters a randomly chosen node experiences during its sojourn time in the anchor zone, which again depends on the communication range and the mobility pattern. The theoretical studies are complemented with simulation experiments with various mobility models showing good agreement with the analytical results.