Demo Data from EDBT 2026 / reviewers in the wild / expert
Qixuan Jin
dblp:260/8587
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0008-2861-5927ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 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 networks
1 paper |
Routing and switching · 44% Internet architecture and protocols · 44% Edge and fog computing · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › multicast
multicast scheduling |
0.7 | 1 | 2023 | Cost-Efficient Scheduling of Multicast Transfers With Deadline Guarantees Across Edge Datacenters · IEEE Trans. Serv. Comput. 2023 |
Routing and switching
traffic engineering |
0.7 | 1 | 2023 | Cost-Efficient Scheduling of Multicast Transfers With Deadline Guarantees Across Edge Datacenters · IEEE Trans. Serv. Comput. 2023 |
Edge and fog computing › edge cloud
edge datacenter |
0.2 | 1 | 2023 | Cost-Efficient Scheduling of Multicast Transfers With Deadline Guarantees Across Edge Datacenters · IEEE Trans. Serv. Comput. 2023 |
Methods — techniques the papers use, named apart from their topics
steiner tree · 0.7randomized rounding · 0.7linear program relaxation · 0.7adaptive routing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Cost-Efficient Scheduling of Multicast Transfers With Deadline Guarantees Across Edge DatacentersabstractModerate-scale datacenters are increasingly deployed at the network edge to support low-latency and high-bandwidth internet of Things (IoT) and 5G applications. These applications usually have bulk data to transfer from one datacenter to several datacenters, which can cause a significant amount of bandwidth costs. Traffic engineering (TE) systems at the network edge must minimize the bandwidth costs of multicast transfers across edge datacenters. To avoid service quality degradation, TE should also guarantee transfer deadlines, which have received little attention in existing work. Due to the dynamic bandwidth pricing schemes, it is challenging to strike a good balance between minimizing costs and guaranteeing transfer deadlines. In this paper, we present CDScheduler a cost-efficient scheduling solution for multicast transfers with deadline guarantees. To reduce bandwidth costs, CDScheduler uses Steiner trees for forwarding and adaptive routing that considers bandwidth price variation and transfer demands. We formulate the cost-efficient multicast transfer scheduling problem and propose an algorithm based on linear program relaxation and randomized rounding to find a solution that guarantees timely completion and reduces cost. Extensive evaluations show that CDScheduler can reduce bandwidth cost significantly and outperforms the state-of-the-art solutions by cutting down up to 78% bandwidth cost. Long Luo, Qixuan Jin, Jingzhao Xie, Gang Sun 0001, Hong-Fang Yu |
IEEE Trans. Serv. Comput. | 2 |
| 2020 | PSNet: Reconfigurable network topology design for accelerating parameter server architecture based distributed machine learning
Qixuan Jin, Dan Wang 0009, Hong-Fang Yu, Gang Sun 0001, Shouxi Luo |
Future Gener. Comput. Syst. | 2 |
| 2020 | Job scheduling for distributed machine learning in optical WAN
Hong-Fang Yu, Gang Sun 0001, Long Luo, Qixuan Jin, Shouxi Luo |
Future Gener. Comput. Syst. | 5 |