{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TVGDSQM2C4LTJXA4ITXUL4LORN","short_pith_number":"pith:TVGDSQM2","schema_version":"1.0","canonical_sha256":"9d4c39419a171734dc1c44ef45f16e8b5b67609fe0b32dfbe12356bf2d9b581b","source":{"kind":"arxiv","id":"1603.01708","version":2},"attestation_state":"computed","paper":{"title":"Technique Report: Near-Optimal Routing Protection for SDN Networks Using Distributed Markov Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Baoliu Ye, Huawei Huang, Keqiu Li, Song Guo, Weifa Liang","submitted_at":"2016-03-05T10:26:01Z","abstract_excerpt":"Software Defined Networking (SDN) brings numbers of advantages along with many challenges. One particular concern is on the control-plane resilience, while the existing protection approaches proposed for SDN networks mainly focus on data-plane. In order to achieve the carrier-grade recovery from link failures, we adopt the dedicated protection scheme towards finding optimal protection routing for control-plane traffic. To this end, we study a weighted cost minimization problem, in which the traffic load balancing and flow table rule placement are jointly considered when selecting protection pa"},"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":"1603.01708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-05T10:26:01Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a53e171640e748e0327ede5decf8e20abd8360efaeec3e55eeaed371cc666b79","abstract_canon_sha256":"df01f21ccc6e6ba2cbe8ce02189e1483a806a5f24acbdb69fbb74246b646a2aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:13.996630Z","signature_b64":"+cB7SuzHdQOszgI+sd6ilolobDqqTVWPvGqekwsFIins2GJy7nKSEGrUlCfnVTAy9qM7zb7jepoh0H6Qts/ECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d4c39419a171734dc1c44ef45f16e8b5b67609fe0b32dfbe12356bf2d9b581b","last_reissued_at":"2026-05-18T00:31:13.996007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:13.996007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Technique Report: Near-Optimal Routing Protection for SDN Networks Using Distributed Markov Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Baoliu Ye, Huawei Huang, Keqiu Li, Song Guo, Weifa Liang","submitted_at":"2016-03-05T10:26:01Z","abstract_excerpt":"Software Defined Networking (SDN) brings numbers of advantages along with many challenges. One particular concern is on the control-plane resilience, while the existing protection approaches proposed for SDN networks mainly focus on data-plane. In order to achieve the carrier-grade recovery from link failures, we adopt the dedicated protection scheme towards finding optimal protection routing for control-plane traffic. To this end, we study a weighted cost minimization problem, in which the traffic load balancing and flow table rule placement are jointly considered when selecting protection pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01708","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":""},"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":"1603.01708","created_at":"2026-05-18T00:31:13.996082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01708v2","created_at":"2026-05-18T00:31:13.996082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01708","created_at":"2026-05-18T00:31:13.996082+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVGDSQM2C4LT","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVGDSQM2C4LTJXA4","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVGDSQM2","created_at":"2026-05-18T12:30:46.583412+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/TVGDSQM2C4LTJXA4ITXUL4LORN","json":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN.json","graph_json":"https://pith.science/api/pith-number/TVGDSQM2C4LTJXA4ITXUL4LORN/graph.json","events_json":"https://pith.science/api/pith-number/TVGDSQM2C4LTJXA4ITXUL4LORN/events.json","paper":"https://pith.science/paper/TVGDSQM2"},"agent_actions":{"view_html":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN","download_json":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN.json","view_paper":"https://pith.science/paper/TVGDSQM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01708&json=true","fetch_graph":"https://pith.science/api/pith-number/TVGDSQM2C4LTJXA4ITXUL4LORN/graph.json","fetch_events":"https://pith.science/api/pith-number/TVGDSQM2C4LTJXA4ITXUL4LORN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/action/storage_attestation","attest_author":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/action/author_attestation","sign_citation":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/action/citation_signature","submit_replication":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/action/replication_record"}},"created_at":"2026-05-18T00:31:13.996082+00:00","updated_at":"2026-05-18T00:31:13.996082+00:00"}