Demo Data from EDBT 2026 / reviewers in the wild / expert
Niels Zeilemaker
dblp:20/10575
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% | |
| Computer graphics and multimedia
1 paper |
Multimedia systems and quality of experience · 100% | |
| Network and information security
1 paper |
Authentication and access control · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
peer-to-peer systems |
0.1 | 1 | 2011 | Tribler: P2P media search and sharing · ACM Multimedia 2011 |
Multimedia systems and quality of experience
multimedia streaming |
0.0 | 1 | 2011 | Tribler: P2P media search and sharing · ACM Multimedia 2011 |
Authentication and access control › trust management
reputation systems |
0.0 | 1 | 2011 | Tribler: P2P media search and sharing · ACM Multimedia 2011 |
Methods — techniques the papers use, named apart from their topics
peer-to-peer streaming · 0.4bittorrent protocol · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | 100 Million DHT repliesabstractCrawling a DHT allows researchers to monitor the behaviour of peers, determine their geographic location, etc. However, it has always been an error-prone process as it is not feasible to capture a full snapshot of the Mainline DHT in a timely manner. Therefore, researchers have developed approximation methods which can run on subsets of the DHT and extrapolate those in order to reason on the size and structure of the complete DHT. However, in this paper we introduce a new method of collecting information on peers connected to a DHT. We exploit the caches present at bootstrap servers to collect information on peers which are currently connected. Originally added to the bootstrap servers in order to be able to withstand more than 20,000 requests for peers each second, we now use the same mechanism as peers bootstrapping into the DHT to discover more than 20 Million peers in less than 2 hours. Using the bootstrap servers, we discover more than twice as many peers as BitMon, which crawls a subset of the DHT and then extrapolates. Moreover, in contrast to related work which often require highly customized/tuned BitTorrent clients, our script consists of 90 lines of Python code and runs on a simple laptop. Niels Zeilemaker, Johan A. Pouwelse |
P2P | 1 |
| 2014 | 4P: Performant private peer-to-peer file sharingabstractIn recent years fully decentralized file sharing systems were developed aimed at improving anonymity among their users. These systems provide typical file sharing features such as searching for and downloading files. However, elaborate schemes originally aimed at improving anonymity cause partial keyword matching to be virtually impossible, or introduce a substantial bandwidth overhead. In this paper we introduce 4P, a system that provides users with anonymous search on top of a semantic overlay. The semantic overlay allows users to efficiently locate files using partial keyword matching, without having to resort to an expensive flooding operation. Included into 4P are a number of privacy enhancing features such as probabilistic query forwarding, path uncertainty, caching, and encrypted links. Moreover, we integrate a content retrieval channel into our protocol allowing users to start downloading a file from multiple sources immediately without requiring all intermediate nodes to cache a complete copy. Using a trace-based dataset, we mimic a real-world query workload and show the cost and performance of search using six overlay configurations, comparing random, semantic, Gnutella, RetroShare, and OneSwarm to 4P. The state-of-the-art flooding based alternatives required approximately 10,000 messages to be sent per query, in contrast 4P only required 313. Showing that while flooding can achieve a high recall (more than 85% in our experiments) it is prohibitively expensive. With 4P we achieve a recall of 76% at a considerable reduction in messages sent. Niels Zeilemaker, Johan A. Pouwelse, Henk J. Sips |
P2P | 1 |
| 2013 | Open2Edit: A peer-to-peer platform for collaboration
Niels Zeilemaker, Mihai Capota, Johan A. Pouwelse |
Networking | 1 |
| 2011 | Tribler: P2P media search and sharingabstractTribler is an open-source software project facilitating search, streaming and sharing content using P2P technology. Over 800,000 people have used Tribler since the project started in 2005. The Tribler P2P core supports BitTorrent-compatible downloading, video on demand and live streaming. Aside from a regular desktop GUI that runs on multiple OSes, it can be installed as a browser plug-in, currently used by Wikipedia. Aditionally, it runs on a 450~MHz processor, showcasing future TV support. We continuously work on extensions and test out novel research ideas within our user base, resulting in sub-second content search, a reputation system for rewarding upload, and channels for content publishing and spam prevention. Presently, 1200 channels have been created, enabling rich multimedia communities without requiring any server. Niels Zeilemaker, Mihai Capota, Arno Bakker, Johan A. Pouwelse |
ACM Multimedia | 1 |
| 2011 | Tribler: Search and streamabstractTribler is an open-source software project facilitating searching, streaming and sharing content using P2P technology that has been used by over 800 000 people. The Tribler P2P core supports BitTorrent-compatible downloading, video on demand and live streaming. We continuously work on extensions and test out novel research ideas within our user base, resulting in sub-second content search, a reputation system for rewarding upload, and channels for content publishing and spam prevention. Niels Zeilemaker, Mihai Capota, Arno Bakker, Johan A. Pouwelse |
Peer-to-Peer Computing | 1 |