Balaji Prabhakar

According to our database1, Balaji Prabhakar authored at least 92 papers between 1996 and 2019.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2017, "For developing algorithms and systems for large-scale data center networks and societal networks".

IEEE Fellow

IEEE Fellow 2011, "For contributions to network theory and algorithms".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
λ-NIC: Interactive Serverless Compute on Programmable SmartNICs.
CoRR, 2019

λ-NIC: Interactive Serverless Compute on SmartNICs.
Proceedings of the ACM SIGCOMM 2019 Conference Posters and Demos, 2019

SIMON: A Simple and Scalable Method for Sensing, Inference and Measurement in Data Center Networks.
Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation, 2019

Toward Scalable Replication Systems with Predictable Tails Using Programmable Data Planes.
Proceedings of the 3rd Asia-Pacific Workshop on Networking, 2019

2018
Exploiting a Natural Network Effect for Scalable, Fine-grained Clock Synchronization.
Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation, 2018

The Global Anchor Method for Quantifying Linguistic Shifts and Domain Adaptation.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Stable Matchings in Metric Spaces: Modeling Real-World Preferences using Proximity.
CoRR, 2017

Reducing inefficiencies in taxi systems.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

Self-programming networks: Architecture and algorithms.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2015
A Big Data Dashboard for Urban Mobility.
Proceedings of the 2015 International Conference on Soft Computing and Software Engineering, 2015

A Big Data System for the Internet of Moving Things.
Proceedings of the Federated Computing Research Conference, 2015

Polling one's friends: A graph theoretic view.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Traffic congestion: models, costs and optimal transport.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

2013
Designing large-scale nudge engines.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

pFabric: minimal near-optimal datacenter transport.
Proceedings of the ACM SIGCOMM 2013 Conference, 2013

EyeQ: Practical Network Performance Isolation at the Edge.
Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation, 2013

Road traffic networks: Optimal transport and incentives.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Asymptotic independence of queues under randomized load balancing.
Queueing Syst. Theory Appl., 2012

The Regulation of Ant Colony Foraging Activity without Spatial Information.
PLoS Comput. Biol., 2012

Less Is More: Trading a Little Bandwidth for Ultra-Low Latency in the Data Center.
Proceedings of the 9th USENIX Symposium on Networked Systems Design and Implementation, 2012

Deconstructing datacenter packet transport.
Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012

EyeQ: Practical Network Performance Isolation for the Multi-tenant Cloud.
Proceedings of the 4th USENIX Workshop on Hot Topics in Cloud Computing, 2012

Steptacular: An incentive mechanism for promoting wellness.
Proceedings of the Fourth International Conference on Communication Systems and Networks, 2012

NetBump: user-extensible active queue management with bumps on the wire.
Proceedings of the Symposium on Architecture for Networking and Communications Systems, 2012

Anternet: The regulation of harvester ant foraging and Internet congestion control.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Decay of Tails at Equilibrium for FIFO Join the Shortest Queue Networks
CoRR, 2011

Stability analysis of QCN: the averaging principle.
Proceedings of the SIGMETRICS 2011, 2011

Analysis of DCTCP: stability, convergence, and fairness.
Proceedings of the SIGMETRICS 2011, 2011

2010
Randomized load balancing with general service time distributions.
Proceedings of the SIGMETRICS 2010, 2010

Data center TCP (DCTCP).
Proceedings of the ACM SIGCOMM 2010 Conference on Applications, 2010

AF-QCN: Approximate Fairness with Quantized Congestion Notification for Multi-tenanted Data Centers.
Proceedings of the IEEE 18th Annual Symposium on High Performance Interconnects, 2010

2009
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Counter braids: a novel counter architecture for per-flow measurement.
Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008

Counter Braids.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

2007
Detailed Network Measurements Using Sparse Graph Counters: The Theory
CoRR, 2007

Efficient, Fully Local Algorithms for CIOQ Switches.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Iterative Scheduling Algorithms.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

ElephantTrap: A low cost device for identifying large flows.
Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects, 2007

2006
Introduction to the special issue on networking and information theory.
IEEE/ACM Trans. Netw., 2006

Optimal Throughput-Delay Scaling in Wireless Networks - Part II: Constant-Size Packets.
IEEE Trans. Inf. Theory, 2006

