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