{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OZAIMFMHJ7OKCJX66ZIBJGO3JO","short_pith_number":"pith:OZAIMFMH","schema_version":"1.0","canonical_sha256":"76408615874fdca126fef6501499db4ba71870a9445d4f7e036b85374df86b6f","source":{"kind":"arxiv","id":"1101.1237","version":1},"attestation_state":"computed","paper":{"title":"Statistical Analysis of Link Scheduling on Long Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Almut Burchard, Jorg Liebeherr, Yashar Ghiassi-Farrokhfal","submitted_at":"2011-01-06T15:47:59Z","abstract_excerpt":"We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closed-form expressions for end-to-end delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on end-to-end b"},"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":"1101.1237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-06T15:47:59Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"a19d483749edb1d322cdbf3850fcb44e9f5d6e5eef785108726b923ec5a7e182","abstract_canon_sha256":"7a79272fcad6de79db07067a485e03631b2dc74b597dca7d31a30c31c00d0a94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:00.264290Z","signature_b64":"jLB9ktVL+dBobc6go2J2691sKuY9aVA1RGlku+K3ngsliWlDLpxcUUt0JtbdRcLuPKkOguk4NrcBQBtQd3OzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76408615874fdca126fef6501499db4ba71870a9445d4f7e036b85374df86b6f","last_reissued_at":"2026-05-18T04:32:00.263722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:00.263722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Analysis of Link Scheduling on Long Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Almut Burchard, Jorg Liebeherr, Yashar Ghiassi-Farrokhfal","submitted_at":"2011-01-06T15:47:59Z","abstract_excerpt":"We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closed-form expressions for end-to-end delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on end-to-end b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1237","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":"1101.1237","created_at":"2026-05-18T04:32:00.263819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1237v1","created_at":"2026-05-18T04:32:00.263819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1237","created_at":"2026-05-18T04:32:00.263819+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZAIMFMHJ7OK","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZAIMFMHJ7OKCJX6","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZAIMFMH","created_at":"2026-05-18T12:26:37.096874+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/OZAIMFMHJ7OKCJX66ZIBJGO3JO","json":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO.json","graph_json":"https://pith.science/api/pith-number/OZAIMFMHJ7OKCJX66ZIBJGO3JO/graph.json","events_json":"https://pith.science/api/pith-number/OZAIMFMHJ7OKCJX66ZIBJGO3JO/events.json","paper":"https://pith.science/paper/OZAIMFMH"},"agent_actions":{"view_html":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO","download_json":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO.json","view_paper":"https://pith.science/paper/OZAIMFMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1237&json=true","fetch_graph":"https://pith.science/api/pith-number/OZAIMFMHJ7OKCJX66ZIBJGO3JO/graph.json","fetch_events":"https://pith.science/api/pith-number/OZAIMFMHJ7OKCJX66ZIBJGO3JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO/action/storage_attestation","attest_author":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO/action/author_attestation","sign_citation":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO/action/citation_signature","submit_replication":"https://pith.science/pith/OZAIMFMHJ7OKCJX66ZIBJGO3JO/action/replication_record"}},"created_at":"2026-05-18T04:32:00.263819+00:00","updated_at":"2026-05-18T04:32:00.263819+00:00"}