Repositório Institucional da UFMG
metadata only
Robust optimization for OSPF routing
On OSPF protocol, given a et of weights for each link, the data are routed through the shortest paths between the sender and the receiver. The OSPF weight setting problem consists in defining the assignment of link weights such that the respective shortest path routing results in the least congested
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
- A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks#288392
- Multi-Topology (MT) Routing in OSPF#254530
- OSPF Application-Specific Link Attributes#399425
- Pareto Optimization with Robust Evaluation for Noisy Subset Selection#155527
- OSPF-xTE: Experimental Extension to OSPF for Traffic Engineering#208867
Record · ID 1435568
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