{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RCO3YLYLWLVEB73JTE2RLDMPAB","short_pith_number":"pith:RCO3YLYL","schema_version":"1.0","canonical_sha256":"889dbc2f0bb2ea40ff699935158d8f004263f1fb9a584e40eb53414252cc0642","source":{"kind":"arxiv","id":"1704.05684","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Scheduling Algorithm to Provide Quality-of-Service in Multihop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ashok Krishnan K.S., Vinod Sharma","submitted_at":"2017-04-19T10:50:41Z","abstract_excerpt":"Control of multihop Wireless networks in a distributed manner while providing end-to-end delay requirements for different flows, is a challenging problem. Using the notions of Draining Time and Discrete Review from the theory of fluid limits of queues, an algorithm that meets delay requirements to various flows in a network is constructed. The algorithm involves an optimization which is implemented in a cyclic distributed manner across nodes by using the technique of iterative gradient ascent, with minimal information exchange between nodes. The algorithm uses time varying weights to give prio"},"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":"1704.05684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-19T10:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"ee1c7c0728377bbd28c0c385e5e6fffa6e297fc9842b8d5a81a17d6b3080e2a7","abstract_canon_sha256":"a8a2ea7a4133325a5ef26672259a87c93f87612fdb8f6a561801137d2f8f194e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:06.790224Z","signature_b64":"J4IMUevVGtZcCJz7r/F/HGa2Goijp5Rf27RcA+vzpvuY+03RRECfwSh9vY/RWukFg+9QVz72m0pk3QWdChJuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889dbc2f0bb2ea40ff699935158d8f004263f1fb9a584e40eb53414252cc0642","last_reissued_at":"2026-05-18T00:46:06.789623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:06.789623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Scheduling Algorithm to Provide Quality-of-Service in Multihop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ashok Krishnan K.S., Vinod Sharma","submitted_at":"2017-04-19T10:50:41Z","abstract_excerpt":"Control of multihop Wireless networks in a distributed manner while providing end-to-end delay requirements for different flows, is a challenging problem. Using the notions of Draining Time and Discrete Review from the theory of fluid limits of queues, an algorithm that meets delay requirements to various flows in a network is constructed. The algorithm involves an optimization which is implemented in a cyclic distributed manner across nodes by using the technique of iterative gradient ascent, with minimal information exchange between nodes. The algorithm uses time varying weights to give prio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05684","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":"1704.05684","created_at":"2026-05-18T00:46:06.789713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05684v1","created_at":"2026-05-18T00:46:06.789713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05684","created_at":"2026-05-18T00:46:06.789713+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCO3YLYLWLVE","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCO3YLYLWLVEB73J","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCO3YLYL","created_at":"2026-05-18T12:31:39.905425+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/RCO3YLYLWLVEB73JTE2RLDMPAB","json":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB.json","graph_json":"https://pith.science/api/pith-number/RCO3YLYLWLVEB73JTE2RLDMPAB/graph.json","events_json":"https://pith.science/api/pith-number/RCO3YLYLWLVEB73JTE2RLDMPAB/events.json","paper":"https://pith.science/paper/RCO3YLYL"},"agent_actions":{"view_html":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB","download_json":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB.json","view_paper":"https://pith.science/paper/RCO3YLYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05684&json=true","fetch_graph":"https://pith.science/api/pith-number/RCO3YLYLWLVEB73JTE2RLDMPAB/graph.json","fetch_events":"https://pith.science/api/pith-number/RCO3YLYLWLVEB73JTE2RLDMPAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/action/storage_attestation","attest_author":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/action/author_attestation","sign_citation":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/action/citation_signature","submit_replication":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/action/replication_record"}},"created_at":"2026-05-18T00:46:06.789713+00:00","updated_at":"2026-05-18T00:46:06.789713+00:00"}