The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Balaji Prabhakar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah
    Mixing Times for Random Walks on Geometric Random Graphs. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:240-249 [Conf]
  2. Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah
    Load Balancing with Memory. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:799-808 [Conf]
  3. Chandra Nair, Balaji Prabhakar, Mayank Sharma
    Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:168-178 [Conf]
  4. Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah
    Gossip algorithms: design, analysis and applications. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:1653-1664 [Conf]
  5. Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaji Prabhakar
    Matching Output Queueing with a Combined Input Output Queued Switch. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:1169-1178 [Conf]
  6. J. G. Dai, Balaji Prabhakar
    The Throughput of Data Switches with and without Speedup. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:556-564 [Conf]
  7. Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah
    Throughput-Delay Trade-off in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  8. Paolo Giaccone, Balaji Prabhakar, Devavrat Shah
    Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  9. Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
    Near Optimal Routing Lookups with Bounded Worst Case Performance. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1184-1192 [Conf]
  10. Nick McKeown, Balaji Prabhakar
    Scheduling Multicast Cells in an Input-Queued Switch. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1996, pp:271-278 [Conf]
  11. Chandra Nair, Abbas El Gamal, Balaji Prabhakar, Elif Uysal-Biyikoglu, Sina Zahedi
    Energy-efficient Scheduling of Packet Transmissions over Wireless Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  12. Rong Pan, Balaji Prabhakar, Konstantinos Psounis
    CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:942-951 [Conf]
  13. Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik
    SHRiNK: A method for scaleable performance prediction and efficient network simulation. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  14. Balaji Prabhakar, Elif Uysal-Biyikoglu, Abbas El Gamal
    Energy-efficient Transmission over a Wireless Link via Lazy Packet Scheduling. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:386-394 [Conf]
  15. Konstantinos Psounis, Balaji Prabhakar
    A Randomized Web-Cache Replacement Scheme. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1407-1415 [Conf]
  16. Kevin Leyton-Brown, Ryan Porter, Shobha Venkataraman, Balaji Prabhakar
    Smoothing out focused demand for network resources. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2001, pp:245-248 [Conf]
  17. Balaji Prabhakar
    Network Hardware Algorithms (Keynote). [Citation Graph (0, 0)][DBLP]
    CollaborateCom, 2005, pp:- [Conf]
  18. Konstantinos Psounis, Rong Pan, Balaji Prabhakar, Damon Wischik
    The scaling hypothesis: simplifying the prediction of network performance using scaled-down simulations. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2003, v:33, n:1, pp:35-40 [Journal]
  19. Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker
    Approximate fairness through differential dropping (summary). [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2002, v:32, n:1, pp:72- [Journal]
  20. Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker
    Approximate fairness through differential dropping. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2003, v:33, n:2, pp:23-39 [Journal]
  21. Konstantinos Psounis, An Zhu, Balaji Prabhakar, Rajeev Motwani
    Modeling correlations in web traces and implications for designing replacement policies. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2004, v:45, n:4, pp:379-398 [Journal]
  22. Kevin Leyton-Brown, Ryan Porter, Balaji Prabhakar, Yoav Shoham, Shobha Venkataraman
    Incentive mechanisms for smoothing out a focused demand for network resources. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2003, v:26, n:3, pp:237-250 [Journal]
  23. Balaji Prabhakar, Nick McKeown, Ritesh Ahuja
    Multicast Scheduling for Input-Queued Switches. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1997, v:15, n:5, pp:855-866 [Journal]
  24. Paolo Giaccone, Devavrat Shah, Balaji Prabhakar
    An Implementable Parallel Scheduler for Input-Queued Switches. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2002, v:22, n:1, pp:19-25 [Journal]
  25. Rong Pan, Balaji Prabhakar, Lee Breslau, Scott Shenker
    Approximate Fair Allocation of Link Bandwidth. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2003, v:23, n:1, pp:36-43 [Journal]
  26. Devavrat Shah, Paolo Giaccone, Balaji Prabhakar
    Efficient Randomized Algorithms for Input-Queued Switch Scheduling. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2002, v:22, n:1, pp:10-18 [Journal]
  27. Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown
    Maintaining Statistics Counters in Router Line Cards. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2002, v:22, n:1, pp:76-81 [Journal]
  28. Konstantinos Psounis, Rong Pan, Balaji Prabhakar
    Approximate Fair Dropping for Variable-Length Packets. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2001, v:21, n:1, pp:48-56 [Journal]
  29. Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah
    Delay bounds for combined input-output switches with low speedup. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2004, v:55, n:1-2, pp:113-128 [Journal]
  30. Konstantinos Psounis, Pablo Molinero-Fernández, Balaji Prabhakar, Fragkiskos Papadopoulos
    Systems with multiple servers under heavy-tailed workloads. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2005, v:62, n:1-4, pp:456-474 [Journal]
  31. Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah
    Randomized gossip algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2508-2530 [Journal]
  32. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2285-2288 [Journal]
  33. Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah
    Optimal throughput-delay scaling in wireless networks: part I: the fluid model. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2568-2592 [Journal]
  34. Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
    Near-optimal depth-constrained codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3294-3298 [Journal]
  35. Balaji Prabhakar, R. Gallager
    Entropy and the timing capacity of discrete queues. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:357-370 [Journal]
  36. Abbas El Gamal, Mammen P. Mammen, Balaji Prabhakar, Devavrat Shah
    Optimal Throughput-Delay Scaling in Wireless Networks - Part II: Constant-Size Packets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5111-5116 [Journal]
  37. Konstantinos Psounis, Balaji Prabhakar
    Efficient randomized web-cache replacement schemes using samples from past eviction times. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:4, pp:441-455 [Journal]
  38. Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik
    SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:5, pp:975-988 [Journal]
  39. Elif Uysal-Biyikoglu, Balaji Prabhakar, Abbas El Gamal
    Energy-eficient packet transmission over a wireless link. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:4, pp:487-499 [Journal]
  40. 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. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:14, n:4, pp:674- [Journal]
  41. Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma
    Iterative Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:445-453 [Conf]
  42. Amin Firoozshahian, Vahideh Manshadi, Ashish Goel, Balaji Prabhakar
    Efficient, Fully Local Algorithms for CIOQ Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:2491-2495 [Conf]
  43. Chandra Nair, Balaji Prabhakar, Devavrat Shah
    On entropy for mixtures of discrete and continuous variables [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  44. Yi Lu, Andrea Montanari, Balaji Prabhakar
    Detailed Network Measurements Using Sparse Graph Counters: The Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  45. A Flow Table-Based Design to Approximate Fairness. [Citation Graph (, )][DBLP]


  46. Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture. [Citation Graph (, )][DBLP]


  47. Data center TCP (DCTCP). [Citation Graph (, )][DBLP]


  48. Counter braids: a novel counter architecture for per-flow measurement. [Citation Graph (, )][DBLP]


  49. Randomized load balancing with general service time distributions. [Citation Graph (, )][DBLP]


  50. Belief Propagation Based Multi--User Detection [Citation Graph (, )][DBLP]


Search in 0.247secs, Finished in 0.250secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002