{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OEZ2PNLMH3NFSMRKVDEOP6LT2B","short_pith_number":"pith:OEZ2PNLM","schema_version":"1.0","canonical_sha256":"7133a7b56c3eda59322aa8c8e7f973d0712d44db49798b1a1ed97ef95c4645e8","source":{"kind":"arxiv","id":"1801.00840","version":1},"attestation_state":"computed","paper":{"title":"High Performance Architecture for Flow-Table Lookup in SDN on FPGA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad Khonsari, Hossein Bahramgiria, Rashid Hatamia","submitted_at":"2018-01-02T21:25:24Z","abstract_excerpt":"We propose Range-based Ternary Search Tree (RTST), a tree-based approach for flow-table lookup in SDN network. RTST builds upon flow-tables in SDN switches to provide a fast lookup among flows. We present a parallel multi-pipeline architecture for implementing RTST that benefits from high throughput and low latency. The proposed RTST and architecture achieve a memory efficiency of 1 byte of memory for each byte of flow. We also present a set of techniques to support dynamic updates. Experimental results show that RTST can be used to improve the performance of flow-lookup. It achieves a through"},"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":"1801.00840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-02T21:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"a12c633308605f09faf9ae68651e74818c567fa0f7823b1687218877930eee0c","abstract_canon_sha256":"2f50a95d869359464fc8ff1850312a56d3ea1ffed32fec9cfe32c13ac10553d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:48.640153Z","signature_b64":"eYHswYzmKHRAPFIMN4r87mLrASFxaq8toK5n1MAPNOK4gzor8YHUmDlSlTjkTQ+3Ikacr+gUVi9tP1zvxffVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7133a7b56c3eda59322aa8c8e7f973d0712d44db49798b1a1ed97ef95c4645e8","last_reissued_at":"2026-05-18T00:26:48.639450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:48.639450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Performance Architecture for Flow-Table Lookup in SDN on FPGA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad Khonsari, Hossein Bahramgiria, Rashid Hatamia","submitted_at":"2018-01-02T21:25:24Z","abstract_excerpt":"We propose Range-based Ternary Search Tree (RTST), a tree-based approach for flow-table lookup in SDN network. RTST builds upon flow-tables in SDN switches to provide a fast lookup among flows. We present a parallel multi-pipeline architecture for implementing RTST that benefits from high throughput and low latency. The proposed RTST and architecture achieve a memory efficiency of 1 byte of memory for each byte of flow. We also present a set of techniques to support dynamic updates. Experimental results show that RTST can be used to improve the performance of flow-lookup. It achieves a through"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00840","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":"1801.00840","created_at":"2026-05-18T00:26:48.639574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00840v1","created_at":"2026-05-18T00:26:48.639574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00840","created_at":"2026-05-18T00:26:48.639574+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEZ2PNLMH3NF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEZ2PNLMH3NFSMRK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEZ2PNLM","created_at":"2026-05-18T12:32:43.782077+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/OEZ2PNLMH3NFSMRKVDEOP6LT2B","json":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B.json","graph_json":"https://pith.science/api/pith-number/OEZ2PNLMH3NFSMRKVDEOP6LT2B/graph.json","events_json":"https://pith.science/api/pith-number/OEZ2PNLMH3NFSMRKVDEOP6LT2B/events.json","paper":"https://pith.science/paper/OEZ2PNLM"},"agent_actions":{"view_html":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B","download_json":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B.json","view_paper":"https://pith.science/paper/OEZ2PNLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00840&json=true","fetch_graph":"https://pith.science/api/pith-number/OEZ2PNLMH3NFSMRKVDEOP6LT2B/graph.json","fetch_events":"https://pith.science/api/pith-number/OEZ2PNLMH3NFSMRKVDEOP6LT2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B/action/storage_attestation","attest_author":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B/action/author_attestation","sign_citation":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B/action/citation_signature","submit_replication":"https://pith.science/pith/OEZ2PNLMH3NFSMRKVDEOP6LT2B/action/replication_record"}},"created_at":"2026-05-18T00:26:48.639574+00:00","updated_at":"2026-05-18T00:26:48.639574+00:00"}