Polynomial-time algorithms for coding across multiple unicasts
Tracey Ho
Abstract
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network codes within the class of network codes restricted to XOR coding between pairs of flows.
Create a lesson
Related papers
FaulT-Bench: Towards Benchmarking Network Troubleshooting LLM Agents under Unreliable User Tickets
Kuan-Hao Tseng, Niruth Bogahawatta, Yasod Ginige et al.
Claude Code Complete User Handbook
David Soldani
Extending Low Latency Service Across the Internet
Harkirat Singh, Fatih Berkay Sarpkaya, Hakan Gulec et al.
SFC-Aware Online Aggregated Data-Link Orchestration for SDN/NFV-Enabled SAGINs
Ziyang Guo, Bing Du
PRO-RAN: Processor-Level Characterization of Open RAN Centralized and Distributed Units
Moojan Kamalzadeh, Larry Horner, Linqi Xiao et al.
SlimTCP: It's fast, but not because it's slim
Mihai Drosi Caju, Costin Raiciu