Appeared in the Proceedings of Conference on Algorithms,Computing,Graph Theory and Combinatorics-April-2011). Mr.Hanumanthappa.J. Dr.Manjaiah.D.H. Dr.Ashok JhunJhunwala. Mr.Ramesh.K. Presented by Mr.Ramesh.K. At KU Conference on Algorithms,Computing,Graph Theory and Combinatorics-April-2011) 20 th April,VTU Campus,Belgaum . 4/20/2011 A Simulation study on the performance of Divide- and-Conquer based IPv6 Address Longest Prefix Matching using a Novel Reduced Segment Table(RST) algorithm in BD-SIIT Translator.
4/20/2011 About the Authors About the Authors Mr.Hanumanthappa.J. DoS in Computer Science,University of Mysore,Manasagangotri Mysore. Email:firstname.lastname@example.org. Dr.Manjaiah.D.H. Dept of Computer Science,Mangalore University,Mangalagangotri Mangalore. [email_address] . Dr.Ashok Jhunjhunwala Professor,Dept of Electrical Engg,Indian Institute of Technology(IITM). Chennai-600036 . Email: [email_address] Mr.Ramesh.K. Asst.Professor,Dept of Computer Science,Karnatak University,Dharwad. Email: email@example.com.
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 Divide-and-Conquer based IPv6 Address Longest Prefix Matching .
4/20/2011 4/13/2011 4/13/2011 NS-2 Simulation parameters . Table-5: Simulations Parameters in NS-2 environment. Sl.No Description Name/Values 1 IFQ Length 50 Packets. 2 Number of Nodes 7 3 Grid Size 500 Meters * 500 Meters. 4 Very traffic Loads 6~240 Nodes. 5 IFQ Drop tail 6 Simulation Time 200 Seconds. 7 Propagation Model TwoRayGround
4/20/2011 Performance Evaluation metrics and Simulation parameters of BD-SIIT. In this Paper we have calculated three performance evaluation metrics. 1.End to End delay 2.Throughput 3.Round trip time(RTT) N rec 1.Mean End to End delay= ∑ i=1 EEDi/Nrec where EEDi = Tdi- Tsi where EEDi is the end to end delay of ith packet. Tsi is the Source packet i created and Tdi is the Destination packet which is created at Destination. Nrec is the total number of packets received at Dest host and Mean EED is the mean value of each communication session
4/20/2011 The mean throughput for a sequence of packets of specific size is calculated by using equations 1 and 2. MeanThr = Σ N j =1 Thrj /N -------------(1) where Thr=Packetsreceived(Pr)/Packets generated(Pg)*100%.--------------(2) Where Thrj is the value of the throughput when the packet j is received at intermediate device like DSTM gateway,BD-SIIT Gateway,v4/v6 Router and N is the number of received packets at intermediate device,Pr is the no of packets received at intermediate device and Pg is the number of packets created by source host .
4/20/2011 4/13/2011 Graph-1: The comparison between EED of v4-to-v4 and v6-to-v6 communication sessions. Simulation Results .
4/20/2011 Graph-2: A Comparison between the throughput (v4-to-v4, and v6-to-v6) communication sessions .
It is also possible to prove the divide and conquer based IPv6 address Longest prefix matching using a novel reduced segment table is a innovative,challenging and qualitative research problem for innovative researchers .
We have also calculated round trip time,delay(latency),packet loss for BD-SIIT Protocol translator etc .
References 1.L.C Wnn,K.M.Chen and T.J.Liu,“A Longest Prefix First Search Tree for IP Lookup” in ICC’05,pp..989-993,May.16-20,2005. 2.H.Lu,S.Sahni,“A B-Tree Dynamic Router-Table Design”,IEEE Trans.Computers,vol.54,pp.813-823,2005. 3.S.Nilsson and G.Karlsson,“IP-address Lookup using LC-Trie”,IEEE J.on Sel.Area in Comm,Vol.17,pp.1083-1092,June.2001. 4.M.Waldvogel,”First longest prefix matching:Algorithms,Analysis and Applications,”Ph.D.Thesis,Swiss Federal Institute of Technology,Zurich,2000. 5.S.Deering and R.Hinden,“Internet Protocol Version 6 specification”,RFC 2460,Dec.1998. 6.P.Gupta and N.McKeown,”Packet Classification on Multiple Fields,”ACM SIGCOMM1999. 7.Y.Rekhter and T.Li,“An Architecture for IP address Allocation with CIDR,”RFC 1518,Sept.1993. 8.V.Srinivasan and G.Varghese,“Fast Address Lookups Using Controlled Prefix Expansion,”ACM Transactions on Computer Systems,Vol.17,No.1,February 1999,pp.1-40. 9.S.Tanenbaum,“Computer Networks”,Third Edition, Prentice Hall Inc.,1996, pp.686,413- 436,437-449. 4/20/2011
10.Behrouz A.Forouzan,Third Edition,“TCP/IP Protocol Suite ” . 11.Atul Kahate,“Cryptography and Network Security “,Tata McGraw-Hill, 2003, pp-8-10. 12.B.Carpenter and K.Moore,“Connection of IPv6 Domains via IPv4 Clouds“,RFC3056,Feb 200. 13.Kurose.J. & Ross .K.(2005) Computer Networking: A top- down approach featuring the Internet.3 rd ed, (Addison Wesley). 14.Ra’ed AlJa’afreh,John mellor,Mumtaz Kamala,”A Novel IPv4/IPv6 transition mechanism which support transparent connections”. 15.Jivika Govil,Jivesh Govil, Navkeerat Kaur,Harkeerat Kaur,An examination of IPv4 and IPv6 Networks: constraints,and various transition mechanisms . 4/20/2011