{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PPUM2DBLNLTTJ7ZYZA7KXL5VP5","short_pith_number":"pith:PPUM2DBL","schema_version":"1.0","canonical_sha256":"7be8cd0c2b6ae734ff38c83eabafb57f47c86a8f86f8a37776391751ccaba637","source":{"kind":"arxiv","id":"1007.4853","version":2},"attestation_state":"computed","paper":{"title":"Performance bounds in wormhole routing, a network calculus approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"cs.PF","authors_text":"Bruno Gaujal, Nadir Farhi","submitted_at":"2010-07-27T23:47:58Z","abstract_excerpt":"We present a model of performance bound calculus on feedforward networks where data packets are routed under wormhole routing discipline. We are interested in determining maximum end-to-end delays and backlogs of messages or packets going from a source node to a destination node, through a given virtual path in the network. Our objective here is to give a network calculus approach for calculating the performance bounds. First we propose a new concept of curves that we call packet curves. The curves permit to model constraints on packet lengths of a given data flow, when the lengths are allowed"},"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":"1007.4853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-07-27T23:47:58Z","cross_cats_sorted":["cs.NI","math.OC"],"title_canon_sha256":"05738c6473b06b203874eccccec9c6634e456a1b998fe5cbd203c9ce36093383","abstract_canon_sha256":"80d9816e55c8a548a70b4e04532013e7a5e626c8766ff92f8e4c3fed2dd62912"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:43.099667Z","signature_b64":"Yo0N7CWKRb0W3GCjo1GB6IIPbcWpajyZxTuzMuJg7Vu0/qWNxog+WEcYaWnHrFJo/+NFXj5bkcijQh8LLfrlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7be8cd0c2b6ae734ff38c83eabafb57f47c86a8f86f8a37776391751ccaba637","last_reissued_at":"2026-05-18T04:42:43.099235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:43.099235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance bounds in wormhole routing, a network calculus approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"cs.PF","authors_text":"Bruno Gaujal, Nadir Farhi","submitted_at":"2010-07-27T23:47:58Z","abstract_excerpt":"We present a model of performance bound calculus on feedforward networks where data packets are routed under wormhole routing discipline. We are interested in determining maximum end-to-end delays and backlogs of messages or packets going from a source node to a destination node, through a given virtual path in the network. Our objective here is to give a network calculus approach for calculating the performance bounds. First we propose a new concept of curves that we call packet curves. The curves permit to model constraints on packet lengths of a given data flow, when the lengths are allowed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4853","kind":"arxiv","version":2},"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":"1007.4853","created_at":"2026-05-18T04:42:43.099305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.4853v2","created_at":"2026-05-18T04:42:43.099305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4853","created_at":"2026-05-18T04:42:43.099305+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPUM2DBLNLTT","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPUM2DBLNLTTJ7ZY","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPUM2DBL","created_at":"2026-05-18T12:26:12.377268+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/PPUM2DBLNLTTJ7ZYZA7KXL5VP5","json":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5.json","graph_json":"https://pith.science/api/pith-number/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/graph.json","events_json":"https://pith.science/api/pith-number/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/events.json","paper":"https://pith.science/paper/PPUM2DBL"},"agent_actions":{"view_html":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5","download_json":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5.json","view_paper":"https://pith.science/paper/PPUM2DBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.4853&json=true","fetch_graph":"https://pith.science/api/pith-number/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/graph.json","fetch_events":"https://pith.science/api/pith-number/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/action/storage_attestation","attest_author":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/action/author_attestation","sign_citation":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/action/citation_signature","submit_replication":"https://pith.science/pith/PPUM2DBLNLTTJ7ZYZA7KXL5VP5/action/replication_record"}},"created_at":"2026-05-18T04:42:43.099305+00:00","updated_at":"2026-05-18T04:42:43.099305+00:00"}