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

Steve Padgett

dblp:204/3447 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Computer networks · 2

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
Internet architecture and protocols · 40% Software-defined and programmable networks · 36% Routing and switching · 24%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 6 heaviest of 8, 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
Internet architecture and protocols › overlay networks
application-aware routing
0.312017
Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering · SIGCOMM 2017
Software-defined and programmable networks
SDN traffic engineering
0.312017
Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering · SIGCOMM 2017
Internet architecture and protocols
peering
0.112017
Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering · SIGCOMM 2017

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

two-stage matching/hashing · 0.7host-based routing · 0.3commodity switches · 0.3
YearPublicationVenuePosition
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
SIGCOMM12
2017 Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering
abstract
We present the design of Espresso, Google's SDN-based Internet peering edge routing infrastructure. This architecture grew out of a need to exponentially scale the Internet edge cost-effectively and to enable application-aware routing at Internet-peering scale. Espresso utilizes commodity switches and host-based routing/packet processing to implement a novel fine-grained traffic engineering capability. Overall, Espresso provides Google a scalable peering edge that is programmable, reliable, and integrated with global traffic systems. Espresso also greatly accelerated deployment of new networking features at our peering edge. Espresso has been in production for two years and serves over 22% of Google's total traffic to the Internet.
Kok-Kiong Yap, Murtaza Motiwala, Jeremy Rahe, Steve Padgett, Matthew J. Holliman, Gary Baldus, Marcus Hines, Taeeun Kim, Ashok Narayanan, Victor Lin, Colin Rice, Brian Rogan, Bert Tanaka, Manish Verma, Puneet Sood, Muhammad Mukarram Bin Tariq, Matt Tierney, Dzevad Trumic, Vytautas Valancius, Calvin Ying, Mahesh Kallahalla, Bikash Koley, Amin Vahdat
SIGCOMM4