Vinayak Dangui

dblp:95/11344 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0001-8403-6064ORCID · corroborated

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

Computer networks · 3 · 1 first-author · 3 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
2 papers
Network optimization and economics · 47% Network management and operations · 32% Wireless networking · 22%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource sharing
network sharing
0.612022
Network entitlement: contract-based network sharing with agility and SLO guarantees · SIGCOMM 2022
Wireless networking
cross-layer optimization
0.512021
Capacity-efficient and uncertainty-resilient backbone network planning with hose · SIGCOMM 2021
Network optimization and economics
hose model
0.512021
Capacity-efficient and uncertainty-resilient backbone network planning with hose · SIGCOMM 2021

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

simulation · 1.1distributed enforcement · 1.1heuristic algorithm · 0.5
YearPublicationVenuePosition
2026 Achieving Network Efficiency Through Service Collaborative Capacity Sharing and Enforcement
abstract
Meta's rapid expansion in users, business operations, and AI workloads is straining our backbone network, while physical constraints—such as fiber, space, and power—limit the speed of capacity growth. To address these challenges, we present a service-aware network capacity planning suite that systematically improves network efficiency with a service collaboration approach. We propose the "safe capacity" abstraction which enables services to incorporate current and projected network conditions into their compute and storage allocation decisions. We introduce a hose-carving method that efficiently translates service-level traffic demands into detailed traffic matrices, allowing for more precise bandwidth allocation. To promote responsible network usage, we design a network rate card which attributes network consumption to individual services, incentivizing optimization and resource trade-offs. Additionally, new enforcement features at the end-host layer dynamically adjust resource allocations and traffic flows at runtime to maximize utilization. This paper is the first to detail a collaborative, service-aware approach to backbone network efficiency at Meta scale. Based on years of operational experience, we share practical insights and highlight new directions for research in network efficiency.
Vinayak Dangui, Alaleh Razmjoo, Guanqing Yan, Mahesh Nayak, Mansi Babbar, Brian Bierig, Tejas Birajdar, Prabhakaran Ganesan, Lilian Liu, Matt Maia, Jerry Yang, Shrinivas Petale, Satyajeet Ahuja, Abhinav Triguna, Guyue Liu, Ying Zhang 0022
SIGCOMM1
2022 Network entitlement: contract-based network sharing with agility and SLO guarantees
abstract
This paper presents Meta's Production Wide Area Network (WAN) Entitlement solution used by thousands of Meta's services to share the network safely and efficiently. We first introduce the Network Entitlement problem, i.e., how to share WAN bandwidth across services with flexibility and SLO guarantees. We present a new abstraction entitlement contract, which is stable, simple, and operationally friendly. The contract defines services' network quota and is set up between the network team and services teams to govern their obligations. Our framework includes two key parts: (1) an entitlement granting system that establishes an agile contract while achieving network efficiency and meeting long-term SLO guarantees, and (2) a large-scale distributed run-time enforcement system that enforces the contract on the production traffic. We demonstrate its effectiveness through extensive simulations and real-world end-to-end tests. The system has been deployed and operated for over two years in production. We hope that our years of experience provide a new angle to viewing WAN network sharing in production and will inspire follow-up research.
Satyajeet Ahuja, Vinayak Dangui, Kirtesh Patil, Manikandan Somasundaram, Mario A. Sánchez, Guanqing Yan, Mohammad Noormohammadpour, Alaleh Razmjoo, Grace Smith, Abhinav Triguna, Soshant Bali, Yuxiang Xiang, Prabhakaran Ganesan, Mikel Jimenez Fernandez, Petr Lapukhov, Guyue Liu, Ying Zhang 0022
SIGCOMM2
2021 Capacity-efficient and uncertainty-resilient backbone network planning with hose
abstract
This paper presents Facebook's design and operational experience of a Hose-based backbone network planning system. This initial adoption of the Hose model in network planning is driven by the capacity and demand uncertainty pressure of backbone expansion. Since the Hose model abstracts the aggregated traffic demand per site, peak traffic flows at different times can be multiplexed to save capacity and buffer traffic spikes. Our core design involves heuristic algorithms to select Hose-compliant traffic matrices and cross-layer optimization between the optical and IP networks. We evaluate the system performance in production and share insights from years of production experience. Hose-based network planning can save 17.4% capacity and drops 75% less traffic under fiber cuts. As the first study of Hose in network planning, our work has the potential to inspire follow-up research.
Satyajeet Ahuja, Vinayak Dangui, Soshant Bali, Abishek Gopalan, Petr Lapukhov, Yiting Xia, Ying Zhang 0022
SIGCOMM3