Pooria Namyar

Pooria Namyar

Auto-generated profile, based on publicly available information

Pooria Namyar

University of Southern California, Los Angeles, California, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 April 2023 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
KCKanatip Chitavisutthivong
Kanatip Chitavisutthivong
SSSucha Supittayapornpong
Sucha Supittayapornpong
PNPooria Namyar
Pooria Namyar
MZMingyang Zhang
Mingyang Zhang
MYMinlan Yu
Minlan Yu
RGRamesh Govindan
Ramesh Govindan
Oblivious routing distributes traffic from sources to destinations following predefined routes with rules independent of traffic demands. While finding optimal oblivious routing with a concave objective is intractable for general topologies, we show that it is tractable for structured topologies often used in datacenter networks. To achieve this, we apply graph automorphism and prove the existence of the optimal automorphism-invariant solution. This result reduces the search space to targeting the optimal automorphism-invariant solution. We design an iterative algorithm to obtain such a solution by alternating between convex optimization and a linear program. The convex optimization finds an automorphism-invariant solution based on representative variables and constraints, making the problem tractable. The linear program generates adversarial demands to ensure the final result satisfies all possible demands. Since the construction of the representative variables and constraints are combinatorial problems, we design polynomial-time algorithms for the construction. We evaluate the iterative algorithm in terms of throughput performance, scalability, and generality over three potential applications. The algorithm i) improves the throughput up to $87.5\%$ for partially deployed FatTree and achieves up to $2.55\times$ throughput gain for DRing over heuristic algorithms, ii) scales for three considered topologies with a thousand switches, iii) applies to a general structured topology with non-uniform link capacity and server distribution.

27 August 2025
Verified
Conference Paper
Open access
PNPooria Namyar
Pooria Namyar
YLYuliang Li
Yuliang Li
WWWeitao Wang
Weitao Wang
NDNandita Dukkipati
Nandita Dukkipati
KYKk Yap
Kk Yap
AVAmin Vahdat
Amin Vahdat

18 November 2024
Verified
Conference Paper
Open access
PKPantea Karimi
Pantea Karimi
SPSolal Pirelli
Solal Pirelli
SKSiva Kesava Reddy Kakarla
Siva Kesava Reddy Kakarla
RBRyan Beckett
Ryan Beckett
SSSantiago Segarra
Santiago Segarra
BABehnaz Arzani
Behnaz Arzani
Many problems that cloud operators solve are computationally expensive, and operators often use heuristic algorithms (that are faster and scale better than optimal) to solve them more efficiently. Heuristic analyzers enable operators to find when and by how much their heuristics underperform. However, these tools do not provide enough detail for operators to mitigate the heuristic's impact in practice: they only discover a single input instance that causes the heuristic to underperform (and not the full set) and they do not explain why. We propose XPlain, a tool that extends these analyzers and helps operators understand when and why their heuristics underperform. We present promising initial results that show such an extension is viable.

18 November 2024
Verified
Conference Paper
Open access
PNPooria Namyar
Pooria Namyar
MSMichael Schapira
Michael Schapira
RGRamesh Govindan
Ramesh Govindan
SSSantiago Segarra
Santiago Segarra
RBRyan Beckett
Ryan Beckett
BABehnaz Arzani
Behnaz Arzani
We propose a performance analysis tool for learning-enabled systems that allows operators to uncover potential performance issues before deploying DNNs in their systems. The tools that exist for this purpose require operators to faithfully model all components (a white-box approach) or do inefficient black-box local search. We propose a gray-box alternative, which eliminates the need to precisely model all the system's components. Our approach is faster and finds substantially worse scenarios compared to prior work. We show that a state-of-the-art learning-enabled traffic engineering pipeline can underperform the optimal by 6× --- a much higher number compared to what the authors found.

27 August 2025
Verified
Conference Paper
Open access
PNPooria Namyar
Pooria Namyar
AGArvin Ghavidel
Arvin Ghavidel
MZMingyang Zhang
Mingyang Zhang
HMHarsha V. Madhyastha
Harsha V. Madhyastha
SRSrivatsan Ravi
Srivatsan Ravi
RGRamesh Govindan
Ramesh Govindan

27 August 2025
Verified
Conference Paper
Open access
BABehnaz Arzani
Behnaz Arzani
STSina Taheri
Sina Taheri
PNPooria Namyar
Pooria Namyar
RBRyan Beckett
Ryan Beckett
SKSiva Kesava Reddy Kakarla
Siva Kesava Reddy Kakarla
EJElnaz Jalilipour
Elnaz Jalilipour