![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Parimal Parag
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j22]Rooji Jinan
, Ajay Badita
, Tejas Bodas
, Parimal Parag
:
Load balancing policies without feedback using timed replicas. Perform. Evaluation 162: 102381 (2023) - [j21]Rooji Jinan, Gaurav Gautam, Parimal Parag, Vaneet Aggarwal:
Asymptotic Analysis of Probabilistic Scheduling for Erasure-Coded Heterogeneous Systems. SIGMETRICS Perform. Evaluation Rev. 50(4): 8-10 (2023) - [j20]Ashok Krishnan K. S.
, Chandramani Singh
, Siva Theja Maguluri
, Parimal Parag
:
Optimal Pricing in a Single Server System. ACM Trans. Model. Perform. Evaluation Comput. Syst. 8(4): 12:1-12:32 (2023) - 2022
- [j19]Ashok Krishnan K. S.
, Chandramani Singh, Siva Theja Maguluri, Parimal Parag
:
Optimal pricing in multi server systems. Perform. Evaluation 154: 102282 (2022) - [j18]Rooji Jinan
, Ajay Badita
, Pradeep Kiran Sarvepalli
, Parimal Parag
:
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers. IEEE Trans. Inf. Theory 68(6): 4135-4155 (2022) - 2021
- [j17]Rooji Jinan
, Parimal Parag
, Himanshu Tyagi:
Tracking an Auto-Regressive Process with Limited Communication per Unit Time. Entropy 23(3): 347 (2021) - [j16]Sarat Chandra Bobbili
, Sanidhay Bhambay
, Parimal Parag
:
Variable Length Differential Encoding for Real-Time Status Updates. IEEE Commun. Lett. 25(4): 1129-1133 (2021) - [j15]Ajay Badita
, Parimal Parag
, Vaneet Aggarwal
:
Single-Forking of Coded Subtasks for Straggler Mitigation. IEEE/ACM Trans. Netw. 29(6): 2413-2424 (2021) - [j14]Vamseedhar R. Reddyvari
, Sarat Chandra Bobbili
, Parimal Parag
, Srinivas Shakkottai
:
Mode-Suppression: A Simple, Stable and Scalable Chunk-Sharing Algorithm for P2P Networks. IEEE/ACM Trans. Netw. 29(6): 2548-2559 (2021) - 2020
- [j13]Rawad Bitar
, Parimal Parag
, Salim El Rouayheb:
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes. IEEE Trans. Commun. 68(8): 4609-4619 (2020) - [j12]Sarat Chandra Bobbili
, Parimal Parag
, Jean-François Chamberland
:
Real-Time Status Updates With Perfect Feedback Over Erasure Channels. IEEE Trans. Commun. 68(9): 5363-5374 (2020) - [j11]Prathamesh Mayekar
, Parimal Parag
, Himanshu Tyagi
:
Optimal Source Codes for Timely Updates. IEEE Trans. Inf. Theory 66(6): 3714-3731 (2020) - [j10]Ajay Badita
, Parimal Parag
, Vaneet Aggarwal
:
Optimal Server Selection for Straggler Mitigation. IEEE/ACM Trans. Netw. 28(2): 709-721 (2020) - 2019
- [j9]Sanidhay Bhambay
, Sudheer Poojary
, Parimal Parag
:
Fixed Length Differential Encoding for Real-Time Status Updates. IEEE Trans. Commun. 67(3): 2381-2392 (2019) - [j8]Anoosheh Heidarzadeh
, Jean-François Chamberland
, Richard D. Wesel
, Parimal Parag
:
A Systematic Approach to Incremental Redundancy With Application to Erasure Channels. IEEE Trans. Commun. 67(4): 2620-2631 (2019) - [j7]Ajay Badita
, Parimal Parag
, Jean-François Chamberland
:
Latency Analysis for Distributed Coded Storage Systems. IEEE Trans. Inf. Theory 65(8): 4683-4698 (2019) - [j6]Sudheer Poojary
, Sanidhay Bhambay
, Parimal Parag
:
Real-Time Status Updates for Markov Source. IEEE Trans. Inf. Theory 65(9): 5737-5749 (2019) - 2013
- [j5]Parimal Parag
, Jean-François Chamberland
, Henry D. Pfister
, Krishna R. Narayanan:
Code-Rate Selection, Queueing Behavior, and the Correlated Erasure Channel. IEEE Trans. Inf. Theory 59(1): 397-407 (2013) - 2011
- [j4]Parimal Parag
, Sankalp Sah, Srinivas Shakkottai, Jean-François Chamberland
:
Value-Aware Resource Allocation for Service Guarantees in Networks. IEEE J. Sel. Areas Commun. 29(5): 960-968 (2011) - 2010
- [j3]Parimal Parag
, Jean-François Chamberland
:
Queueing analysis of a butterfly network for comparing network coding to classical routing. IEEE Trans. Inf. Theory 56(4): 1890-1908 (2010) - 2007
- [j2]Lingjia Liu, Parimal Parag
, Jia Tang, Wei-Yu Chen, Jean-François Chamberland
:
Resource Allocation and Quality of Service Evaluation for Wireless Communication Systems Using Fluid Models. IEEE Trans. Inf. Theory 53(5): 1767-1777 (2007) - [j1]Lingjia Liu, Parimal Parag
, Jean-François Chamberland
:
Quality of Service Analysis for Wireless User-Cooperation Networks. IEEE Trans. Inf. Theory 53(10): 3833-3842 (2007)
Conference and Workshop Papers
- 2022
- [c24]Saraswathy Ramanathan, Gaurav Gautam, Vikram Srinivasan, Parimal Parag:
Latency-Redundancy Tradeoff in Distributed Read-Write Systems. COMSNETS 2022: 172-180 - [c23]Gaurav Gautam, Sandhya Rathee, Preetam Patil, Parimal Parag:
A Scalable Container-based Virtualized Data Center Emulation Framework. COMSNETS 2022: 452-454 - 2021
- [c22]Rooji Jinan, Ajay Badita, Pradeep Kiran Sarvepalli, Parimal Parag:
Low latency replication coded storage over memory -constrained servers. ISIT 2021: 2340-2345 - 2020
- [c21]Srikrishna Acharya, Bharadwaj S. Amrutur, Yogesh Simmhan, Aditya Gopalan, Parimal Parag
, Himanshu Tyagi:
CORNET: A Co-Simulation Middleware for Robot Networks. COMSNETS 2020: 245-251 - [c20]Serge Kas Hanna, Rawad Bitar, Parimal Parag
, Venkat Dasari, Salim El Rouayheb:
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers. ICASSP 2020: 4262-4266 - [c19]Ajay Badita
, Parimal Parag
, Vaneet Aggarwal
:
Sequential addition of coded sub-tasks for straggler mitigation. INFOCOM 2020: 746-755 - [c18]Rooji Jinan, Parimal Parag
, Himanshu Tyagi:
Tracking an Auto-Regressive Process with Limited Communication. ISIT 2020: 2462-2467 - [c17]Pratik Sharma, Devam Awasare, Bishal Jaiswal, Srivats Mohan, N. Abinaya, Ishan Darwhekar, Anand SVR, Bharadwaj Amrutur, Aditya Gopalan, Parimal Parag
, Himanshu Tyagi:
On the Latency in Vehicular Control using Video Streaming over Wi-Fi. NCC 2020: 1-6 - [c16]Ashok Krishnan K. S., Chandramani Singh, Siva Theja Maguluri, Parimal Parag:
Optimal Pricing in Finite Server Systems. WiOpt 2020: 190-197 - 2018
- [c15]Vamseedhar R. Reddyvari, Parimal Parag
, Srinivas Shakkottai:
Mode-Suppression: A Simple and Provably Stable Chunk-Sharing Algorithm for P2P Networks. INFOCOM 2018: 2573-2581 - [c14]Anoosheh Heidarzadeh, Jean-François Chamberland
, Parimal Parag
, Richard D. Wesel:
A Systematic Approach to Incremental Redundancy over Erasure Channels. ISIT 2018: 1176-1180 - [c13]Prathamesh Mayekar, Parimal Parag
, Himanshu Tyagi:
Optimal Lossless Source Codes for Timely Updates. ISIT 2018: 1246-1250 - [c12]Parimal Parag
, Jean-François Chamberland
:
Novel Latency Bounds for Distributed Coded Storage. ITA 2018: 1-9 - 2017
- [c11]Parimal Parag
, Archana Bura, Jean-François Chamberland
:
Latency analysis for distributed storage. INFOCOM 2017: 1-9 - [c10]Rawad Bitar, Parimal Parag
, Salim El Rouayheb:
Minimizing latency for secure distributed computing. ISIT 2017: 2900-2904 - [c9]Sudheer Poojary
, Sanidhay Bhambay, Parimal Parag
:
Real-time status updates for correlated source. ITW 2017: 274-278 - [c8]Sanidhay Bhambay, Sudheer Poojary
, Parimal Parag
:
Differential Encoding for Real-Time Status Updates. WCNC 2017: 1-6 - [c7]Parimal Parag
, Austin Taghavi, Jean-François Chamberland
:
On Real-Time Status Updates over Symbol Erasure Channels. WCNC 2017: 1-6 - 2011
- [c6]Parimal Parag, Srinivas Shakkottai, Ishai Menache:
Service Routing in Multi-ISP Peer-to-Peer Content Distribution: Local or Remote? GAMENETS 2011: 353-368 - [c5]Parimal Parag
, Jean-François Chamberland
:
Exploiting an interplay between norms to analyze scalar quantization schemes. ICASSP 2011: 4224-4227 - [c4]Meghana M. Amble, Parimal Parag
, Srinivas Shakkottai, Lei Ying
:
Content-aware caching and traffic management in content distribution networks. INFOCOM 2011: 2858-2866 - 2010
- [c3]Parimal Parag
, Srinivas Shakkottai, Jean-François Chamberland
:
Value-aware Resource Allocation for Service Guarantees in Networks. INFOCOM 2010: 2730-2738 - [c2]Parimal Parag
, Jean-François Chamberland
, Henry D. Pfister
, Krishna R. Narayanan:
On the queueing behavior of random codes over a gilbert-elliot erasure channel. ISIT 2010: 1798-1802 - 2008
- [c1]Parimal Parag
, Jean-François Chamberland
:
Queueing analysis of a butterfly network. ISIT 2008: 672-676
Informal and Other Publications
- 2022
- [i15]Serge Kas Hanna, Rawad Bitar, Parimal Parag, Venkat Dasari, Salim El Rouayheb:
Adaptive Stochastic Gradient Descent for Fast and Communication-Efficient Distributed Learning. CoRR abs/2208.03134 (2022) - 2021
- [i14]Ashok Krishnan K. S., Chandramani Singh, Siva Theja Maguluri, Parimal Parag:
Optimal Pricing in Multi Server Systems. CoRR abs/2105.02002 (2021) - [i13]Ajay Badita, Rooji Jinan, Balajee Vamanan, Parimal Parag:
Modeling Performance and Energy trade-offs in Online Data-Intensive Applications. CoRR abs/2108.08199 (2021) - [i12]Saraswathy Ramanathan, Gaurav Gautam, Vikram Srinivasan, Parimal Parag:
Latency-Redundancy Tradeoff in Distributed Read-Write Systems. CoRR abs/2108.13949 (2021) - 2020
- [i11]Serge Kas Hanna, Rawad Bitar, Parimal Parag
, Venkat Dasari, Salim El Rouayheb:
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers. CoRR abs/2002.11005 (2020) - [i10]Rooji Jinan, Parimal Parag
, Himanshu Tyagi:
Tracking an Auto-Regressive Process with Limited Communication per Unit Time. CoRR abs/2003.09808 (2020) - [i9]Rooji Jinan, Ajay Badita
, Pradeep Kiran Sarvepalli, Parimal Parag
:
Latency optimal storage and scheduling of replicated fragments for memory-constrained servers. CoRR abs/2010.01589 (2020) - [i8]Rooji Jinan, Ajay Badita
, Tejas Bodas, Parimal Parag
:
Load balancing policies with server-side cancellation of replicas. CoRR abs/2010.13575 (2020) - 2019
- [i7]Vamseedhar Reddyvari Raja, Parimal Parag
, Srinivas Shakkottai:
Mode-Suppression: A Simple, Stable and Scalable Chunk-Sharing Algorithm for P2P Networks. CoRR abs/1904.04191 (2019) - [i6]Ajay Badita
, Parimal Parag
, Vaneet Aggarwal:
Optimal Server Selection for Straggler Mitigation. CoRR abs/1911.05918 (2019) - 2018
- [i5]Rawad Bitar, Parimal Parag
, Salim El Rouayheb:
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes. CoRR abs/1802.02640 (2018) - [i4]Anoosheh Heidarzadeh, Jean-François Chamberland, Parimal Parag
, Richard D. Wesel:
A Systematic Approach to Incremental Redundancy over Erasure Channels. CoRR abs/1805.03235 (2018) - [i3]Prathamesh Mayekar, Parimal Parag
, Himanshu Tyagi:
Optimal Source Codes for Timely Updates. CoRR abs/1810.05561 (2018) - 2017
- [i2]Rawad Bitar, Parimal Parag
, Salim El Rouayheb:
Minimizing Latency for Secure Distributed Computing. CoRR abs/1703.01504 (2017) - 2010
- [i1]Parimal Parag
, Jean-François Chamberland, Henry D. Pfister, Krishna R. Narayanan:
On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel. CoRR abs/1006.2403 (2010)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint