default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalakrishna J. Prabhu
B. J. Prabhu
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Olivier Brun
, Rachid El Azouzi, Quang-Trung Luu, Francesco De Pellegrini, Balakrishna J. Prabhu, Cédric Richier:
Weighted Scheduling of Time-Sensitive Coflows. IEEE Trans. Cloud Comput. 12(2): 644-658 (2024)- [j28]V. Hari Rohit, Akshay Mete, D. Manjunath, Jayakrishnan Nair, Balakrishna J. Prabhu:
Partial Server Pooling in Delay Systems. ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(3): 9:1-9:32 (2024) - 2023
- [j27]Thi Thuy Nga Nguyen, Olivier Brun, Balakrishna J. Prabhu:
A learning-based scheme for channel allocation to vehicular users in wireless networks. Perform. Evaluation 159: 102331 (2023) - [c39]Julianna Devillers, Olivier Brun, Balakrishna J. Prabhu:
Data Summarization for Federated Learning. MLN 2023: 118-137 - [i9]Olivier Brun, Rachid El Azouzi, Quang-Trung Luu, Francesco De Pellegrini, Balakrishna J. Prabhu, Cédric Richier:
Weighted Scheduling of Time-Sensitive Coflows. CoRR abs/2303.17175 (2023) - 2022
- [j26]Fernando Miguelez, Josu Doncel, Balakrishna J. Prabhu:
Load-balancing for multi-skilled servers with Bernoulli routing. Ann. Oper. Res. 312(2): 949-971 (2022) - [j25]Thi Thuy Nga Nguyen, Olivier Brun, Balakrishna J. Prabhu:
Using channel predictions for improved proportional-fair utility for vehicular users. Comput. Networks 208: 108872 (2022) - [j24]Rudesindo Núñez-Queija, Balakrishna J. Prabhu, Jacques Resing:
Queueing models with service speed adaptations at arrival instants of an external observer. Queueing Syst. Theory Appl. 100(3-4): 233-235 (2022) - [c38]Quang-Trung Luu, Olivier Brun, Rachid El Azouzi, Francesco De Pellegrini, Balakrishna J. Prabhu, Cédric Richier:
DCoflow: Deadline-Aware Scheduling Algorithm for Coflows in Datacenter Networks. IFIP Networking 2022: 1-9 - [i8]Quang-Trung Luu, Olivier Brun, Rachid El Azouzi, Francesco De Pellegrini, Balakrishna J. Prabhu, Cédric Richier:
DCoflow: Deadline-Aware Scheduling Algorithm for Coflows in Datacenter Networks. CoRR abs/2205.01229 (2022) - [i7]R. Núñez Queija, Balakrishna J. Prabhu, J. A. C. Resing:
Markovian queues with Poisson control. CoRR abs/2208.10198 (2022) - 2021
- [j23]Giuliana A. Franceschinis, Balakrishna J. Prabhu, Mikaël Touati:
Editorial: Valuetools 2019. Perform. Evaluation 149-150: 102216 (2021) - [j22]Dieter Fiems, Balakrishna J. Prabhu:
Macroscopic modelling and analysis of flows during rush-hour congestion. Perform. Evaluation 149-150: 102218 (2021) - [c37]Laurent Chasserat, Nicola Accettura, Balakrishna J. Prabhu, Pascal Berthou:
TREMA: A traffic-aware energy efficient MAC protocol to adapt the LoRaWAN capacity. ICCCN 2021: 1-6 - [c36]Ioanna Stypsanelli, Olivier Brun, Balakrishna J. Prabhu:
Performance Evaluation of Some Adaptive Task Allocation Algorithms for Fog Networks. ICFEC 2021: 84-88 - 2020
- [c35]Ioanna-Vasiliki Stypsanelli, Samir Medjiah, Balakrishna J. Prabhu:
Reducing Service Migrations in Fog Infrastructures by Optimizing Node Location. FMEC 2020: 13-19 - [c34]Thi Thuy Nga Nguyen, Olivier Brun, Balakrishna J. Prabhu:
Learning Resource Allocation Algorithms for Cellular Networks. MLN 2020: 184-203 - [c33]Marine Ségneré-Yter, Olivier Brun, Balakrishna J. Prabhu:
A Markovian Approach for Improving End-to-End Data Rates in the Internet. NetGCooP 2020: 167-171 - [c32]Maxime Mouchet, Martín Randall, M. Ségneré, Isabel Amigo, Pablo Belzarena, Olivier Brun, Balakrishna J. Prabhu, Sandrine Vaton:
Scalable Monitoring Heuristics for Improving Network Latency. NOMS 2020: 1-9 - [c31]Dieter Fiems, Balakrishna J. Prabhu:
Macroscopic modelling and analysis of rush-hour congestion. VALUETOOLS 2020: 11-18 - [c30]Thi Thuy Nga Nguyen, Olivier Brun, Balakrishna J. Prabhu:
Joint downlink power control and channel allocation based on a partial view of future channel conditions. WiOpt 2020: 315-322
2010 – 2019
- 2019
- [j21]Sandrine Vaton, Olivier Brun, Maxime Mouchet, Pablo Belzarena, Isabel Amigo, Balakrishna J. Prabhu, Thierry Chonavel:
Joint Minimization of Monitoring Cost and Delay in Overlay Networks: Optimal Policies with a Markovian Approach. J. Netw. Syst. Manag. 27(1): 188-232 (2019) - [j20]Thi Thu Hang Nguyen, Olivier Brun, Balakrishna J. Prabhu:
Performance of a Fixed Reward Incentive Scheme for Two-hop DTNs with Competing Relays. ACM Trans. Model. Perform. Evaluation Comput. Syst. 4(2): 12:1-12:19 (2019) - [j19]Anvitha Nandigam, Suraj Jog, D. Manjunath, Jayakrishnan Nair, Balakrishna J. Prabhu:
Sharing Within Limits: Partial Resource Pooling in Loss Systems. IEEE/ACM Trans. Netw. 27(4): 1305-1318 (2019) - [c29]Thi Thuy Nga Nguyen, Olivier Brun, Balakrishna J. Prabhu:
An Algorithm for Improved Proportional-Fair Utility for Vehicular Users. ASMTA 2019: 115-130 - [c28]Ioanna Stypsanelli, Olivier Brun, Samir Medjiah, Balakrishna J. Prabhu:
Capacity Planning of Fog Computing Infrastructures under Probabilistic Delay Guarantees. ICFC 2019: 185-194 - [c27]Akshay Mete, D. Manjunath, Jayakrishnan Nair, Balakrishna J. Prabhu:
Partial Server Pooling in Redundancy Systems. ITC 2019: 106-114 - [c26]Thi Thuy Nga Nguyen, Urtzi Ayesta, Balakrishna J. Prabhu:
Scheduling users in drive-thru Internet: a multi-armed bandit approach. WiOpt 2019: 1-8 - [i6]Akshay Mete, D. Manjunath, Jayakrishnan Nair, Balakrishna J. Prabhu:
Partial Server Pooling in Redundancy Systems. CoRR abs/1906.03587 (2019) - 2018
- [j18]Urtzi Ayesta, Balakrishna J. Prabhu:
Special volume on selected papers from the second ECQT conference. Perform. Evaluation 119: 3-4 (2018) - [j17]Matthieu Jonckheere, Balakrishna J. Prabhu:
Asymptotics of insensitive load balancing and blocking phases. Queueing Syst. Theory Appl. 88(3-4): 243-278 (2018) - [c25]Thi Thu Hang Nguyen, Olivier Brun, Balakrishna J. Prabhu:
A Mixed Strategy for a Competitive Game in Delay Tolerant Networks. EPEW 2018: 190-204 - [c24]Thi Thu Hang Nguyen, Olivier Brun, Balakrishna J. Prabhu:
Mean-field limit of the fixed-reward incentive mechanism in delay tolerant networks. WiOpt 2018: 1-8 - [i5]Anvitha Nandigam, Suraj Jog, D. Manjunath, Jayakrishnan Nair, B. J. Prabhu:
Sharing within limits: Partial resource pooling in loss systems. CoRR abs/1808.06175 (2018) - 2017
- [j16]Olivier Brun, Balakrishna J. Prabhu, Josselin Vallet:
A penalized best-response algorithm for nonlinear single-path routing problems. Networks 69(1): 52-66 (2017) - [j15]Tatiana Seregina, Olivier Brun, Rachid El Azouzi, Balakrishna J. Prabhu:
On the Design of a Reward-Based Incentive Mechanism for Delay Tolerant Networks. IEEE Trans. Mob. Comput. 16(2): 453-465 (2017) - [c23]Rachid El Azouzi, Ahmed El Ouadrhiri, Balakrishna J. Prabhu, Daniel Sadoc Menasché, Olivier Brun:
Incentive-Rewarding Mechanisms to Stimulate Participation in Heterogeneous DTNs. ITC 2017: 117-125 - [c22]Nicola Accettura, Samir Medjiah, Balakrishna J. Prabhu, Thierry Monteil:
Low power radiolocation through long range wide area networks: A performance study. WiMob 2017: 1-8 - [i4]Rachid El Azouzi, Ahmed El Ouadrhiri, Balakrishna J. Prabhu, Daniel S. Menasché, Olivier Brun:
Incentive-rewarding mechanisms to stimulate participation in heterogeneous DTNs. CoRR abs/1704.02948 (2017) - 2016
- [j14]Olivier Brun, Balakrishna J. Prabhu:
Worst-case analysis of non-cooperative load balancing. Ann. Oper. Res. 239(2): 471-495 (2016) - [j13]Josselin Vallet, Olivier Brun, Balakrishna J. Prabhu:
A Game-theoretic Algorithm for Non-linear Single-Path Routing Problems. Electron. Notes Discret. Math. 52: 77-84 (2016) - [j12]Thi Thu Hang Nguyen, Olivier Brun, Balakrishna J. Prabhu:
Performance of a fixed reward incentive scheme for two-hop DTNs with competing relays: Short talk. SIGMETRICS Perform. Evaluation Rev. 44(3): 39 (2016) - [c21]Matthieu Jonckheere, Balakrishna J. Prabhu:
Asymptotics of Insensitive Load Balancing and Blocking Phases. SIGMETRICS 2016: 311-322 - [i3]Matthieu Jonckheere, Balakrishna J. Prabhu:
Asymptotics of Insensitive Load Balancing and Blocking Phases. CoRR abs/1605.02996 (2016) - 2015
- [j11]Olivier Brun, Henda Ben Cheikh, Balakrishna J. Prabhu:
A Fluid model based Heuristic for Optimal Speed-scaling of Multi-class Single Server Queues. SIGMETRICS Perform. Evaluation Rev. 43(2): 22-23 (2015) - 2014
- [j10]Josu Doncel, Urtzi Ayesta, Olivier Brun, Balakrishna J. Prabhu:
A resource-sharing game with relative priorities. Perform. Evaluation 79: 287-305 (2014) - [j9]Josu Doncel, Urtzi Ayesta, Olivier Brun, Balakrishna J. Prabhu:
Is the Price of Anarchy the Right Measure for Load-Balancing Games? ACM Trans. Internet Techn. 14(2-3): 18:1-18:20 (2014) - [c20]Henda Ben Cheikh, Josu Doncel, Olivier Brun, Balakrishna J. Prabhu:
Predicting Response Times of Applications in Virtualized Environments. NCCA 2014: 83-90 - [c19]Olivier Brun, Rachid El Azouzi, Balakrishna J. Prabhu, Tatiana Seregina:
Modeling rewards and incentive mechanisms for Delay Tolerant Networks. WiOpt 2014: 233-240 - 2013
- [j8]Dieter Fiems, Balakrishna J. Prabhu, Koen De Turck:
Analytic approximations of queues with lightly- and heavily-correlated autoregressive service times. Ann. Oper. Res. 202(1): 103-119 (2013) - [c18]Josu Doncel, Urtzi Ayesta, Olivier Brun, Balakrishna J. Prabhu:
On the efficiency of non-cooperative load balancing. Networking 2013: 1-9 - [c17]Olivier Brun, Balakrishna J. Prabhu, Tatiana Seregina:
On the convergence of the best-response algorithm in routing games. VALUETOOLS 2013: 136-144 - [i2]Konstantin Avrachenkov, Koen De Turck, Dieter Fiems, Balakrishna J. Prabhu:
Information dissemination processes in directed social networks. CoRR abs/1311.2023 (2013) - 2012
- [j7]Ahmad Al Sheikh, Olivier Brun, Pierre-Emmanuel Hladik, Balakrishna J. Prabhu:
Strictly periodic scheduling in IMA-based architectures. Real Time Syst. 48(4): 359-386 (2012) - [c16]B. J. Prabhu, A. E. Tugui, Ina Maria Verloop:
Steady-state approximations of dynamic speed-scaling in data centers. NetGCooP 2012: 135-138 - 2011
- [j6]Urtzi Ayesta, Olivier Brun, B. J. Prabhu:
Price of anarchy in non-cooperative load balancing games. Perform. Evaluation 68(12): 1312-1332 (2011) - [j5]Eitan Altman, Urtzi Ayesta, B. J. Prabhu:
Load balancing in processor sharing systems. Telecommun. Syst. 47(1-2): 35-48 (2011) - [c15]Ahmad Al Sheikh, Olivier Brun, Pierre-Emmanuel Hladik, Balakrishna J. Prabhu:
A Best-Response Algorithm for Multiprocessor Periodic Scheduling. ECRTS 2011: 228-237 - [c14]Manjesh Kumar Hanawal, Eitan Altman, Rachid El Azouzi, Balakrishna J. Prabhu:
Spatio-temporal Control for Dynamic Routing Games. GAMENETS 2011: 205-220 - [c13]Onno J. Boxma, B. J. Prabhu:
Analysis of an M/G/1 queue with customer impatience and adaptive arrival process. NetGCoop 2011: 1-4 - [i1]Mathieu Feuillet, Matthieu Jonckheere, Balakrishna J. Prabhu:
Responding to traffic surges: Stochastic networks under time-space-priority scalings. CoRR abs/1101.4523 (2011) - 2010
- [c12]Urtzi Ayesta, Olivier Brun, Balakrishna J. Prabhu:
Price of Anarchy in Non-Cooperative Load Balancing. INFOCOM 2010: 436-440 - [c11]Matthieu Jonckheere, Rudesindo Núñez-Queija, Balakrishna J. Prabhu:
Performance analysis of traffic surges in multi-class communication networks. ITC 2010: 1-8
2000 – 2009
- 2009
- [j4]Eitan Altman, Konstantin Avrachenkov, Ishai Menache, Gregory B. Miller, Balakrishna J. Prabhu, Adam Shwartz:
Dynamic Discrete Power Control in Cellular Networks. IEEE Trans. Autom. Control. 54(10): 2328-2340 (2009) - 2008
- [c10]Rudesindo Núñez-Queija, Balakrishna J. Prabhu:
Scaling Laws for File Dissemination in P2P Networks with Random Contacts. IWQoS 2008: 75-79 - [c9]Eitan Altman, Urtzi Ayesta, Balakrishna J. Prabhu:
Load balancing in processor sharing systems. VALUETOOLS 2008: 12 - 2007
- [c8]Eitan Altman, Konstantin Avrachenkov, Gregory B. Miller, Balakrishna J. Prabhu:
Discrete Power Control: Cooperative and Non-Cooperative Optimization. INFOCOM 2007: 37-45 - [c7]Ilkka Norros, Balakrishna J. Prabhu, Hannu Reittu:
On Uncoordinated File Distribution with Non-altruistic Downloaders. ITC 2007: 606-617 - 2005
- [b1]Balakrishna J. Prabhu:
Markov chains and decision processes for congestion avoidance and power control. (Chaînes de Markov et processus de décision markoviens pour le contrôle de congestion et de puissance). University of Nice Sophia Antipolis, France, 2005 - [j3]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Arzad Alam Kherani, B. J. Prabhu:
Analysis of MIMD congestion control algorithm for high speed networks. Comput. Networks 48(6): 972-989 (2005) - [j2]Arzad Alam Kherani, B. J. Prabhu, Konstantin Avrachenkov, Eitan Altman:
Comparative Study of Different Adaptive Window Protocols. Telecommun. Syst. 30(4): 321-350 (2005) - [j1]Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu:
Fairness in MIMD Congestion Control Algorithms. Telecommun. Syst. 30(4): 387-415 (2005) - [c6]Eitan Altman, Konstantin Avrachenkov, Arzad Alam Kherani, B. J. Prabhu:
Performance analysis and stochastic stability of congestion control protocols. INFOCOM 2005: 1316-1327 - [c5]Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu:
Fairness in MIMD congestion control algorithms. INFOCOM 2005: 1350-1361 - [c4]Vivek S. Borkar, Arzad Alam Kherani, B. J. Prabhu:
Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device. WiOpt 2005: 3-9 - 2004
- [c3]Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Arzad Alam Kherani, B. J. Prabhu:
Analysis of Scalable TCP. HSNMC 2004: 51-62 - 2002
- [c2]Balakrishna J. Prabhu, Ananthanarayanan Chockalingam:
A routing protocol and energy efficient techniques in Bluetooth scatternets. ICC 2002: 3336-3340 - [c1]Balakrishna J. Prabhu, A. Chockalingam, Vinod Sharma:
Performance analysis of battery power management schemes in wireless mobile devices. WCNC 2002: 825-831
Coauthor Index
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-10-04 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
