{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XHSTGO4LBJ7MMJ3YNR6QZM2F7A","short_pith_number":"pith:XHSTGO4L","schema_version":"1.0","canonical_sha256":"b9e5333b8b0a7ec627786c7d0cb345f83510978eb7f4b58471f7d296b74c2583","source":{"kind":"arxiv","id":"1103.1448","version":3},"attestation_state":"computed","paper":{"title":"Optimal Multi-Server Allocation to Parallel Queues With Independent Random Queue-Server Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Hussein Al-Zubaidy, Ioannis Lambadaris, Yannis Viniotis","submitted_at":"2011-03-08T06:59:50Z","abstract_excerpt":"We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected servers. Each queue may be connected to a subset of the K servers during any given time slot. This model has been widely used in studies of emerging 3G/4G wireless systems. We introduce the class of Most Balancing (MB) policies and provide their mathematical characterization. We prove that MB policies are optimal; we define optimality as minimization, in stochastic ordering sense, of a range of cost functions of the queue lengths, including the process "},"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":"1103.1448","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-08T06:59:50Z","cross_cats_sorted":["cs.NI","cs.SY","math.IT","math.OC"],"title_canon_sha256":"be205e340c11818341cbf2b5c0f2a4ce8e6514205d4597fc8d099b1db417a32e","abstract_canon_sha256":"6c9e0f3a80208d9e8898ab3230b628377c7c7da490957d8971fbd02783cd1fa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:24.723465Z","signature_b64":"Wxxjg0v1o0Tdasxe6N57Rkp4Se8mIzuRXjm+8LKwHH25fsPkqkdnN/jeTlC6328gJeKBHozJ7v5UNpObQUUVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9e5333b8b0a7ec627786c7d0cb345f83510978eb7f4b58471f7d296b74c2583","last_reissued_at":"2026-05-18T01:03:24.722990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:24.722990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Multi-Server Allocation to Parallel Queues With Independent Random Queue-Server Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Hussein Al-Zubaidy, Ioannis Lambadaris, Yannis Viniotis","submitted_at":"2011-03-08T06:59:50Z","abstract_excerpt":"We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected servers. Each queue may be connected to a subset of the K servers during any given time slot. This model has been widely used in studies of emerging 3G/4G wireless systems. We introduce the class of Most Balancing (MB) policies and provide their mathematical characterization. We prove that MB policies are optimal; we define optimality as minimization, in stochastic ordering sense, of a range of cost functions of the queue lengths, including the process "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1448","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":"1103.1448","created_at":"2026-05-18T01:03:24.723064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1448v3","created_at":"2026-05-18T01:03:24.723064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1448","created_at":"2026-05-18T01:03:24.723064+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHSTGO4LBJ7M","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHSTGO4LBJ7MMJ3Y","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHSTGO4L","created_at":"2026-05-18T12:26:44.992195+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/XHSTGO4LBJ7MMJ3YNR6QZM2F7A","json":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A.json","graph_json":"https://pith.science/api/pith-number/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/graph.json","events_json":"https://pith.science/api/pith-number/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/events.json","paper":"https://pith.science/paper/XHSTGO4L"},"agent_actions":{"view_html":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A","download_json":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A.json","view_paper":"https://pith.science/paper/XHSTGO4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1448&json=true","fetch_graph":"https://pith.science/api/pith-number/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/graph.json","fetch_events":"https://pith.science/api/pith-number/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/action/storage_attestation","attest_author":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/action/author_attestation","sign_citation":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/action/citation_signature","submit_replication":"https://pith.science/pith/XHSTGO4LBJ7MMJ3YNR6QZM2F7A/action/replication_record"}},"created_at":"2026-05-18T01:03:24.723064+00:00","updated_at":"2026-05-18T01:03:24.723064+00:00"}