{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GWO3Z2GY2XS4ND3LSAPNJ6QQCW","short_pith_number":"pith:GWO3Z2GY","schema_version":"1.0","canonical_sha256":"359dbce8d8d5e5c68f6b901ed4fa10158f8c270ad10b6180046878c431b5f49e","source":{"kind":"arxiv","id":"1703.07419","version":2},"attestation_state":"computed","paper":{"title":"Optimal Routing for Delay-Sensitive Traffic in Overlay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Rahul Singh","submitted_at":"2017-03-21T20:33:01Z","abstract_excerpt":"We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the underlay characteristics. We pose the problem as a constrained MDP, and show that when the underlay implements static policies such as FIFO with randomized routing, then a decentralized policy, that can be computed efficiently in a distributed fashion, is optimal. Our algorithm utilizes multi-timescale stochastic approximation techniques, and its convergence relies on the fact that the recursion"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.07419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-03-21T20:33:01Z","cross_cats_sorted":[],"title_canon_sha256":"1545b10d4e40382b980be20bb306d22e863dfe92933d52874252347e1100107b","abstract_canon_sha256":"819886eaf54bedcf4009f6000378998116fb541c33d5e9b6c72997a8126c9a04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:17.658768Z","signature_b64":"bZAf+HTX40LF8zRZatsEBPMbCOB11OBr6S9zPxOXFBfj4oJBx52/4b2kxB/c9GGpth6iES5e9N6+eZLXmFiRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"359dbce8d8d5e5c68f6b901ed4fa10158f8c270ad10b6180046878c431b5f49e","last_reissued_at":"2026-05-17T23:48:17.658102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:17.658102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Routing for Delay-Sensitive Traffic in Overlay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Rahul Singh","submitted_at":"2017-03-21T20:33:01Z","abstract_excerpt":"We design dynamic routing policies for an overlay network which meet delay requirements of real-time traffic being served on top of an underlying legacy network, where the overlay nodes do not know the underlay characteristics. We pose the problem as a constrained MDP, and show that when the underlay implements static policies such as FIFO with randomized routing, then a decentralized policy, that can be computed efficiently in a distributed fashion, is optimal. Our algorithm utilizes multi-timescale stochastic approximation techniques, and its convergence relies on the fact that the recursion"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07419","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.07419","created_at":"2026-05-17T23:48:17.658216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07419v2","created_at":"2026-05-17T23:48:17.658216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07419","created_at":"2026-05-17T23:48:17.658216+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWO3Z2GY2XS4","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWO3Z2GY2XS4ND3L","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWO3Z2GY","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW","json":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW.json","graph_json":"https://pith.science/api/pith-number/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/graph.json","events_json":"https://pith.science/api/pith-number/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/events.json","paper":"https://pith.science/paper/GWO3Z2GY"},"agent_actions":{"view_html":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW","download_json":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW.json","view_paper":"https://pith.science/paper/GWO3Z2GY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07419&json=true","fetch_graph":"https://pith.science/api/pith-number/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/graph.json","fetch_events":"https://pith.science/api/pith-number/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/action/storage_attestation","attest_author":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/action/author_attestation","sign_citation":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/action/citation_signature","submit_replication":"https://pith.science/pith/GWO3Z2GY2XS4ND3LSAPNJ6QQCW/action/replication_record"}},"created_at":"2026-05-17T23:48:17.658216+00:00","updated_at":"2026-05-17T23:48:17.658216+00:00"}