{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ACHB2HUQE5QW7AF7NCZ25W7F4Y","short_pith_number":"pith:ACHB2HUQ","schema_version":"1.0","canonical_sha256":"008e1d1e9027616f80bf68b3aedbe5e608ea63d23449958b87bc2f1988ac4f54","source":{"kind":"arxiv","id":"1605.07353","version":3},"attestation_state":"computed","paper":{"title":"Enhancing Performance Bounds of Multiple-Ring Networks with Cyclic Dependencies based on Network Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Ahlem Mifdaoui, Ahmed Amari","submitted_at":"2016-05-24T09:55:06Z","abstract_excerpt":"Tightening performance bounds of ring networks with cyclic dependencies is still an open problem in the literature. In this paper, we tackle such a challenging issue based on Network Calculus. First, we review the conventional timing approaches in the area and identify their main limitations, in terms of delay bounds pessimism. Afterwards, we have introduced a new concept called Pay Multiplexing Only at Convergence points (PMOC) to overcome such limitations. PMOC considers the flow serialization phenomena along the flow path, by paying the bursts of interfering flows only at the convergence po"},"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":"1605.07353","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-05-24T09:55:06Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"62be52bcf0067dda8c65494b4fd8a2ecf4d332e21863adee504e600449e89304","abstract_canon_sha256":"4898d5e1381ed335a483690548857b4816fcdb3e159e4f6e4a52a5b13423db89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:07.056961Z","signature_b64":"DuKLH7av9+VJMr/M+cbjgUWmojz3tkU9EFdCcoQtXKW7lIuWAXaxVM3n7xMHNoa74WwwEMzB/T1TksDOjDjoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"008e1d1e9027616f80bf68b3aedbe5e608ea63d23449958b87bc2f1988ac4f54","last_reissued_at":"2026-05-18T00:14:07.056490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:07.056490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Performance Bounds of Multiple-Ring Networks with Cyclic Dependencies based on Network Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Ahlem Mifdaoui, Ahmed Amari","submitted_at":"2016-05-24T09:55:06Z","abstract_excerpt":"Tightening performance bounds of ring networks with cyclic dependencies is still an open problem in the literature. In this paper, we tackle such a challenging issue based on Network Calculus. First, we review the conventional timing approaches in the area and identify their main limitations, in terms of delay bounds pessimism. Afterwards, we have introduced a new concept called Pay Multiplexing Only at Convergence points (PMOC) to overcome such limitations. PMOC considers the flow serialization phenomena along the flow path, by paying the bursts of interfering flows only at the convergence po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07353","kind":"arxiv","version":3},"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":"1605.07353","created_at":"2026-05-18T00:14:07.056555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07353v3","created_at":"2026-05-18T00:14:07.056555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07353","created_at":"2026-05-18T00:14:07.056555+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACHB2HUQE5QW","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACHB2HUQE5QW7AF7","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACHB2HUQ","created_at":"2026-05-18T12:30:07.202191+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/ACHB2HUQE5QW7AF7NCZ25W7F4Y","json":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y.json","graph_json":"https://pith.science/api/pith-number/ACHB2HUQE5QW7AF7NCZ25W7F4Y/graph.json","events_json":"https://pith.science/api/pith-number/ACHB2HUQE5QW7AF7NCZ25W7F4Y/events.json","paper":"https://pith.science/paper/ACHB2HUQ"},"agent_actions":{"view_html":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y","download_json":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y.json","view_paper":"https://pith.science/paper/ACHB2HUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07353&json=true","fetch_graph":"https://pith.science/api/pith-number/ACHB2HUQE5QW7AF7NCZ25W7F4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/ACHB2HUQE5QW7AF7NCZ25W7F4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y/action/storage_attestation","attest_author":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y/action/author_attestation","sign_citation":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y/action/citation_signature","submit_replication":"https://pith.science/pith/ACHB2HUQE5QW7AF7NCZ25W7F4Y/action/replication_record"}},"created_at":"2026-05-18T00:14:07.056555+00:00","updated_at":"2026-05-18T00:14:07.056555+00:00"}