{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3SA5FVPWHDHDUR2JC3DJEQUDCY","short_pith_number":"pith:3SA5FVPW","schema_version":"1.0","canonical_sha256":"dc81d2d5f638ce3a474916c692428316327b697d7e10ffe023325600d19fe586","source":{"kind":"arxiv","id":"1701.02419","version":1},"attestation_state":"computed","paper":{"title":"Coflow Scheduling in Input-Queued Switches: Optimal Delay Scaling and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Qingkai Liang","submitted_at":"2017-01-10T02:33:25Z","abstract_excerpt":"A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \\emph{coflow-level delay}, i.e., the time to complete all the flows in a coflow, in the context of an $N\\times N$ input-queued switch. In particular, we develop a throughput-optimal scheduling policy that achieves the best scaling of coflow-level delay as $N\\rightarrow\\infty$. We first derive lower bounds on the coflow-level delay that can be achieved by any scheduling policy. "},"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":"1701.02419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-10T02:33:25Z","cross_cats_sorted":[],"title_canon_sha256":"978c6b44bb6d406ccd3030121e4ca6d17466a45800ca0f58f766f75e9e0604ae","abstract_canon_sha256":"f90e46d0b6ef639cd60fef842cabd2d515cef95e5298534a2ee785858e198f8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:04.306150Z","signature_b64":"Qguu7fYJf78ZThimpEKrr9bx0BVUsR0/oEDWaIBJlxDQT2xbxjjhlZDyR3GBAJiImzEIYg3cm67SvCC39LH8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc81d2d5f638ce3a474916c692428316327b697d7e10ffe023325600d19fe586","last_reissued_at":"2026-05-18T00:53:04.305634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:04.305634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coflow Scheduling in Input-Queued Switches: Optimal Delay Scaling and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Qingkai Liang","submitted_at":"2017-01-10T02:33:25Z","abstract_excerpt":"A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \\emph{coflow-level delay}, i.e., the time to complete all the flows in a coflow, in the context of an $N\\times N$ input-queued switch. In particular, we develop a throughput-optimal scheduling policy that achieves the best scaling of coflow-level delay as $N\\rightarrow\\infty$. We first derive lower bounds on the coflow-level delay that can be achieved by any scheduling policy. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02419","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":"1701.02419","created_at":"2026-05-18T00:53:04.305721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02419v1","created_at":"2026-05-18T00:53:04.305721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02419","created_at":"2026-05-18T00:53:04.305721+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SA5FVPWHDHD","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SA5FVPWHDHDUR2J","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SA5FVPW","created_at":"2026-05-18T12:30:58.224056+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/3SA5FVPWHDHDUR2JC3DJEQUDCY","json":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY.json","graph_json":"https://pith.science/api/pith-number/3SA5FVPWHDHDUR2JC3DJEQUDCY/graph.json","events_json":"https://pith.science/api/pith-number/3SA5FVPWHDHDUR2JC3DJEQUDCY/events.json","paper":"https://pith.science/paper/3SA5FVPW"},"agent_actions":{"view_html":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY","download_json":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY.json","view_paper":"https://pith.science/paper/3SA5FVPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02419&json=true","fetch_graph":"https://pith.science/api/pith-number/3SA5FVPWHDHDUR2JC3DJEQUDCY/graph.json","fetch_events":"https://pith.science/api/pith-number/3SA5FVPWHDHDUR2JC3DJEQUDCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/action/storage_attestation","attest_author":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/action/author_attestation","sign_citation":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/action/citation_signature","submit_replication":"https://pith.science/pith/3SA5FVPWHDHDUR2JC3DJEQUDCY/action/replication_record"}},"created_at":"2026-05-18T00:53:04.305721+00:00","updated_at":"2026-05-18T00:53:04.305721+00:00"}