A mathematical model to realize the parallel computing based diminution tree with list ranking based BD-TTCS as a new IPv4/IPv6 transition mechanism

While the details of the Next-generation IPv6 protocol are now reaching maturity,the next hurdle in realizing the promises of IPv6 is the need for deployment on a wider scale.The process of transitioning from IPv4 to IPv6 is currently being extensively studied with a goal to achieve high level compatibility and clear procedure for easy and an autonomous deployment of IPv6.IPv6 offers variety of enhancements including increased Addressing capabilities,QoS control,Mobility,Built in IPSec and Improved routing efficiency which are seen as potential improvements to IPv4 and serve as main drivers for adopting it. We Proposed Parallel Computing based diminution tree with list ranking based BD-TTCS as a new innovative IPv4/IPv6 transition mechanism and it also acts as a research challenge with other IETF IPv6 transition mechanisms and discusses the various potential key performance issues like throughput, end-to-end delay, Jitter, Packet loss, RTT etc. In order to plot bar graph and Line Graph we used Matlab 7.11.0(R2010b).