Publications

Peer-reviewed publications

Conference | Dissertation | Journal | Patent

2026

X. Chen, R. Bhagat, P. Parag, and S. E. Rouayheb. Create, duplicate, or be eaten: random-walk learning vs. the Pac-Man attack. Asilomar Conference on Signals, Systems, and Computers, 60(1):1--5, Pacific Grove, CA, USA, Oct 25-28, 2026. paper. slides.
A. Letsiou, J. P. Champati, A. J. Ganesh, J. R. Gross, and P. Parag. Hierarchical inference with a finite offload queue. European Workshop on Reinforcement Learning, 19(1):1--10, Lille, France, Oct 05-07, 2026. paper. slides.
I. Papageorgiou, S. Nomula, A. J. Ganesh, S. Jaggi, and P. Parag. Distributed 20 questions for classification. Allerton Conference on Communication, Control, and Computing, 62(1):1--8, Urbana, IL, USA, Sep 15-19, 2026. paper. slides.
P. Charreaux, P. Parag, A. Reiffers, and F. Sailhan. Securing services --- age-based redeployment using weakly coupled Markov decision processes. International Federation of Automatic Control (IFAC) World Congress, 23(1):1--6, Busan, Korea, Aug 23-28, 2026. sciencedirect. paper. slides.
X. Chen, P. Parag, R. Bhagat, Z. Liu, and S. E. Rouayheb. Random walk learning and the Pac-Man attack. IEEE International Symposium on Information Theory (ISIT), 52(1):1--6, Guangzhou, China, Jun 28-Jul 03, 2026. ieeexplore. paper. slides.
F. Ye, Z. Liu, P. Parag, and S. E. Rouayheb. Perfect privacy and strong stationary times for Markovian sources. IEEE International Symposium on Information Theory (ISIT), 52(1):1--6, Guangzhou, China, Jun 28-Jul 03, 2026. ieeexplore. paper. slides.
D. Narasimha, S. Nomula, S. Shakkottai, and P. Parag. The power of two in large service-marketplaces. IEEE Transactions on Networking, 34(6):6170--6181, Jun 2026. ieeexplore. appendix. paper.
S. Nomula, P. Parag, A. J. Ganesh, and J. P. Champati. Hierarchical inference with an offload queue. IEEE International Conference on Computer Communications (INFOCOM), 45(1):1--10, Tokyo, Japan, May 18-21, 2026. ieeexplore. paper. slides.
T. Sun, T. He, B. Ji, and P. Parag. Optimizing resource allocation for geographically-distributed inference by large language models. ACM SIGMETRICS Performance Evaluation Review, 53(4):12--13, Mar 2026. acm. paper. slides.

2025

T. Sun, T. He, B. Ji, and P. Parag. Optimizing resource allocation for geographically-distributed inference by large language models. International Symposium on Computer Performance, Modeling, Measurements and Evaluation (IFIP WG 7.3 Peformance), 43(1):1--2, Amsterdam, Netherlands, Nov 11-13, 2025. ifip. paper. slides.
T. Sun, T. He, B. Ji, and P. Parag. Optimizing resource allocation for geographically-distributed inference by large language models. Performance Evaluation, 170:102527, Nov 2025. elsevier. paper.
D. Narasimha, S. Nomula, S. Shakkottai, and P. Parag. The power of two in large service-marketplaces. IEEE International Conference on Computer Communications (INFOCOM), 44(1):1--10, London, UK, May 19-22, 2025. ieeexplore. paper. slides.
M. Mohanty, G. Bolar, P. Patil, U. M. Devi, F. George, P. Moogi, and P. Parag. Deferred prefill for throughput maximization in LLM inference. Workshop on Machine Learning and Systems (EuroMLSys), 5(1):100--106, Rotterdam, Netherlands, Mar 31, 2025. acm. paper. slides. video.

2024

M. Mohanty, G. Gautam, V. Aggarwal, and P. Parag. Analysis of fork-join scheduling on heterogeneous parallel servers. IEEE/ACM Transactions on Networking, 32(6):4798--4809, Dec 2024. ieeexplore. appendix. paper.
A. Priya, Rajiv Choudhury, S. Patni, H. Sharma, M. Mohanty, K. Narayanam, U. M. Devi, P. Moogi, P. Patil, and P. Parag. Energy-minimizing workload splitting and frequency selection for guaranteed performance over heterogeneous cores. ACM International Conference on Future and Sustainable Energy Systems (e-Energy), 15(1):308--322, Singapore, June 04-07, 2024. acm. paper. slides.

2023

