Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Balaji Prabhakar
2010 – today
- 2013
[c35]- 2012
[j27]Balaji Prabhakar, Katherine N. Dektar, Deborah M. Gordon: The Regulation of Ant Colony Foraging Activity without Spatial Information. PLoS Computational Biology 8(8) (2012)
[j26]Maury Bramson, Yi Lu, Balaji Prabhakar: Asymptotic independence of queues under randomized load balancing. Queueing Syst. 71(3): 247-292 (2012)
[c34]Mohammad Al-Fares, Rishi Kapoor, George Porter, Sambit Das, Hakim Weatherspoon, Balaji Prabhakar, Amin Vahdat: NetBump: user-extensible active queue management with bumps on the wire. ANCS 2012: 61-72
[c33]Naini Gomes, Deepak Merugu, Gearoid O'Brien, Chinmoy Mandayam, Jia Shuo Yue, Berk Atikoglu, Adrian Albert, Norihiro Fukumoto, Huan Liu, Balaji Prabhakar, Damon Wischik: Steptacular: An incentive mechanism for promoting wellness. COMSNETS 2012: 1-6
[c32]Mohammad Alizadeh, Shuang Yang, Sachin Katti, Nick McKeown, Balaji Prabhakar, Scott Shenker: Deconstructing datacenter packet transport. HotNets 2012: 133-138- 2011
[c31]Mohammad Alizadeh, Abdul Kabbani, Berk Atikoglu, Balaji Prabhakar: Stability analysis of QCN: the averaging principle. SIGMETRICS 2011: 49-60
[c30]Mohammad Alizadeh, Adel Javanmard, Balaji Prabhakar: Analysis of DCTCP: stability, convergence, and fairness. SIGMETRICS 2011: 73-84
[i4]Maury Bramson, Yi Lu, Balaji Prabhakar: Decay of Tails at Equilibrium for FIFO Join the Shortest Queue Networks. CoRR abs/1106.4582 (2011)- 2010
[c29]Abdul Kabbani, Mohammad Alizadeh, Masato Yasuda, Rong Pan, Balaji Prabhakar: AF-QCN: Approximate Fairness with Quantized Congestion Notification for Multi-tenanted Data Centers. Hot Interconnects 2010: 58-65
[c28]Mohammad Alizadeh, Albert G. Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, Murari Sridharan: Data center TCP (DCTCP). SIGCOMM 2010: 63-74
[c27]Maury Bramson, Yi Lu, Balaji Prabhakar: Randomized load balancing with general service time distributions. SIGMETRICS 2010: 275-286
2000 – 2009
- 2009
[c26]Yi Lu, Balaji Prabhakar: Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture. INFOCOM 2009: 522-530- 2008
[c25]Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang Dharmapurikar, Abdul Kabbani: Counter braids: a novel counter architecture for per-flow measurement. SIGMETRICS 2008: 121-132- 2007
[c24]Yi Lu, Mei Wang, Balaji Prabhakar, Flavio Bonomi: ElephantTrap: A low cost device for identifying large flows. Hot Interconnects 2007: 99-108
[c23]Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma: Iterative Scheduling Algorithms. INFOCOM 2007: 445-453
[c22]Amin Firoozshahian, Vahideh H. Manshadi, Ashish Goel, Balaji Prabhakar: Efficient, Fully Local Algorithms for CIOQ Switches. INFOCOM 2007: 2491-2495
[i3]Yi Lu, Andrea Montanari, Balaji Prabhakar: Detailed Network Measurements Using Sparse Graph Counters: The Theory. CoRR abs/0710.0658 (2007)- 2006
[j25]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, Rayadurgam Srikant, Donald F. Towsley, Raymond W. Yeung: Introduction to the special issue on networking and information theory. IEEE Transactions on Information Theory 52(6): 2285-2288 (2006)
[j24]Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6): 2508-2530 (2006)
[j23]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Optimal throughput-delay scaling in wireless networks: part I: the fluid model. IEEE Transactions on Information Theory 52(6): 2568-2592 (2006)
[j22]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Optimal Throughput-Delay Scaling in Wireless Networks - Part II: Constant-Size Packets. IEEE Transactions on Information Theory 52(11): 5111-5116 (2006)
[j21]Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, R. Srikant, Donald F. Towsley, Raymond W. Yeung: Introduction to the special issue on networking and information theory. IEEE/ACM Trans. Netw. 14(4): 674 (2006)
[i2]Chandra Nair, Balaji Prabhakar, Devavrat Shah: On entropy for mixtures of discrete and continuous variables. CoRR abs/cs/0607075 (2006)- 2005
[j20]Konstantinos Psounis, Pablo Molinero-Fernández, Balaji Prabhakar, Fragkiskos Papadopoulos: Systems with multiple servers under heavy-tailed workloads. Perform. Eval. 62(1-4): 456-474 (2005)
[j19]Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik: SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation. IEEE/ACM Trans. Netw. 13(5): 975-988 (2005)
[c21]Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Mixing Times for Random Walks on Geometric Random Graphs. ALENEX/ANALCO 2005: 240-249
[c20]
[c19]Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Gossip algorithms: design, analysis and applications. INFOCOM 2005: 1653-1664
[i1]Andrea Montanari, Balaji Prabhakar, David Tse: Belief Propagation Based Multi--User Detection. CoRR abs/cs/0510044 (2005)- 2004
[j18]Konstantinos Psounis, An Zhu, Balaji Prabhakar, Rajeev Motwani: Modeling correlations in web traces and implications for designing replacement policies. Computer Networks 45(4): 379-398 (2004)
[j17]Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah: Delay bounds for combined input-output switches with low speedup. Perform. Eval. 55(1-2): 113-128 (2004)
[j16]Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd: Near-optimal depth-constrained codes. IEEE Transactions on Information Theory 50(12): 3294-3298 (2004)
[c18]Mayank Sharma, Dina Katabi, Rong Pan, Balaji Prabhakar: An in-band easy-to-deploy mechanism for network-to-transport signaling. GLOBECOM 2004: 1278-1283
[c17]Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Throughput-Delay Trade-off in Wireless Networks. INFOCOM 2004- 2003
[j15]Konstantinos Psounis, Rong Pan, Balaji Prabhakar, Damon Wischik: The scaling hypothesis: simplifying the prediction of network performance using scaled-down simulations. Computer Communication Review 33(1): 35-40 (2003)
[j14]Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker: Approximate fairness through differential dropping. Computer Communication Review 33(2): 23-39 (2003)
[j13]Kevin Leyton-Brown, Ryan Porter, Balaji Prabhakar, Yoav Shoham, Shobha Venkataraman: Incentive mechanisms for smoothing out a focused demand for network resources. Computer Communications 26(3): 237-250 (2003)
[j12]Paolo Giaccone, Balaji Prabhakar, Devavrat Shah: Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE Journal on Selected Areas in Communications 21(4): 546-559 (2003)
[j11]Rong Pan, Balaji Prabhakar, Lee Breslau, Scott Shenker: Approximate Fair Allocation of Link Bandwidth. IEEE Micro 23(1): 36-43 (2003)
[j10]Balaji Prabhakar, R. Gallager: Entropy and the timing capacity of discrete queues. IEEE Transactions on Information Theory 49(2): 357-370 (2003)
[c16]Chandra Nair, Balaji Prabhakar, Mayank Sharma: Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem. FOCS 2003: 168-178
[c15]Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik: SHRiNK: A method for scaleable performance prediction and efficient network simulation. INFOCOM 2003- 2002
[j9]Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker: Approximate fairness through differential dropping (summary). Computer Communication Review 32(1): 72 (2002)
[j8]Devavrat Shah, Paolo Giaccone, Balaji Prabhakar: Efficient Randomized Algorithms for Input-Queued Switch Scheduling. IEEE Micro 22(1): 10-18 (2002)
[j7]Paolo Giaccone, Devavrat Shah, Balaji Prabhakar: An Implementable Parallel Scheduler for Input-Queued Switches. IEEE Micro 22(1): 19-25 (2002)
[j6]Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown: Maintaining Statistics Counters in Router Line Cards. IEEE Micro 22(1): 76-81 (2002)
[j5]Konstantinos Psounis, Balaji Prabhakar: Efficient randomized web-cache replacement schemes using samples from past eviction times. IEEE/ACM Trans. Netw. 10(4): 441-455 (2002)
[j4]Elif Uysal-Biyikoglu, Balaji Prabhakar, Abbas El Gamal: Energy-eficient packet transmission over a wireless link. IEEE/ACM Trans. Netw. 10(4): 487-499 (2002)
[c14]Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah: Load Balancing with Memory. FOCS 2002: 799-808
[c13]Elif Uysal-Biyikoglu, Abbas El Gamal, Balaji Prabhakar: Adaptive transmission of variable-rate data over a fading channel for energy-efficiency. GLOBECOM 2002: 97-101
[c12]Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah: Delay performance of high-speed packet switches with low speedup. GLOBECOM 2002: 2629-2633
[c11]Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker: A Flow Table-Based Design to Approximate Fairness. Hot Interconnects 2002: 37-42
[c10]Paolo Giaccone, Balaji Prabhakar, Devavrat Shah: Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches. INFOCOM 2002
[c9]Chandra Nair, Abbas El Gamal, Balaji Prabhakar, Elif Uysal-Biyikoglu, Sina Zahedi: Energy-efficient Scheduling of Packet Transmissions over Wireless Networks. INFOCOM 2002- 2001
[j3]Konstantinos Psounis, Rong Pan, Balaji Prabhakar: Approximate Fair Dropping for Variable-Length Packets. IEEE Micro 21(1): 48-56 (2001)
[c8]Balaji Prabhakar, Elif Uysal-Biyikoglu, Abbas El Gamal: Energy-efficient Transmission over a Wireless Link via Lazy Packet Scheduling. INFOCOM 2001: 386-394
[c7]Konstantinos Psounis, Balaji Prabhakar: A Randomized Web-Cache Replacement Scheme. INFOCOM 2001: 1407-1415
[c6]Kevin Leyton-Brown, Ryan Porter, Shobha Venkataraman, Balaji Prabhakar: Smoothing out focused demand for network resources. ACM Conference on Electronic Commerce 2001: 245-248- 2000
[c5]J. G. Dai, Balaji Prabhakar: The Throughput of Data Switches with and without Speedup. INFOCOM 2000: 556-564
[c4]Rong Pan, Balaji Prabhakar, Konstantinos Psounis: CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation. INFOCOM 2000: 942-951
[c3]Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd: Near Optimal Routing Lookups with Bounded Worst Case Performance. INFOCOM 2000: 1184-1192
1990 – 1999
- 1999
[j2]Balaji Prabhakar, Nick McKeown: On the speedup required for combined input- and output-queued switching. Automatica 35(12): 1909-1920 (1999)
[c2]Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaji Prabhakar: Matching Output Queueing with a Combined Input Output Queued Switch. INFOCOM 1999: 1169-1178- 1997
[j1]Balaji Prabhakar, Nick McKeown, Ritesh Ahuja: Multicast Scheduling for Input-Queued Switches. IEEE Journal on Selected Areas in Communications 15(5): 855-866 (1997)- 1996
[c1]Nick McKeown, Balaji Prabhakar: Scheduling Multicast Cells in an Input-Queued Switch. INFOCOM 1996: 271-278
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:45 CEST by the dblp team



