{"title":"改进的基于LC-trie的高效路由查找","authors":"V. Ravikumar, R. Mahapatra, Jyh-Charn S. Liu","doi":"10.1109/MASCOT.2002.1167075","DOIUrl":null,"url":null,"abstract":"IP address lookup at the router is a complex problem. This has been primarily due to the increasing table sizes, growth in traffic rate and high link capacities. We propose an algorithm for fast routing lookup with reduced memory utilization and access time. This approach shows significant performance improvement in the average case and optimizes the overall time taken for packet routing. Since storage requirement, processing time and number of lookups performed are reduced, power consumption by the router is also reduced. Our simulation result indicates that the proposed technique works approximately 4.11 times better than the standard level compressed trie (LC-trie) approach (see Nilsson, S. and Karlsson, G., Proc. IEEE Broadband Commun. 98, p.9-18, 1998) in the average case.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Modified LC-trie based efficient routing lookup\",\"authors\":\"V. Ravikumar, R. Mahapatra, Jyh-Charn S. Liu\",\"doi\":\"10.1109/MASCOT.2002.1167075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IP address lookup at the router is a complex problem. This has been primarily due to the increasing table sizes, growth in traffic rate and high link capacities. We propose an algorithm for fast routing lookup with reduced memory utilization and access time. This approach shows significant performance improvement in the average case and optimizes the overall time taken for packet routing. Since storage requirement, processing time and number of lookups performed are reduced, power consumption by the router is also reduced. Our simulation result indicates that the proposed technique works approximately 4.11 times better than the standard level compressed trie (LC-trie) approach (see Nilsson, S. and Karlsson, G., Proc. IEEE Broadband Commun. 98, p.9-18, 1998) in the average case.\",\"PeriodicalId\":384900,\"journal\":{\"name\":\"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2002.1167075\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2002.1167075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
摘要
在路由器上查找IP地址是一个复杂的问题。这主要是由于表大小的增加、流量速率的增长和高链路容量。我们提出了一种快速路由查找算法,减少了内存利用率和访问时间。这种方法在平均情况下显示了显著的性能改进,并优化了数据包路由所花费的总体时间。由于存储需求、处理时间和执行的查找次数减少了,路由器的功耗也降低了。我们的模拟结果表明,在平均情况下,所提出的技术比标准级别压缩三树(lc -三树)方法的效果好大约4.11倍(见Nilsson, S.和Karlsson, G., Proc. IEEE Broadband common . 98, p.9-18, 1998)。
IP address lookup at the router is a complex problem. This has been primarily due to the increasing table sizes, growth in traffic rate and high link capacities. We propose an algorithm for fast routing lookup with reduced memory utilization and access time. This approach shows significant performance improvement in the average case and optimizes the overall time taken for packet routing. Since storage requirement, processing time and number of lookups performed are reduced, power consumption by the router is also reduced. Our simulation result indicates that the proposed technique works approximately 4.11 times better than the standard level compressed trie (LC-trie) approach (see Nilsson, S. and Karlsson, G., Proc. IEEE Broadband Commun. 98, p.9-18, 1998) in the average case.