{"schema_version":"1.0","canonical_url":"https://patentable.app/patents/US-11502957","patent":{"patent_number":"US-11502957","title":"Avoiding markers for longest prefix match based on binary search tree algorithm","assignee":null,"inventors":[],"filing_date":"2021-04-07T00:00:00.000Z","publication_date":"2022-11-15T00:00:00.000Z","cpc_codes":["H04L","H04L","H04L","H04L","H04L","H04L"],"num_claims":18,"abstract":"In one embodiment, a packet processing apparatus includes interfaces, a memory to store a representation of a routing table as a binary search tree of address prefixes, and store a marker with an embedded prefix including k marker bits providing a marker for an address prefix of a node corresponding to a prefix length greater than k, and n additional bits, such that the k marker bits concatenated with the n additional bits provide another address prefix, packet processing circuitry configured upon receiving a data packet having a destination address, to traverse the binary search tree to find a longest prefix match, compare a key with the k marker bits, extract an additional n bits from the destination address, and compare the extracted n bits with the n additional bits, and process the data packet in accordance with a forwarding action indicated by the longest prefix match."},"analysis":{"summary":null,"layman_explanation":null,"technical_analysis":null,"business_analysis":null,"faqs":null,"topics":[],"tech_cluster":null},"seo":{"title":"Avoiding markers for longest prefix match based on binary search tree algorithm","description":"In one embodiment, a packet processing apparatus includes interfaces, a memory to store a representation of a routing table as a binary search tree of address prefixes, and store a marker with an embe","keywords":[]},"attribution":{"source":"Patentable","source_url":"https://patentable.app","canonical_url":"https://patentable.app/patents/US-11502957","license":"CC-BY-4.0-like","license_terms":"AI-generated analysis on this page (summary, layman_explanation, technical_analysis, business_analysis, faqs) may be reused with attribution and a visible link back to the canonical URL above. Patent abstracts, claims, and bibliographic data are USPTO public domain.","required_link":"https://patentable.app/patents/US-11502957","citation_suggestion":"Patentable. \"Avoiding markers for longest prefix match based on binary search tree algorithm\" (US-11502957). https://patentable.app/patents/US-11502957","copyright_holder":"Nomic Interactive Technology LLC"},"links":{"html":"https://patentable.app/patents/US-11502957","json":"https://patentable.app/api/llm-context/US-11502957","site":"https://patentable.app","llms_txt":"https://patentable.app/llms.txt"},"generated_at":"2026-05-31T07:59:40.015Z"}