Demo Data from EDBT 2026 / reviewers in the wild / expert
Dianjun Wang
dblp:23/1410
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 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 networks
1 paper |
Routing and switching · 75% Vehicular, aerial and satellite networks · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching
adaptive routing |
0.2 | 1 | 2013 | Dynamic Fault-Tolerant Routing Based on FSA for LEO Satellite Networks · IEEE Trans. Computers 2013 |
Routing and switching
deadlock-free routing |
0.2 | 1 | 2013 | Dynamic Fault-Tolerant Routing Based on FSA for LEO Satellite Networks · IEEE Trans. Computers 2013 |
Routing and switching
fault-tolerant routing |
0.2 | 1 | 2013 | Dynamic Fault-Tolerant Routing Based on FSA for LEO Satellite Networks · IEEE Trans. Computers 2013 |
Vehicular, aerial and satellite networks › satellite networks
LEO satellite networks |
0.2 | 1 | 2013 | Dynamic Fault-Tolerant Routing Based on FSA for LEO Satellite Networks · IEEE Trans. Computers 2013 |
Methods — techniques the papers use, named apart from their topics
finite state automata · 0.2boundary diffusion · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Dynamic Fault-Tolerant Routing Based on FSA for LEO Satellite NetworksabstractWe formalize the construction of fault blocks by a state transition model based on finite state automata. Based on the model, a boundary diffusion method is presented for the rectilinear-monotone orthogonal convex fault model such as the rectangular fault model and minimal-connected-component (MCC) faulty model, whereby an adaptive fault-tolerant routing algorithm, called X-Y boundary routing algorithm (X-YBRA), is presented for deadlock-free fault-tolerant adaptive routing outside the fault blocks. To improve the network resources utilization, we put forward a routing diffusion method in the fault block, which completely solves the routing problem in the fault block. The experiment result shows that the diffusion overhead of our method is far lower than that of the traditional routing algorithms such as distance vector and link state routing algorithms with the light loss in convergence time. For the occurrence and recovery of random faults, the expansion and shrinkage of the fault block are also discussed. Accordingly, the dynamic boundary and routing updating methods are put forward to respond to these cases. Based on these methods, we develop low earth orbit satellite networks into an adaptive fault-tolerant system in routing. Our works can be also applied to other 2D mesh networks such as the interconnect multiprocessor computer systems. Youjian Zhao, Fuchun Sun 0001, Hongbo Li 0001, Dianjun Wang |
IEEE Trans. Computers | 5 |
| 2005 | Nonnegative time-frequency distributions for parametric time-frequency representations using semi-affine transformation group
Hongxing Zou, Dianjun Wang, Xian-Da Zhang, Yanda Li |
Signal Process. | 2 |