Maarten van Steen

Maarten van Steen

orcid

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

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

Representative Publications

View All Publications
1 August 2007 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
MJMárk Jelasity
Márk Jelasity
SVSpyros Voulgaris
Spyros Voulgaris
RGRachid Guerraoui
Rachid Guerraoui
AKAnne-Marie Kermarrec
Anne-Marie Kermarrec
MSMaarten van Steen
Maarten van Steen
Gossip-based communication protocols are appealing in large-scale distributed applications such as information dissemination, aggregation, and overlay topology management. This paper factors out a fundamental mechanism at the heart of all these protocols: the peer-sampling service. In short, this service provides every node with peers to gossip with. We promote this service to the level of a first-class abstraction of a large-scale distributed system, similar to a name service being a first-class abstraction of a local-area system. We present a generic framework to implement a peer-sampling service in a decentralized manner by constructing and maintaining dynamic unstructured overlays through gossiping membership information itself. Our framework generalizes existing approaches and makes it easy to discover new ones. We use this framework to empirically explore and compare several implementations of the peer-sampling service. Through extensive simulation experiments we show that---although all protocols provide a good quality uniform random stream of peers to each node locally---traditional theoretical assumptions about the randomness of the unstructured overlays as a whole do not hold in any of the instances. We also show that different design decisions result in severe differences from the point of view of two crucial aspects: load balancing and fault tolerance. Our simulations are validated by means of a wide-area implementation.

1 June 2005 in Journal of Network and Systems Management
Verified
Journal Article
Closed access
PDF file
SVSpyros Voulgaris
Spyros Voulgaris
DGDaniela Gavidia
Daniela Gavidia
MSMaarten van Steen
Maarten van Steen

1 July 2009 in Computer Networks
Verified
Journal Article
Closed access
GUGuido Urdaneta
Guido Urdaneta
GPGuillaume Pierre
Guillaume Pierre
MSMaarten van Steen
Maarten van Steen

1 May 2007 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
JPJ. A. Pouwelse
J. A. Pouwelse
PGP. Garbacki
P. Garbacki
JWJ. Wang
J. Wang
ABA. Bakker
A. Bakker
JYJ. Yang
J. Yang
HSH. J. Sips
H. J. Sips

1 May 2012
Verified
Conference Paper
Open access
CRChristian Rossow
Christian Rossow
CDChristian J. Dietrich
Christian J. Dietrich
CGChris Grier
Chris Grier
CKChristian Kreibich
Christian Kreibich
VPVern Paxson
Vern Paxson
MSMaarten van Steen
Maarten van Steen
Malware researchers rely on the observation of malicious code in execution to collect datasets for a wide array of experiments, including generation of detection models, study of longitudinal behavior, and validation of prior research. For such research to reflect prudent science, the work needs to address a number of concerns relating to the correct and representative use of the datasets, presentation of methodology in a fashion sufficiently transparent to enable reproducibility, and due consideration of the need not to harm others. In this paper we study the methodological rigor and prudence in 36 academic publications from 2006-2011 that rely on malware execution. 40% of these papers appeared in the 6 highest-ranked academic security conferences. We find frequent shortcomings, including problematic assumptions regarding the use of execution-driven datasets (25% of the papers), absence of description of security precautions taken during experiments (71% of the articles), and oftentimes insufficient description of the experimental setup. Deficiencies occur in top-tier venues and elsewhere alike, highlighting a need for the community to improve its handling of malware datasets. In the hope of aiding authors, reviewers, and readers, we frame guidelines regarding transparency, realism, correctness, and safety for collecting and using malware datasets.

1 January 2011 in ACM Computing Surveys
Verified
Journal Article
Open access
GUGuido Urdaneta
Guido Urdaneta
GPGuillaume Pierre
Guillaume Pierre
MSMaarten van Steen
Maarten van Steen
Peer-to-peer networks based on distributed hash tables (DHTs) have received considerable attention ever since their introduction in 2001. Unfortunately, DHT-based systems have been shown to be notoriously difficult to protect against security attacks. Various reports have been published that discuss or classify general security issues, but so far a comprehensive survey describing the various proposed defenses has been lacking. In this article, we present an overview of techniques reported in the literature for making DHT-based systems resistant to the three most important attacks that can be launched by malicious nodes participating in the DHT: (1) the Sybil attack, (2) the Eclipse attack, and (3) routing and storage attacks. We review the advantages and disadvantages of the proposed solutions and, in doing so, confirm how difficult it is to secure DHT-based systems in an adversarial environment.