Optimal throughput-delay scaling in wireless networks: part I: the fluid model.
IEEE Trans. Inf. Theory, 2006

Randomized gossip algorithms.
IEEE Trans. Inf. Theory, 2006

On entropy for mixtures of discrete and continuous variables
CoRR, 2006

Perfect Hashing for Network Applications.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation.
IEEE/ACM Trans. Netw., 2005

Systems with multiple servers under heavy-tailed workloads.
Perform. Evaluation, 2005

Belief Propagation Based Multi--User Detection
CoRR, 2005

Throughput-delay scaling in wireless networks with constant-size packets.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Load balancing with migration penalties.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Gossip algorithms: design, analysis and applications.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Network Hardware Algorithms (Keynote).
Proceedings of the 1st International Conference on Collaborative Computing: Networking, 2005

Mixing Times for Random Walks on Geometric Random Graphs.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Near-optimal depth-constrained codes.
IEEE Trans. Inf. Theory, 2004

Delay bounds for combined input-output switches with low speedup.
Perform. Evaluation, 2004

Modeling correlations in web traces and implications for designing replacement policies.
Comput. Networks, 2004

A new proof of Parisi's conjecture for the finite random assignment problem.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Throughput-delay trade-off in energy constrained wireless networks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Throughput-Delay Trade-off in Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

An in-band easy-to-deploy mechanism for network-to-transport signaling.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003
Entropy and the timing capacity of discrete queues.
IEEE Trans. Inf. Theory, 2003

Approximate Fair Allocation of Link Bandwidth.
IEEE Micro, 2003

Randomized scheduling algorithms for high-aggregate bandwidth switches.
IEEE J. Sel. Areas Commun., 2003

Incentive mechanisms for smoothing out a focused demand for network resources.
Comput. Commun., 2003

The scaling hypothesis: simplifying the prediction of network performance using scaled-down simulations.
Comput. Commun. Rev., 2003

Approximate fairness through differential dropping.
Comput. Commun. Rev., 2003

SHRiNK: A method for scaleable performance prediction and efficient network simulation.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Energy-eficient packet transmission over a wireless link.
IEEE/ACM Trans. Netw., 2002

Efficient randomized web-cache replacement schemes using samples from past eviction times.
IEEE/ACM Trans. Netw., 2002

Maintaining Statistics Counters in Router Line Cards.
IEEE Micro, 2002

Efficient Randomized Algorithms for Input-Queued Switch Scheduling.
IEEE Micro, 2002

An Implementable Parallel Scheduler for Input-Queued Switches.
IEEE Micro, 2002

Approximate fairness through differential dropping (summary).
Comput. Commun. Rev., 2002

Energy-efficient Scheduling of Packet Transmissions over Wireless Networks.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

A Flow Table-Based Design to Approximate Fairness.
Proceedings of the 10th Annual IEEE Symposium on High Performance Interconnects (HOTIC 2002), August 21, 2002

Adaptive transmission of variable-rate data over a fading channel for energy-efficiency.
Proceedings of the Global Telecommunications Conference, 2002

Delay performance of high-speed packet switches with low speedup.
Proceedings of the Global Telecommunications Conference, 2002

Load Balancing with Memory.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Approximate Fair Dropping for Variable-Length Packets.
IEEE Micro, 2001

Smoothing out focused demand for network resources.
Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001

A Randomized Web-Cache Replacement Scheme.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Energy-efficient Transmission over a Wireless Link via Lazy Packet Scheduling.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Analysis of a statistics counter architecture.
Proceedings of the Ninth Symposium on High Performance Interconnects, 2001

An efficient randomized algorithm for input-queued switch scheduling.
Proceedings of the Ninth Symposium on High Performance Interconnects, 2001

2000
CHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Near Optimal Routing Lookups with Bounded Worst Case Performance.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

The Throughput of Data Switches with and without Speedup.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999
Matching output queueing with a combined input/output-queued switch.
IEEE J. Sel. Areas Commun., 1999

On the speedup required for combined input- and output-queued switching.
Autom., 1999

1997
Multicast Scheduling for Input-Queued Switches.
IEEE J. Sel. Areas Commun., 1997

1996
Scheduling Multicast Cells in an Input-Queued Switch.
Proceedings of the Proceedings IEEE INFOCOM '96, 1996


  Loading...