All Stories

  1. Nonuniform Graph Partitioning with Just a Little Flex
  2. Perfect Network Resilience in Polynomial Time
  3. How AI Communication Is Biased and Why It Matters for Society
  4. Exp-PIFO: Scalable and Efficient Programmable Packet Scheduling
  5. Approximate Agreement Algorithms for Byzantine Collaborative Learning
  6. In the Search of Optimal Tree Networks: Hardness and Heuristics
  7. Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
  8. An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
  9. When is liquid democracy possible?
  10. Revolutionizing Datacenter Networks via Reconfigurable Topologies
  11. L3: Latency-aware Load Balancing in Multi-Cluster Service Mesh
  12. Starlink Performance through the Edge Router Lens
  13. Proceedings of the Twenty-fifth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
  14. Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation
  15. Invited Paper: Blockchain Governance and Liquid Democracy -- Quantifying Decentralization in Gitcoin and Internet Computer
  16. Poster: P4DME: DNS Threat Mitigation with P4 In-Network Machine Learning Offload
  17. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization
  18. TCP's Third Eye: Leveraging eBPF for Telemetry-Powered Congestion Control
  19. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
  20. Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control
  21. Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control
  22. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
  23. Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
  24. Analyzing the Communication Clusters in Datacenters✱
  25. Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
  26. Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control
  27. Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
  28. Survey on Blockchain Networking
  29. Cerberus
  30. Cerberus
  31. Cerberus
  32. Optimal Virtual Network Embeddings for Tree Topologies
  33. Input-Dynamic Distributed Algorithms for Communication Networks
  34. Input-Dynamic Distributed Algorithms for Communication Networks
  35. Input-Dynamic Distributed Algorithms for Communication Networks
  36. Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network
  37. P4Fuzz: Compiler Fuzzer forDependable Programmable Dataplanes
  38. On the Hardness and Inapproximability of Virtual Network Embeddings