{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4H3A3QCKZ5TXT4GANCDFWMHKJM","short_pith_number":"pith:4H3A3QCK","schema_version":"1.0","canonical_sha256":"e1f60dc04acf6779f0c068865b30ea4b08e29732e46c939785ca8b36976964ac","source":{"kind":"arxiv","id":"1307.7416","version":1},"attestation_state":"computed","paper":{"title":"DiFS: Distributed Flow Scheduling for Data Center Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chen Qian, Wenzhi Cui","submitted_at":"2013-07-28T22:48:56Z","abstract_excerpt":"Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth for cluster computing applications. However, state of the art distributed multi-pathing protocols such as Equal Cost Multipath (ECMP) use static flow-to-link assignment, which is load-oblivious. They may cause bandwidth loss due to \\emph{flow collisions} on a same link. Recently proposed centralized scheduling algorithm or host-based multi-pathing may suffer from scalability problems.\n  In this paper, we present Distributed Flow Scheduling (DiFS) for data center networks, which is "},"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":"1307.7416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-28T22:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"57e2d0b1f36dd57d5d3f821d8dbde431af12d9f10127e6a11e689d9c3345b292","abstract_canon_sha256":"bfc4b4b4e0fede138d017eea3985e372a6bb132c5a6b1b3af402865ab2f989fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:23.344730Z","signature_b64":"dpxRDF+XHkLkkWq22wCP1cnHpLDsiVoL2QEw7YihjtAujzQ/TFWb0ynS71hwNQf5VZ8Hq+Csv+0uVkV0rRYdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f60dc04acf6779f0c068865b30ea4b08e29732e46c939785ca8b36976964ac","last_reissued_at":"2026-05-18T03:17:23.344325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:23.344325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DiFS: Distributed Flow Scheduling for Data Center Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chen Qian, Wenzhi Cui","submitted_at":"2013-07-28T22:48:56Z","abstract_excerpt":"Data center networks leverage multiple parallel paths connecting end host pairs to offer high bisection bandwidth for cluster computing applications. However, state of the art distributed multi-pathing protocols such as Equal Cost Multipath (ECMP) use static flow-to-link assignment, which is load-oblivious. They may cause bandwidth loss due to \\emph{flow collisions} on a same link. Recently proposed centralized scheduling algorithm or host-based multi-pathing may suffer from scalability problems.\n  In this paper, we present Distributed Flow Scheduling (DiFS) for data center networks, which is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7416","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":"1307.7416","created_at":"2026-05-18T03:17:23.344387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7416v1","created_at":"2026-05-18T03:17:23.344387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7416","created_at":"2026-05-18T03:17:23.344387+00:00"},{"alias_kind":"pith_short_12","alias_value":"4H3A3QCKZ5TX","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4H3A3QCKZ5TXT4GA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4H3A3QCK","created_at":"2026-05-18T12:27:34.582898+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/4H3A3QCKZ5TXT4GANCDFWMHKJM","json":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM.json","graph_json":"https://pith.science/api/pith-number/4H3A3QCKZ5TXT4GANCDFWMHKJM/graph.json","events_json":"https://pith.science/api/pith-number/4H3A3QCKZ5TXT4GANCDFWMHKJM/events.json","paper":"https://pith.science/paper/4H3A3QCK"},"agent_actions":{"view_html":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM","download_json":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM.json","view_paper":"https://pith.science/paper/4H3A3QCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7416&json=true","fetch_graph":"https://pith.science/api/pith-number/4H3A3QCKZ5TXT4GANCDFWMHKJM/graph.json","fetch_events":"https://pith.science/api/pith-number/4H3A3QCKZ5TXT4GANCDFWMHKJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/action/storage_attestation","attest_author":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/action/author_attestation","sign_citation":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/action/citation_signature","submit_replication":"https://pith.science/pith/4H3A3QCKZ5TXT4GANCDFWMHKJM/action/replication_record"}},"created_at":"2026-05-18T03:17:23.344387+00:00","updated_at":"2026-05-18T03:17:23.344387+00:00"}