{"title":"快速IP查找算法","authors":"Jaeyong Lim, S. Rajasekaran","doi":"10.1109/ICON.2003.1266173","DOIUrl":null,"url":null,"abstract":"In this paper we present a fast algorithm for the problem of IP routing. In particular, the algorithm presented is for the problem of longest prefix matching. The new algorithm has an expected run time that is asymptotically better than those of existing algorithms. Experimental results are also encouraging. For a packet with a given destination IP address, the next hop the packet should take can be determined in an expected time of O(1+log (n/2/sup q/)), where n is the number of destination prefixes and q is an appropriate parameter. For instance, if q is chosen to be log n, then the expected search time is O(1). The memory requirement is only O(n).","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast IP lookup algorithms\",\"authors\":\"Jaeyong Lim, S. Rajasekaran\",\"doi\":\"10.1109/ICON.2003.1266173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a fast algorithm for the problem of IP routing. In particular, the algorithm presented is for the problem of longest prefix matching. The new algorithm has an expected run time that is asymptotically better than those of existing algorithms. Experimental results are also encouraging. For a packet with a given destination IP address, the next hop the packet should take can be determined in an expected time of O(1+log (n/2/sup q/)), where n is the number of destination prefixes and q is an appropriate parameter. For instance, if q is chosen to be log n, then the expected search time is O(1). The memory requirement is only O(n).\",\"PeriodicalId\":122389,\"journal\":{\"name\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2003.1266173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2003.1266173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we present a fast algorithm for the problem of IP routing. In particular, the algorithm presented is for the problem of longest prefix matching. The new algorithm has an expected run time that is asymptotically better than those of existing algorithms. Experimental results are also encouraging. For a packet with a given destination IP address, the next hop the packet should take can be determined in an expected time of O(1+log (n/2/sup q/)), where n is the number of destination prefixes and q is an appropriate parameter. For instance, if q is chosen to be log n, then the expected search time is O(1). The memory requirement is only O(n).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
