Matches in SemOpenAlex for { <https://semopenalex.org/work/W4317460878> ?p ?o ?g. }
Showing items 1 to 68 of
68
with 100 items per page.
- W4317460878 endingPage "294" @default.
- W4317460878 startingPage "249" @default.
- W4317460878 abstract "Prefixes have been used to compress a large database, but at the cost of a more complex longest-matching-prefix lookup. As described in Chapter 2, the Internet uses the same idea. In the year 2022, core routers stored only around 900,000 prefixes, instead of potentially billions of entries for each possible Internet address. For example, to a core router all the computers within a university, such as UCLA, will probably be reachable by the same next hop. If all the computers within UCLA are given the same initial set of bits (the network number, or prefix), then the router can store one entry for UCLA instead of thousands of entries for each computer in UCLA. The world has changed significantly since the first edition. In this edition, we have updated this chapter with how the following changes have impacted the designs of IP lookup schemes: (1) the six fold increase in number of prefixes in a core routing table; (2) wide adoption of IPv6; (3) new memory technologies; (4) wide availability of programmable chips with TCAM; (5) the emergence of Software Defined Networks (SDN); (6) the wide use of multicore processors in routers and switches; and (7) the emergence of Network Function Virtualization (NFV). The entire chapter is organized as follows. Section 11.1 provides an introduction to prefix lookups. Section 11.2 describes attempts to finesse the need for IP lookups. Section 11.3 presents nonalgorithmic techniques for lookup based on caching and parallel hardware. Section 11.4 describes the simplest technique based on unibit tries. The chapter then transitions to describe seven more sophisticated schemes: multibit tries (Section 11.5), levelcompressed tries (Section 11.6), Lulea-compressed tries (Section 11.7), Tree bitmap (Section 11.8), binary search on prefix ranges (Section 11.10) (with a modern manifestation called DXR), binary search on prefix lengths (Section 11.11), and linear search on prefix lengths (Section 11.12). The chapter ends with Section 11.13 on memory allocation issues, Section 11.14 on fixed function lookup chips, and Section 11.15 on programmable chips, and the P4 language to program them." @default.
- W4317460878 created "2023-01-20" @default.
- W4317460878 creator A5003989352 @default.
- W4317460878 creator A5025728584 @default.
- W4317460878 date "2022-01-01" @default.
- W4317460878 modified "2023-10-18" @default.
- W4317460878 title "Prefix-match lookups" @default.
- W4317460878 cites W1968801809 @default.
- W4317460878 cites W1999064874 @default.
- W4317460878 cites W2009995012 @default.
- W4317460878 cites W2094678784 @default.
- W4317460878 cites W2123845384 @default.
- W4317460878 cites W4254091566 @default.
- W4317460878 doi "https://doi.org/10.1016/b978-0-12-809927-8.00018-x" @default.
- W4317460878 hasPublicationYear "2022" @default.
- W4317460878 type Work @default.
- W4317460878 citedByCount "0" @default.
- W4317460878 crossrefType "book-chapter" @default.
- W4317460878 hasAuthorship W4317460878A5003989352 @default.
- W4317460878 hasAuthorship W4317460878A5025728584 @default.
- W4317460878 hasConcept C104954878 @default.
- W4317460878 hasConcept C110875604 @default.
- W4317460878 hasConcept C111919701 @default.
- W4317460878 hasConcept C138885662 @default.
- W4317460878 hasConcept C141603448 @default.
- W4317460878 hasConcept C173608175 @default.
- W4317460878 hasConcept C184896649 @default.
- W4317460878 hasConcept C2775896111 @default.
- W4317460878 hasConcept C2779233093 @default.
- W4317460878 hasConcept C31258907 @default.
- W4317460878 hasConcept C41008148 @default.
- W4317460878 hasConcept C41895202 @default.
- W4317460878 hasConcept C74172769 @default.
- W4317460878 hasConcept C77270119 @default.
- W4317460878 hasConcept C84555802 @default.
- W4317460878 hasConceptScore W4317460878C104954878 @default.
- W4317460878 hasConceptScore W4317460878C110875604 @default.
- W4317460878 hasConceptScore W4317460878C111919701 @default.
- W4317460878 hasConceptScore W4317460878C138885662 @default.
- W4317460878 hasConceptScore W4317460878C141603448 @default.
- W4317460878 hasConceptScore W4317460878C173608175 @default.
- W4317460878 hasConceptScore W4317460878C184896649 @default.
- W4317460878 hasConceptScore W4317460878C2775896111 @default.
- W4317460878 hasConceptScore W4317460878C2779233093 @default.
- W4317460878 hasConceptScore W4317460878C31258907 @default.
- W4317460878 hasConceptScore W4317460878C41008148 @default.
- W4317460878 hasConceptScore W4317460878C41895202 @default.
- W4317460878 hasConceptScore W4317460878C74172769 @default.
- W4317460878 hasConceptScore W4317460878C77270119 @default.
- W4317460878 hasConceptScore W4317460878C84555802 @default.
- W4317460878 hasLocation W43174608781 @default.
- W4317460878 hasOpenAccess W4317460878 @default.
- W4317460878 hasPrimaryLocation W43174608781 @default.
- W4317460878 hasRelatedWork W2156553943 @default.
- W4317460878 hasRelatedWork W2159375466 @default.
- W4317460878 hasRelatedWork W2159910630 @default.
- W4317460878 hasRelatedWork W2169324860 @default.
- W4317460878 hasRelatedWork W2183259095 @default.
- W4317460878 hasRelatedWork W2361149988 @default.
- W4317460878 hasRelatedWork W2367101834 @default.
- W4317460878 hasRelatedWork W2501800521 @default.
- W4317460878 hasRelatedWork W2783496005 @default.
- W4317460878 hasRelatedWork W3149578913 @default.
- W4317460878 isParatext "false" @default.
- W4317460878 isRetracted "false" @default.
- W4317460878 workType "book-chapter" @default.