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

Umesh Krishnaswamy

dblp:46/3870 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
5since 2021 · last 2026
—ORCID · none

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

Computer networks · 6 · 2 first-author · 5 since 2021Systems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

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
5 papers
Routing and switching · 60% Internet architecture and protocols · 24% Network optimization and economics · 11%
Theoretical computer science
2 papers
Mathematical optimization · 44% Algorithmic game theory and mechanism design · 44% Algorithms and data structures · 13%

Topics — the 11 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching
traffic engineering
1.012026
HEDGE: Traffic Engineering with Probabilistic Link Capacities · NSDI 2026
Algorithmic game theory and mechanism design › fair division › max-min fairness
max-min fair allocation
0.812024
Solving Max-Min Fair Resource Allocations Quickly on Large Graphs · NSDI 2024
Mathematical optimization
multilevel optimization
0.812024
Finding Adversarial Inputs for Heuristics using Multi-level Optimization · NSDI 2024
Routing and switching › traffic engineering
distributed traffic engineering
0.612022
Decentralized cloud wide-area network traffic engineering with BLASTSHIELD · NSDI 2022
Routing and switching › traffic engineering
WAN traffic engineering
0.612022
Decentralized cloud wide-area network traffic engineering with BLASTSHIELD · NSDI 2022
Network optimization and economics
resource allocation
0.422024
Solving Max-Min Fair Resource Allocations Quickly on Large Graphs · NSDI 2024
Decentralized cloud wide-area network traffic engineering with BLASTSHIELD · NSDI 2022
Algorithms and data structures
heuristic algorithms
0.212024
Finding Adversarial Inputs for Heuristics using Multi-level Optimization · NSDI 2024
Internet architecture and protocols
wide area network
0.212023
OneWAN is better than two: Unifying a split WAN architecture · NSDI 2023
Performance modeling and evaluation
benchmarking
0.022000
A Framework for Computer Performance Evaluation Using Benchmark Sets · IEEE Trans. Computers 2000
Micro-Architecture Evaluation Using Performance Vectors · SIGMETRICS 1996
Processor architecture and microarchitecture
microarchitecture evaluation
0.011996
Micro-Architecture Evaluation Using Performance Vectors · SIGMETRICS 1996
Processor architecture and microarchitecture › superscalar processor
superscalar processor performance
0.011996
Micro-Architecture Evaluation Using Performance Vectors · SIGMETRICS 1996

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

multilevel optimization · 0.8performance vectors · 0.0geometric model · 0.0non-linear performance vector computation · 0.0SPEC benchmarks · 0.0
YearPublicationVenuePosition
2026 HEDGE: Traffic Engineering with Probabilistic Link Capacities
Arjun Devraj, Bill Owens, Umesh Krishnaswamy, Rachee Singh
NSDI3
2024 Finding Adversarial Inputs for Heuristics using Multi-level Optimization
Pooria Namyar, Behnaz Arzani, Ryan Beckett, Santiago Segarra, Himanshu Raj, Umesh Krishnaswamy, Ramesh Govindan, Srikanth Kandula
NSDI6
2024 Solving Max-Min Fair Resource Allocations Quickly on Large Graphs
Pooria Namyar, Behnaz Arzani, Srikanth Kandula, Santiago Segarra, Daniel Crankshaw, Umesh Krishnaswamy, Ramesh Govindan, Himanshu Raj
NSDI6
2023 OneWAN is better than two: Unifying a split WAN architecture
Umesh Krishnaswamy, Rachee Singh, Paul Mattes, Paul-Andre C. Bissonnette, Nikolaj S. Bjørner, Zahira Nasrin, Sonal Kothari, Prabhakar Reddy, John Abeln, Srikanth Kandula, Himanshu Raj, Luis Irún-Briz, Jamie Gaudette, Erica Lan
NSDI1
2022 Decentralized cloud wide-area network traffic engineering with BLASTSHIELD
Umesh Krishnaswamy, Rachee Singh, Nikolaj S. Bjørner, Himanshu Raj
NSDI1
2013 Seamless interworking of SDN and IP
abstract
No abstract available.
Pingping Lin, Jonathan Hart, Umesh Krishnaswamy, Tetsuya Murakami, Masayoshi Kobayashi, Ali Al-Shabibi, Kuang-Ching Wang, Jun Bi
SIGCOMM3
2000 A Framework for Computer Performance Evaluation Using Benchmark Sets
abstract
Benchmarking is a widely used approach to measure computer performance. Current use of benchmarks only provides running times to describe the performance of a tested system. Glancing through these execution times provides little or no information about system strengths and weaknesses. A novel benchmarking methodology is proposed to identify key performance parameters; the methodology is based on measuring performance vectors. A performance vector is a vector of ratings that represents delivered performance of primitive operations of a system. In order to measure performance vectors, a geometric model is proposed which defines system behavior using the concepts of support points, context lattice, and operating points. In addition to the performance vector, other metrics derivable from the geometric model include the variation in system performance and the compliance of benchmarks. Using this methodology, the performance vectors of the Sun SuperSPARC (desktop workstation) and the Cray C90 (vector supercomputer) are evaluated using the SPEC benchmarks and the Perfect Club, respectively. The proposed methodology respects several practical constraints and issues in benchmarking. The instrumentation required is minimal. The benchmarks used are realistic (not synthetic) in order to reflect the delivered (not peak) performance. Finally, operations in the performance vector are not measured individually since there may be significant interplay in their executions.
Umesh Krishnaswamy, Isaac D. Scherson
IEEE Trans. Computers1
1996 Micro-Architecture Evaluation Using Performance Vectors
abstract
Benchmarking is a widely used approach to measure computer performance. Current use of benchmarks only provides running times to describe the performance of a tested system. Glancing through these execution times provides little or no information about system strengths and weaknesses. A novel benchmarking methodology is proposed to identify key performance parameters; the methodology is based on measuring performance vectors. A performance vector is a vector of ratings that represents delivered performance of primitive operations of a system. Measuring the performance vector of a system in a typical user workload can be a tough problem. We show how the performance vector falls out of an equation consisting of dynamic instruction counts and execution times of benchmarks. We present a non-linear approach for computing the performance vector. The efficacy of the methodology is ascertained by evaluating the micro-architecture of the Sun SuperSPARC superscalar processor using SPEC benchmarks. Results show interesting tradeoffs in the SuperSPARC and speak favorably of our methodology.
Umesh Krishnaswamy, Isaac D. Scherson
SIGMETRICS1