{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZYTYYZPBAHAS36KHXV2FVHXJBQ","short_pith_number":"pith:ZYTYYZPB","schema_version":"1.0","canonical_sha256":"ce278c65e101c12df947bd745a9ee90c3919a110008931a4d76cfd26861f770d","source":{"kind":"arxiv","id":"1506.00204","version":1},"attestation_state":"computed","paper":{"title":"Fair Packet Scheduling in Network on Chip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Ge Li, Mingyu Yan, Wei Yang, Xiao Lv, Zhuang Wang","submitted_at":"2015-05-31T08:52:34Z","abstract_excerpt":"Interconnection networks of parallel systems are used for servicing traf- fic generated by different applications, often belonging to different users. When multiple traffic flows contend for channel bandwidth, the scheduling algorithm regulating the access to that channel plays a key role in ensur- ing that each flow obtains the required quality of service. Fairness is a highly desirable property for a scheduling algorithm. We show that using the Relative Fairness Bound as a fairness measure may lead to decrease in throughput and increase in latency. We propose an alternative metric to evaluat"},"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":"1506.00204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-31T08:52:34Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7fc900e8400badd3a612dcd17df09123537ae4a97ceafd1cf4a31de530e13fd4","abstract_canon_sha256":"0f2a6c3969bed85cddea03cefeaa769e01282f0c55ae8fa72ed161ce0f72cac0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.211960Z","signature_b64":"zJmnlTVVvxbNkDTjHTbmg0Bly3PHaddiquj4tg8s24J+EYSN/bR63qiGsobBJk5GfiwjVtSfEotPLLmOHAZPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce278c65e101c12df947bd745a9ee90c3919a110008931a4d76cfd26861f770d","last_reissued_at":"2026-05-18T01:59:55.211497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.211497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Packet Scheduling in Network on Chip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Ge Li, Mingyu Yan, Wei Yang, Xiao Lv, Zhuang Wang","submitted_at":"2015-05-31T08:52:34Z","abstract_excerpt":"Interconnection networks of parallel systems are used for servicing traf- fic generated by different applications, often belonging to different users. When multiple traffic flows contend for channel bandwidth, the scheduling algorithm regulating the access to that channel plays a key role in ensur- ing that each flow obtains the required quality of service. Fairness is a highly desirable property for a scheduling algorithm. We show that using the Relative Fairness Bound as a fairness measure may lead to decrease in throughput and increase in latency. We propose an alternative metric to evaluat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00204","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":"1506.00204","created_at":"2026-05-18T01:59:55.211564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00204v1","created_at":"2026-05-18T01:59:55.211564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00204","created_at":"2026-05-18T01:59:55.211564+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYTYYZPBAHAS","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYTYYZPBAHAS36KH","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYTYYZPB","created_at":"2026-05-18T12:29:52.810259+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/ZYTYYZPBAHAS36KHXV2FVHXJBQ","json":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ.json","graph_json":"https://pith.science/api/pith-number/ZYTYYZPBAHAS36KHXV2FVHXJBQ/graph.json","events_json":"https://pith.science/api/pith-number/ZYTYYZPBAHAS36KHXV2FVHXJBQ/events.json","paper":"https://pith.science/paper/ZYTYYZPB"},"agent_actions":{"view_html":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ","download_json":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ.json","view_paper":"https://pith.science/paper/ZYTYYZPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00204&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYTYYZPBAHAS36KHXV2FVHXJBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYTYYZPBAHAS36KHXV2FVHXJBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZYTYYZPBAHAS36KHXV2FVHXJBQ/action/replication_record"}},"created_at":"2026-05-18T01:59:55.211564+00:00","updated_at":"2026-05-18T01:59:55.211564+00:00"}