{"id":"https://openalex.org/W2119165656","doi":"https://doi.org/10.1142/s0129054107004607","title":"UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES","display_name":"UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES","publication_year":2007,"publication_date":"2007-02-01","ids":{"openalex":"https://openalex.org/W2119165656","doi":"https://doi.org/10.1142/s0129054107004607","mag":"2119165656"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054107004607","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054107004607","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004492374","display_name":"Tobias Lauer","orcid":"https://orcid.org/0009-0003-8845-8277"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"TOBIAS LAUER","raw_affiliation_strings":["Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg, Georges-K\u00f6hler-Allee, Geb\u00e4ude 51, 79110 Freiburg im Breisgau, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg, Georges-K\u00f6hler-Allee, Geb\u00e4ude 51, 79110 Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113581859","display_name":"Thomas Ottmann","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"THOMAS OTTMANN","raw_affiliation_strings":["Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg, Georges-K\u00f6hler-Allee, Geb\u00e4ude 51, 79110 Freiburg im Breisgau, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg, Georges-K\u00f6hler-Allee, Geb\u00e4ude 51, 79110 Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005705210","display_name":"Amitava Datta","orcid":"https://orcid.org/0000-0001-6916-7907"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"AMITAVA DATTA","raw_affiliation_strings":["School of Computer Science & Software Engineering, University of Western Australia, 35 Stirling Highway, Crawley, Perth, WA 6009, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science & Software Engineering, University of Western Australia, 35 Stirling Highway, Crawley, Perth, WA 6009, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004492374"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.953,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77666284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"01","first_page":"139","last_page":"161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.8204021453857422},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.7921729683876038},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7661815881729126},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6794126033782959},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6297821402549744},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6069226264953613},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5139965415000916},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4802711009979248},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.47145161032676697},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.47067791223526},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.43781036138534546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4240260124206543},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.42289304733276367},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.41662442684173584},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37458133697509766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.343367338180542},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.23385941982269287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16306191682815552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11030703783035278},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09250345826148987},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08559128642082214}],"concepts":[{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.8204021453857422},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.7921729683876038},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7661815881729126},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6794126033782959},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6297821402549744},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6069226264953613},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5139965415000916},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4802711009979248},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.47145161032676697},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.47067791223526},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.43781036138534546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4240260124206543},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42289304733276367},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.41662442684173584},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37458133697509766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.343367338180542},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.23385941982269287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16306191682815552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11030703783035278},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09250345826148987},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08559128642082214},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054107004607","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054107004607","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/3e2a3c1f-ecbe-4226-84c2-22488ac4d0b7","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/3e2a3c1f-ecbe-4226-84c2-22488ac4d0b7","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lauer , T , Ottman , T & Datta , A 2007 , ' Update-Efficient data structures for dynamic IP router tables ' , International Journal of Foundations of Computer Science , vol. 18 , no. 1 , pp. 139-161 . https://doi.org/10.1142/S0129054107004607","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W155342555","https://openalex.org/W564800084","https://openalex.org/W2033539581","https://openalex.org/W2042996023","https://openalex.org/W2082089278","https://openalex.org/W2108712752","https://openalex.org/W2114883292","https://openalex.org/W2115278163","https://openalex.org/W2137748137","https://openalex.org/W2142753649","https://openalex.org/W2395529434","https://openalex.org/W2407339179","https://openalex.org/W4242487431","https://openalex.org/W4249532028"],"related_works":["https://openalex.org/W1552925710","https://openalex.org/W2142350709","https://openalex.org/W2159312398","https://openalex.org/W2227630426","https://openalex.org/W2406489341","https://openalex.org/W2142861006","https://openalex.org/W1529048805","https://openalex.org/W4242990453","https://openalex.org/W2119165656","https://openalex.org/W136800840"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,26],"two":[3],"data":[4],"structures,":[5],"min-augmented":[6],"range":[7],"tree":[8,43],"and":[9,24,107],"priority":[10,41,115],"search":[11,42,116],"pennant,":[12],"efficiently":[13],"support":[14],"all":[15],"the":[16,33,40,79,103],"required":[17],"operations":[18],"for":[19,32,74],"updatable":[20],"IP":[21,36,104],"router":[22],"tables":[23],"argue":[25],"both":[27,55],"structures":[28,56,81,96],"are":[29,97],"better":[30],"suited":[31],"one-dimensional":[34],"dynamic":[35],"lookup":[37,105],"problem":[38,106],"than":[39],"(PST)":[44],"used":[45,110],"in":[46,57,118],"a":[47,61,75,86],"previous":[48],"solution.":[49],"It":[50],"is":[51],"possible":[52],"to":[53,93],"maintain":[54],"time":[58],"O(1)":[59],"after":[60],"rotation,":[62],"while":[63],"PST":[64],"with":[65],"n":[66],"elements":[67],"may":[68,108],"require":[69],"\u03a9(":[70],"log":[71],"n)":[72],"steps":[73],"single":[76],"rotation.":[77],"Therefore,":[78],"proposed":[80],"can":[82],"be":[83,109],"balanced":[84],"using":[85],"larger":[87],"class":[88],"of":[89,99,102,114],"rebalancing":[90],"schemes":[91],"compared":[92],"PST.":[94],"Both":[95],"also":[98],"interest":[100],"independently":[101],"as":[111,121],"attractive":[112],"implementations":[113],"queues":[117],"other":[119],"contexts":[120],"well.":[122]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}