Srinivasan T, Vijayalakshmi D, Azeezunnisa A A, Assistant Professor
{"title":"PTSPM:一种新的基于PTS的IPv6路由器前缀匹配方案","authors":"Srinivasan T, Vijayalakshmi D, Azeezunnisa A A, Assistant Professor","doi":"10.1109/CNSR.2007.53","DOIUrl":null,"url":null,"abstract":"Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when router traffic increases or when employed for IPv6 address lookup. Our paper describes a novel parallel ternary search based prefix matching (PTSPM) scheme with reduced collision for IPv6 routers. This approach employs multiple hashing on reduced number of hash tables on which parallel ternary search (PTS) on levels is applied. This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups. The approach we describe is fast, simple, scalable, parallelizable, and flexible.","PeriodicalId":266936,"journal":{"name":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PTSPM: A Novel PTS Based Prefix Matching Scheme with Reduced Collision for IPv6 Routers\",\"authors\":\"Srinivasan T, Vijayalakshmi D, Azeezunnisa A A, Assistant Professor\",\"doi\":\"10.1109/CNSR.2007.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when router traffic increases or when employed for IPv6 address lookup. Our paper describes a novel parallel ternary search based prefix matching (PTSPM) scheme with reduced collision for IPv6 routers. This approach employs multiple hashing on reduced number of hash tables on which parallel ternary search (PTS) on levels is applied. This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups. The approach we describe is fast, simple, scalable, parallelizable, and flexible.\",\"PeriodicalId\":266936,\"journal\":{\"name\":\"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)\",\"volume\":\"115 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNSR.2007.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2007.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
PTSPM: A Novel PTS Based Prefix Matching Scheme with Reduced Collision for IPv6 Routers
Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when router traffic increases or when employed for IPv6 address lookup. Our paper describes a novel parallel ternary search based prefix matching (PTSPM) scheme with reduced collision for IPv6 routers. This approach employs multiple hashing on reduced number of hash tables on which parallel ternary search (PTS) on levels is applied. This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups. The approach we describe is fast, simple, scalable, parallelizable, and flexible.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
