arXiv (All)
open access
Formal Abstractions for Packet Scheduling
Early programming models for software-defined networking (SDN) focused on basic features for controlling network-wide forwarding paths, but more recent work has considered richer features, such as packet scheduling and queueing, that affect performance. In particular, PIFO trees, proposed by Sivaram
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- data plane systems for network monitoring and packet scheduling in programmable networks#194375
- Performance Measurement for Segment Routing Networks with the MPLS Data Plane#153147
- A YANG Data Model for OSPF Segment Routing over the MPLS Data Plane#131648
- MPLS Transport Profile Data Plane Architecture#501309
- Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations#2469
Record · ID 1035247
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive