Demo Data from VLDB 2026 / reviewers in the wild / expert
Ruixuan Qiao
dblp:209/6030
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—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 networks
1 paper |
Network optimization and economics · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network optimization and economics › throughput-optimal scheduling
back-pressure scheduling |
0.3 | 1 | 2018 | EABS: An Event-Aware Backpressure Scheduling Scheme for Emergency Internet of Things · IEEE Trans. Mob. Comput. 2018 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.3queue backlog analysis · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | EABS: An Event-Aware Backpressure Scheduling Scheme for Emergency Internet of ThingsabstractThe backpressure scheduling scheme has been applied in Internet of Things, which can control the network congestion effectively and increase the network throughput. However, in large-scale Emergency Internet of Things (EIoT), emergency packets may exist because of the urgent events or situations. The traditional backpressure scheduling scheme will explore all the possible routes between the source and destination nodes that cause a superfluous long path for packets. Therefore, the end-to-end delay increases and the real-time performance of emergency packets cannot be guaranteed. To address this shortcoming, this paper proposes EABS, an event-aware backpressure scheduling scheme for EIoT. A backpressure queue model with emergency packets is first devised based on the analysis of the arrival process of different packets. Meanwhile, EABS combines the shortest path with backpressure scheme in the process of next-hop node selecting. The emergency packets are forwarded in the shortest path and avoid the network congestion according to the queue backlog difference. The extensive experiment results verify that EABS can reduce the average end-to-end delay and increase the average forwarding percentage. For the emergency packets, the real-time performance is guaranteed. Moreover, we compare EABS with two existing backpressure scheduling schemes, showing that EABS outperforms both of them. Tie Qiu 0001, Ruixuan Qiao, Dapeng Oliver Wu |
IEEE Trans. Mob. Comput. | 2 |