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

Mohammad Al-Fares

dblp:77/2383 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
2since 2021 · last 2026
0009-0003-5766-2128ORCID · corroborated

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

Computer networks · 7 · 5 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 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
6 papers
Network management and operations · 28% Internet architecture and protocols · 21% Software-defined and programmable networks · 14%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network topology
hierarchical network topology
0.312018
B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google's software-defined WAN · SIGCOMM 2018
Software-defined and programmable networks › SDN applications
software-defined WAN
0.312018
B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google's software-defined WAN · SIGCOMM 2018
Routing and switching
traffic engineering
0.312018
B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google's software-defined WAN · SIGCOMM 2018
Content delivery and video streaming › web performance
page load time
0.112011
Overclocking the Yahoo!: CDN for faster web page loads · Internet Measurement Conference 2011
Datacenter networks
flow scheduling
0.112010
Hedera: Dynamic Flow Scheduling for Data Center Networks · NSDI 2010
Transport protocols and congestion control › transport protocol performance
bandwidth scalability
0.112008
A scalable, commodity data center network architecture · SIGCOMM 2008
Datacenter networks
data center network topology
0.112008
A scalable, commodity data center network architecture · SIGCOMM 2008
Internet architecture and protocols
network topology
0.112008
A scalable, commodity data center network architecture · SIGCOMM 2008
Internet architecture and protocols › world wide web › web protocols
HTTP
0.012011
Overclocking the Yahoo!: CDN for faster web page loads · Internet Measurement Conference 2011
Internet architecture and protocols › local area network
ethernet
0.012010
SPAIN: COTS Data-Center Ethernet for Multipathing over Arbitrary Topologies · NSDI 2010
Network performance modeling
network utilization
0.012010
Hedera: Dynamic Flow Scheduling for Data Center Networks · NSDI 2010
Cloud and datacenter computing
datacenter infrastructure
0.012008
A scalable, commodity data center network architecture · SIGCOMM 2008

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

two-stage matching/hashing · 0.7measurement · 0.1
YearPublicationVenuePosition
2026 GGN: Experiences in Designing and Deploying the Next-Generation Google Global Network
abstract
Cloud and AI/ML workloads are posing unprecedented new requirements on the wide-area network: it must combine strict availability, massive growth, and feature agility. It became increasingly clear that traditional WAN designs were ill-equipped to adapt to these requirements.
Mohammad Al-Fares, Richard Alimi, Arda Balkanay, Dennis Fetterly, Chi-Yao Hong, Nachikethas A. Jagadeesan, Bikash Koley, Priya Mahadevan, Subhasree Mandal, Warren Martins, Arjun Muralidharan, Namrata Pralhad Kadam, Aman Shaikh, Anees Shaikh, Rob Shakir, Sankalp Singh, Charith Wickramaarachchi, Jonathan Zolla
SIGCOMM1
2023 Change Management in Physical Network Lifecycle Automation
Mohammad Al-Fares, Virginia Beauregard, Kevin Grant, Angus Griffith, Jahangir Hasan, Quan Leng, Alexander Lin, Zhuotao Liu, Ahmed Mansy, Bill Martinusen, Nikil Mehta, Jeffrey C. Mogul, Andrew Narver, Anshul Nigham, Melanie Obenberger, Kurt Steinkraus, Edward Thiele, Amin Vahdat
USENIX ATC1
2018 B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google's software-defined WAN
abstract
Private WANs are increasingly important to the operation of enterprises, telecoms, and cloud providers. For example, B4, Google's private software-defined WAN, is larger and growing faster than our connectivity to the public Internet. In this paper, we present the five-year evolution of B4. We describe the techniques we employed to incrementally move from offering best-effort content-copy services to carrier-grade availability, while concurrently scaling B4 to accommodate 100x more traffic. Our key challenge is balancing the tension introduced by hierarchy required for scalability, the partitioning required for availability, and the capacity asymmetry inherent to the construction and operation of any large-scale network. We discuss our approach to managing this tension: i) we design a custom hierarchical network topology for both horizontal and vertical software scaling, ii) we manage inherent capacity asymmetry in hierarchical topologies using a novel traffic engineering algorithm without packet encapsulation, and iii) we re-architect switch forwarding rules via two-stage matching/hashing to deal with asymmetric network failures at scale.
Chi-Yao Hong, Subhasree Mandal, Mohammad Al-Fares, Richard Alimi, Kondapa Naidu Bollineni, Chandan Bhagat, Sourabh Jain, Jay Kaimal, Shiyu Liang, Kirill Mendelev, Steve Padgett, Faro Rabe, Saikat Ray, Malveeka Tewari, Matt Tierney, Monika Zahn, Jonathan Zolla, Joon Ong, Amin Vahdat
SIGCOMM3
2012 NetBump: user-extensible active queue management with bumps on the wire
abstract
Engineering large-scale data center applications built from thousands of commodity nodes requires both an underlying network that supports a wide variety of traffic demands, and low latency at microsecond timescales. Many ideas for adding innovative functionality to networks, especially active queue management strategies, require either modifying packets or performing alternative queuing to packets in-flight on the data plane. However, configuring packet queuing, marking, and dropping is challenging, since buffering in commercial switches and routers is not programmable.
Mohammad Al-Fares, Rishi Kapoor, George Porter, Sambit Das, Hakim Weatherspoon, Balaji Prabhakar, Amin Vahdat
ANCS1
2011 Overclocking the Yahoo!: CDN for faster web page loads
abstract
Fast-loading web pages are key for a positive user experience. Unfortunately, a large number of users suffer from page load times of many seconds, especially for pages with many embedded objects. Most of this time is spent fetching the page and its objects over the Internet.
Mohammad Al-Fares, Khaled Elmeleegy, Benjamin C. Reed, Igor Gashinsky
Internet Measurement Conference1
2010 Hedera: Dynamic Flow Scheduling for Data Center Networks
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, Amin Vahdat
NSDI1
2010 SPAIN: COTS Data-Center Ethernet for Multipathing over Arbitrary Topologies
Jayaram Mudigonda, Praveen Yalagandula, Mohammad Al-Fares, Jeffrey C. Mogul
NSDI3
2008 A scalable, commodity data center network architecture
abstract
Today's data centers may contain tens of thousands of computers with significant aggregate bandwidth requirements. The network architecture typically consists of a tree of routing and switching elements with progressively more specialized and expensive equipment moving up the network hierarchy. Unfortunately, even when deploying the highest-end IP switches/routers, resulting topologies may only support 50% of the aggregate bandwidth available at the edge of the network, while still incurring tremendous cost. Non-uniform bandwidth among data center nodes complicates application design and limits overall system performance.
Mohammad Al-Fares, Alexander Loukissas, Amin Vahdat
SIGCOMM1