Divide-and-conquer based IPv6 address LPR in BD-SIIT IPv4/IPv6 transition using a novel reduced segment table(RST) algorithm

摘要: We performed a simulative evaluation of performance analysis divide and conquer based IPv6 Address longest prefix matching(LPR) using novel reduced segment table(RST) algorithm via ns-2 for scenario comprising up to 4 phases from phase 0 it contains 8 chunks chunk chunk7. implemented simulated complex data structure concept like Longest Prefix matching in BD-SIIT Translator. The primary role routers is forward packets towards the direction final destinations. For this purpose v4-v6 enabled router will decide each incoming packet where send next. forwarding decision which consists identifying address next hop as well egress port through should be deliver. Divide table challenging domain innovative creative research scholars due increasing routing size,the link speed,and network traffic with size. In paper we proposed new called RST depicts reduction tree designed on entries portion(section)division an algorithm. As challenge future simulations have identified design Novel Divide-and-Conquer Matching. present results end-to-end delay, loss, Latency.