R. Jinan, A. K. Badita, T. P. Bodas, and P. Parag. Load balancing policies without feedback using timed replicas. Performance Evaluation, 162:102381, Nov 2023. elsevier. paper.
A. Krishnan K. S., C. K. Singh, S. T. Maguluri, and P. Parag. Optimal pricing in a single server system. International Teletraffic Congress -- Networked Systems and Services, invited session, Turin, Italy, Oct 03-05, 2023. itc. paper. slides.
A. Krishnan K. S., C. K. Singh, S. T. Maguluri, and P. Parag. Optimal pricing in a single server system. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 8(4):12, Dec 2023. acm. paper.
R. Jinan, G. Gautam, P. Parag, and V. Aggarwal. Asymptotic analysis of probabilistic scheduling for erasure-coded heterogeneous systems. ACM SIGMETRICS Performance Evaluation Review, 50(4):8--10, Apr 2023. acm. paper.

2022

R. Jinan, A. K. Badita, P. K. Sarvepalli, and P. Parag. Latency optimal storage and scheduling of replicated fragments for memory constrained servers. IEEE Transactions on Information Theory, 68(6):4135--4155, Jun 2022. ieeexplore. paper.
A. Krishnan K. S., C. K. Singh, S. T. Maguluri, and P. Parag. Optimal pricing in multi server systems. Performance Evaluation, 154:102282, Apr 2022. elsevier. paper.
G. Gautam, S. Rathee, P. Patil, and P. Parag. A scalable container-based virtualized data center emulation framework. International Conference on Communication Systems and Networks (COMSNETS), 14(1):452--454, Bengaluru, India, Jan 03-09, 2022. ieeexplore. paper. slides. video. short video.
S. Ramanathan, G. Gautam, V. Srinivasan, and P. Parag. Latency-redundancy tradeoff in distributed read-write systems. International Conference on Communication Systems and Networks (COMSNETS), 14(1):172--180, Bengaluru, India, Jan 03-09, 2022. ieeexplore. paper. slides. video.

2021

V. Reddyvari, S. C. Bobbili, P. Parag, and S. Shakkottai. Mode-suppression: A simple, stable and scalable chunk-sharing algorithm for P2P networks. IEEE/ACM Transactions on Networking, 29(6):2548--2559, Dec 2021. ieeexplore. appendix. paper.
A. K. Badita, P. Parag, and V. Aggarwal. Single-forking of coded subtasks for straggler mitigation. IEEE/ACM Transactions on Networking, 29(6):2413--2424, Dec 2021. ieeexplore. appendix. paper.
R. Jinan, A. K. Badita, P. K. Sarvepalli, and P. Parag. Low latency replication coded storage over memory-constrained servers. IEEE International Symposium on Information Theory (ISIT), 47(1):2340--2345, Melbourne, Australia, Jul 11-16, 2021. ieeexplore. paper. slides. video. short video.
S. C. Bobbili, S. Bhambay, and P. Parag. Variable length differential encoding for real-time status updates. IEEE Communication Letters, 25(4):1129--1133, Apr 2021. ieeexplore. paper.
R. Jinan, P. Parag, and H. Tyagi. Tracking an auto-regressive process with limited communication per unit time. MDPI Entropy, 23(3):347, Mar 2021. mdpi. paper.

2020

