Demo Data from EDBT 2026 / reviewers in the wild / expert
D. M. Poduska
dblp:10/2744
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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
1 paper |
Distributed systems · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Computer networks
1 paper |
Internet architecture and protocols · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault tolerance › self-stabilization
self-stabilizing protocols |
0.0 | 1 | 1995 | A timing-based schema for stabilizing information exchange · ICNP 1995 |
Mathematical optimization › control theory
stabilization |
0.0 | 1 | 1995 | A timing-based schema for stabilizing information exchange · ICNP 1995 |
Methods — techniques the papers use, named apart from their topics
timing-based actions · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | A timing-based schema for stabilizing information exchangeabstractThe paradigm of information exchange provides a basis for nodes in a network to stay up-to-date with the recent information in the network. In this paradigm, nodes cooperate with each other to share their current information. We present a simple and uniform schema for building information exchange protocols that are stabilizing, in the following strong sense. Starting from arbitrary state, the protocols reach within bounded real-time a state from where all nodes remain up-to-date with recent information in the network. The ability to stabilize in bounded time is achieved by using timing-based actions. The timing constraints on these actions can be systematically adapted to suit a variety of network loads, delay requirements, and scheduling restrictions and to tolerate out-of-phase and drift-prone node clocks. Our schema also tolerates any number of topological changes in the network. Moreover, it accommodates information that is time-varying as well as it does information that is fixed. It is thus well-suited to dynamic high speed networks. Anish Arora, D. M. Poduska |
ICNP | 2 |