George Varghese
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
George Varghese has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Todd Millstein
University of California, Los Angeles, USA
4 shared publications - Alan Tang
Microsoft, Redmond, WA, USA
3 shared publications Cristian Estan
University of California San Diego, San Diego, CA
2 shared publications- Rajdeep Mondal
UCLA, Los Angeles, California, USA
2 shared publications - Ryan Beckett
Microsoft Research, Redmond, USA
2 shared publications - Aniruddha Kushwaha
Indian Institute of Technology, Bombay, India
1 shared publication
Latest Publications
- Open Access
- 17 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 201-209
Software Managed Networks via Coarsening
- 17 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 201-209
Open AccessSoftware Managed Networks via Coarsening
- Open Access
- 17 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 176-183
Tackling Ambiguity in User Intent for LLM-based Network Configuration Synthesis
- 17 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 176-183
Open AccessTackling Ambiguity in User Intent for LLM-based Network Configuration Synthesis
- Open Access
- 18 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 142-149
If Layering is useful, why not Sublayering?
The Internet's success arose from classical layering: protocols like TCP and Ethernet can be independently understood, changed, debugged, verified, and offloaded to hardware using a clean service interface between layers. To accrue the same benefits at a finer grain, we suggest sublayering, i.e., layering recursively within each layer. We show that the data link and routing layers have natural sublayers. However, while TCP intuitively decomposes into sub-functions (connection management, reliable delivery, congestion control) common state variables like sequence numbers and window sizes entangle these functions, making sublayering difficult. We propose an alternate sublayered TCP with equivalent functionality which enables easily changing congestion control and connection management. We also argue that sublayering can help create robust and verified Internet protocol implementations akin to seL4 for Operating Systems. To this end, we describe early experiments with a verified sublayered implementation of a simple bit-stuffing protocol using Coq, and a verified monolithic implementation of a lightweight TCP using Dafny. We end with a set of challenges for sublayered protocols.
- 18 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 142-149
Open AccessIf Layering is useful, why not Sublayering?
The Internet's success arose from classical layering: protocols like TCP and Ethernet can be independently understood, changed, debugged, verified, and offloaded to hardware using a clean service interface between layers. To accrue the same benefits at a finer grain, we suggest sublayering, i.e., layering recursively within each layer. We show that the data link and routing layers have natural sublayers. However, while TCP intuitively decomposes into sub-functions (connection management, reliable delivery, congestion control) common state variables like sequence numbers and window sizes entangle these functions, making sublayering difficult. We propose an alternate sublayered TCP with equivalent functionality which enables easily changing congestion control and connection management. We also argue that sublayering can help create robust and verified Internet protocol implementations akin to seL4 for Operating Systems. To this end, we describe early experiments with a verified sublayered implementation of a simple bit-stuffing protocol using Coq, and a verified monolithic implementation of a lightweight TCP using Dafny. We end with a set of challenges for sublayered protocols.
- Top Cited PapersOpen Access
- 28 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 189-195
What do LLMs need to Synthesize Correct Router Configurations?
We investigate whether Large Language Models (e.g., GPT-4) can synthesize correct router configurations with reduced manual effort. We find GPT-4 works very badly by itself, producing promising draft configurations but with egregious errors in topology, syntax, and semantics. Our strategy, that we call Verified Prompt Programming, is to combine GPT-4 with verifiers, and use localized feedback from the verifier to automatically correct errors. Verification requires a specification and actionable localized feedback to be effective. We show results for two use cases: translating from Cisco to Juniper configurations on a single router, and implementing a no-transit policy on multiple routers. While human input is still required, if we define the leverage as the number of automated prompts to the number of human prompts, our experiments show a leverage of 10X for Juniper translation, and 6X for implementing the no-transit policy, ending with verified configurations.
- 28 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 189-195
Top Cited PapersOpen AccessWhat do LLMs need to Synthesize Correct Router Configurations?
We investigate whether Large Language Models (e.g., GPT-4) can synthesize correct router configurations with reduced manual effort. We find GPT-4 works very badly by itself, producing promising draft configurations but with egregious errors in topology, syntax, and semantics. Our strategy, that we call Verified Prompt Programming, is to combine GPT-4 with verifiers, and use localized feedback from the verifier to automatically correct errors. Verification requires a specification and actionable localized feedback to be effective. We show results for two use cases: translating from Cisco to Juniper configurations on a single router, and implementing a no-transit policy on multiple routers. While human input is still required, if we define the leverage as the number of automated prompts to the number of human prompts, our experiments show a leverage of 10X for Juniper translation, and 6X for implementing the no-transit policy, ending with verified configurations.
- Open Access
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 94-107
Lightyear: Using Modularity to Scale BGP Control Plane Verification
- 10 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 94-107
Open AccessLightyear: Using Modularity to Scale BGP Control Plane Verification
- Open Access
- 23 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 23 (1) , 1-26
Tuneman: Customizing Networks to Guarantee Application Bandwidth and Latency
We examine how to provide applications with dedicated bandwidth and guaranteed latency in a programmable mission-critical network. Unlike other SDN approaches such as B4 or SWAN, our system Tuneman optimizes both routes and packet schedules at each node to provide flows with sub-second bandwidth changes. Tuneman uses node-level optimization to compute node schedules in a slotted switch and does dynamic routing using a search procedure with Quality of Service– (QoS) based weights. This allows Tuneman to provide an efficient solution for mission-critical networks that have stringent QoS requirements. We evaluate Tuneman on a telesurgery network using a switch prototype built using FPGAs and also via simulations on India’s Tata Network. For mission-critical networks with multiple QoS levels, Tuneman has comparable or better utilization than SWAN while providing delay bounds guarantees.
- 23 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 23 (1) , 1-26
Open AccessTuneman: Customizing Networks to Guarantee Application Bandwidth and Latency
We examine how to provide applications with dedicated bandwidth and guaranteed latency in a programmable mission-critical network. Unlike other SDN approaches such as B4 or SWAN, our system Tuneman optimizes both routes and packet schedules at each node to provide flows with sub-second bandwidth changes. Tuneman uses node-level optimization to compute node schedules in a slotted switch and does dynamic routing using a search procedure with Quality of Service– (QoS) based weights. This allows Tuneman to provide an efficient solution for mission-critical networks that have stringent QoS requirements. We evaluate Tuneman on a telesurgery network using a switch prototype built using FPGAs and also via simulations on India’s Tata Network. For mission-critical networks with multiple QoS levels, Tuneman has comparable or better utilization than SWAN while providing delay bounds guarantees.
- Open Access
- 11 August 2006
- Published by Association for Computing Machinery (ACM)
- Vol. 36 (4) , 327-338
Detecting evasion attacks at high speeds without reassembly
- 11 August 2006
- Published by Association for Computing Machinery (ACM)
- Vol. 36 (4) , 327-338
Open AccessDetecting evasion attacks at high speeds without reassembly
- 1 January 2005
- Published by Elsevier
- p. 399-416
Network Security
- 1 January 2005
- Published by Elsevier
- p. 379-398
Measuring Network Traffic
- 1 January 2005
- Published by Elsevier
- p. 362-375
Routers as Distributed Systems