S. C. Bobbili, P. Parag, and J.-F. Chamberland. Real-time status updates with perfect feedback over erasure channels. IEEE Transactions on Communications, 68(9):5363--5374, Sep 2020. ieeexplore. paper.
R. Bitar, P. Parag, and S. E. Rouayheb. Minimizing latency for secure coded computing using secret sharing via staircase codes. IEEE Transactions on Communications, 68(8):4609--4619, Aug 2020. ieeexplore. paper.
R. Jinan, P. Parag, and H. Tyagi. Tracking an auto-regressive process with limited communication. IEEE International Symposium on Information Theory (ISIT), 46(1):2462--2467, Los Angeles, CA, USA, Jun 21-26, 2020. ieeexplore. paper. slides. video.
A. Krishnan K. S., C. K. Singh, S. T. Maguluri, and P. Parag. Optimal pricing in finite server systems. International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 18(1):1--8, Volos, Greece, Jun 15-19, 2020. ieeexplore. paper. slides. video.
P. Mayekar, P. Parag, and H. Tyagi. Optimal lossless source codes for timely updates. IEEE Transactions on Information Theory, 66(6):3714--3731, Jun 2020. ieeexplore. paper.
S. K. Hanna, R. Bitar, P. Parag, V. Dasari, and S. E. Rouayheb. Adaptive distributed stochastic gradient descent for minimizing delay in the presence of stragglers. International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 45(1):4262--4266, Barcelona, Spain, May 04-08, 2020. ieeexplore. paper. poster. video. video.
A. K. Badita, P. Parag, and V. Aggarwal. Sequential addition of coded tasks for straggler mitigation. IEEE International Conference on Computer Communications (INFOCOM), 39(1):746--755, Beijing, China, Jul 06-09, 2020. ieeexplore. paper. slides. video.
A. K. Badita, P. Parag, and V. Aggarwal. Optimal server selection for straggler mitigation. IEEE/ACM Transactions on Networking, 28(2):709--721, Apr 2020. ieeexplore. appendix. paper.
P. Sharma, D. Awasare, B. Jaiswal, S. Mohan, N. Abinaya, I. Darwhekar, S. Anand, B. Amrutur, A. Gopalan, P. Parag, and H. Tyagi. On the latency in vehicular control using video streaming over Wi-Fi. National Conference on Communications (NCC), 26(1):1--6, IIT Kharagpur, India, Feb 21-23, 2020. ieeexplore. paper. slides.
S. Acharya, B. Amrutur, Y. Simmhan, A. Gopalan, P. Parag, and H. Tyagi. CORNET: A co-simulation middleware for robot networks. International Conference on Communication Systems & Networks (COMSNETS), 12(1):245--251, Bangalore, India, Jan 07-11, 2020. ieeexplore. paper. slides.

2019

S. Poojary, S. Bhambay, and P. Parag. Real-time status updates for Markov source. IEEE Transactions on Information Theory, 65(9):5737--5749, Sep 2019. ieeexplore. paper.
A. K. Badita, P. Parag, and J.-F. Chamberland. Latency analysis for distributed coded storage systems. IEEE Transactions on Information Theory, 65(8):4683--4698, Aug 2019. ieeexplore. paper.
A. Heiderzadeh, J.-F. Chamberland, R. D. Wesel, and P. Parag. A systematic approach to incremental redundancy with application to erasure channels. IEEE Transactions on Communications, 67(4):2620--2631, Apr 2019. ieeexplore. paper.
S. Bhambay, S. Poojary, and P. Parag. Fixed length differential encoding for real-time status updates. IEEE Transactions on Communications, 67(3):2381--2392, Mar 2019. ieeexplore. paper.

2018

A. Heiderzadeh, J.-F. Chamberland, R. D. Wesel, and P. Parag. A systematic approach to incremental redundancy over erasure channels. IEEE International Symposium on Information Theory (ISIT), 44(1):1176--1180, Vail, CO, USA, Jun 17-22, 2018. ieeexplore. paper. slides.
P. Mayekar, P. Parag, and H. Tyagi. Optimal lossless source codes for timely updates. IEEE International Symposium on Information Theory (ISIT), 44(1):1246--1250, Vail, CO, USA, Jun 17-22, 2018. ieeexplore. paper. slides.
V. Reddyvari, P. Parag, and S. Shakkottai. Mode-suppression: A simple and provably stable chunk-sharing algorithm for P2P networks. IEEE International Conference on Computer Communications (INFOCOM), 37(1):2573--2581, Honolulu, HI, USA, Apr 15-19, 2018. ieeexplore. paper. slides.
P. Parag and J.-F. Chamberland. Novel latency bounds for distributed coded storage. Information Theory and Applications Workshop (ITA), 13(1):1--9, San Diego, CA, Feb 11-16, 2018. ieeexplore. paper. slides.

2017

S. Poojary, S. Bhambay, and P. Parag. Real-time status updates for correlated source. IEEE Information Theory Workshop (ITW), 62(1):274--278, Kaohsiung, Taiwan, Nov 06-10, 2017. ieeexplore. paper. slides.
R. Bitar, P. Parag, and S. E. Rouayheb. Minimizing latency for secure distributed computing. IEEE International Symposium on Information Theory (ISIT), 43(1):2900--2904, Aachen, Germany, Jun 25-30, 2017. ieeexplore. paper. slides.
P. Parag, A. Bura, and J.-F. Chamberland. Latency analysis for distributed storage. IEEE International Conference on Computer Communications (INFOCOM), 36(1):1--9, Atlanta, GA, May 01-04, 2017. ieeexplore. paper. slides.
S. Bhambay, S. Poojary, and P. Parag. Differential encoding for real-time status updates. IEEE Wireless Communications and Networking Conference (WCNC), 18(1):1--6, San Francisco, CA, USA, Mar 19-22, 2017. ieeexplore. paper. slides.
P. Parag, A. Taghavi, and J.-F. Chamberland. On real-time status updates over symbol erasure channels. IEEE Wireless Communications and Networking Conference (WCNC), 18(1):1--6, San Francisco, CA, USA, Mar 19-22, 2017. ieeexplore. paper. slides.

