Published

• Daniela Hurtado-Lange, Siva Theja Maguluri (2022). "Heavy-Traffic Analysis of Queueing Systems with no Complete Resource Pooling." Mathematics of Operations Research.

• Daniela Hurtado-Lange, Siva Theja Maguluri (2021). “Throughput and Delay Optimality of Power-of-d Choices in Inhomogeneous Load Balancing Systems.” Operations Research Letters, Volume 49, Issue 4, Pages 616-622.

• Daniela Hurtado-Lange, Siva Theja Maguluri (2020). “Transform Methods for Heavy-Traffic Analysis.” Stochastic Systems. ISSN 1946-5238.

Conference papers

• Daniela Hurtado-Lange, Siva Theja Maguluri. “Heavy-traffic Analysis of the Generalized Switch under Multidimensional State Space Collapse,” ACM SIGMETRICS 2020, Abstract in ACM SIGMETRICS Performance Evaluation Review 2019, Vol 47, No.2, Pages 36-38.

  • A preliminary version of this paper was presented in MAMA workshop at ACM SIGMETRICS 2019. Abstract available here.

Accepted for publication

• Daniela Hurtado-Lange, Sushil Varma, Siva Theja Maguluri (2021). “Logarithmic Heavy Traffic Error Bounds in Generalized Switch and Load Balancing Systems.” Journal of Applied Probability.

• Daniela Hurtado-Lange, Siva Theja Maguluri. “Load balancing system under Join the Shortest Queue: Many-Server-Heavy-Traffic Asymptotics.” QUESTA.

Conferences

• INFORMS 2021, Anaheim CA, USA and online. Title: Queue Length Behavior in Load Balancing Systems Under Power-of-d Choices: Many-Server Heavy-Traffic Regime. The slides are available here.

• INFORMS 2020, Held online. Title: Load Balancing System under JSQ and Power-of-d: Many-Server Heavy-Traffic Asymptotics. The slides are available here.

• SIGMETRICS 2020, Held online. Title: Heavy-Traffic Analysis of the Generalized Switch under Multidimensional State Space Collapse. The slides are available here, and a video of the presentation is available here.

• INFORMS 2019, Seattle WA, USA. Title: Heavy-Traffic Analysis of the Generalized Switch under Multidimensional State Space Collapse. The slides are available here.

• INFORMS-APS 2019, Brisbane Australia. Title: Transform Methods for Heavy-Traffic Analysis. The slides are available here.

• MAMA Workshop 2019, Phoenix AZ, USA. Title: Heavy-Traffic Analysis of the Generalized Switch under Multidimensional State Space Collapse. The slides are available here.

Invited seminar presentations

• "Minimizing Delay in Supermarket-Checkout Systems." April 2022. Math department at William & Mary. The slides are available here.

• "Performance Analysis of Data Center Networks: Drift Method and Transform Techniques." Math department at William & Mary. Held online.
  February 2021. The slides are available here.

• "Performance Analysis of Data Center Networks: Drift Method and Transform Techniques." IEOR at UC Berkeley. Held online. February 2021. The slides are available here.

• "Heavy-Traffic Analysis of the Generalized Switch with no Complete Resource Pooling.'' Online seminar organized by Anton Braverman, July 2020. The slides are available here.

• "Mathematical Models to Analyze Queueing Systems: Minimizing Delay in Data Centers." Pontificia Universidad Católica de Chile, Santiago, Chile, January 2020. The slides are here. This presentation was in Spanish, so are the slides.

• "Optimal Resource Allocation in Data Center Networks: Drift Method and Transform Techniques." Amherst College, Amherst MA, USA. September 2019. The slides are available here.

• "Mathematical Models for Queueing Systems: Asymptotics and New Approximations." Universidad de Santiago, Santiago, Chile. January 2019. The slides are available here. This presentation was in Spanish, so are the slides. The presentation is similar to the talk I gave in Universidad Adolfo Ibañez in December 2018, but here I included more examples.

• "Transform Methods for Heavy-traffic Analysis." Universidad Adolfo Ibañez, Santiago, Chile. December 2018. The slides are available here.

• "Performance Analysis in Data Center Networks." Pontificia Universidad Católica de Chile, Santiago, Chile. May 2018. The slides are available here.

• A unified view of the drift method and the MGF method for heavy-traffic analysis

Presented in the International Workshop on Recent Progress in Data, Models and Decisions (July 2018) held by iDDA (Institute for Data and Decision Analytics) of The Chinese University of Hong Kong, Shenzhen. You can see it here.

• A Novel View of the Drift Method for Heavy-Traffic Limits of Queueing Systems

Co-authored with and presented by Siva Theja Maguluri at ACM SIGMETRICS 2018 Poster Session (June 2018). You can see the poster here, the abstract here and a technical report here.

• Performance Analysis for Data Centers: A Novel Heavy-Traffic Approach

Presented in DCL Student Spring Symposium, Poster Session (March 2018). Held by Decision and Control Laboratory of Georgia Institute of Technology. You can see it here.

• Georgia Tech Sigma Xi Best PhD Thesis Award (Fall 2022)

• Ed Iacobucci Fellowship for Excellence in Research, area of Applied Probability and Simulation (Spring 2021)

• Phillip J. and Delores A. Scott Graduate Student Health and Wellness Award (Spring 2021)

• Honorable mention at Alice and John Jarvis research award (Spring 2020)

• ARC-TRIAD Student Fellowship (Spring 2019)

• BECAS CHILE (Fall 2017 to Summer 2021)

• Tennenbaum fellowship (First year of Ph.D.)

SURE at Georgia Tech:

• Milton Pagan, 2019

• Anabel Rivera, 2018

Informal mentoring of undergraduate and junior Ph.D. students

• Xiaofan Wu, Ph.D. student in the Booth School of Business at University of Chicago since Fall 2019
  Former undergraduate student at the Industrial and Systems Engineering Department at Georgia Institute of Technology.

• Sushil Varma, Ph.D. student in Operations Research at Georgia Tech

• Shancong Mou, Ph.D. student in Operations Research at Georgia Tech

• Yuanzhe Ma, Master student in Operations Research and Math at Georgia Tech

• SIGMETRICS Webmaster (January 2020 to date)

• ISyE Students Seminars Organization Committee at Georgia Tech (October 2018 to date). If you are interested in giving a talk, just let me know. We usually meet on Friday at 3.30 pm.