{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P64HX4GCKTR3FN3SUJQ75IIX5S","short_pith_number":"pith:P64HX4GC","schema_version":"1.0","canonical_sha256":"7fb87bf0c254e3b2b772a261fea117ec89a2a58234ce180981aa68b5b911fbcd","source":{"kind":"arxiv","id":"1711.07912","version":1},"attestation_state":"computed","paper":{"title":"Optimal Sleeping Mechanism for Multiple Servers with MMPP-Based Bursty Traffic Arrival","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bhaskar Krishnamachari, Sheng Zhou, Zhisheng Niu, Zhiyuan Jiang","submitted_at":"2017-11-21T17:02:44Z","abstract_excerpt":"An important fundamental problem in green communications and networking is the operation of servers (routers or base stations) with sleeping mechanism to optimize energy-delay tradeoffs. This problem is very challenging when considering realistic bursty, non-Poisson traffic. We prove for the first time the optimal structure of such a sleep mechanism for multiple servers when the arrival of jobs is modeled by a bursty Markov-modulated Poisson process (MMPP). It is shown that the optimal operation, which determines the number of active (or sleeping) servers dynamically, is hysteretic and monoton"},"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":"1711.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:02:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61c49fa6d9eb46782578ab9dcd73c31cb9a370f449631a9e616bdc5a27a1bd36","abstract_canon_sha256":"5ea3419103875ee7f7e130c935edf84994f040a8a99b32c8efc7c940a0b0ee38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.189175Z","signature_b64":"q8Ab6FFSn+6/tqT1rnRTOwFrFAYiqrhDCnzjgFq8pK3exxhqCkSB5LnhzdHvM+8+mN7dQOS72k9q+TyYHIaWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb87bf0c254e3b2b772a261fea117ec89a2a58234ce180981aa68b5b911fbcd","last_reissued_at":"2026-05-18T00:29:56.188629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.188629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sleeping Mechanism for Multiple Servers with MMPP-Based Bursty Traffic Arrival","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bhaskar Krishnamachari, Sheng Zhou, Zhisheng Niu, Zhiyuan Jiang","submitted_at":"2017-11-21T17:02:44Z","abstract_excerpt":"An important fundamental problem in green communications and networking is the operation of servers (routers or base stations) with sleeping mechanism to optimize energy-delay tradeoffs. This problem is very challenging when considering realistic bursty, non-Poisson traffic. We prove for the first time the optimal structure of such a sleep mechanism for multiple servers when the arrival of jobs is modeled by a bursty Markov-modulated Poisson process (MMPP). It is shown that the optimal operation, which determines the number of active (or sleeping) servers dynamically, is hysteretic and monoton"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07912","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":"1711.07912","created_at":"2026-05-18T00:29:56.188696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07912v1","created_at":"2026-05-18T00:29:56.188696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07912","created_at":"2026-05-18T00:29:56.188696+00:00"},{"alias_kind":"pith_short_12","alias_value":"P64HX4GCKTR3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P64HX4GCKTR3FN3S","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P64HX4GC","created_at":"2026-05-18T12:31:37.085036+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/P64HX4GCKTR3FN3SUJQ75IIX5S","json":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S.json","graph_json":"https://pith.science/api/pith-number/P64HX4GCKTR3FN3SUJQ75IIX5S/graph.json","events_json":"https://pith.science/api/pith-number/P64HX4GCKTR3FN3SUJQ75IIX5S/events.json","paper":"https://pith.science/paper/P64HX4GC"},"agent_actions":{"view_html":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S","download_json":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S.json","view_paper":"https://pith.science/paper/P64HX4GC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07912&json=true","fetch_graph":"https://pith.science/api/pith-number/P64HX4GCKTR3FN3SUJQ75IIX5S/graph.json","fetch_events":"https://pith.science/api/pith-number/P64HX4GCKTR3FN3SUJQ75IIX5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/action/storage_attestation","attest_author":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/action/author_attestation","sign_citation":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/action/citation_signature","submit_replication":"https://pith.science/pith/P64HX4GCKTR3FN3SUJQ75IIX5S/action/replication_record"}},"created_at":"2026-05-18T00:29:56.188696+00:00","updated_at":"2026-05-18T00:29:56.188696+00:00"}