{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GN7HYWYFXWU5YADFN3C6NXJH4I","short_pith_number":"pith:GN7HYWYF","schema_version":"1.0","canonical_sha256":"337e7c5b05bda9dc00656ec5e6dd27e21bf50dea5377bdcb98d1c414f00662d3","source":{"kind":"arxiv","id":"1409.1739","version":1},"attestation_state":"computed","paper":{"title":"Throughput Optimal Routing in Overlay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Georgios Paschos","submitted_at":"2014-09-05T11:13:22Z","abstract_excerpt":"Maximum throughput requires path diversity enabled by bifurcating traffic at different network nodes. In this work, we consider a network where traffic bifurcation is allowed only at a subset of nodes called \\emph{routers}, while the rest nodes (called \\emph{forwarders}) cannot bifurcate traffic and hence only forward packets on specified paths. This implements an overlay network of routers where each overlay link corresponds to a path in the physical network. We study dynamic routing implemented at the overlay. We develop a queue-based policy, which is shown to be maximally stable (throughput"},"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":"1409.1739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-09-05T11:13:22Z","cross_cats_sorted":[],"title_canon_sha256":"580c919d78274daa2a9252d80f7326948390eead3eba2781071e043f9f00133e","abstract_canon_sha256":"a09403d026037b90a847834982e674a3bdfbdd911e7485431d8f86fcaa046b6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:25.363271Z","signature_b64":"QOOZOM+sAm/kLm1h7YbotXhqKgNFbBjc/PcqrEWTs92Z0SAw53j+LrnROEVGt8HheFSfj1EOG//tBnWYAZOzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"337e7c5b05bda9dc00656ec5e6dd27e21bf50dea5377bdcb98d1c414f00662d3","last_reissued_at":"2026-05-18T02:43:25.362793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:25.362793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput Optimal Routing in Overlay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Georgios Paschos","submitted_at":"2014-09-05T11:13:22Z","abstract_excerpt":"Maximum throughput requires path diversity enabled by bifurcating traffic at different network nodes. In this work, we consider a network where traffic bifurcation is allowed only at a subset of nodes called \\emph{routers}, while the rest nodes (called \\emph{forwarders}) cannot bifurcate traffic and hence only forward packets on specified paths. This implements an overlay network of routers where each overlay link corresponds to a path in the physical network. We study dynamic routing implemented at the overlay. We develop a queue-based policy, which is shown to be maximally stable (throughput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1739","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.1739","created_at":"2026-05-18T02:43:25.362861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1739v1","created_at":"2026-05-18T02:43:25.362861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1739","created_at":"2026-05-18T02:43:25.362861+00:00"},{"alias_kind":"pith_short_12","alias_value":"GN7HYWYFXWU5","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GN7HYWYFXWU5YADF","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GN7HYWYF","created_at":"2026-05-18T12:28:30.664211+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/GN7HYWYFXWU5YADFN3C6NXJH4I","json":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I.json","graph_json":"https://pith.science/api/pith-number/GN7HYWYFXWU5YADFN3C6NXJH4I/graph.json","events_json":"https://pith.science/api/pith-number/GN7HYWYFXWU5YADFN3C6NXJH4I/events.json","paper":"https://pith.science/paper/GN7HYWYF"},"agent_actions":{"view_html":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I","download_json":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I.json","view_paper":"https://pith.science/paper/GN7HYWYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1739&json=true","fetch_graph":"https://pith.science/api/pith-number/GN7HYWYFXWU5YADFN3C6NXJH4I/graph.json","fetch_events":"https://pith.science/api/pith-number/GN7HYWYFXWU5YADFN3C6NXJH4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I/action/storage_attestation","attest_author":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I/action/author_attestation","sign_citation":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I/action/citation_signature","submit_replication":"https://pith.science/pith/GN7HYWYFXWU5YADFN3C6NXJH4I/action/replication_record"}},"created_at":"2026-05-18T02:43:25.362861+00:00","updated_at":"2026-05-18T02:43:25.362861+00:00"}