2013

P. Parag, J.-F. Chamberland, H. D. Pfister, and K. R. Narayanan. Code-rate selection, queueing Behavior, and the correlated erasure channel. IEEE Transactions on Information Theory, 59(1):397--407, Jan 2013. ieeexplore. paper.

2011

P. Parag and J.-F. Chamberland. Exploiting an interplay between norms to analyze scalar quantization schemes. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 36(1):4224--4227, Prague, Czech Republic, May 22-25, 2011. ieeexplore. paper. slides.
P. Parag, S. Sah, S. Shakkottai, and J.-F. Chamberland. Value-aware resource allocation for service guarantees in networks. IEEE Journal on Selected Areas in Communications, 29(5):960--968, May 2011. ieeexplore. paper.
P. Parag, S. Shakkottai, and I. Menache. Service routing in multi-ISP P2P content distribution: Local or remote? International ICST Conference on Game Theory for Networks (GameNets), 2(1):353--368, Shanghai, China, Apr 16-18, 2011. springer. paper. slides.
M. M. Amble, P. Parag, S. Shakkottai, and L. Ying. Content-aware caching and traffic management in content distribution networks. IEEE Conference on Computer Communications (INFOCOM), 30(1):2858--2866, Shanghai, China, Apr 10-15, 2011. ieeexplore. paper. slides.

2010

P. Parag, J.-F. Chamberland, H. D. Pfister, and K. R. Narayanan. On the queueing behavior of random codes over a Gilbert-Elliot erasure channel. IEEE International Symposium on Information Theory (ISIT), 36(1):1798--1802, Austin, TX, USA, Jun 13-18, 2010. ieeexplore. paper. slides.
P. Parag, J.-F. Chamberland, H. D. Pfister, and K. R. Narayanan. Code rate, queueing behavior and the correlated erasure channel. IEEE Information Theory Workshop(ITW), invited paper, 55(1):1--5, Cairo, Egypt, Jan 06-08, 2010. ieeexplore. paper. slides.
P. Parag and J.-F. Chamberland. Queueing analysis of a butterfly network for comparing network coding to classical routing. IEEE Transactions on Information Theory, 56(4):1890--1908, Apr 2010. ieeexplore. paper.
P. Parag, S. Shakkottai, and J.-F. Chamberland. Value-aware resource allocation for service guarantees in networks. IEEE International Conference on Computer Communications (INFOCOM), 29(1):2730--2738, San Diego, CA, USA, Mar 15-19, 2010. ieeexplore. paper. slides.

2008

P. Parag and J.-F. Chamberland. Queueing analysis of a butterfly network. IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, Jul 06-11, 2008. ieeexplore. paper. slides.

2007

L. Liu, P. Parag, and J.-F. Chamberland. Quality of service analysis for user cooperation in wireless communication systems using fluid models. IEEE Transactions on Information Theory, 53(10):3833--3842, Oct 2007. ieeexplore. paper.
L. Liu, P. Parag, J. Tang, W.-Y. Chen, and J.-F. Chamberland. Resource allocation and quality of service evaluation for wireless communication systems using fluid models. IEEE Transactions on Information Theory, 53(5):1767--1777, May 2007. ieeexplore. paper.

2006

L. Liu, P. Parag, J. Tang, W.-Y. Chen, and J.-F. Chamberland. Resource allocation and quality of service evaluation for wireless communication systems using fluid models. Allerton Conference on Communication, Control, and Computing, 44(1):1--7, Monticello, IL, USA, Sep 27-29, 2006. allerton. paper.

2005

P. Parag, S. Bhashyam, and R. Aravind. A subcarrier allocation algorithm for OFDMA using buffer and channel state information. IEEE Vehicular Technology Conference (VTC), 62(1):622--625, Dallas, TX, USA, Sep 25-28, 2005. ieeexplore. paper. slides.

Dissertation

P. Parag. Delay-sensitive communications: code-Rates, strategies, and distributed control. Entire.

Patents

C. S. Hwang, J. Noh, and P. Parag. Method and apparatus for continuous access network monitoring and packet loss estimation. Google Patents.

Disclaimer

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In general, these works should not be reposted without the explicit permission of the copyright holder.