{"paper":{"title":"Routing Metrics Depending on Previous Edges: The Mn Taxonomy and its Corresponding Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amaury Van Bemten, Carmen Mas Machuca, Jochen W. Guck, Wolfgang Kellerer","submitted_at":"2018-05-29T17:06:54Z","abstract_excerpt":"The routing algorithms used by current operators aim at coping with the demanded QoS requirements while optimizing the use of their network resources. These algorithms rely on the optimal substructure property (OSP), which states that an optimal path contains other optimal paths within it. However, we show that QoS metrics such as queuing delay and buffer consumption do not satisfy this property, which implies that the used algorithms lose their optimality and/or completeness. This negatively impacts the operator economy by causing a waste of network resources and/or violating Service Level Ag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11586","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}