From MWM to iSLIP: A Linear-Algebraic Tutorial on Input-Queued Switch Scheduling
2026-06-16T07:23:51Z•d69ab9c679f6e1537f633a68b58f7e1566712be28d455e2b40340475f69c3341
6GADAS-V2X-safetyContainernetHEMSIoT traffic captureIoT-testbedLEO-satelliteMWMPVSINRSinkhornTeraLinkbase-station deploymentbattery-degradationcomputing-network convergencehierarchical-RLiSLIPinput-queued switchnetworkingoptimal-transportorchestrationspectral-schedulingsub-THzsubmodular-optimizationswitch-scheduling
What happened
This feed aggregates recent arXiv CS/Networking & Internet papers (June 16, 2026) covering scheduling, wireless/6G architectures, satellite links, IoT testbeds, deployment optimization, energy-storage economics, cooperative vehicle safety, deterministic scheduling, transport-layer priority for mixed-criticality flows, and cross-site GPU inference routing. Key contributions include: a linear-algebraic tutorial unifying maximum-weight matching (MWM), queue stability and iSLIP behavior (shows iSLIP throughput ceiling under non-uniform high load; spectral scheduling and entropy-regularized OT more
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_cs_ni
- Record identifier
- d69ab9c679f6e1537f633a68b58f7e1566712be28d455e2b40340475f69c3341
- Enrichment time
- 2026-06-16T07:23:51Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.