2008 | ||
---|---|---|
47 | EE | 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 | ||
46 | EE | Amin Firoozshahian, Vahideh Manshadi, Ashish Goel, Balaji Prabhakar: Efficient, Fully Local Algorithms for CIOQ Switches. INFOCOM 2007: 2491-2495 |
45 | EE | Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma: Iterative Scheduling Algorithms. INFOCOM 2007: 445-453 |
44 | EE | Yi Lu, Andrea Montanari, Balaji Prabhakar: Detailed Network Measurements Using Sparse Graph Counters: The Theory CoRR abs/0710.0658: (2007) |
2006 | ||
43 | EE | Chandra Nair, Balaji Prabhakar, Devavrat Shah: On entropy for mixtures of discrete and continuous variables CoRR abs/cs/0607075: (2006) |
42 | EE | 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) |
41 | EE | 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) |
40 | EE | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6): 2508-2530 (2006) |
39 | EE | 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) |
38 | EE | 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) |
2005 | ||
37 | EE | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Mixing Times for Random Walks on Geometric Random Graphs. ALENEX/ANALCO 2005: 240-249 |
36 | EE | Balaji Prabhakar: Network Hardware Algorithms (Keynote). CollaborateCom 2005 |
35 | EE | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Gossip algorithms: design, analysis and applications. INFOCOM 2005: 1653-1664 |
34 | EE | Andrea Montanari, Balaji Prabhakar, David Tse: Belief Propagation Based Multi--User Detection CoRR abs/cs/0510044: (2005) |
33 | EE | 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) |
32 | EE | 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) |
2004 | ||
31 | EE | Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Throughput-Delay Trade-off in Wireless Networks. INFOCOM 2004 |
30 | EE | 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) |
29 | EE | Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd: Near-optimal depth-constrained codes. IEEE Transactions on Information Theory 50(12): 3294-3298 (2004) |
28 | EE | 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) |
2003 | ||
27 | EE | Chandra Nair, Balaji Prabhakar, Mayank Sharma: Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem. FOCS 2003: 168-178 |
26 | EE | Rong Pan, Balaji Prabhakar, Konstantinos Psounis, Damon Wischik: SHRiNK: A method for scaleable performance prediction and efficient network simulation. INFOCOM 2003 |
25 | EE | 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) |
24 | EE | Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker: Approximate fairness through differential dropping. Computer Communication Review 33(2): 23-39 (2003) |
23 | EE | 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) |
22 | EE | Rong Pan, Balaji Prabhakar, Lee Breslau, Scott Shenker: Approximate Fair Allocation of Link Bandwidth. IEEE Micro 23(1): 36-43 (2003) |
21 | Balaji Prabhakar, R. Gallager: Entropy and the timing capacity of discrete queues. IEEE Transactions on Information Theory 49(2): 357-370 (2003) | |
2002 | ||
20 | EE | Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah: Load Balancing with Memory. FOCS 2002: 799-808 |
19 | EE | Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker: A Flow Table-Based Design to Approximate Fairness. Hot Interconnects 2002: 37-42 |
18 | EE | Chandra Nair, Abbas El Gamal, Balaji Prabhakar, Elif Uysal-Biyikoglu, Sina Zahedi: Energy-efficient Scheduling of Packet Transmissions over Wireless Networks. INFOCOM 2002 |
17 | EE | Paolo Giaccone, Balaji Prabhakar, Devavrat Shah: Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches. INFOCOM 2002 |
16 | EE | Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker: Approximate fairness through differential dropping (summary). Computer Communication Review 32(1): 72 (2002) |
15 | EE | Devavrat Shah, Paolo Giaccone, Balaji Prabhakar: Efficient Randomized Algorithms for Input-Queued Switch Scheduling. IEEE Micro 22(1): 10-18 (2002) |
14 | EE | Paolo Giaccone, Devavrat Shah, Balaji Prabhakar: An Implementable Parallel Scheduler for Input-Queued Switches. IEEE Micro 22(1): 19-25 (2002) |
13 | EE | Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown: Maintaining Statistics Counters in Router Line Cards. IEEE Micro 22(1): 76-81 (2002) |
12 | EE | 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) |
11 | EE | 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) |
2001 | ||
10 | EE | Kevin Leyton-Brown, Ryan Porter, Shobha Venkataraman, Balaji Prabhakar: Smoothing out focused demand for network resources. ACM Conference on Electronic Commerce 2001: 245-248 |
9 | EE | Konstantinos Psounis, Balaji Prabhakar: A Randomized Web-Cache Replacement Scheme. INFOCOM 2001: 1407-1415 |
8 | EE | Balaji Prabhakar, Elif Uysal-Biyikoglu, Abbas El Gamal: Energy-efficient Transmission over a Wireless Link via Lazy Packet Scheduling. INFOCOM 2001: 386-394 |
7 | EE | Konstantinos Psounis, Rong Pan, Balaji Prabhakar: Approximate Fair Dropping for Variable-Length Packets. IEEE Micro 21(1): 48-56 (2001) |
2000 | ||
6 | EE | Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd: Near Optimal Routing Lookups with Bounded Worst Case Performance. INFOCOM 2000: 1184-1192 |
5 | EE | J. G. Dai, Balaji Prabhakar: The Throughput of Data Switches with and without Speedup. INFOCOM 2000: 556-564 |
4 | EE | Rong Pan, Balaji Prabhakar, Konstantinos Psounis: CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation. INFOCOM 2000: 942-951 |
1999 | ||
3 | Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaji Prabhakar: Matching Output Queueing with a Combined Input Output Queued Switch. INFOCOM 1999: 1169-1178 | |
1997 | ||
2 | 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 | ||
1 | Nick McKeown, Balaji Prabhakar: Scheduling Multicast Cells in an Input-Queued Switch. INFOCOM 1996: 271-278 |