Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jingsong Meng

dblp:213/7794 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0008-4153-6772ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Computer 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 · 67% Cloud and datacenter computing · 33%
Computer networks
2 papers
Datacenter networks · 54% Routing and switching · 23% Network management and operations · 23%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Datacenter networks
RDMA
0.812024
RR-Compound: RDMA-Fused gRPC for Low Latency, High Throughput, and Easy Interface · IEEE Trans. Parallel Distributed Syst. 2024
Cloud and datacenter computing › datacenter network
datacenter communication
0.812024
RR-Compound: RDMA-Fused gRPC for Low Latency, High Throughput, and Easy Interface · IEEE Trans. Parallel Distributed Syst. 2024
Distributed systems › remote procedure call
RDMA-based RPC
0.812024
RR-Compound: RDMA-Fused gRPC for Low Latency, High Throughput, and Easy Interface · IEEE Trans. Parallel Distributed Syst. 2024
Distributed systems
remote procedure call
0.812024
RR-Compound: RDMA-Fused gRPC for Low Latency, High Throughput, and Easy Interface · IEEE Trans. Parallel Distributed Syst. 2024
Network management and operations
network control
0.312018
Experience-driven Networking: A Deep Reinforcement Learning based Approach · INFOCOM 2018
Routing and switching
traffic engineering
0.312018
Experience-driven Networking: A Deep Reinforcement Learning based Approach · INFOCOM 2018

Methods — techniques the papers use, named apart from their topics

gRPC · 1.5RDMA · 1.5prioritized experience replay · 0.3deep reinforcement learning · 0.3actor-critic · 0.3
YearPublicationVenuePosition
2024 RR-Compound: RDMA-Fused gRPC for Low Latency, High Throughput, and Easy Interface
abstract
Advanced data centers strive for high performance and throughput, which can be achieved through the desirable merits of Remote Procedure Call (RPC) programming model and the low latency of Remote Direct Memory Access (RDMA). However, despite the widespread availability of these software and hardware utilities, they have been utilized separately for their own applications in existing production systems for many years. Although researchers have attempted to develop RDMA-enabled RPC prototypes, they often face challenges such as API discrepancies and a lack of specific features for effective integration with major production software, rendering them incompatible. This industry R&D project aims to enhance the performance of gRPC, a widely utilized RPC framework in major companies, by integrating RDMA as an internal component. Our system solution, called, combines the simple user interface and other merits of gRPC with low latency for remote data accesses. RR-Compound is fully compatible with gRPC and can serve as a seamless replacement without altering existing applications. However, to achieve low latency, high throughput, and scalability for RR-Compound, several technical challenges in managing network connections and memory space utilization must be effectively addressed. To overcome the limitations of existing connection methods, we have developed a new method called BPEV that is independent of gRPC and applicable to all RDMA systems. We have also retained the asynchronous framework of gRPC, albeit with limited buffer space in RDMA memory management. In micro-benchmarks, RR-Compound outperforms mRPC - the state-of-the-art RPC framework for a large number of connections, achieving a 14.77% increase in throughput and a 42.55% reduction in latency. Subsequently, we compare RR-Compound with gRPC over IPoIB using two real-world applications: KV-Store and TensorFlow. RR-Compound achieves up to a 2.35x increase in throughput and reduces the average latency by 46.92%.
Liang Geng, Hao Wang 0002, Jingsong Meng, Dayi Fan, Sami Ben-Romdhane, Hari Kadayam Pichumani, Vinay Phegade, Xiaodong Zhang 0001
IEEE Trans. Parallel Distributed Syst.3
2018 Experience-driven Networking: A Deep Reinforcement Learning based Approach
abstract
Modern communication networks have become very complicated and highly dynamic, which makes them hard to model, predict and control. In this paper, we develop a novel experience-driven approach that can learn to well control a communication network from its own experience rather than an accurate mathematical model, just as a human learns a new skill (such as driving, swimming, etc). Specifically, we, for the first time, propose to leverage emerging Deep Reinforcement Learning (DRL) for enabling model-free control in communication networks; and present a novel and highly effective DRL-based control framework, DRL-TE, for a fundamental networking problem: Traffic Engineering (TE). The proposed framework maximizes a widely-used utility function by jointly learning network environment and its dynamics, and making decisions under the guidance of powerful Deep Neural Networks (DNNs). We propose two new techniques, TE-aware exploration and actor-critic-based prioritized experience replay, to optimize the general DRL framework particularly for TE. To validate and evaluate the proposed framework, we implemented it in ns-3, and tested it comprehensively with both representative and randomly generated network topologies. Extensive packet-level simulation results show that 1) compared to several widely-used baseline methods, DRL-TE significantly reduces end-to-end delay and consistently improves the network utility, while offering better or comparable throughput; 2) DRL-TE is robust to network changes; and 3) DRL-TE consistently outperforms a state-of-the-art DRL method (for continuous control), Deep Deterministic Policy Gradient (DDPG), which, however, does not offer satisfying performance.
Jian Tang 0008, Jingsong Meng, Weiyi Zhang 0001, Yanzhi Wang 0001, Chi Harold Liu, Dejun Yang
INFOCOM3