Brian Chang

dblp:323/9359 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2026
0000-0002-2018-8704ORCID · corroborated

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

Computer networks · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
4 papers
Software-defined and programmable networks · 34% Datacenter networks · 34% Routing and switching · 17%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › control plane
control plane partitioning
1.822026
Virtual Slicing: Achieving Control Plane Availability and Traffic Engineering Efficiency in Data Centers · IEEE Trans. Netw. 2026
Balancing Sdn Control Plane Availability and Traffic Engineering Efficiency in Data Centers · ICNP 2024
Datacenter networks
load balancing
1.822026
Virtual Slicing: Achieving Control Plane Availability and Traffic Engineering Efficiency in Data Centers · IEEE Trans. Netw. 2026
Balancing Sdn Control Plane Availability and Traffic Engineering Efficiency in Data Centers · ICNP 2024
Software-defined and programmable networks
SDN control plane
1.822026
Virtual Slicing: Achieving Control Plane Availability and Traffic Engineering Efficiency in Data Centers · IEEE Trans. Netw. 2026
Balancing Sdn Control Plane Availability and Traffic Engineering Efficiency in Data Centers · ICNP 2024
Routing and switching
traffic engineering
1.822026
Virtual Slicing: Achieving Control Plane Availability and Traffic Engineering Efficiency in Data Centers · IEEE Trans. Netw. 2026
Balancing Sdn Control Plane Availability and Traffic Engineering Efficiency in Data Centers · ICNP 2024
Datacenter networks › datacenter transport
flow completion time optimization
0.812024
Balancing Sdn Control Plane Availability and Traffic Engineering Efficiency in Data Centers · ICNP 2024
Content delivery and video streaming › content delivery network
CDN caching
0.712023
Darwin: Flexible Learning-based CDN Caching · SIGCOMM 2023
Cloud and datacenter computing › datacenter network
datacenter network management
0.522026
Virtual Slicing: Achieving Control Plane Availability and Traffic Engineering Efficiency in Data Centers · IEEE Trans. Netw. 2026
Balancing Sdn Control Plane Availability and Traffic Engineering Efficiency in Data Centers · ICNP 2024

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

measurement study · 2.0traffic engineering · 1.5simulation · 1.5unsupervised clustering · 0.7reinforcement learning · 0.7neural bandit · 0.7
YearPublicationVenuePosition
2026 Express Lane to Efficiency and Reliability: Multi-Dimensional Control in Meta's Express Backbone Network
Faisal Iqbal, Vitaly Neganov, Brian Chang, Rong Rong, Yuanjun Yao, Marek Denis, Alexandru Manea, Anton Marchenko, Ulas Kozat, Aditya Akella, Ying Zhang 0022
NSDI3
2026 Virtual Slicing: Achieving Control Plane Availability and Traffic Engineering Efficiency in Data Centers
abstract
Many proposals have demonstrated the efficiency advantages of software-defined networking (SDN) in managing data center networks. Common practices employ centralized traffic engineering (TE) in the SDN control plane to optimize load balancing and throughput. Meanwhile, for high availability purposes, the control plane is partitioned to ensure the impact of a single faulty controller is contained. However, the interaction between these two aspects is often overlooked. In particular, we show that the current control plane partitioning approach leads to imbalanced link loads and degraded application performance. To address this issue, we proposevirtual slicing, a new control plane partitioning scheme. Virtual slicing achieves desirable traffic engineering performance while retaining the availability guarantees from the current approach. Virtual slicing is implemented and evaluated with real-world and synthetic traffic traces on production spine-free data center networks. Results show that virtual slicing reduces tail link utilizations by up to 28.4%, and improves flow completion times by up to 36%.
Brian Chang, Keqiang He, Shawn Shuoshuo Chen, Mingyang Zhang 0005, Wenfei Wu, Fan Wu 0006, Chen Tian 0001, Aditya Akella
IEEE Trans. Netw.1
2024 Balancing Sdn Control Plane Availability and Traffic Engineering Efficiency in Data Centers
abstract
Many proposals have demonstrated the efficiency advantages of software-defined networking (SDN) in managing data center networks. Common practices employ centralized traffic engineering (TE) in the SDN control plane to optimize load balancing and throughput. Meanwhile, for high availability purposes, the control plane is partitioned to ensure the impact of a single faulty controller is contained. However, the interaction between these two aspects is often overlooked. In particular, we show that the current control plane partitioning approach leads to imbalanced link loads and degraded application performance. To address this issue, we propose virtual slicing, a new control plane partitioning scheme. Virtual slicing achieves desirable traffic engineering performance while retaining the availability guarantees from the current approach. Virtual slicing is implemented and evaluated with real-world and synthetic traffic traces on production spine-free data center networks. Results show that virtual slicing reduces tail link utilizations by up to 28.4 %, and improves flow completion times by up to 36 %.
Brian Chang, Keqiang He, Shawn Shuoshuo Chen, Mingyang Zhang 0005, Wenfei Wu, Aditya Akella
ICNP1
2024 CLEFT: Language-Image Contrastive Learning with Efficient Large Language Model and Prompt Fine-Tuning
Yuexi Du, Brian Chang, Nicha C. Dvornek
MICCAI (12)2
2024 Learned load balancing
Brian Chang, Kausik Subramanian, Loris D'Antoni, Aditya Akella
Theor. Comput. Sci.1
2023 Darwin: Flexible Learning-based CDN Caching
abstract
Cache management is critical for Content Delivery Networks (CDNs), impacting their performance and operational costs. Most production CDNs apply static, hand-tuned caching policy parameters at cache servers, such as admission frequency or size thresholds for the Hot Object Caches (HOC) of their system. However, these static policies fall short when a server is faced with unpredictable traffic pattern changes, even when policies employ multiple control parameters/knobs. Recent approaches have proposed learning-based solutions to dynamically adjust policy parameters, but they are limited in action space, caching objectives, or impose high overhead. We propose Darwin, a CDN cache management system that is robust to traffic pattern changes and can flexibly optimize different caching objectives with unrestricted action spaces. Darwin employs a three-stage pipeline involving traffic pattern feature collection, unsupervised clustering for classification, and neural bandit expert selection to choose the optimal caching policy. Through extensive simulations, experiments using an Apache Traffic Server (ATS)-based prototype, and theoretical analysis, we show that Darwin achieves significant performance gain w.r.t. different objectives such as maximizing object hit rates and minimizing disk writes, while simultaneously adapting to traffic pattern shifts. Darwin imposes negligible overhead and achieves high throughput compared to the state-of-the-art.
Nihal Sharma, Tarannum Khan, Brian Chang, Aditya Akella, Sanjay Shakkottai, Ramesh K. Sitaraman
SIGCOMM5