NYU Faculty Digital Archive
metadata only
ROUTING AND CAPACITY ASSIGNMENT IN A NETWORK WITH DIFFERENT CLASSES OF MESSAGES
A mathematical model is presented for the problem of jointly assigning routes to the communicating pairs of nodes and capacities to the links in a packet switched network. It is assumed that several classes of flow are using the network, different service requirements and message characteristics bei
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
- CAPACITY AND FLOW ASSIGNMENTS IN LARGE COMPUTER NETWORKS#933595
- Models of policy based routing#131688
- Defining Network Capacity#420327
- Network Management Framework for MPLS-based Transport Networks#476290
- Network-based prediction of drug combinations with quantum annealing#1063824
Record · ID 933527
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