{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6IARB22NPSLCQQXCDLJLONULJM","short_pith_number":"pith:6IARB22N","schema_version":"1.0","canonical_sha256":"f20110eb4d7c962842e21ad2b7368b4b313c23a430098f940aa915d819215110","source":{"kind":"arxiv","id":"0911.3856","version":1},"attestation_state":"computed","paper":{"title":"Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Almut Burchard, Florin Ciucu, Jorg Liebeherr","submitted_at":"2009-11-19T19:27:50Z","abstract_excerpt":"We provide upper bounds on the end-to-end backlog and delay in a network with heavy-tailed and self-similar traffic. The analysis follows a network calculus approach where traffic is characterized by envelope functions and service is described by service curves. A key contribution of this paper is the derivation of a probabilistic sample path bound for heavy-tailed self-similar arrival processes, which is enabled by a suitable envelope characterization, referred to as `htss envelope'. We derive a heavy-tailed service curve for an entire network path when the service at each node on the path 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":"0911.3856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-11-19T19:27:50Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"b188d112d7fc1c1b6bd3131600002cbb312ea12c7867bd92df0afc165478bb02","abstract_canon_sha256":"39cdd2989c3fcd87e0c1a9fe695e6a7a8e3e34624f9a2e527bd24c8bf3daaf5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:55.496456Z","signature_b64":"Gbx/XYZ1QlI24/uCFzcCktoYh9DGXZ66tjgtuVOWExEYDQzpV1zHuPF53NMldMcH+qVmlOF6h53ZFOM4+8FTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f20110eb4d7c962842e21ad2b7368b4b313c23a430098f940aa915d819215110","last_reissued_at":"2026-05-18T03:03:55.495815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:55.495815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Almut Burchard, Florin Ciucu, Jorg Liebeherr","submitted_at":"2009-11-19T19:27:50Z","abstract_excerpt":"We provide upper bounds on the end-to-end backlog and delay in a network with heavy-tailed and self-similar traffic. The analysis follows a network calculus approach where traffic is characterized by envelope functions and service is described by service curves. A key contribution of this paper is the derivation of a probabilistic sample path bound for heavy-tailed self-similar arrival processes, which is enabled by a suitable envelope characterization, referred to as `htss envelope'. We derive a heavy-tailed service curve for an entire network path when the service at each node on the path is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.3856","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":"0911.3856","created_at":"2026-05-18T03:03:55.495904+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.3856v1","created_at":"2026-05-18T03:03:55.495904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.3856","created_at":"2026-05-18T03:03:55.495904+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IARB22NPSLC","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IARB22NPSLCQQXC","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IARB22N","created_at":"2026-05-18T12:25:58.837520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12961","citing_title":"Improving Network Clock Synchronization by Marking Congestion","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM","json":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM.json","graph_json":"https://pith.science/api/pith-number/6IARB22NPSLCQQXCDLJLONULJM/graph.json","events_json":"https://pith.science/api/pith-number/6IARB22NPSLCQQXCDLJLONULJM/events.json","paper":"https://pith.science/paper/6IARB22N"},"agent_actions":{"view_html":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM","download_json":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM.json","view_paper":"https://pith.science/paper/6IARB22N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.3856&json=true","fetch_graph":"https://pith.science/api/pith-number/6IARB22NPSLCQQXCDLJLONULJM/graph.json","fetch_events":"https://pith.science/api/pith-number/6IARB22NPSLCQQXCDLJLONULJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM/action/storage_attestation","attest_author":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM/action/author_attestation","sign_citation":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM/action/citation_signature","submit_replication":"https://pith.science/pith/6IARB22NPSLCQQXCDLJLONULJM/action/replication_record"}},"created_at":"2026-05-18T03:03:55.495904+00:00","updated_at":"2026-05-18T03:03:55.495904+00:00"}