Demo Data from EDBT 2026 / reviewers in the wild / expert
Soubhik Deb
dblp:192/3565
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-4854-7203ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Security and privacy · 1 · 1 since 2021
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
2 papers |
Distributed systems · 80% Interconnection networks and networks-on-chip · 20% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › consensus
byzantine agreement |
0.7 | 1 | 2023 | Themis: Fast, Strong Order-Fairness in Byzantine Consensus · CCS 2023 |
Distributed systems › consensus › byzantine agreement
order-fairness |
0.7 | 1 | 2023 | Themis: Fast, Strong Order-Fairness in Byzantine Consensus · CCS 2023 |
Interconnection networks and networks-on-chip › network topology
network topology design |
0.4 | 1 | 2020 | Perigee: Efficient Peer-to-Peer Network Design for Blockchains · PODC 2020 |
Distributed systems
peer-to-peer systems |
0.4 | 1 | 2020 | Perigee: Efficient Peer-to-Peer Network Design for Blockchains · PODC 2020 |
Machine learning › Reinforcement learning
multi-armed bandit |
0.1 | 1 | 2020 | Perigee: Efficient Peer-to-Peer Network Design for Blockchains · PODC 2020 |
Methods — techniques the papers use, named apart from their topics
multi-armed bandit · 0.9byzantine fault tolerance · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Themis: Fast, Strong Order-Fairness in Byzantine ConsensusabstractWe introduce Themis, a scheme for introducing fair ordering of transactions into (permissioned) Byzantine consensus protocols with at most ƒ faulty nodes among n ≥ 4ƒ + 1. Themis enforces the strongest notion of fair ordering proposed to date. It also achieves standard liveness, rather than the weaker notion of previous work with the same fair ordering property. Mahimna Kelkar, Soubhik Deb, Sishan Long, Ari Juels, Sreeram Kannan |
CCS | 2 |
| 2020 | Perigee: Efficient Peer-to-Peer Network Design for BlockchainsabstractA key performance metric in blockchains is the latency between when a transaction is broadcast and when it is confirmed (the so-called, confirmation latency). While improvements in consensus techniques can lead to lower confirmation latency, a fundamental lower bound on confirmation latency is the propagation latency of messages through the underlying peer-to-peer (p2p) network (in Bitcoin, the propagation latency is several tens of seconds). The de facto p2p protocol used by Bitcoin and other blockchains is based on random connectivity: each node connects to a random subset of nodes. The induced p2p network topology can be highly suboptimal since it neglects geographical distance, differences in bandwidth, hash-power and computational abilities across peers. We present Perigee, a decentralized algorithm that automatically learns an efficient p2p topology tuned to the aforementioned network heterogeneities, purely based on peers' interactions with their neighbors. Motivated by the literature on the multi-armed bandit problem, Perigee optimally balances the tradeoff between retaining connections to known well-connected neighbors, and exploring new connections to previously-unseen neighbors. Experimental evaluations show that Perigee reduces the latency to broadcast by 33%. Lastly Perigee is simple, computationally lightweight, adversary-resistant, and compatible with the selfish interests of peers, making it an attractive p2p protocol for blockchains. Soubhik Deb, Shaileshh Bojja Venkatakrishnan, Sreeram Kannan, Kannan Srinivasan 0001 |
PODC | 2 |
| 2016 | Feasibility study of LTE middle-mile networks in TV White Spaces for rural IndiaabstractWith an intention to provide robust broadband connection to rural areas, Government of India is laying out optical fiber cables across the country connecting the rural offices (named Gram Panchayat) under the initiative BharatNet. This work explores the feasibility of implementing a middle-mile network from these Gram Panchayats to the nearby villages, where wireless clusters will be set up, using LTE-Advanced over TV White Spaces owing to excellent propagation characteristics of the frequencies in TV UHF band. A proportionally fair radio resource allocation over the middle-mile network is proposed that uses Coordinated Multipoint Technology offered by Long Term Evolution — Advanced (LTE-A) which satisfies the broadband requirement. The simulation results have shown that for a cell radius of Coordination Region below 5 km, a rate of 1 Mbps per end-user for rural population density of India is achievable, which is more than the 512 Kbps target rate prescribed by the Telecom Regulatory Authority of India (TRAI). N. Chaitanya Prasad, Soubhik Deb, Abhay Karandikar |
PIMRC | 2 |