Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

A New Scheme for IPv6 BD-TTCS Translator: A Section Division Approach

International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 46 - Number 5
Year of Publication: 2012
Hanumanthappa. J
Ramesh. K
Manjaiah. D. H

Hanumanthappa.j, Ramesh.k and Manjaiah.d.h. Article: A New Scheme for IPv6 BD-TTCS Translator: A Section Division Approach. International Journal of Computer Applications 46(5):7-15, May 2012. Full text available. BibTeX

	author = {Hanumanthappa.j and Ramesh.k and Manjaiah.d.h},
	title = {Article: A New Scheme for IPv6 BD-TTCS Translator: A Section Division Approach},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {46},
	number = {5},
	pages = {7-15},
	month = {May},
	note = {Full text available}


Divide and conquer(D&C) based IPv6 ALPM(Address Longest Prefix Matching) using a new reduced segment table(RST) is a challenging issue for an innovative and creative researchers 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 innovative translator called BD-TTCS(Bi-Directional Transmission and Transfer Control System) which clearly illustrates reduction tree based on number of entries in a routing table using section division Method. We simulated and tested the proposed scheme using D&C based on IPv6 ALPM using a novel RST in BD-TTCS Translator. We used NS2 and Matlab 7. 11. 0(R2010b) to simulate results and in order to plot bar graph and Line Graph. To Judge the performance of our scheme on different performance parameters some results with different graphs are shown in the figures. From the perspective of analysis of computing time the overall time complexity of the proposed method is o(logn) where N is the number of routing entries in a routing table. Using NS2 based simulation results we have analyze the various performance parameters


  • Chao,H. J. :'Next generation routers' in:Proceedings. of IEEE,2002,90,(9),pp. 1518-1558.
  • Ruiz-Sanchez,M. A,Biersack,E. W. ,and Dabbous,W. :'Survey and taxonomy of IP address lookup algorithms',IEEE Netw. ,2001, pp. 8-23.
  • S. Tanenbaum,"Computer Networks",Third Edition,Prentice Hall Inc. ,1996,pp. 686,413-436,437-449.
  • Behrouz A. Forouzan,Third Edition,"TCP/IP Protocol Suite".
  • Atul Kahate,"Cryptography and Network Security",Tata McGraw-Hill,2003,pp-8-10.
  • B. Carpenter and K. Moore,"Connection of IPv6 Domains via IPv4 Clouds",RFC3056,Feb 200.
  • Kurose. J. & Ross . K. (2005) Computer Networking:A top-down approach featuring the Internet. 3rd ed,(Addison Wesley).
  • Ra'ed AlJa'afreh,John mellor,Mumtaz Kamala,"A Novel IPv4/IPv6 transition mechanism which support transparent. connections".
  • Jivika Govil,Jivesh Govil,Navkeerat Kaur,Harkeerat Kaur,An examination of IPv4 and IPv6 Networks: constraints, and various transition mechanisms.
  • S. Deering and R. Hinden,"Internet Protocol Version 6 specification",RFC 2460,Dec. 1998.
  • 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.
  • H. Lu,S. Sahni,"A B-Tree Dynamic Router-Table Design",IEEE Trans. Computers,vol. 54,pp. 813-823,2005.
  • 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.
  • M. Waldvogel,"First longest prefix matching:Algorithms,Analysis and Applications,"Ph. D. Thesis,Swiss Federal Institute of Technology,Zurich,2000.
  • P. Gupta and N. McKeown,"Packet Classification on Multiple Fields,"ACM SIGCOMM1999.
  • Y. Rekhter and T. Li,"An Architecture for IP address Allocation with CIDR,"RFC 1518,Sept. 1993.
  • 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.
  • Gilligan. & Nodmar. E. (1996)Transition Mechanisms for IPv6 Hosts and Routers.
  • Carpenter,B. and K. Moore,"Connection of IPv6 Domains via IPv4 Clouds",RFC 3056,February 2001.
  • Waldvogel,M. ,Varghese,G. ,Turner,J. ,and Plattner,B. :'Scalable high speed IP routing lookups',ACM SIGCOMM,1997.
  • Gupta,P. ,Lin,S. ,and McKeown,N. 'Routing lookups in hardware at memory access speeds',IEEE INFOCOM,1998,pp. 1240-1247.
  • . Pao,D. ,Liu. ,C. ,Wu,A. ,Yeung,L. ,and Chan,K. S. ,"Efficient hardware architecture for fast IP address lookup',IEEE Proc Comput Digit Tech. ,2003,150,(1)pp-43-52.
  • Rudra Pratap,"Getting Started with MATLAB7",Oxford University Press.
  • Vijay. K. Garg,"Wireless Communications and Networking",Morgan Kaufmann Publishers.
  • JerryBanks,John. S. Carson,Barry. L. Nelson,David. M. Nicol,P. Shahabudeen,"Discrete-EventSystem Simulation",PearsonPublications.
  • Vinay K. Ingle,John. G. Proakis,"Digital Signal Processing using Matlab",India Edition.
  • Rafael C. Gonzalez,Richard E. Woods,Steven L. Eddins,"Digital Image Processing Using MATLAB",Tata McGraw Hill Education Private Limited.
  • J. Liu,"Approaches to network simulation based on NS," Application Research of Computers,vol. 9,2002, pp: 54-57.
  • G. Tsirtsis and P. Srisuresh,Network Address Translation-Protocol Translation(NAT-PT),RFC2766,February 2000.
  • E. Nordmark,Stateless IP/ICMP Translation Algorithm (SIIT),RFC2765,February 2000.
  • R. Gilligan,Transition Mechanisms for IPv6 Hosts and Routers,RFC2893,August 2000.
  • D. Waddington and F. Chang,"Realizing the Transition to IPv6,"IEEE Communications Magazine,Vol. 40,No. 6,June 2002, pp. 138-147.
  • IPv6 Forum,The New Internet:Internet for Everyone. (www. ipv6forum. com).
  • Microsoft,"IPv6/IPv4 Coexistence and Migration,"White Paper,Washington,November 2001.
  • Nokia,"IPv6-Enabling the Mobile Internet,"White Paper 10878,Finland,2000 .
  • Ns2 tutorial running simulations by Matthias Transier.
  • Mahmood Hasanlou,"Introduction to mobility and network simulator 2".