{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EYOZS7N4A3EDLSQBJMNI5BFXMG","short_pith_number":"pith:EYOZS7N4","schema_version":"1.0","canonical_sha256":"261d997dbc06c835ca014b1a8e84b761aa4fe465425bfb72206dc4dab7611d79","source":{"kind":"arxiv","id":"1601.04749","version":1},"attestation_state":"computed","paper":{"title":"Constrained Multi-user Multi-server Max-Min Fair Queuing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Ioannis Lambadaris, Jalal Khamse-Ashari, Yiqiang Zhao","submitted_at":"2016-01-18T22:55:41Z","abstract_excerpt":"In this paper, a multi-user multi-server queuing system is studied in which each user is constrained to get service from a subset of servers. In the studied system, rate allocation in the sense of max-min fairness results in multi-level fair rates. To achieve such fair rates, we propose $CM^4FQ$ algorithm. In this algorithm users are chosen for service on a packet by packet basis. The priority of each user $i$ to be chosen at time $t$ is determined based on a parameter known as service tag (representing the amount of work counted for user $i$ till time $t$). Hence, a free server will choose to"},"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":"1601.04749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-18T22:55:41Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"8b85d585eaddf51476f620c47c2a15f261044a0213b4f21e667fe9e3be77d6cf","abstract_canon_sha256":"ce65ead66fd0c9e4fe37f78ec304f7873fed1ee135832662ad54aee1be4cca31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:31.895917Z","signature_b64":"OFdij7vbrDxOJmqhcQXGiFg3RWytcwHNysUtn3Gwih9rPEz33y6Nmjqmnvt8vr3n3KivDaf6fR2BUb8dub0UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"261d997dbc06c835ca014b1a8e84b761aa4fe465425bfb72206dc4dab7611d79","last_reissued_at":"2026-05-18T01:22:31.895389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:31.895389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Multi-user Multi-server Max-Min Fair Queuing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Ioannis Lambadaris, Jalal Khamse-Ashari, Yiqiang Zhao","submitted_at":"2016-01-18T22:55:41Z","abstract_excerpt":"In this paper, a multi-user multi-server queuing system is studied in which each user is constrained to get service from a subset of servers. In the studied system, rate allocation in the sense of max-min fairness results in multi-level fair rates. To achieve such fair rates, we propose $CM^4FQ$ algorithm. In this algorithm users are chosen for service on a packet by packet basis. The priority of each user $i$ to be chosen at time $t$ is determined based on a parameter known as service tag (representing the amount of work counted for user $i$ till time $t$). Hence, a free server will choose to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04749","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":"1601.04749","created_at":"2026-05-18T01:22:31.895501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04749v1","created_at":"2026-05-18T01:22:31.895501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04749","created_at":"2026-05-18T01:22:31.895501+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYOZS7N4A3ED","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYOZS7N4A3EDLSQB","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYOZS7N4","created_at":"2026-05-18T12:30:15.759754+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/EYOZS7N4A3EDLSQBJMNI5BFXMG","json":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG.json","graph_json":"https://pith.science/api/pith-number/EYOZS7N4A3EDLSQBJMNI5BFXMG/graph.json","events_json":"https://pith.science/api/pith-number/EYOZS7N4A3EDLSQBJMNI5BFXMG/events.json","paper":"https://pith.science/paper/EYOZS7N4"},"agent_actions":{"view_html":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG","download_json":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG.json","view_paper":"https://pith.science/paper/EYOZS7N4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04749&json=true","fetch_graph":"https://pith.science/api/pith-number/EYOZS7N4A3EDLSQBJMNI5BFXMG/graph.json","fetch_events":"https://pith.science/api/pith-number/EYOZS7N4A3EDLSQBJMNI5BFXMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG/action/storage_attestation","attest_author":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG/action/author_attestation","sign_citation":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG/action/citation_signature","submit_replication":"https://pith.science/pith/EYOZS7N4A3EDLSQBJMNI5BFXMG/action/replication_record"}},"created_at":"2026-05-18T01:22:31.895501+00:00","updated_at":"2026-05-18T01:22:31.895501+00:00"}