改进了基于尝试的数据结构的IP查找技术

IF 1.1 3区计算机科学 Q1 BUSINESS, FINANCE

Journal of Computer and System Sciences Pub Date : 2023-05-01 DOI:10.1016/j.jcss.2022.10.003

Yen-Heng Lin , Sun-Yuan Hsieh

{"title":"改进了基于尝试的数据结构的IP查找技术","authors":"Yen-Heng Lin , Sun-Yuan Hsieh","doi":"10.1016/j.jcss.2022.10.003","DOIUrl":null,"url":null,"abstract":"<div><p>Many Internet protocol (IP) lookup algorithms have been formulated to improve network performance. This study reviewed and experimentally evaluated technologies for trie-based methods that reduce memory access, memory consumption and IP lookup time. Experiments involving binary tries (for simplicity) were conducted on four real-world data sets, two of which were on IPv4 router tables (855,997 and 876,489 active prefixes) and two of which were on IPv6 router tables (155,310 and 157,579 active prefixes). Technologies designed to reduce time taken (at the expense of memory consumption) worked well for IPv4, and those designed to reduce memory consumption worked well for IPv6. Various combinations of these technologies were applied together in the experiments.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"133 ","pages":"Pages 41-55"},"PeriodicalIF":1.1000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved IP lookup technology for trie-based data structures\",\"authors\":\"Yen-Heng Lin , Sun-Yuan Hsieh\",\"doi\":\"10.1016/j.jcss.2022.10.003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Many Internet protocol (IP) lookup algorithms have been formulated to improve network performance. This study reviewed and experimentally evaluated technologies for trie-based methods that reduce memory access, memory consumption and IP lookup time. Experiments involving binary tries (for simplicity) were conducted on four real-world data sets, two of which were on IPv4 router tables (855,997 and 876,489 active prefixes) and two of which were on IPv6 router tables (155,310 and 157,579 active prefixes). Technologies designed to reduce time taken (at the expense of memory consumption) worked well for IPv4, and those designed to reduce memory consumption worked well for IPv6. Various combinations of these technologies were applied together in the experiments.</p></div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"133 \",\"pages\":\"Pages 41-55\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2023-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000022000733\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000022000733","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}

引用次数: 0

摘要

已经制定了许多因特网协议（IP）查找算法来提高网络性能。这项研究回顾并实验评估了基于trie的方法的技术，这些方法可以减少内存访问、内存消耗和IP查找时间。涉及二进制尝试的实验（为了简单起见）在四个真实世界的数据集上进行，其中两个在IPv4路由器表（855997和876489个活动前缀）上，两个在IPv6路由器表（155310和157579个活跃前缀）上。旨在减少耗时（以内存消耗为代价）的技术在IPv4中运行良好，而那些旨在减少内存消耗的技术在IPv6中运行良好。这些技术的各种组合被一起应用于实验中。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Improved IP lookup technology for trie-based data structures

Many Internet protocol (IP) lookup algorithms have been formulated to improve network performance. This study reviewed and experimentally evaluated technologies for trie-based methods that reduce memory access, memory consumption and IP lookup time. Experiments involving binary tries (for simplicity) were conducted on four real-world data sets, two of which were on IPv4 router tables (855,997 and 876,489 active prefixes) and two of which were on IPv6 router tables (155,310 and 157,579 active prefixes). Technologies designed to reduce time taken (at the expense of memory consumption) worked well for IPv4, and those designed to reduce memory consumption worked well for IPv6. Various combinations of these technologies were applied together in the experiments.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Computer and System Sciences 工程技术-计算机：理论方法

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

68 days

期刊介绍： The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.