{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YMJ56WMNUYJTXNMO5XT2TYNJ6Y","short_pith_number":"pith:YMJ56WMN","schema_version":"1.0","canonical_sha256":"c313df598da6133bb58eede7a9e1a9f62b5b56c8434eb8ac458d7eeba327a42d","source":{"kind":"arxiv","id":"2006.06150","version":2},"attestation_state":"computed","paper":{"title":"Heavy Traffic Queue Length Behaviour in a Switch under Markovian Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Shancong Mou, Siva Theja Maguluri","submitted_at":"2020-06-11T01:56:32Z","abstract_excerpt":"This paper studies the input queued switch operating under the MaxWeight algorithm when the arrivals are according to a Markovian process. We exactly characterize the heavy-traffic scaled mean sum queue length in the heavy-traffic limit, and shows that it is within a factor of less than $2$ from a universal lower bound. Moreover, we obtain lower and upper bounds, that are applicable in all traffic regimes, and they become tight in the heavy-traffic regime.\n  The paper obtains these results by generalizing the drift method recently developed for the case of i.i.d. arrivals, to the case of Marko"},"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":"2006.06150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-06-11T01:56:32Z","cross_cats_sorted":[],"title_canon_sha256":"e81440f72e6cd15bbfa1b44033a158089eb344f118682d74c84218271d083d2a","abstract_canon_sha256":"faf7a289d670284346008cd5ebb28ab380cf62a96b6118ebc4abd19cc74a4530"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:20:46.289754Z","signature_b64":"mPzmr08ViiHd42+ooIrjRx4924F5qbBcYjFn5wvgf+lYcv0uzk5iNCYQLnqeCgGeAp5tRcTUx7QcLfq2cqM9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c313df598da6133bb58eede7a9e1a9f62b5b56c8434eb8ac458d7eeba327a42d","last_reissued_at":"2026-07-05T07:20:46.289274Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:20:46.289274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heavy Traffic Queue Length Behaviour in a Switch under Markovian Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Shancong Mou, Siva Theja Maguluri","submitted_at":"2020-06-11T01:56:32Z","abstract_excerpt":"This paper studies the input queued switch operating under the MaxWeight algorithm when the arrivals are according to a Markovian process. We exactly characterize the heavy-traffic scaled mean sum queue length in the heavy-traffic limit, and shows that it is within a factor of less than $2$ from a universal lower bound. Moreover, we obtain lower and upper bounds, that are applicable in all traffic regimes, and they become tight in the heavy-traffic regime.\n  The paper obtains these results by generalizing the drift method recently developed for the case of i.i.d. arrivals, to the case of Marko"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06150","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.06150/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.06150","created_at":"2026-07-05T07:20:46.289337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.06150v2","created_at":"2026-07-05T07:20:46.289337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06150","created_at":"2026-07-05T07:20:46.289337+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMJ56WMNUYJT","created_at":"2026-07-05T07:20:46.289337+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMJ56WMNUYJTXNMO","created_at":"2026-07-05T07:20:46.289337+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMJ56WMN","created_at":"2026-07-05T07:20:46.289337+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/YMJ56WMNUYJTXNMO5XT2TYNJ6Y","json":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y.json","graph_json":"https://pith.science/api/pith-number/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/graph.json","events_json":"https://pith.science/api/pith-number/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/events.json","paper":"https://pith.science/paper/YMJ56WMN"},"agent_actions":{"view_html":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y","download_json":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y.json","view_paper":"https://pith.science/paper/YMJ56WMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.06150&json=true","fetch_graph":"https://pith.science/api/pith-number/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/action/storage_attestation","attest_author":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/action/author_attestation","sign_citation":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/action/citation_signature","submit_replication":"https://pith.science/pith/YMJ56WMNUYJTXNMO5XT2TYNJ6Y/action/replication_record"}},"created_at":"2026-07-05T07:20:46.289337+00:00","updated_at":"2026-07-05T07:20:46.289337+00:00"}