Demo Data from EDBT 2026 / reviewers in the wild / expert
Sumeet Sobti
dblp:42/5920
· DBLP profile ↗
7ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 3 · 2 first-authorComputer networks · 2 · 1 first-authorTheory of computation · 1
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
4 papers |
Storage systems · 43% Energy-efficient computing · 33% Embedded and real-time systems · 19% | |
| Computer networks
2 papers |
Network optimization and economics · 68% Internet of things and sensor networks · 32% | |
| Theoretical computer science
1 paper |
Computational geometry · 62% Graph algorithms and graph theory · 38% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network optimization and economics
digital divide |
0.1 | 2 | 2005 | Bridging the digital divide: storage media + postal network = generic high-bandwidth communication · ACM Trans. Storage 2005 Turning the postal system into a generic digital communication mechanism · SIGCOMM 2004 |
Internet of things and sensor networks
delay tolerant networks |
0.0 | 1 | 2004 | Turning the postal system into a generic digital communication mechanism · SIGCOMM 2004 |
Embedded and real-time systems
mobile computing |
0.0 | 1 | 2004 | Segank: A Distributed Mobile Storage System · FAST 2004 |
Storage systems › magnetic storage
hard disk drive |
0.0 | 1 | 2003 | Modeling Hard-Disk Power Consumption · FAST 2003 |
Energy-efficient computing › power modeling
power consumption modeling |
0.0 | 1 | 2003 | Modeling Hard-Disk Power Consumption · FAST 2003 |
Energy-efficient computing
power modeling |
0.0 | 1 | 2003 | Modeling Hard-Disk Power Consumption · FAST 2003 |
Storage systems › storage devices › storage media
mobile storage |
0.0 | 1 | 2002 | PersonalRAID: Mobile Storage for Distributed and Disconnected Computers · FAST 2002 |
Storage systems › storage devices
storage media |
0.0 | 1 | 2005 | Bridging the digital divide: storage media + postal network = generic high-bandwidth communication · ACM Trans. Storage 2005 |
Storage systems
distributed storage |
0.0 | 1 | 2004 | Segank: A Distributed Mobile Storage System · FAST 2004 |
Distributed systems › distributed system architecture › distributed operating systems
disconnected operation |
0.0 | 1 | 2002 | PersonalRAID: Mobile Storage for Distributed and Disconnected Computers · FAST 2002 |
Graph algorithms and graph theory › graph algorithms › network flow
generalized flow |
0.0 | 1 | 1999 | The Table Layout Problem · SCG 1999 |
Graph algorithms and graph theory › graph algorithms
network flow |
0.0 | 1 | 1999 | The Table Layout Problem · SCG 1999 |
Methods — techniques the papers use, named apart from their topics
store-and-forward · 0.0distributed mobile storage · 0.0personal RAID · 0.0linear programming · 0.0convex hull computation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Bridging the digital divide: storage media + postal network = generic high-bandwidth communicationabstractMaking high-bandwidth Internet access pervasively available to a large worldwide audience is a difficult challenge, especially in many developing regions. As we wait for the uncertain takeoff of technologies that promise to improve the situation, we propose to explore an approach that is potentially more easily realizable: the use of digital storage media transported by the postal system as a general digital communication mechanism. We shall call such a system a Postmanet . Compared to more conventional wide-area connectivity options, the Postmanet has several important advantages, including wide global reach, great bandwidth potential, low cost, and ease of incremental adoption. While the idea of sending digital content via the postal system is not a new one, none of the existing attempts have turned the postal system into a generic and transparent communication channel that not only can cater to a wide array of applications, but also effectively manage the many idiosyncrasies associated with using the postal system. In the proposed Postmanet, we see two recurring themes at many different levels of the system. One is the simultaneous exploitation of the Internet and the postal system so we can combine their latency and bandwidth advantages. The other is the exploitation of the abundant capacity and bandwidth of the Postmanet to improve its latency, cost, and reliability. Sumeet Sobti, Junwen Lai, Fengzhou Zheng, Kai Li 0001, Randolph Y. Wang, Arvind Krishnamurthy |
ACM Trans. Storage | 2 |
| 2004 | Segank: A Distributed Mobile Storage System
Sumeet Sobti, Fengzhou Zheng, Junwen Lai, Yilei Shao, Chi Zhang 0070, Elisha Ziskind, Arvind Krishnamurthy, Randolph Y. Wang |
FAST | 1 |
| 2004 | Network-Embedded Programmable Storage and Its Applications
Sumeet Sobti, Junwen Lai, Yilei Shao, Chi Zhang 0070, Ming Zhang 0005, Fengzhou Zheng, Arvind Krishnamurthy, Randolph Y. Wang |
NETWORKING | 1 |
| 2004 | Turning the postal system into a generic digital communication mechanismabstractThe phenomenon that rural residents and people with low incomes lag behind in Internet access is known as the "digital divide." This problem is particularly acute in developing countries, where most of the world's population lives. Bridging this digital divide, especially by attempting to increase the accessibility of broadband connectivity, can be challenging. The improvement of wide-area connectivity is constrained by factors such as how quickly we can dig ditches to bury fibers in the ground; and the cost of furnishing "last-mile" wiring can be prohibitively high.In this paper, we explore the use of digital storage media transported by the postal system as a general digital communication mechanism. While some companies have used the postal system to deliver software and movies, none of them has turned the postal system into a truly generic digital communication medium supporting a wide variety of applications. We call such a generic system a Postmanet. Compared to traditional wide-area connectivity options, the Postmanet has several important advantages, including wide global reach, great bandwidth potential and low cost.Manually preparing mobile storage devices for shipment may appear deceptively simple, but with many applications, communicating parties and messages, manual management becomes infeasible, and systems support at several levels becomes necessary. We explore the simultaneous exploitation of the Internet and the Postmanet, so we can combine their latency and bandwidth advantages to enable sophisticated bandwidth-intensive applications. Randolph Y. Wang, Sumeet Sobti, Elisha Ziskind, Junwen Lai, Arvind Krishnamurthy |
SIGCOMM | 2 |
| 2003 | Modeling Hard-Disk Power Consumption
John Zedlewski, Sumeet Sobti, Fengzhou Zheng, Arvind Krishnamurthy, Randolph Y. Wang |
FAST | 2 |
| 2002 | PersonalRAID: Mobile Storage for Distributed and Disconnected Computers
Sumeet Sobti, Chi Zhang 0070, Arvind Krishnamurthy, Randolph Y. Wang |
FAST | 1 |
| 1999 | The Table Layout ProblemabstractIn this paper we study a geometric problem arising in typography: the problem of laying out a two dimensional table. Each cell of the table has content associated with it. We may have choices on the geometry of cells (e.g., number of rows to use for the text in a cell.) The problem is to choose configurations for the cells to optimize an objective function such as minimum table height given a fixed width for the table. We formulate a combinatorial version of the table layout problem, where the objective is to choose cell geometry to minimize table size. The table layout problem is NP-complete, even for very restricted instances. One of our main results is an algorithm for computing the convex hull of the set of feasible table configurations, which gives a heuristic algorithm for table layout. We establish a connection between the fractional (LP) solution to the table layout problem and generalized network flow. We also present experimental results comparing the performance of heuristic... Richard J. Anderson 0001, Sumeet Sobti |
SCG | 2 |