{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OJPK25MQH4W52QYMFBWOTJJCPU","short_pith_number":"pith:OJPK25MQ","schema_version":"1.0","canonical_sha256":"725ead75903f2ddd430c286ce9a5227d1cf5304cc63d992178589869d0f2373f","source":{"kind":"arxiv","id":"1608.08365","version":1},"attestation_state":"computed","paper":{"title":"Scalable and Cost Efficient Algorithms for Virtual CDN Migration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed E. Kamal, Emad Abd-Elrahman, Hatem Ibn-Khedher, Hossam Afifi, Makhlouf Hadji","submitted_at":"2016-08-30T08:36:43Z","abstract_excerpt":"Virtual Content Delivery Network (vCDN) migration is necessary to optimize the use of resources and improve the performance of the overall SDN/NFV-based CDN function in terms of network operator cost reduction and high streaming quality. It requires intelligent and enticed joint SDN/NFV migration algorithms due to the evident huge amount of traffic to be delivered to end customers of the network. In this paper, two approaches for finding the optimal and near optimal path placement(s) and vCDN migration(s) are proposed (OPAC and HPAC). Moreover, several scenarios are considered to quantify the "},"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":"1608.08365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-30T08:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"b463467b6b74bcc6b27cf0bb957c84ca401334216f6f6507f721dd0b9e06e42f","abstract_canon_sha256":"2a7894562a5a8e900c9ac03db04bd0bf8412abc7246bf1e4f65ff2d57217b898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:19.632666Z","signature_b64":"re6ghCLyxwJ2GbcZuWSS6A3RWc4AAU87vBsvgemX7vvWMayXBFLgLuARnTXIc+BvpvrFXYA16SUkgblfSKe/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"725ead75903f2ddd430c286ce9a5227d1cf5304cc63d992178589869d0f2373f","last_reissued_at":"2026-05-18T01:07:19.632071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:19.632071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable and Cost Efficient Algorithms for Virtual CDN Migration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed E. Kamal, Emad Abd-Elrahman, Hatem Ibn-Khedher, Hossam Afifi, Makhlouf Hadji","submitted_at":"2016-08-30T08:36:43Z","abstract_excerpt":"Virtual Content Delivery Network (vCDN) migration is necessary to optimize the use of resources and improve the performance of the overall SDN/NFV-based CDN function in terms of network operator cost reduction and high streaming quality. It requires intelligent and enticed joint SDN/NFV migration algorithms due to the evident huge amount of traffic to be delivered to end customers of the network. In this paper, two approaches for finding the optimal and near optimal path placement(s) and vCDN migration(s) are proposed (OPAC and HPAC). Moreover, several scenarios are considered to quantify the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08365","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":"1608.08365","created_at":"2026-05-18T01:07:19.632183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08365v1","created_at":"2026-05-18T01:07:19.632183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08365","created_at":"2026-05-18T01:07:19.632183+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJPK25MQH4W5","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJPK25MQH4W52QYM","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJPK25MQ","created_at":"2026-05-18T12:30:36.002864+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/OJPK25MQH4W52QYMFBWOTJJCPU","json":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU.json","graph_json":"https://pith.science/api/pith-number/OJPK25MQH4W52QYMFBWOTJJCPU/graph.json","events_json":"https://pith.science/api/pith-number/OJPK25MQH4W52QYMFBWOTJJCPU/events.json","paper":"https://pith.science/paper/OJPK25MQ"},"agent_actions":{"view_html":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU","download_json":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU.json","view_paper":"https://pith.science/paper/OJPK25MQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08365&json=true","fetch_graph":"https://pith.science/api/pith-number/OJPK25MQH4W52QYMFBWOTJJCPU/graph.json","fetch_events":"https://pith.science/api/pith-number/OJPK25MQH4W52QYMFBWOTJJCPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU/action/storage_attestation","attest_author":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU/action/author_attestation","sign_citation":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU/action/citation_signature","submit_replication":"https://pith.science/pith/OJPK25MQH4W52QYMFBWOTJJCPU/action/replication_record"}},"created_at":"2026-05-18T01:07:19.632183+00:00","updated_at":"2026-05-18T01:07:19.632183+00:00"}